Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(graph search). Showing records 1 – 30 of 108 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters

1. Yang, Shengqi. Querying Large-scale Knowledge Graphs.

Degree: 2015, University of California – eScholarship, University of California

 With the rise of the Internet, social computing and numerous mobile applications have brought about a large amount of unstructured entity data, including places, events,… (more)

Subjects/Keywords: Computer science; graph management; graph search; knowledge graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, S. (2015). Querying Large-scale Knowledge Graphs. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/7wq7n7gv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yang, Shengqi. “Querying Large-scale Knowledge Graphs.” 2015. Thesis, University of California – eScholarship, University of California. Accessed December 10, 2019. http://www.escholarship.org/uc/item/7wq7n7gv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yang, Shengqi. “Querying Large-scale Knowledge Graphs.” 2015. Web. 10 Dec 2019.

Vancouver:

Yang S. Querying Large-scale Knowledge Graphs. [Internet] [Thesis]. University of California – eScholarship, University of California; 2015. [cited 2019 Dec 10]. Available from: http://www.escholarship.org/uc/item/7wq7n7gv.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang S. Querying Large-scale Knowledge Graphs. [Thesis]. University of California – eScholarship, University of California; 2015. Available from: http://www.escholarship.org/uc/item/7wq7n7gv

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Victoria

2. Gorzny, Jan. On End Vertices of Search Algorithms.

Degree: Department of Mathematics and Statistics, 2015, University of Victoria

 Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for… (more)

Subjects/Keywords: graph theory; search algorithm; end vertex

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gorzny, J. (2015). On End Vertices of Search Algorithms. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6506

Chicago Manual of Style (16th Edition):

Gorzny, Jan. “On End Vertices of Search Algorithms.” 2015. Masters Thesis, University of Victoria. Accessed December 10, 2019. http://hdl.handle.net/1828/6506.

MLA Handbook (7th Edition):

Gorzny, Jan. “On End Vertices of Search Algorithms.” 2015. Web. 10 Dec 2019.

Vancouver:

Gorzny J. On End Vertices of Search Algorithms. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/1828/6506.

Council of Science Editors:

Gorzny J. On End Vertices of Search Algorithms. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6506


University of Waterloo

3. Liu, Rui Peng. Some Upper and Lower Bounds regarding Query Complexity.

Degree: 2017, University of Waterloo

 Query complexity is one of the several notions of complexity de ned to measure the cost of algorithms. It plays an important role in demonstrating… (more)

Subjects/Keywords: Quantum Complexity Theory; Graph Search Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, R. P. (2017). Some Upper and Lower Bounds regarding Query Complexity. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12245

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liu, Rui Peng. “Some Upper and Lower Bounds regarding Query Complexity.” 2017. Thesis, University of Waterloo. Accessed December 10, 2019. http://hdl.handle.net/10012/12245.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liu, Rui Peng. “Some Upper and Lower Bounds regarding Query Complexity.” 2017. Web. 10 Dec 2019.

Vancouver:

Liu RP. Some Upper and Lower Bounds regarding Query Complexity. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/10012/12245.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu RP. Some Upper and Lower Bounds regarding Query Complexity. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12245

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New South Wales

4. Zhu, Gaoping. Efficient algorithms for graph all-matching and containment search.

Degree: Computer Science & Engineering, 2012, University of New South Wales

 Recent advances in database research have shown the potential of graph in modellingcomplicated data. Graph data have pervaded many modern applicationsincluding bio-informatics, chem-informatics, semantic webs,… (more)

Subjects/Keywords: Similarity All-Matching; Graph Database; Containment Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhu, G. (2012). Efficient algorithms for graph all-matching and containment search. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Zhu, Gaoping. “Efficient algorithms for graph all-matching and containment search.” 2012. Doctoral Dissertation, University of New South Wales. Accessed December 10, 2019. http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true.

MLA Handbook (7th Edition):

Zhu, Gaoping. “Efficient algorithms for graph all-matching and containment search.” 2012. Web. 10 Dec 2019.

Vancouver:

Zhu G. Efficient algorithms for graph all-matching and containment search. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2019 Dec 10]. Available from: http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true.

Council of Science Editors:

Zhu G. Efficient algorithms for graph all-matching and containment search. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/51790 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10457/SOURCE02?view=true


University of Ontario Institute of Technology

5. Drake, Richard J.I. Towards a concurrent implementation of keyword search over relational databases.

Degree: 2014, University of Ontario Institute of Technology

 Vast amounts of data are stored in relational databases. Traditionally, querying this data required a deep understanding of the underlying schema in addition to knowledge… (more)

