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 structure). Showing records 1 – 30 of 99 total matches.

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

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


Anna University

1. Senbagamalar J. On topological indices of Molecular graphs;.

Degree: On topological indices of Molecular graphs, 2015, Anna University

The representation of an object giving information only about the newlinenumber of elements composing it and their connectivity is named as newlinetopological representation of an… (more)

Subjects/Keywords: Molecular graph; quantitative structure activity relationships

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

J, S. (2015). On topological indices of Molecular graphs;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/33720

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):

J, Senbagamalar. “On topological indices of Molecular graphs;.” 2015. Thesis, Anna University. Accessed July 10, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/33720.

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

MLA Handbook (7th Edition):

J, Senbagamalar. “On topological indices of Molecular graphs;.” 2015. Web. 10 Jul 2020.

Vancouver:

J S. On topological indices of Molecular graphs;. [Internet] [Thesis]. Anna University; 2015. [cited 2020 Jul 10]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33720.

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

Council of Science Editors:

J S. On topological indices of Molecular graphs;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/33720

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


University of Texas – Austin

2. Malik, Muhammad Zubair. Combining data structure repair and program repair.

Degree: PhD, Electrical and Computer Engineering, 2014, University of Texas – Austin

 Bugs in code continue to pose a fundamental problem for software reliability and cause expensive failures. The process of removing known bugs is termed debugging,… (more)

Subjects/Keywords: Program repair; Data Structure repair; Graph spectra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malik, M. Z. (2014). Combining data structure repair and program repair. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/26034

Chicago Manual of Style (16th Edition):

Malik, Muhammad Zubair. “Combining data structure repair and program repair.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed July 10, 2020. http://hdl.handle.net/2152/26034.

MLA Handbook (7th Edition):

Malik, Muhammad Zubair. “Combining data structure repair and program repair.” 2014. Web. 10 Jul 2020.

Vancouver:

Malik MZ. Combining data structure repair and program repair. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/2152/26034.

Council of Science Editors:

Malik MZ. Combining data structure repair and program repair. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/26034


Carnegie Mellon University

3. Kang, U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.

Degree: 2012, Carnegie Mellon University

 How do we find patterns and anomalies, on graphs with billions of nodes and edges, which do not fit in memory? How to use parallelism… (more)

Subjects/Keywords: graph mining; MAPREDUCE; HADOOP; graph structure analysis; radius plot; diameter; connected component; inference; spectral graph analysis; eigensolver; tensor analysis; graph management; graph indexing; graph compression; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kang, U. (2012). Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/160

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):

Kang, U. “Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.” 2012. Thesis, Carnegie Mellon University. Accessed July 10, 2020. http://repository.cmu.edu/dissertations/160.

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

MLA Handbook (7th Edition):

Kang, U. “Mining Tera-Scale Graphs: Theory, Engineering and Discoveries.” 2012. Web. 10 Jul 2020.

Vancouver:

Kang U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. [Internet] [Thesis]. Carnegie Mellon University; 2012. [cited 2020 Jul 10]. Available from: http://repository.cmu.edu/dissertations/160.

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

Council of Science Editors:

Kang U. Mining Tera-Scale Graphs: Theory, Engineering and Discoveries. [Thesis]. Carnegie Mellon University; 2012. Available from: http://repository.cmu.edu/dissertations/160

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


University of Georgia

4. Huang, Zhibin. Computational search of RNA pseudoknots and structural variations in genomes.

Degree: PhD, Computer Science, 2011, University of Georgia

 Non-coding RNA (ncRNA) secondary structural homologs can be detected effectively in genomes based on a covariance model (CM) and associated dynamic programming algorithms. However, the… (more)

Subjects/Keywords: ncRNA structure search; Sequence structure alignment; pseudoknot; ncRNA structure variation; RNA structure evolution; Graph tree decomposition; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Z. (2011). Computational search of RNA pseudoknots and structural variations in genomes. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd

Chicago Manual of Style (16th Edition):

Huang, Zhibin. “Computational search of RNA pseudoknots and structural variations in genomes.” 2011. Doctoral Dissertation, University of Georgia. Accessed July 10, 2020. http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd.

MLA Handbook (7th Edition):

Huang, Zhibin. “Computational search of RNA pseudoknots and structural variations in genomes.” 2011. Web. 10 Jul 2020.

Vancouver:

Huang Z. Computational search of RNA pseudoknots and structural variations in genomes. [Internet] [Doctoral dissertation]. University of Georgia; 2011. [cited 2020 Jul 10]. Available from: http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd.

Council of Science Editors:

Huang Z. Computational search of RNA pseudoknots and structural variations in genomes. [Doctoral Dissertation]. University of Georgia; 2011. Available from: http://purl.galileo.usg.edu/uga_etd/huang_zhibin_201105_phd


Penn State University

5. Yuan, Dayu. Mining and indexing graph databases.

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

 Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional… (more)

Subjects/Keywords: data mining; graph database; query processing; index structure; information retrieval

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuan, D. (2013). Mining and indexing graph databases. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/19880

Chicago Manual of Style (16th Edition):

Yuan, Dayu. “Mining and indexing graph databases.” 2013. Doctoral Dissertation, Penn State University. Accessed July 10, 2020. https://etda.libraries.psu.edu/catalog/19880.

MLA Handbook (7th Edition):

Yuan, Dayu. “Mining and indexing graph databases.” 2013. Web. 10 Jul 2020.

Vancouver:

Yuan D. Mining and indexing graph databases. [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2020 Jul 10]. Available from: https://etda.libraries.psu.edu/catalog/19880.

Council of Science Editors:

Yuan D. Mining and indexing graph databases. [Doctoral Dissertation]. Penn State University; 2013. Available from: https://etda.libraries.psu.edu/catalog/19880


University of California – San Diego

6. Moeller, Daniel Paul. Exploiting Structure in the Stable Matching Problem.

Degree: Computer Science, 2016, University of California – San Diego

 Stable matching is a widely studied problem in social choice theory. For the basiccentralized case, an optimal quadratic time algorithm is known. However, we presentseveral… (more)

Subjects/Keywords: Computer science; Complexity; Decentralized; Jealousy Graph; Stable Matching; Structure; Succinct

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moeller, D. P. (2016). Exploiting Structure in the Stable Matching Problem. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/6f80v7jc

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):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Thesis, University of California – San Diego. Accessed July 10, 2020. http://www.escholarship.org/uc/item/6f80v7jc.

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

MLA Handbook (7th Edition):

Moeller, Daniel Paul. “Exploiting Structure in the Stable Matching Problem.” 2016. Web. 10 Jul 2020.

Vancouver:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Jul 10]. Available from: http://www.escholarship.org/uc/item/6f80v7jc.

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

Council of Science Editors:

Moeller DP. Exploiting Structure in the Stable Matching Problem. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/6f80v7jc

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


North Carolina State University

7. Chen, Kunsheng. An open solution to discover the graph structure of World Wide Web.

Degree: MS, Computer Science, 2009, North Carolina State University

 The World Wide Web is a large complex network of inter-linked web pages. Understanding this structure is of immense benefit both economically and socially. Currently,… (more)

Subjects/Keywords: graph structure of World Wide Web; distributed web crawler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2009). An open solution to discover the graph structure of World Wide Web. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1176

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):

Chen, Kunsheng. “An open solution to discover the graph structure of World Wide Web.” 2009. Thesis, North Carolina State University. Accessed July 10, 2020. http://www.lib.ncsu.edu/resolver/1840.16/1176.

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

MLA Handbook (7th Edition):

Chen, Kunsheng. “An open solution to discover the graph structure of World Wide Web.” 2009. Web. 10 Jul 2020.

Vancouver:

Chen K. An open solution to discover the graph structure of World Wide Web. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2020 Jul 10]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1176.

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

Council of Science Editors:

Chen K. An open solution to discover the graph structure of World Wide Web. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1176

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


Mississippi State University

8. 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 July 10, 2020. 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 Jul 2020.

Vancouver:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Internet] [Masters thesis]. Mississippi State University; 2010. [cited 2020 Jul 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/ ;


University of New South Wales

9. Kwok, Eric. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.

Degree: Mathematics & Statistics, 2018, University of New South Wales

 Transport and mixing in dynamical systems are important properties for many physical, chemical, biological, and engineering processes. The detection of transport barriers for dynamics with… (more)

Subjects/Keywords: Lagrangian coherent structure; Dynamic; Isoperimetry; Weighted manifold; Graph; Manifold learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kwok, E. (2018). Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Doctoral Dissertation, University of New South Wales. Accessed July 10, 2020. http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

MLA Handbook (7th Edition):

Kwok, Eric. “Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds.” 2018. Web. 10 Jul 2020.

Vancouver:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2020 Jul 10]. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true.