Subjects/Keywords: Relational database; Full-text search; Graph search; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Drake, R. J. I. (2014). Towards a concurrent implementation of keyword search over relational databases. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/433

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Drake, Richard J I. “Towards a concurrent implementation of keyword search over relational databases.” 2014. Thesis, University of Ontario Institute of Technology. Accessed December 10, 2019. http://hdl.handle.net/10155/433.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Drake, Richard J I. “Towards a concurrent implementation of keyword search over relational databases.” 2014. Web. 10 Dec 2019.

Vancouver:

Drake RJI. Towards a concurrent implementation of keyword search over relational databases. [Internet] [Thesis]. University of Ontario Institute of Technology; 2014. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/10155/433.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Drake RJI. Towards a concurrent implementation of keyword search over relational databases. [Thesis]. University of Ontario Institute of Technology; 2014. Available from: http://hdl.handle.net/10155/433

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kent State University

6. Ayvaz, Serkan. NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2015, Kent State University

 Currently, the most common method to access and utilize data on the Web is through the use of search engines. Classical Information Retrieval (IR) techniques,… (more)

Subjects/Keywords: Computer Science; semantic web; summary graph; RDF graph; semantic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ayvaz, S. (2015). NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1447710652

Chicago Manual of Style (16th Edition):

Ayvaz, Serkan. “NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH.” 2015. Doctoral Dissertation, Kent State University. Accessed December 10, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1447710652.

MLA Handbook (7th Edition):

Ayvaz, Serkan. “NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH.” 2015. Web. 10 Dec 2019.

Vancouver:

Ayvaz S. NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH. [Internet] [Doctoral dissertation]. Kent State University; 2015. [cited 2019 Dec 10]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1447710652.

Council of Science Editors:

Ayvaz S. NEAR NEIGHBOR EXPLORATIONS FOR KEYWORD-BASED SEMANTIC SEARCHES USING RDF SUMMARY GRAPH. [Doctoral Dissertation]. Kent State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1447710652

7. Liu, Kaihua. Query on Knowledge Graphs with Hierarchical Relationships.

Degree: 2017, University of Massachusetts

  The dramatic popularity of graph database has resulted in a growing interest in graph queries. Two major topics are included in graph queries. One… (more)

Subjects/Keywords: knowledge graph; graph search; distributed system; hierarchical relationship; Other Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, K. (2017). Query on Knowledge Graphs with Hierarchical Relationships. (Thesis). University of Massachusetts. Retrieved from https://scholarworks.umass.edu/masters_theses_2/560

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liu, Kaihua. “Query on Knowledge Graphs with Hierarchical Relationships.” 2017. Thesis, University of Massachusetts. Accessed December 10, 2019. https://scholarworks.umass.edu/masters_theses_2/560.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liu, Kaihua. “Query on Knowledge Graphs with Hierarchical Relationships.” 2017. Web. 10 Dec 2019.

Vancouver:

Liu K. Query on Knowledge Graphs with Hierarchical Relationships. [Internet] [Thesis]. University of Massachusetts; 2017. [cited 2019 Dec 10]. Available from: https://scholarworks.umass.edu/masters_theses_2/560.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu K. Query on Knowledge Graphs with Hierarchical Relationships. [Thesis]. University of Massachusetts; 2017. Available from: https://scholarworks.umass.edu/masters_theses_2/560

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

8. Sun, Bingjun. MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS.

Degree: PhD, Computer Science and Engineering, 2008, Penn State University

 Traditional generic search engines using textual keyword matching do not support domain specific searches. However, different domains may have different domain specific searches. For example,… (more)

Subjects/Keywords: Information retrieval; information extraction; entity tagging; entity search; query model; graph mining; graph indexing; graph search; feature selection; Chemoinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sun, B. (2008). MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/9239

Chicago Manual of Style (16th Edition):

Sun, Bingjun. “MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS.” 2008. Doctoral Dissertation, Penn State University. Accessed December 10, 2019. https://etda.libraries.psu.edu/catalog/9239.

MLA Handbook (7th Edition):

Sun, Bingjun. “MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS.” 2008. Web. 10 Dec 2019.

Vancouver:

Sun B. MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2019 Dec 10]. Available from: https://etda.libraries.psu.edu/catalog/9239.

Council of Science Editors:

Sun B. MINING, INDEXING, AND SEARCH APPROACHES TO ENTITY AND GRAPH INFORMATION RETRIEVAL FOR CHEMOINFORMATICS. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/9239


University of California – Irvine

9. FRANCI RODON, ARNAU. Dynamic Network Redesign for Strategic Air Traffic Planning.

Degree: Mechanical and Aerospace Engineering, 2017, University of California – Irvine

 This research extends previous work on strategic air traffic planning based on an aggregate route model. Assuming a base model has been developed from historic… (more)

Subjects/Keywords: Aerospace engineering; Artificial intelligence; Robotics; Air Traffic Optimization; Graph ATC; Graph Search Aeronautics; Graph Search Aerospace; Path Planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

FRANCI RODON, A. (2017). Dynamic Network Redesign for Strategic Air Traffic Planning. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/2n87q7j0

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

FRANCI RODON, ARNAU. “Dynamic Network Redesign for Strategic Air Traffic Planning.” 2017. Thesis, University of California – Irvine. Accessed December 10, 2019. http://www.escholarship.org/uc/item/2n87q7j0.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

FRANCI RODON, ARNAU. “Dynamic Network Redesign for Strategic Air Traffic Planning.” 2017. Web. 10 Dec 2019.

Vancouver:

FRANCI RODON A. Dynamic Network Redesign for Strategic Air Traffic Planning. [Internet] [Thesis]. University of California – Irvine; 2017. [cited 2019 Dec 10]. Available from: http://www.escholarship.org/uc/item/2n87q7j0.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

FRANCI RODON A. Dynamic Network Redesign for Strategic Air Traffic Planning. [Thesis]. University of California – Irvine; 2017. Available from: http://www.escholarship.org/uc/item/2n87q7j0

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New South Wales

10. Zhao, Xiang. Efficient processing of advanced structural queries in graph databases.

Degree: Computer Science & Engineering, 2014, University of New South Wales

 Recent decades witnessed a rapid proliferation of graph data, such as chemicalstructures and business processes. Structural queries are frequently issued in thesedomains, and hence, attract… (more)

Subjects/Keywords: Graph data; Structural queries; Graph similarity join; Graph similarity search; Graph substructure selection; Algorithms; Dynamic pruning technique; Efficiency; Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhao, X. (2014). Efficient processing of advanced structural queries in graph databases. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53213 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11908/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Zhao, Xiang. “Efficient processing of advanced structural queries in graph databases.” 2014. Doctoral Dissertation, University of New South Wales. Accessed December 10, 2019. http://handle.unsw.edu.au/1959.4/53213 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11908/SOURCE02?view=true.

MLA Handbook (7th Edition):

Zhao, Xiang. “Efficient processing of advanced structural queries in graph databases.” 2014. Web. 10 Dec 2019.

Vancouver:

Zhao X. Efficient processing of advanced structural queries in graph databases. [Internet] [Doctoral dissertation]. University of New South Wales; 2014. [cited 2019 Dec 10]. Available from: http://handle.unsw.edu.au/1959.4/53213 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11908/SOURCE02?view=true.

Council of Science Editors:

Zhao X. Efficient processing of advanced structural queries in graph databases. [Doctoral Dissertation]. University of New South Wales; 2014. Available from: http://handle.unsw.edu.au/1959.4/53213 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11908/SOURCE02?view=true


Florida International University

11. Varadarajan, Ramakrishna R. Ranked Search on Data Graphs.

Degree: Computer Science, 2009, Florida International University

Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example,… (more)

Subjects/Keywords: Graph Search; Database Ranking; Web Search; Information Retrieval; Document Summarization; Information Discovery

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Varadarajan, R. R. (2009). Ranked Search on Data Graphs. (Thesis). Florida International University. Retrieved from http://digitalcommons.fiu.edu/etd/220 ; 10.25148/etd.FI10022554 ; FI10022554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Varadarajan, Ramakrishna R. “Ranked Search on Data Graphs.” 2009. Thesis, Florida International University. Accessed December 10, 2019. http://digitalcommons.fiu.edu/etd/220 ; 10.25148/etd.FI10022554 ; FI10022554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Varadarajan, Ramakrishna R. “Ranked Search on Data Graphs.” 2009. Web. 10 Dec 2019.

Vancouver:

Varadarajan RR. Ranked Search on Data Graphs. [Internet] [Thesis]. Florida International University; 2009. [cited 2019 Dec 10]. Available from: http://digitalcommons.fiu.edu/etd/220 ; 10.25148/etd.FI10022554 ; FI10022554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Varadarajan RR. Ranked Search on Data Graphs. [Thesis]. Florida International University; 2009. Available from: http://digitalcommons.fiu.edu/etd/220 ; 10.25148/etd.FI10022554 ; FI10022554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Portland State University

12. Wilson, Keith Eirik. Factoring Semiprimes Using PG2N Prime Graph Multiagent Search.

Degree: MS(M.S.) in Computer Science, Computer Science, 2011, Portland State University

  In this thesis a heuristic method for factoring semiprimes by multiagent depth-limited search of PG2N graphs is presented. An analysis of PG2N graph connectivity… (more)