Council of Science Editors:

Kwok E. Dynamic Isoperimetry on Graphs and Weighted Riemannian manifolds. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/59708 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49421/SOURCE02?view=true


Purdue University

10. Huang, Jiajie. Graphical methods in RNA structure matching.

Degree: PhD, PULSe, 2016, Purdue University

  Eukaryotic genomes are pervasively transcribed; almost every base can be found in an RNA transcript. This is a surprising observation since most of the… (more)

Subjects/Keywords: Biological sciences; Graph matching; RNA structure; Bioinformatics; Biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, J. (2016). Graphical methods in RNA structure matching. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/773

Chicago Manual of Style (16th Edition):

Huang, Jiajie. “Graphical methods in RNA structure matching.” 2016. Doctoral Dissertation, Purdue University. Accessed July 10, 2020. https://docs.lib.purdue.edu/open_access_dissertations/773.

MLA Handbook (7th Edition):

Huang, Jiajie. “Graphical methods in RNA structure matching.” 2016. Web. 10 Jul 2020.

Vancouver:

Huang J. Graphical methods in RNA structure matching. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2020 Jul 10]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/773.

Council of Science Editors:

Huang J. Graphical methods in RNA structure matching. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/773

11. Bloyet, Nicolas. Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models.

Degree: Docteur es, Informatique, 2019, Lorient

Dans le domaine de la chimie, il est intéressant de pouvoir estimer des propriétés physico- chimiques de molécules, notamment pour des applications industrielles. Celles-ci sont… (more)

Subjects/Keywords: Canonisation de graphe; Plongement de graphe; Graph canonization; Graph embedding; Machine learning; Structure-activity relationship (QSAR) models; 016.511 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bloyet, N. (2019). Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models. (Doctoral Dissertation). Lorient. Retrieved from http://www.theses.fr/2019LORIS546

Chicago Manual of Style (16th Edition):

Bloyet, Nicolas. “Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models.” 2019. Doctoral Dissertation, Lorient. Accessed July 10, 2020. http://www.theses.fr/2019LORIS546.

MLA Handbook (7th Edition):

Bloyet, Nicolas. “Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models.” 2019. Web. 10 Jul 2020.

Vancouver:

Bloyet N. Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models. [Internet] [Doctoral dissertation]. Lorient; 2019. [cited 2020 Jul 10]. Available from: http://www.theses.fr/2019LORIS546.

Council of Science Editors:

Bloyet N. Caractérisation et plongement de sous-graphes colorés : application à la construction de modèles structures à activité (QSAR) : Characterization and embeddings of colored subgraphs : application to quantitative structure-activity relationship (QSAR) models. [Doctoral Dissertation]. Lorient; 2019. Available from: http://www.theses.fr/2019LORIS546

12. Alqahtani, Mohra Abdullah Z. Generalized Line Graphs.

Degree: PhD, Mathematics, 2018, Western Michigan University

  With every nonempty graph, there are associated many graphs. One of the best known and most studied of these is the line graph L… (more)

Subjects/Keywords: Generalized line graph; graph structure; derived graph; Mathematics

…LIST OF FIGURES 1.1 A graph and its line graph… …1 1.2 The induced subgraphs not contained in any line graph… …3 1.3 The 5-cycle and the Petersen graph P… …4 1.4 Illustrating adjacency in a Schwenk graph… …4 1.5 A tree T and its 3-line graph L3 (T )… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alqahtani, M. A. Z. (2018). Generalized Line Graphs. (Doctoral Dissertation). Western Michigan University. Retrieved from https://scholarworks.wmich.edu/dissertations/3348

Chicago Manual of Style (16th Edition):

Alqahtani, Mohra Abdullah Z. “Generalized Line Graphs.” 2018. Doctoral Dissertation, Western Michigan University. Accessed July 10, 2020. https://scholarworks.wmich.edu/dissertations/3348.

MLA Handbook (7th Edition):

Alqahtani, Mohra Abdullah Z. “Generalized Line Graphs.” 2018. Web. 10 Jul 2020.

Vancouver:

Alqahtani MAZ. Generalized Line Graphs. [Internet] [Doctoral dissertation]. Western Michigan University; 2018. [cited 2020 Jul 10]. Available from: https://scholarworks.wmich.edu/dissertations/3348.