Subjects/Keywords: Computational search; Factoring; Prime number graph; Prime Numbers; Trees (Graph theory); Factorization (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wilson, K. E. (2011). Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/219

Chicago Manual of Style (16th Edition):

Wilson, Keith Eirik. “Factoring Semiprimes Using PG2N Prime Graph Multiagent Search.” 2011. Masters Thesis, Portland State University. Accessed December 10, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/219.

MLA Handbook (7th Edition):

Wilson, Keith Eirik. “Factoring Semiprimes Using PG2N Prime Graph Multiagent Search.” 2011. Web. 10 Dec 2019.

Vancouver:

Wilson KE. Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. [Internet] [Masters thesis]. Portland State University; 2011. [cited 2019 Dec 10]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/219.

Council of Science Editors:

Wilson KE. Factoring Semiprimes Using PG2N Prime Graph Multiagent Search. [Masters Thesis]. Portland State University; 2011. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/219


University of Manchester

13. Paredes Lopez, Mireya. Exploring vectorisation for parallel breadth-first search on an advanced vector processor.

Degree: 2017, University of Manchester

 Modern applications generate a massive amount of data that is challenging to process or analyse. Graph algorithms have emerged as a solution for the analysis… (more)

Subjects/Keywords: parallel architecture; vectorisation; breadth first search; Xeon Phi; graph algorithms; graph 500 benchmark

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Paredes Lopez, M. (2017). Exploring vectorisation for parallel breadth-first search on an advanced vector processor. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308019

Chicago Manual of Style (16th Edition):

Paredes Lopez, Mireya. “Exploring vectorisation for parallel breadth-first search on an advanced vector processor.” 2017. Doctoral Dissertation, University of Manchester. Accessed December 10, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308019.

MLA Handbook (7th Edition):

Paredes Lopez, Mireya. “Exploring vectorisation for parallel breadth-first search on an advanced vector processor.” 2017. Web. 10 Dec 2019.

Vancouver:

Paredes Lopez M. Exploring vectorisation for parallel breadth-first search on an advanced vector processor. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2019 Dec 10]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308019.

Council of Science Editors:

Paredes Lopez M. Exploring vectorisation for parallel breadth-first search on an advanced vector processor. [Doctoral Dissertation]. University of Manchester; 2017. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:308019


University of Manchester

14. Paredes Lopez, Mireya. Exploring vectorisation for parallel breadth-first search on an advanced vector processor.

Degree: PhD, 2017, University of Manchester

 Modern applications generate a massive amount of data that is challenging to process or analyse. Graph algorithms have emerged as a solution for the analysis… (more)

Subjects/Keywords: 511; graph algorithms; graph 500 benchmark; breadth first search; parallel architecture; vectorisation; Xeon Phi

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Paredes Lopez, M. (2017). Exploring vectorisation for parallel breadth-first search on an advanced vector processor. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/exploring-vectorisation-for-parallel-breadthfirst-search-on-an-advanced-vector-processor(f5de60ab-179e-4dbe-9934-dc3e22d0b8a8).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728202

Chicago Manual of Style (16th Edition):

Paredes Lopez, Mireya. “Exploring vectorisation for parallel breadth-first search on an advanced vector processor.” 2017. Doctoral Dissertation, University of Manchester. Accessed December 10, 2019. https://www.research.manchester.ac.uk/portal/en/theses/exploring-vectorisation-for-parallel-breadthfirst-search-on-an-advanced-vector-processor(f5de60ab-179e-4dbe-9934-dc3e22d0b8a8).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728202.

MLA Handbook (7th Edition):

Paredes Lopez, Mireya. “Exploring vectorisation for parallel breadth-first search on an advanced vector processor.” 2017. Web. 10 Dec 2019.

Vancouver:

Paredes Lopez M. Exploring vectorisation for parallel breadth-first search on an advanced vector processor. [Internet] [Doctoral dissertation]. University of Manchester; 2017. [cited 2019 Dec 10]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/exploring-vectorisation-for-parallel-breadthfirst-search-on-an-advanced-vector-processor(f5de60ab-179e-4dbe-9934-dc3e22d0b8a8).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728202.

Council of Science Editors:

Paredes Lopez M. Exploring vectorisation for parallel breadth-first search on an advanced vector processor. [Doctoral Dissertation]. University of Manchester; 2017. Available from: https://www.research.manchester.ac.uk/portal/en/theses/exploring-vectorisation-for-parallel-breadthfirst-search-on-an-advanced-vector-processor(f5de60ab-179e-4dbe-9934-dc3e22d0b8a8).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.728202


University of Alberta

15. Hajebi, Kiana. Efficient Visual Search in Appearance-based SLAM.

Degree: PhD, Department of Computing Science, 2015, University of Alberta

 Simultaneous localization and mapping (SLAM) in an unknown environment is a prerequisite to have a truly autonomous mobile robot. In this thesis, we focus on… (more)

Subjects/Keywords: Graph Nearest Neighbor Search; Image Retrieval; Robotics; Appearance-based SLAM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hajebi, K. (2015). Efficient Visual Search in Appearance-based SLAM. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/k643b385g

Chicago Manual of Style (16th Edition):

Hajebi, Kiana. “Efficient Visual Search in Appearance-based SLAM.” 2015. Doctoral Dissertation, University of Alberta. Accessed December 10, 2019. https://era.library.ualberta.ca/files/k643b385g.

MLA Handbook (7th Edition):

Hajebi, Kiana. “Efficient Visual Search in Appearance-based SLAM.” 2015. Web. 10 Dec 2019.

Vancouver:

Hajebi K. Efficient Visual Search in Appearance-based SLAM. [Internet] [Doctoral dissertation]. University of Alberta; 2015. [cited 2019 Dec 10]. Available from: https://era.library.ualberta.ca/files/k643b385g.

Council of Science Editors:

Hajebi K. Efficient Visual Search in Appearance-based SLAM. [Doctoral Dissertation]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/k643b385g


University of Alberta

16. Rayner, David Christopher Ferguson. Optimization for Heuristic Search.

Degree: PhD, Department of Computing Science, 2014, University of Alberta

 Heuristic search is a central problem in artificial intelligence. Among its defining properties is the use of a heuristic, a scalar function mapping pairs of… (more)

Subjects/Keywords: search; graph embedding; manifold learning; pathfinding; optimization; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rayner, D. C. F. (2014). Optimization for Heuristic Search. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/st74cs84d

Chicago Manual of Style (16th Edition):

Rayner, David Christopher Ferguson. “Optimization for Heuristic Search.” 2014. Doctoral Dissertation, University of Alberta. Accessed December 10, 2019. https://era.library.ualberta.ca/files/st74cs84d.

MLA Handbook (7th Edition):

Rayner, David Christopher Ferguson. “Optimization for Heuristic Search.” 2014. Web. 10 Dec 2019.

Vancouver:

Rayner DCF. Optimization for Heuristic Search. [Internet] [Doctoral dissertation]. University of Alberta; 2014. [cited 2019 Dec 10]. Available from: https://era.library.ualberta.ca/files/st74cs84d.

Council of Science Editors:

Rayner DCF. Optimization for Heuristic Search. [Doctoral Dissertation]. University of Alberta; 2014. Available from: https://era.library.ualberta.ca/files/st74cs84d


EPFL

17. Vajda, Péter. Object Duplicate Detection.

Degree: 2011, EPFL

 With the technological evolution of digital acquisition and storage technologies, millions of images and video sequences are captured every day and shared in online services.… (more)

Subjects/Keywords: object duplicate detection; image analysis; mobile visual search; graph matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vajda, P. (2011). Object Duplicate Detection. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/167916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vajda, Péter. “Object Duplicate Detection.” 2011. Thesis, EPFL. Accessed December 10, 2019. http://infoscience.epfl.ch/record/167916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vajda, Péter. “Object Duplicate Detection.” 2011. Web. 10 Dec 2019.

Vancouver:

Vajda P. Object Duplicate Detection. [Internet] [Thesis]. EPFL; 2011. [cited 2019 Dec 10]. Available from: http://infoscience.epfl.ch/record/167916.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vajda P. Object Duplicate Detection. [Thesis]. EPFL; 2011. Available from: http://infoscience.epfl.ch/record/167916

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Louisville

18. Wenerstrom, Brent, 1980-. Enhanced web-based summary generation for search.

Degree: PhD, 2012, University of Louisville

 After a user types in a search query on a major search engine, they are presented with a number of search results. Each search result… (more)

Subjects/Keywords: Automatic summarization; Search engines; Graph theory; Social media

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wenerstrom, Brent, 1. (2012). Enhanced web-based summary generation for search. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/1547 ; https://ir.library.louisville.edu/etd/1547

Chicago Manual of Style (16th Edition):

Wenerstrom, Brent, 1980-. “Enhanced web-based summary generation for search.” 2012. Doctoral Dissertation, University of Louisville. Accessed December 10, 2019. 10.18297/etd/1547 ; https://ir.library.louisville.edu/etd/1547.

MLA Handbook (7th Edition):

Wenerstrom, Brent, 1980-. “Enhanced web-based summary generation for search.” 2012. Web. 10 Dec 2019.

Vancouver:

Wenerstrom, Brent 1. Enhanced web-based summary generation for search. [Internet] [Doctoral dissertation]. University of Louisville; 2012. [cited 2019 Dec 10]. Available from: 10.18297/etd/1547 ; https://ir.library.louisville.edu/etd/1547.

Council of Science Editors:

Wenerstrom, Brent 1. Enhanced web-based summary generation for search. [Doctoral Dissertation]. University of Louisville; 2012. Available from: 10.18297/etd/1547 ; https://ir.library.louisville.edu/etd/1547