Council of Science Editors:

Alqahtani MAZ. Generalized Line Graphs. [Doctoral Dissertation]. Western Michigan University; 2018. Available from: https://scholarworks.wmich.edu/dissertations/3348


Queensland University of Technology

13. He, Hu. Joint 2D and 3D cues for image segmentation towards robotic applications.

Degree: 2014, Queensland University of Technology

 This thesis investigates the fusion of 3D visual information with 2D image cues to provide 3D semantic maps of large-scale environments in which a robot… (more)

Subjects/Keywords: Image Segmentation; Computer Vision; Robotics; Structure from Motion; Markov Random Fields; Graph Cut; Energy Minimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, H. (2014). Joint 2D and 3D cues for image segmentation towards robotic applications. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/71760/

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):

He, Hu. “Joint 2D and 3D cues for image segmentation towards robotic applications.” 2014. Thesis, Queensland University of Technology. Accessed July 10, 2020. https://eprints.qut.edu.au/71760/.

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

MLA Handbook (7th Edition):

He, Hu. “Joint 2D and 3D cues for image segmentation towards robotic applications.” 2014. Web. 10 Jul 2020.

Vancouver:

He H. Joint 2D and 3D cues for image segmentation towards robotic applications. [Internet] [Thesis]. Queensland University of Technology; 2014. [cited 2020 Jul 10]. Available from: https://eprints.qut.edu.au/71760/.

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

Council of Science Editors:

He H. Joint 2D and 3D cues for image segmentation towards robotic applications. [Thesis]. Queensland University of Technology; 2014. Available from: https://eprints.qut.edu.au/71760/

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

14. Kelz, Justin M. A Walk Through Quaternionic Structures.

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

 In 1980, Murray Marshall proved that the category of Quaternionic Structures is naturally equivalent to the category of abstract Witt rings. This paper develops a… (more)

Subjects/Keywords: Mathematics; Abstract Witt Ring; Combinatorics; Graph Theory; Quaternionic Structure; Steiner Triple System; Witt Ring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kelz, J. M. (2016). A Walk Through Quaternionic Structures. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/31w4d6tr

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):

Kelz, Justin M. “A Walk Through Quaternionic Structures.” 2016. Thesis, University of California – eScholarship, University of California. Accessed July 10, 2020. http://www.escholarship.org/uc/item/31w4d6tr.

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

MLA Handbook (7th Edition):

Kelz, Justin M. “A Walk Through Quaternionic Structures.” 2016. Web. 10 Jul 2020.

Vancouver:

Kelz JM. A Walk Through Quaternionic Structures. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2020 Jul 10]. Available from: http://www.escholarship.org/uc/item/31w4d6tr.

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

Council of Science Editors:

Kelz JM. A Walk Through Quaternionic Structures. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/31w4d6tr

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


University of Toronto

15. Chui, Carmen Stephanie. A Molecular Structure Ontology for Medicinal Chemistry.

Degree: PhD, 2019, University of Toronto

 The field of medicinal chemistry involves the design, synthesis, and development of new drugs that can be further enhanced with the application of ontologies. This… (more)

Subjects/Keywords: graph theory; knowledge representation; medicinal chemistry; molecular structure; ontologies; ontology engineering; 0546

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chui, C. S. (2019). A Molecular Structure Ontology for Medicinal Chemistry. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/97001

Chicago Manual of Style (16th Edition):

Chui, Carmen Stephanie. “A Molecular Structure Ontology for Medicinal Chemistry.” 2019. Doctoral Dissertation, University of Toronto. Accessed July 10, 2020. http://hdl.handle.net/1807/97001.

MLA Handbook (7th Edition):

Chui, Carmen Stephanie. “A Molecular Structure Ontology for Medicinal Chemistry.” 2019. Web. 10 Jul 2020.

Vancouver:

Chui CS. A Molecular Structure Ontology for Medicinal Chemistry. [Internet] [Doctoral dissertation]. University of Toronto; 2019. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1807/97001.

Council of Science Editors:

Chui CS. A Molecular Structure Ontology for Medicinal Chemistry. [Doctoral Dissertation]. University of Toronto; 2019. Available from: http://hdl.handle.net/1807/97001


University of Southern California

16. Hidaka, Yukikazu. Computational model of stroke therapy and long term recovery.

Degree: PhD, Computer Science, 2013, University of Southern California

 Understanding the effects of task practice on the long term recovery of arm function post-stroke could allow effective motor training at a reduced cost. There… (more)

Subjects/Keywords: Bayesian regression; computational model; graph structure learning; machine learning; stroke rehabilitation; task specific training

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hidaka, Y. (2013). Computational model of stroke therapy and long term recovery. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1549

Chicago Manual of Style (16th Edition):

Hidaka, Yukikazu. “Computational model of stroke therapy and long term recovery.” 2013. Doctoral Dissertation, University of Southern California. Accessed July 10, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1549.

MLA Handbook (7th Edition):

Hidaka, Yukikazu. “Computational model of stroke therapy and long term recovery.” 2013. Web. 10 Jul 2020.

Vancouver:

Hidaka Y. Computational model of stroke therapy and long term recovery. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2020 Jul 10]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1549.

Council of Science Editors:

Hidaka Y. Computational model of stroke therapy and long term recovery. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/322852/rec/1549

17. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

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):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed July 10, 2020. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

MLA Handbook (7th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 10 Jul 2020.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2020 Jul 10]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

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

18. Al Nasr, Kamal H. De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph.

Degree: PhD, Computer Science, 2012, Old Dominion University

  Proteins are the molecules carry out the vital functions and make more than the half of dry weight in every cell. Protein in nature… (more)

Subjects/Keywords: Cryoem; De novo proteins; Protein structure modeling; Digital mapping; Secondary structure topology graph; Bioinformatics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al Nasr, K. H. (2012). De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45

Chicago Manual of Style (16th Edition):

Al Nasr, Kamal H. “De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph.” 2012. Doctoral Dissertation, Old Dominion University. Accessed July 10, 2020. 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45.

MLA Handbook (7th Edition):

Al Nasr, Kamal H. “De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph.” 2012. Web. 10 Jul 2020.

Vancouver:

Al Nasr KH. De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. [Internet] [Doctoral dissertation]. Old Dominion University; 2012. [cited 2020 Jul 10]. Available from: 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45.

Council of Science Editors:

Al Nasr KH. De Novo Protein Structure Modeling from Cryoem Data Through a Dynamic Programming Algorithm in the Secondary Structure Topology Graph. [Doctoral Dissertation]. Old Dominion University; 2012. Available from: 9781267668288 ; https://digitalcommons.odu.edu/computerscience_etds/45


Indian Institute of Science

19. Bhattacharya, Sourangshu. Computational Protein Structure Analysis : Kernel And Spectral Methods.

Degree: 2008, Indian Institute of Science

 The focus of this thesis is to develop computational techniques for analysis of protein structures. We model protein structures as points in 3-dimensional space which… (more)

Subjects/Keywords: Protein - Structure; Protein Structure - Data Processing; Protein Structure Alignment; Kernel Method; Structural Bioinformatics; Spectral Graph Theory; Machine Learning; Neighborhood Alignments; Structural Alignment; Protein Structure Classification; Bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhattacharya, S. (2008). Computational Protein Structure Analysis : Kernel And Spectral Methods. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/831

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):

Bhattacharya, Sourangshu. “Computational Protein Structure Analysis : Kernel And Spectral Methods.” 2008. Thesis, Indian Institute of Science. Accessed July 10, 2020. http://hdl.handle.net/2005/831.

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

MLA Handbook (7th Edition):

Bhattacharya, Sourangshu. “Computational Protein Structure Analysis : Kernel And Spectral Methods.” 2008. Web. 10 Jul 2020.

Vancouver:

Bhattacharya S. Computational Protein Structure Analysis : Kernel And Spectral Methods. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/2005/831.

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

Council of Science Editors:

Bhattacharya S. Computational Protein Structure Analysis : Kernel And Spectral Methods. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/831

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


East Tennessee State University

20. Koessler, Denise Renee. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.

Degree: MS, Mathematical Sciences, 2010, East Tennessee State University

  In this work we use a graph-theoretic representation of secondary RNA structure found in the database RAG: RNA-As-Graphs. We model the bonding of two… (more)

Subjects/Keywords: graph theory; artificial neural network; graph models; math modeling; secondary RNA; RNA structure; RNA as Graphs; RNA; tree graph; application of graph theory; vertex identification; merge; predictive model; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koessler, D. R. (2010). A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1684

Chicago Manual of Style (16th Edition):