Université Catholique de Louvain

19. Pham, Quang Dung. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.

Degree: 2011, Université Catholique de Louvain

Constrained Optimum Tree (COT) and Constrained Optimum Path (COP) are two classes of problems which arise in many real-life applications and are ubiquitous in communication… (more)

Subjects/Keywords: LS(Graph); Constraint optimization; Graphs; Trees; Paths; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pham, Q. D. (2011). LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/70746

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pham, Quang Dung. “LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.” 2011. Thesis, Université Catholique de Louvain. Accessed December 10, 2019. http://hdl.handle.net/2078.1/70746.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pham, Quang Dung. “LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.” 2011. Web. 10 Dec 2019.

Vancouver:

Pham QD. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. [Internet] [Thesis]. Université Catholique de Louvain; 2011. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/2078.1/70746.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pham QD. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. [Thesis]. Université Catholique de Louvain; 2011. Available from: http://hdl.handle.net/2078.1/70746

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Mississippi State University

20. Wu, Xiaojian. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.

Degree: MS, Computer Science and Engineering, 2010, Mississippi State University

  Bayesian network is a popular machine learning tool for modeling uncertain dependence relationships among the random factors of a domain. It represents the relations… (more)

Subjects/Keywords: Dynamic Programming; Heursitic Search; Structure Learning; Directed Acyclic Graph; Bayesian Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, X. (2010). A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;

Chicago Manual of Style (16th Edition):

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Masters Thesis, Mississippi State University. Accessed December 10, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

MLA Handbook (7th Edition):

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Web. 10 Dec 2019.

Vancouver:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Internet] [Masters thesis]. Mississippi State University; 2010. [cited 2019 Dec 10]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

Council of Science Editors:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Masters Thesis]. Mississippi State University; 2010. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;


Georgia Tech

21. Hauer, Florian M. PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES.

Degree: PhD, Aerospace Engineering, 2019, Georgia Tech

 In this thesis, we discuss the problem of path-planning in high-dimensional spaces. Large search spaces tend to lead to slow algorithms in order to find… (more)

Subjects/Keywords: path-planning; RRT; sampling-based; algorithms; completeness; graph; search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hauer, F. M. (2019). PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61206

Chicago Manual of Style (16th Edition):

Hauer, Florian M. “PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES.” 2019. Doctoral Dissertation, Georgia Tech. Accessed December 10, 2019. http://hdl.handle.net/1853/61206.

MLA Handbook (7th Edition):

Hauer, Florian M. “PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES.” 2019. Web. 10 Dec 2019.

Vancouver:

Hauer FM. PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/1853/61206.

Council of Science Editors:

Hauer FM. PATH-PLANNING ALGORITHMS IN HIGH-DIMENSIONAL SPACES. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61206


University of New South Wales

22. Yuan, Long. I/O efficient cohesive subgraph search in large graphs.

Degree: Computer Science & Engineering, 2017, University of New South Wales

 Cohesive subgraph search has been recently studied for its large number of applications in social networks, web search, collaboration networks, and biology. Most existing approaches… (more)

Subjects/Keywords: cohesive subgraph search; graph; I/O efficient algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yuan, L. (2017). I/O efficient cohesive subgraph search in large graphs. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Yuan, Long. “I/O efficient cohesive subgraph search in large graphs.” 2017. Doctoral Dissertation, University of New South Wales. Accessed December 10, 2019. http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true.

MLA Handbook (7th Edition):

Yuan, Long. “I/O efficient cohesive subgraph search in large graphs.” 2017. Web. 10 Dec 2019.

Vancouver:

Yuan L. I/O efficient cohesive subgraph search in large graphs. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2019 Dec 10]. Available from: http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true.

Council of Science Editors:

Yuan L. I/O efficient cohesive subgraph search in large graphs. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/58110 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:45403/SOURCE02?view=true


New Jersey Institute of Technology

23. Dass, Ananya. Schema-aware keyword search on linked data.

Degree: PhD, Computer Science, 2016, New Jersey Institute of Technology

  Keyword search is a popular technique for querying the ever growing repositories of RDF graph data on the Web. This is due to the… (more)

Subjects/Keywords: Linked data; Semantic web; RDF; Keyword search; Graph data; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dass, A. (2016). Schema-aware keyword search on linked data. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/67

Chicago Manual of Style (16th Edition):

Dass, Ananya. “Schema-aware keyword search on linked data.” 2016. Doctoral Dissertation, New Jersey Institute of Technology. Accessed December 10, 2019. https://digitalcommons.njit.edu/dissertations/67.

MLA Handbook (7th Edition):

Dass, Ananya. “Schema-aware keyword search on linked data.” 2016. Web. 10 Dec 2019.

Vancouver:

Dass A. Schema-aware keyword search on linked data. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2016. [cited 2019 Dec 10]. Available from: https://digitalcommons.njit.edu/dissertations/67.

Council of Science Editors:

Dass A. Schema-aware keyword search on linked data. [Doctoral Dissertation]. New Jersey Institute of Technology; 2016. Available from: https://digitalcommons.njit.edu/dissertations/67


Rice University

24. Kim, Sarah Michelle. Precomputation and Visualization of Metabolic Pathways.

Degree: PhD, Engineering, 2019, Rice University

 Advances in metabolic engineering have led to the development of alternative, renewable methods for producing chemicals that are traditionally challenging to obtain. The rapid growth… (more)

Subjects/Keywords: Metabolic pathfinding; precomputation; metabolic engineering; graph search; atom tracking; metabolic pathways

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, S. M. (2019). Precomputation and Visualization of Metabolic Pathways. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/105385

Chicago Manual of Style (16th Edition):

Kim, Sarah Michelle. “Precomputation and Visualization of Metabolic Pathways.” 2019. Doctoral Dissertation, Rice University. Accessed December 10, 2019. http://hdl.handle.net/1911/105385.

MLA Handbook (7th Edition):

Kim, Sarah Michelle. “Precomputation and Visualization of Metabolic Pathways.” 2019. Web. 10 Dec 2019.

Vancouver:

Kim SM. Precomputation and Visualization of Metabolic Pathways. [Internet] [Doctoral dissertation]. Rice University; 2019. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/1911/105385.

Council of Science Editors:

Kim SM. Precomputation and Visualization of Metabolic Pathways. [Doctoral Dissertation]. Rice University; 2019. Available from: http://hdl.handle.net/1911/105385


University of Pretoria

25. Anguelov, Bobby. Video game pathfinding and improvements to discrete search on grid-based maps.

Degree: Computer Science, 2012, University of Pretoria

 The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding… (more)

Subjects/Keywords: Navigation; Graph search; Hierarchical pathfinding; Games; A*; Hierarchical search algorithms; Pathfinding; Artificial intelligence; Video games; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Anguelov, B. (2012). Video game pathfinding and improvements to discrete search on grid-based maps. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/22940

Chicago Manual of Style (16th Edition):

Anguelov, Bobby. “Video game pathfinding and improvements to discrete search on grid-based maps.” 2012. Masters Thesis, University of Pretoria. Accessed December 10, 2019. http://hdl.handle.net/2263/22940.

MLA Handbook (7th Edition):

Anguelov, Bobby. “Video game pathfinding and improvements to discrete search on grid-based maps.” 2012. Web. 10 Dec 2019.

Vancouver:

Anguelov B. Video game pathfinding and improvements to discrete search on grid-based maps. [Internet] [Masters thesis]. University of Pretoria; 2012. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/2263/22940.

Council of Science Editors:

Anguelov B. Video game pathfinding and improvements to discrete search on grid-based maps. [Masters Thesis]. University of Pretoria; 2012. Available from: http://hdl.handle.net/2263/22940


University of Pretoria

26. [No author]. Video game pathfinding and improvements to discrete search on grid-based maps .

Degree: 2012, University of Pretoria

 The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding… (more)

Subjects/Keywords: Navigation; Graph search; Hierarchical pathfinding; Games; A*; Hierarchical search algorithms; Pathfinding; Artificial intelligence; Video games; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