Koessler, Denise Renee. “A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.” 2010. Masters Thesis, East Tennessee State University. Accessed July 10, 2020. https://dc.etsu.edu/etd/1684.

MLA Handbook (7th Edition):

Koessler, Denise Renee. “A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.” 2010. Web. 10 Jul 2020.

Vancouver:

Koessler DR. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. [Internet] [Masters thesis]. East Tennessee State University; 2010. [cited 2020 Jul 10]. Available from: https://dc.etsu.edu/etd/1684.

Council of Science Editors:

Koessler DR. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. [Masters Thesis]. East Tennessee State University; 2010. Available from: https://dc.etsu.edu/etd/1684


University of Saskatchewan

21. He, Peiren. A general computational tool for structure synthesis.

Degree: 2003, University of Saskatchewan

 Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst… (more)

Subjects/Keywords: structure synthesis; graph isomorphism; graph automorphism; eigenvector; eigenvalue; canonical labeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, P. (2003). A general computational tool for structure synthesis. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-10062008-104305

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):

He, Peiren. “A general computational tool for structure synthesis.” 2003. Thesis, University of Saskatchewan. Accessed July 10, 2020. http://hdl.handle.net/10388/etd-10062008-104305.

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

MLA Handbook (7th Edition):

He, Peiren. “A general computational tool for structure synthesis.” 2003. Web. 10 Jul 2020.

Vancouver:

He P. A general computational tool for structure synthesis. [Internet] [Thesis]. University of Saskatchewan; 2003. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10388/etd-10062008-104305.

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

Council of Science Editors:

He P. A general computational tool for structure synthesis. [Thesis]. University of Saskatchewan; 2003. Available from: http://hdl.handle.net/10388/etd-10062008-104305

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


Linnaeus University

22. Maryokhin, Tymur. Data dissemination in large-cardinality social graphs.

Degree: Computer Science, 2015, Linnaeus University

  Near real-time event streams are a key feature in many popular social media applications. These types of applications allow users to selectively follow event… (more)

Subjects/Keywords: Data dissemination; message delivery; social graph; big data; large scale; feed following; materialized views; social network analysis; community structure detection; graph theory; database theory.; Computer Systems; Datorsystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maryokhin, T. (2015). Data dissemination in large-cardinality social graphs. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268

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):

Maryokhin, Tymur. “Data dissemination in large-cardinality social graphs.” 2015. Thesis, Linnaeus University. Accessed July 10, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268.

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

MLA Handbook (7th Edition):

Maryokhin, Tymur. “Data dissemination in large-cardinality social graphs.” 2015. Web. 10 Jul 2020.

Vancouver:

Maryokhin T. Data dissemination in large-cardinality social graphs. [Internet] [Thesis]. Linnaeus University; 2015. [cited 2020 Jul 10]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268.

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

Council of Science Editors:

Maryokhin T. Data dissemination in large-cardinality social graphs. [Thesis]. Linnaeus University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48268

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


Case Western Reserve University

23. Henderson, Robert Vann. A graph theory-based 'expert system' methodology for structure-activity studies.

Degree: PhD, Chemistry, 1992, Case Western Reserve University

 A new graph theory-based methodology is proposed for the statistical evaluation of the link between the structure and the chemical/biological activity of organic molecules. The… (more)

Subjects/Keywords: graph theory-based 'expert system' methodology structure-activity studies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henderson, R. V. (1992). A graph theory-based 'expert system' methodology for structure-activity studies. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337

Chicago Manual of Style (16th Edition):

Henderson, Robert Vann. “A graph theory-based 'expert system' methodology for structure-activity studies.” 1992. Doctoral Dissertation, Case Western Reserve University. Accessed July 10, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337.

MLA Handbook (7th Edition):

Henderson, Robert Vann. “A graph theory-based 'expert system' methodology for structure-activity studies.” 1992. Web. 10 Jul 2020.

Vancouver:

Henderson RV. A graph theory-based 'expert system' methodology for structure-activity studies. [Internet] [Doctoral dissertation]. Case Western Reserve University; 1992. [cited 2020 Jul 10]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337.

Council of Science Editors:

Henderson RV. A graph theory-based 'expert system' methodology for structure-activity studies. [Doctoral Dissertation]. Case Western Reserve University; 1992. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056048337

24. Boas, Paulino Ribeiro Villas. Efeito da amostragem nas propriedades topológicas de redes complexas.

Degree: PhD, Física Aplicada, 2008, University of São Paulo

Muitos sistemas complexos naturais ou construídos pelos seres humanos podem ser representados por redes complexas, uma teoria que une o estudo de grafos com a… (more)

Subjects/Keywords: Amostragem; Complex networks; Estrutura topológica; Grafos; Graph; Incompleteza; Incompletness; Measurements; Medidas; Redes complexas; Sampling; Topological structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boas, P. R. V. (2008). Efeito da amostragem nas propriedades topológicas de redes complexas. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;

Chicago Manual of Style (16th Edition):

Boas, Paulino Ribeiro Villas. “Efeito da amostragem nas propriedades topológicas de redes complexas.” 2008. Doctoral Dissertation, University of São Paulo. Accessed July 10, 2020. http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;.

MLA Handbook (7th Edition):

Boas, Paulino Ribeiro Villas. “Efeito da amostragem nas propriedades topológicas de redes complexas.” 2008. Web. 10 Jul 2020.

Vancouver:

Boas PRV. Efeito da amostragem nas propriedades topológicas de redes complexas. [Internet] [Doctoral dissertation]. University of São Paulo; 2008. [cited 2020 Jul 10]. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;.

Council of Science Editors:

Boas PRV. Efeito da amostragem nas propriedades topológicas de redes complexas. [Doctoral Dissertation]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-20052011-140835/ ;

25. Soares, Telma Woerle de Lima. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

Problemas de projeto de redes (PPRs) são muito importantes uma vez que envolvem uma série de aplicações em áreas da engenharia e ciências. Para solucionar… (more)

Subjects/Keywords: Algoritmos evolutivos; Data structure; Estutura de dados; Evolutionary algorithms; Graph representations; Networks design; Projeto de redes; Representações de grafos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soares, T. W. d. L. (2009). Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;

Chicago Manual of Style (16th Edition):

Soares, Telma Woerle de Lima. “Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.” 2009. Doctoral Dissertation, University of São Paulo. Accessed July 10, 2020. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;.

MLA Handbook (7th Edition):

Soares, Telma Woerle de Lima. “Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes.” 2009. Web. 10 Jul 2020.

Vancouver:

Soares TWdL. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. [Internet] [Doctoral dissertation]. University of São Paulo; 2009. [cited 2020 Jul 10]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;.

Council of Science Editors:

Soares TWdL. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes. [Doctoral Dissertation]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-28052009-163303/ ;


Durham University

26. Hofton, Antony Edward. Graph layout using subgraph isomorphisms.

Degree: PhD, 2000, Durham University

 Today, graphs are used for many things. In engineering, graphs are used to design circuits in very large scale integration. In computer science, graphs are… (more)

Subjects/Keywords: 005; ANHOF; Call graph; Data flow; Structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hofton, A. E. (2000). Graph layout using subgraph isomorphisms. (Doctoral Dissertation). Durham University. Retrieved from http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781

Chicago Manual of Style (16th Edition):

Hofton, Antony Edward. “Graph layout using subgraph isomorphisms.” 2000. Doctoral Dissertation, Durham University. Accessed July 10, 2020. http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781.

MLA Handbook (7th Edition):

Hofton, Antony Edward. “Graph layout using subgraph isomorphisms.” 2000. Web. 10 Jul 2020.

Vancouver:

Hofton AE. Graph layout using subgraph isomorphisms. [Internet] [Doctoral dissertation]. Durham University; 2000. [cited 2020 Jul 10]. Available from: http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781.

Council of Science Editors:

Hofton AE. Graph layout using subgraph isomorphisms. [Doctoral Dissertation]. Durham University; 2000. Available from: http://etheses.dur.ac.uk/4337/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342781


RMIT University

27. Vu, H. Graph-based human pose estimation using neural networks.

Degree: 2019, RMIT University

 This thesis investigates the problem of human pose estimation (HPE) from unconstrained single two-dimensional (2D) images using Convolutional Neural Networks (CNNs). Recent approaches propose to… (more)

Subjects/Keywords: Fields of Research; human pose estimation; convolutional neural networks; graph structure; conditional random field; structured features

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vu, H. (2019). Graph-based human pose estimation using neural networks. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162746

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):

Vu, H. “Graph-based human pose estimation using neural networks.” 2019. Thesis, RMIT University. Accessed July 10, 2020. http://researchbank.rmit.edu.au/view/rmit:162746.

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