author], [. (2012). Video game pathfinding and improvements to discrete search on grid-based maps . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-03022012-094023/

Chicago Manual of Style (16th Edition):

author], [No. “Video game pathfinding and improvements to discrete search on grid-based maps .” 2012. Masters Thesis, University of Pretoria. Accessed December 10, 2019. http://upetd.up.ac.za/thesis/available/etd-03022012-094023/.

MLA Handbook (7th Edition):

author], [No. “Video game pathfinding and improvements to discrete search on grid-based maps .” 2012. Web. 10 Dec 2019.

Vancouver:

author] [. Video game pathfinding and improvements to discrete search on grid-based maps . [Internet] [Masters thesis]. University of Pretoria; 2012. [cited 2019 Dec 10]. Available from: http://upetd.up.ac.za/thesis/available/etd-03022012-094023/.

Council of Science Editors:

author] [. Video game pathfinding and improvements to discrete search on grid-based maps . [Masters Thesis]. University of Pretoria; 2012. Available from: http://upetd.up.ac.za/thesis/available/etd-03022012-094023/


Mississippi State University

27. Zhou, Rong. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.

Degree: PhD, Computer Science, 2005, Mississippi State University

Graph search is used in many areas of computer science. It is well-known that the scalability of graph-search algorithms such as A* is limited by… (more)

Subjects/Keywords: heuristic search; external-memory graph search; memory-based heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhou, R. (2005). Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;

Chicago Manual of Style (16th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Doctoral Dissertation, Mississippi State University. Accessed December 10, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

MLA Handbook (7th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Web. 10 Dec 2019.

Vancouver:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Internet] [Doctoral dissertation]. Mississippi State University; 2005. [cited 2019 Dec 10]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

Council of Science Editors:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Doctoral Dissertation]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;


Loughborough University

28. Newton, Matthew. Sequential and parallel algorithms for low-crossing graph drawing.

Degree: PhD, 2007, Loughborough University

 The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on… (more)

Subjects/Keywords: 511.5; Graph drawing : Bipartite graphs : Biplanar graphs : Genetic algorithms : Heuristic search : Parallel computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Newton, M. (2007). Sequential and parallel algorithms for low-crossing graph drawing. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017

Chicago Manual of Style (16th Edition):

Newton, Matthew. “Sequential and parallel algorithms for low-crossing graph drawing.” 2007. Doctoral Dissertation, Loughborough University. Accessed December 10, 2019. https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017.

MLA Handbook (7th Edition):

Newton, Matthew. “Sequential and parallel algorithms for low-crossing graph drawing.” 2007. Web. 10 Dec 2019.

Vancouver:

Newton M. Sequential and parallel algorithms for low-crossing graph drawing. [Internet] [Doctoral dissertation]. Loughborough University; 2007. [cited 2019 Dec 10]. Available from: https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017.

Council of Science Editors:

Newton M. Sequential and parallel algorithms for low-crossing graph drawing. [Doctoral Dissertation]. Loughborough University; 2007. Available from: https://dspace.lboro.ac.uk/2134/12944 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.479017


Leiden University

29. Honk, J. van. The Shrinking Web: The consequences of an increasingly reduced sense of space online.

Degree: 2014, Leiden University

 The Internet, and in particular the World Wide Web, has become the primary source of information for a substantial number of people in the world.… (more)

Subjects/Keywords: internet; spatial turn; spatialisation; cloud computing; search engines; cyberspace; navigation; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Honk, J. v. (2014). The Shrinking Web: The consequences of an increasingly reduced sense of space online. (Masters Thesis). Leiden University. Retrieved from http://hdl.handle.net/1887/29601

Chicago Manual of Style (16th Edition):

Honk, J van. “The Shrinking Web: The consequences of an increasingly reduced sense of space online.” 2014. Masters Thesis, Leiden University. Accessed December 10, 2019. http://hdl.handle.net/1887/29601.

MLA Handbook (7th Edition):

Honk, J van. “The Shrinking Web: The consequences of an increasingly reduced sense of space online.” 2014. Web. 10 Dec 2019.

Vancouver:

Honk Jv. The Shrinking Web: The consequences of an increasingly reduced sense of space online. [Internet] [Masters thesis]. Leiden University; 2014. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/1887/29601.

Council of Science Editors:

Honk Jv. The Shrinking Web: The consequences of an increasingly reduced sense of space online. [Masters Thesis]. Leiden University; 2014. Available from: http://hdl.handle.net/1887/29601


Georgia State University

30. Chen, Yan. Enhanced Web Search Engines with Query-Concept Bipartite Graphs.

Degree: PhD, Computer Science, 2010, Georgia State University

  With rapid growth of information on the Web, Web search engines have gained great momentum for exploiting valuable Web resources. Although keywords-based Web search(more)

Subjects/Keywords: Queries; Query-concept bipartite graph; Web search engine; Text mining; Computational intelligence.; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, Y. (2010). Enhanced Web Search Engines with Query-Concept Bipartite Graphs. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/54

Chicago Manual of Style (16th Edition):

Chen, Yan. “Enhanced Web Search Engines with Query-Concept Bipartite Graphs.” 2010. Doctoral Dissertation, Georgia State University. Accessed December 10, 2019. https://scholarworks.gsu.edu/cs_diss/54.

MLA Handbook (7th Edition):

Chen, Yan. “Enhanced Web Search Engines with Query-Concept Bipartite Graphs.” 2010. Web. 10 Dec 2019.

Vancouver:

Chen Y. Enhanced Web Search Engines with Query-Concept Bipartite Graphs. [Internet] [Doctoral dissertation]. Georgia State University; 2010. [cited 2019 Dec 10]. Available from: https://scholarworks.gsu.edu/cs_diss/54.

Council of Science Editors:

Chen Y. Enhanced Web Search Engines with Query-Concept Bipartite Graphs. [Doctoral Dissertation]. Georgia State University; 2010. Available from: https://scholarworks.gsu.edu/cs_diss/54

[1] [2] [3] [4]

.