MLA Handbook (7th Edition):

Vu, H. “Graph-based human pose estimation using neural networks.” 2019. Web. 10 Jul 2020.

Vancouver:

Vu H. Graph-based human pose estimation using neural networks. [Internet] [Thesis]. RMIT University; 2019. [cited 2020 Jul 10]. Available from: http://researchbank.rmit.edu.au/view/rmit:162746.

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

Council of Science Editors:

Vu H. Graph-based human pose estimation using neural networks. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162746

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


Brno University of Technology

28. Šolony, Marek. Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework.

Degree: 2020, Brno University of Technology

 Realistic 3D models of the environment are beneficial in many fields, from natural or man-made structure inspection, robotic navigation and map building, to the movie… (more)

Subjects/Keywords: 3D rekonstrukce; více senzrů; optimizace grafu; 3D struktura z pohybu kamery; 3D reconstruction; multisensor; graph optimisation; structure from motion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šolony, M. (2020). Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187298

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):

Šolony, Marek. “Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework.” 2020. Thesis, Brno University of Technology. Accessed July 10, 2020. http://hdl.handle.net/11012/187298.

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

MLA Handbook (7th Edition):

Šolony, Marek. “Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework.” 2020. Web. 10 Jul 2020.

Vancouver:

Šolony M. Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/11012/187298.

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

Council of Science Editors:

Šolony M. Nástroj pro 3D rekonstrukci z dat z více typů senzorů: Scalable Multisensor 3D Reconstruction Framework. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187298

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


Universitat Politècnica de València

29. Aldecoa García, Rodrigo. Detección de comunidades en redes complejas .

Degree: 2013, Universitat Politècnica de València

 El uso de las redes para modelar sistemas complejos es creciente en multitud de ambitos. Son extremadamente utiles para representar interacciones entre genes, relaciones sociales,… (more)

Subjects/Keywords: Redes complejas; Estructura de comunidades; Teoría de grafos; Graph clustering; Complex networks; Community structure; Sistemas complejos; Complex systems; Grafos; Redes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aldecoa García, R. (2013). Detección de comunidades en redes complejas . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/31638

Chicago Manual of Style (16th Edition):

Aldecoa García, Rodrigo. “Detección de comunidades en redes complejas .” 2013. Doctoral Dissertation, Universitat Politècnica de València. Accessed July 10, 2020. http://hdl.handle.net/10251/31638.

MLA Handbook (7th Edition):

Aldecoa García, Rodrigo. “Detección de comunidades en redes complejas .” 2013. Web. 10 Jul 2020.

Vancouver:

Aldecoa García R. Detección de comunidades en redes complejas . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2013. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/10251/31638.

Council of Science Editors:

Aldecoa García R. Detección de comunidades en redes complejas . [Doctoral Dissertation]. Universitat Politècnica de València; 2013. Available from: http://hdl.handle.net/10251/31638

30. Boulos, Rasha. Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires.

Degree: Docteur es, Physique, 2015, Lyon, École normale supérieure

Le programme de réplication d’environ la moitié du génome des mammifères est caractérisé par des U/N-domaines de réplication de l’ordre du méga-base en taille. Ces… (more)

Subjects/Keywords: Génome; Réplication; Timing de réplication; Données Hi-C; Structure; Graphe; Communautés; Mesures de centralité; Genome; Replication; Timing; Hi-C data; Structure; Graph; Communities; Centrality measures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boulos, R. (2015). Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2015ENSL1024

Chicago Manual of Style (16th Edition):

Boulos, Rasha. “Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires.” 2015. Doctoral Dissertation, Lyon, École normale supérieure. Accessed July 10, 2020. http://www.theses.fr/2015ENSL1024.

MLA Handbook (7th Edition):

Boulos, Rasha. “Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires.” 2015. Web. 10 Jul 2020.

Vancouver:

Boulos R. Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2015. [cited 2020 Jul 10]. Available from: http://www.theses.fr/2015ENSL1024.

Council of Science Editors:

Boulos R. Human genome segmentation into structural domains : from chromatin conformation data to nuclear functions : Segmentation du génome humain en domaines structuraux : des données de conformation de la chromatine aux fonctions nucléaires. [Doctoral Dissertation]. Lyon, École normale supérieure; 2015. Available from: http://www.theses.fr/2015ENSL1024

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

.