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

[1] [2]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters

1. Sussman, Daniel Lewis. Foundations of Adjacency Spectral Embedding.

Degree: 2014, Johns Hopkins University

 The eigendecomposition of an adjacency matrix provides a way to embed a graph as points in finite dimensional Euclidean space. This embedding allows the full… (more)

Subjects/Keywords: graph; spectral decomposition; embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sussman, D. L. (2014). Foundations of Adjacency Spectral Embedding. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37075

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

Sussman, Daniel Lewis. “Foundations of Adjacency Spectral Embedding.” 2014. Thesis, Johns Hopkins University. Accessed July 13, 2020. http://jhir.library.jhu.edu/handle/1774.2/37075.

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

MLA Handbook (7th Edition):

Sussman, Daniel Lewis. “Foundations of Adjacency Spectral Embedding.” 2014. Web. 13 Jul 2020.

Vancouver:

Sussman DL. Foundations of Adjacency Spectral Embedding. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2020 Jul 13]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37075.

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

Council of Science Editors:

Sussman DL. Foundations of Adjacency Spectral Embedding. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/37075

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


University of Manitoba

2. MONDAL, DEBAJYOTI. Embedding a Planar Graph on a Given Point Set.

Degree: Computer Science, 2012, University of Manitoba

 A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G,… (more)

Subjects/Keywords: Graph Drawing; Point-Set Embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

MONDAL, D. (2012). Embedding a Planar Graph on a Given Point Set. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/8869

Chicago Manual of Style (16th Edition):

MONDAL, DEBAJYOTI. “Embedding a Planar Graph on a Given Point Set.” 2012. Masters Thesis, University of Manitoba. Accessed July 13, 2020. http://hdl.handle.net/1993/8869.

MLA Handbook (7th Edition):

MONDAL, DEBAJYOTI. “Embedding a Planar Graph on a Given Point Set.” 2012. Web. 13 Jul 2020.

Vancouver:

MONDAL D. Embedding a Planar Graph on a Given Point Set. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/1993/8869.

Council of Science Editors:

MONDAL D. Embedding a Planar Graph on a Given Point Set. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/8869


Penn State University

3. Viswanath, Archana. Enhanced force directed graph embedding algorithms.

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

Graph embedding is a pictorial representation of a graph G(V;E) on a surface, where V is the set of vertices and E is the set… (more)

Subjects/Keywords: graph embedding; graph drawing; force directed method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Viswanath, A. (2008). Enhanced force directed graph embedding algorithms. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8793

Chicago Manual of Style (16th Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Masters Thesis, Penn State University. Accessed July 13, 2020. https://etda.libraries.psu.edu/catalog/8793.

MLA Handbook (7th Edition):

Viswanath, Archana. “Enhanced force directed graph embedding algorithms.” 2008. Web. 13 Jul 2020.

Vancouver:

Viswanath A. Enhanced force directed graph embedding algorithms. [Internet] [Masters thesis]. Penn State University; 2008. [cited 2020 Jul 13]. Available from: https://etda.libraries.psu.edu/catalog/8793.

Council of Science Editors:

Viswanath A. Enhanced force directed graph embedding algorithms. [Masters Thesis]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8793


KTH

4. Wåhlin, Lova. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.

Degree: Mathematical Statistics, 2019, KTH

There are many machine learning techniques that cannot be performed on graph-data. Techniques such as graph embedding, i.e mapping a graph to a vector,… (more)

Subjects/Keywords: IT-Architecture graph; Node Embedding; Graph Embedding; Reinforcement Learning; Machine Learning; IT-Arkitektur; Node Embedding; Graph Embedding; Reinforcement learning; Maskininlärning; Computational Mathematics; Beräkningsmatematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wåhlin, L. (2019). Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213

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

Wåhlin, Lova. “Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.” 2019. Thesis, KTH. Accessed July 13, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213.

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

MLA Handbook (7th Edition):

Wåhlin, Lova. “Towards Machine Learning Enabled Automatic Design of IT-Network Architectures.” 2019. Web. 13 Jul 2020.

Vancouver:

Wåhlin L. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. [Internet] [Thesis]. KTH; 2019. [cited 2020 Jul 13]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213.

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

Council of Science Editors:

Wåhlin L. Towards Machine Learning Enabled Automatic Design of IT-Network Architectures. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249213

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


Penn State University

5. Chatterjee, Anirban. Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery.

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

 Data-driven discovery seeks to obtain a computational model of the underlying process using observed data on a large number of variables. Observations can be viewed… (more)

Subjects/Keywords: sparse graph embedding; sparse graph partitioning; data mining; sparse linear solvers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chatterjee, A. (2011). Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/12026

Chicago Manual of Style (16th Edition):

Chatterjee, Anirban. “Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery.” 2011. Doctoral Dissertation, Penn State University. Accessed July 13, 2020. https://etda.libraries.psu.edu/catalog/12026.

MLA Handbook (7th Edition):

Chatterjee, Anirban. “Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery.” 2011. Web. 13 Jul 2020.

Vancouver:

Chatterjee A. Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery. [Internet] [Doctoral dissertation]. Penn State University; 2011. [cited 2020 Jul 13]. Available from: https://etda.libraries.psu.edu/catalog/12026.

Council of Science Editors:

Chatterjee A. Exploiting Sparsity, Structure, and Geometry for Knowledge Discovery. [Doctoral Dissertation]. Penn State University; 2011. Available from: https://etda.libraries.psu.edu/catalog/12026


Universitat Autònoma de Barcelona

6. Gibert Domingo, Jaume. Vector Space Embedding of Graphs via Statistics of Labelling Information.

Degree: Departament d'Arquitectura de Computadors i Sistemes Operatius, 2012, Universitat Autònoma de Barcelona

 Pattern recognition is the task that aims at distinguishing objects among different classes. When such a task wants to be solved in an automatic way… (more)

Subjects/Keywords: Structural pattern recognition; Graph-based representations; Graph embedding; Tecnologies; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gibert Domingo, J. (2012). Vector Space Embedding of Graphs via Statistics of Labelling Information. (Thesis). Universitat Autònoma de Barcelona. Retrieved from http://hdl.handle.net/10803/96240

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

Gibert Domingo, Jaume. “Vector Space Embedding of Graphs via Statistics of Labelling Information.” 2012. Thesis, Universitat Autònoma de Barcelona. Accessed July 13, 2020. http://hdl.handle.net/10803/96240.

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

MLA Handbook (7th Edition):

Gibert Domingo, Jaume. “Vector Space Embedding of Graphs via Statistics of Labelling Information.” 2012. Web. 13 Jul 2020.

Vancouver:

Gibert Domingo J. Vector Space Embedding of Graphs via Statistics of Labelling Information. [Internet] [Thesis]. Universitat Autònoma de Barcelona; 2012. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/10803/96240.

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

Council of Science Editors:

Gibert Domingo J. Vector Space Embedding of Graphs via Statistics of Labelling Information. [Thesis]. Universitat Autònoma de Barcelona; 2012. Available from: http://hdl.handle.net/10803/96240

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


University of Melbourne

7. Rashidi, Lida. Anomaly detection in large evolving graphs.

Degree: 2017, University of Melbourne

 Anomaly detection plays a vital role in various application domains including network intrusion detection, environmental monitoring and road traffic analysis. However a major challenge in… (more)

Subjects/Keywords: anomaly detection; graph mining; matrix permutation; graph embedding; dynamic graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rashidi, L. (2017). Anomaly detection in large evolving graphs. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/194243

Chicago Manual of Style (16th Edition):

Rashidi, Lida. “Anomaly detection in large evolving graphs.” 2017. Doctoral Dissertation, University of Melbourne. Accessed July 13, 2020. http://hdl.handle.net/11343/194243.

MLA Handbook (7th Edition):

Rashidi, Lida. “Anomaly detection in large evolving graphs.” 2017. Web. 13 Jul 2020.

Vancouver:

Rashidi L. Anomaly detection in large evolving graphs. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/11343/194243.

Council of Science Editors:

Rashidi L. Anomaly detection in large evolving graphs. [Doctoral Dissertation]. University of Melbourne; 2017. Available from: http://hdl.handle.net/11343/194243

8. Klein, Karsten. Interactive graph drawing with constraints.

Degree: 2011, Technische Universität Dortmund

 In zahlreichen Anwendungsgebieten werden Informationen als Graphen modelliert und mithilfe dieser Graphen visualisiert. Eine übersichtliche Darstellung hilft bei der Analyse und unterstützt das Verständnis bei… (more)

Subjects/Keywords: Clustered planarity; Drawing constraints; Embedding constraints; Graph drawing applications; Graph embedding; Interactive graph drawing; Planarity; Planarization; Scaffold Hunter; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klein, K. (2011). Interactive graph drawing with constraints. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27669

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

Klein, Karsten. “Interactive graph drawing with constraints.” 2011. Thesis, Technische Universität Dortmund. Accessed July 13, 2020. http://hdl.handle.net/2003/27669.

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

MLA Handbook (7th Edition):

Klein, Karsten. “Interactive graph drawing with constraints.” 2011. Web. 13 Jul 2020.

Vancouver:

Klein K. Interactive graph drawing with constraints. [Internet] [Thesis]. Technische Universität Dortmund; 2011. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/2003/27669.

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

Council of Science Editors:

Klein K. Interactive graph drawing with constraints. [Thesis]. Technische Universität Dortmund; 2011. Available from: http://hdl.handle.net/2003/27669

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


Washington University in St. Louis

9. Zhang, Zhen. Kernel Methods for Graph-structured Data Analysis.

Degree: PhD, Electrical & Systems Engineering, 2019, Washington University in St. Louis

 Structured data modeled as graphs arise in many application domains, such as computer vision, bioinformatics, and sociology. In this dissertation, we focus on three important… (more)

Subjects/Keywords: graph embedding; graph kernels; graph matching; kernel methods; network science; Electrical and Electronics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Z. (2019). Kernel Methods for Graph-structured Data Analysis. (Doctoral Dissertation). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/eng_etds/505

Chicago Manual of Style (16th Edition):

Zhang, Zhen. “Kernel Methods for Graph-structured Data Analysis.” 2019. Doctoral Dissertation, Washington University in St. Louis. Accessed July 13, 2020. https://openscholarship.wustl.edu/eng_etds/505.

MLA Handbook (7th Edition):

Zhang, Zhen. “Kernel Methods for Graph-structured Data Analysis.” 2019. Web. 13 Jul 2020.

Vancouver:

Zhang Z. Kernel Methods for Graph-structured Data Analysis. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2019. [cited 2020 Jul 13]. Available from: https://openscholarship.wustl.edu/eng_etds/505.

Council of Science Editors:

Zhang Z. Kernel Methods for Graph-structured Data Analysis. [Doctoral Dissertation]. Washington University in St. Louis; 2019. Available from: https://openscholarship.wustl.edu/eng_etds/505

10. Goretskyy, Maxim. Embedding of Rigid Graphs in Grids .

Degree: Chalmers tekniska högskola / Institutionen för data och informationsvetenskap, 2019, Chalmers University of Technology

This thesis concerns the problem of finding a unit embedding of a graph in a square grid. We introduce the concept of a rigid graph, which is a graph with a unique unit embedding. We present a few polynomial algorithms for embedding large rigid subgraphs of an arbitrary graph.

Subjects/Keywords: Computer; science; factory layout; grid embedding; unit embedding; graph; theory; rigid; graphs; grid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goretskyy, M. (2019). Embedding of Rigid Graphs in Grids . (Thesis). Chalmers University of Technology. Retrieved from http://hdl.handle.net/20.500.12380/300045

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

Goretskyy, Maxim. “Embedding of Rigid Graphs in Grids .” 2019. Thesis, Chalmers University of Technology. Accessed July 13, 2020. http://hdl.handle.net/20.500.12380/300045.

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

MLA Handbook (7th Edition):

Goretskyy, Maxim. “Embedding of Rigid Graphs in Grids .” 2019. Web. 13 Jul 2020.

Vancouver:

Goretskyy M. Embedding of Rigid Graphs in Grids . [Internet] [Thesis]. Chalmers University of Technology; 2019. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/20.500.12380/300045.

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

Council of Science Editors:

Goretskyy M. Embedding of Rigid Graphs in Grids . [Thesis]. Chalmers University of Technology; 2019. Available from: http://hdl.handle.net/20.500.12380/300045

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


Clemson University

11. Sybrandt, Justin George. Exploiting Latent Features of Text and Graphs.

Degree: PhD, School of Computing, 2020, Clemson University

  As the size and scope of online data continues to grow, new machine learning techniques become necessary to best capitalize on the wealth of… (more)

Subjects/Keywords: Conditional Text Generation; Graph Embedding; Hypergraph Partitioning; Hypothesis Generation; Literature-based Discovery; Text Embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sybrandt, J. G. (2020). Exploiting Latent Features of Text and Graphs. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2592

Chicago Manual of Style (16th Edition):

Sybrandt, Justin George. “Exploiting Latent Features of Text and Graphs.” 2020. Doctoral Dissertation, Clemson University. Accessed July 13, 2020. https://tigerprints.clemson.edu/all_dissertations/2592.

MLA Handbook (7th Edition):

Sybrandt, Justin George. “Exploiting Latent Features of Text and Graphs.” 2020. Web. 13 Jul 2020.

Vancouver:

Sybrandt JG. Exploiting Latent Features of Text and Graphs. [Internet] [Doctoral dissertation]. Clemson University; 2020. [cited 2020 Jul 13]. Available from: https://tigerprints.clemson.edu/all_dissertations/2592.

Council of Science Editors:

Sybrandt JG. Exploiting Latent Features of Text and Graphs. [Doctoral Dissertation]. Clemson University; 2020. Available from: https://tigerprints.clemson.edu/all_dissertations/2592


University of Cincinnati

12. Fang, Chunsheng. Novel Frameworks for Mining Heterogeneous and Dynamic Networks.

Degree: PhD, Engineering and Applied Science: Computer Science and Engineering, 2011, University of Cincinnati

 Graphs serve as an important tool for discrete data representation. Recently, graph representations have made possible very powerful machine learning algorithms, such as manifold learning,… (more)

Subjects/Keywords: Computer Science; machine learning; social network; data mining; manifold learning; graph embedding; dynamic graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fang, C. (2011). Novel Frameworks for Mining Heterogeneous and Dynamic Networks. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1321369978

Chicago Manual of Style (16th Edition):

Fang, Chunsheng. “Novel Frameworks for Mining Heterogeneous and Dynamic Networks.” 2011. Doctoral Dissertation, University of Cincinnati. Accessed July 13, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1321369978.

MLA Handbook (7th Edition):

Fang, Chunsheng. “Novel Frameworks for Mining Heterogeneous and Dynamic Networks.” 2011. Web. 13 Jul 2020.

Vancouver:

Fang C. Novel Frameworks for Mining Heterogeneous and Dynamic Networks. [Internet] [Doctoral dissertation]. University of Cincinnati; 2011. [cited 2020 Jul 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1321369978.

Council of Science Editors:

Fang C. Novel Frameworks for Mining Heterogeneous and Dynamic Networks. [Doctoral Dissertation]. University of Cincinnati; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1321369978


Rochester Institute of Technology

13. Doster, Timothy J. Mathematical methods for anomaly grouping in hyperspectral images.

Degree: School of Mathematical Sciences (COS), 2009, Rochester Institute of Technology

 The topological anomaly detection (TAD) algorithm differs from other anomaly detection algorithms in that it does not rely on the data's being normally distributed. We… (more)

Subjects/Keywords: Anomaly detection; Graph theory; Hyperspectral; Local linear embedding; Topological anomaly detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doster, T. J. (2009). Mathematical methods for anomaly grouping in hyperspectral images. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/4990

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

Doster, Timothy J. “Mathematical methods for anomaly grouping in hyperspectral images.” 2009. Thesis, Rochester Institute of Technology. Accessed July 13, 2020. https://scholarworks.rit.edu/theses/4990.

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

MLA Handbook (7th Edition):

Doster, Timothy J. “Mathematical methods for anomaly grouping in hyperspectral images.” 2009. Web. 13 Jul 2020.

Vancouver:

Doster TJ. Mathematical methods for anomaly grouping in hyperspectral images. [Internet] [Thesis]. Rochester Institute of Technology; 2009. [cited 2020 Jul 13]. Available from: https://scholarworks.rit.edu/theses/4990.

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

Council of Science Editors:

Doster TJ. Mathematical methods for anomaly grouping in hyperspectral images. [Thesis]. Rochester Institute of Technology; 2009. Available from: https://scholarworks.rit.edu/theses/4990

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


University of Alberta

14. 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 July 13, 2020. https://era.library.ualberta.ca/files/st74cs84d.

MLA Handbook (7th Edition):

Rayner, David Christopher Ferguson. “Optimization for Heuristic Search.” 2014. Web. 13 Jul 2020.

Vancouver:

Rayner DCF. Optimization for Heuristic Search. [Internet] [Doctoral dissertation]. University of Alberta; 2014. [cited 2020 Jul 13]. 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


Delft University of Technology

15. Hovanesyan, Arthur (author). Late payment prediction of invoices through graph features.

Degree: 2019, Delft University of Technology

Keeping a steady cash flow is one of the biggest if not the biggest problem that Small to Medium Enterprises (SMEs) deal with daily. Within… (more)

Subjects/Keywords: Machine Learning; Feature Engineering; Graph Embedding; Entity Resolution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hovanesyan, A. (. (2019). Late payment prediction of invoices through graph features. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:1b482e0f-6e06-465a-8f7d-ec680d80ac0b

Chicago Manual of Style (16th Edition):

Hovanesyan, Arthur (author). “Late payment prediction of invoices through graph features.” 2019. Masters Thesis, Delft University of Technology. Accessed July 13, 2020. http://resolver.tudelft.nl/uuid:1b482e0f-6e06-465a-8f7d-ec680d80ac0b.

MLA Handbook (7th Edition):

Hovanesyan, Arthur (author). “Late payment prediction of invoices through graph features.” 2019. Web. 13 Jul 2020.

Vancouver:

Hovanesyan A(. Late payment prediction of invoices through graph features. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Jul 13]. Available from: http://resolver.tudelft.nl/uuid:1b482e0f-6e06-465a-8f7d-ec680d80ac0b.

Council of Science Editors:

Hovanesyan A(. Late payment prediction of invoices through graph features. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:1b482e0f-6e06-465a-8f7d-ec680d80ac0b


University of Louisville

16. Liu, Wenqi. Cognitive satellite communications and representation learning for streaming and complex graphs.

Degree: PhD, 2019, University of Louisville

  This dissertation includes two topics. The first topic studies a promising dynamic spectrum access algorithm (DSA) that improves the throughput of satellite communication (SATCOM)… (more)

Subjects/Keywords: Representation learning; real-time graph embedding; dynamic spectrum access; knowledge graph; distributed graph process; Digital Communications and Networking; Systems and Communications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, W. (2019). Cognitive satellite communications and representation learning for streaming and complex graphs. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/3272 ; https://ir.library.louisville.edu/etd/3272

Chicago Manual of Style (16th Edition):

Liu, Wenqi. “Cognitive satellite communications and representation learning for streaming and complex graphs.” 2019. Doctoral Dissertation, University of Louisville. Accessed July 13, 2020. 10.18297/etd/3272 ; https://ir.library.louisville.edu/etd/3272.

MLA Handbook (7th Edition):

Liu, Wenqi. “Cognitive satellite communications and representation learning for streaming and complex graphs.” 2019. Web. 13 Jul 2020.

Vancouver:

Liu W. Cognitive satellite communications and representation learning for streaming and complex graphs. [Internet] [Doctoral dissertation]. University of Louisville; 2019. [cited 2020 Jul 13]. Available from: 10.18297/etd/3272 ; https://ir.library.louisville.edu/etd/3272.

Council of Science Editors:

Liu W. Cognitive satellite communications and representation learning for streaming and complex graphs. [Doctoral Dissertation]. University of Louisville; 2019. Available from: 10.18297/etd/3272 ; https://ir.library.louisville.edu/etd/3272


The Ohio State University

17. Sun, Jiankai. Directed Graph Analysis: Algorithms and Applications.

Degree: PhD, Computer Science and Engineering, 2019, The Ohio State University

 Taxonomy graphs that capture hyponymy or meronymy relationships through directed edges are expected to be acyclic. However, in practice, they may have thousands of cycles,… (more)

Subjects/Keywords: Computer Engineering; Computer Science; graph embedding; graph hierarchy; asymmetric transitivity; question routing; expert finding; cold-start; breaking cycles; directed acyclic graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, J. (2019). Directed Graph Analysis: Algorithms and Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422

Chicago Manual of Style (16th Edition):

Sun, Jiankai. “Directed Graph Analysis: Algorithms and Applications.” 2019. Doctoral Dissertation, The Ohio State University. Accessed July 13, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422.

MLA Handbook (7th Edition):

Sun, Jiankai. “Directed Graph Analysis: Algorithms and Applications.” 2019. Web. 13 Jul 2020.

Vancouver:

Sun J. Directed Graph Analysis: Algorithms and Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2019. [cited 2020 Jul 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422.

Council of Science Editors:

Sun J. Directed Graph Analysis: Algorithms and Applications. [Doctoral Dissertation]. The Ohio State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1565797455907422


University of Minnesota

18. Baingana, Brian. Embedding graphs under centrality constraints.

Degree: MS, Electrical/Computer Engineering, 2013, University of Minnesota

University of Minnesota M.S. thesis. May 2013. Major: Electrical/Computer Engineering. Advisor: Professor: Georgios B. Giannakis. 1 computer file (PDF); v, 46 pages, appendices A-B.

Visual… (more)

Subjects/Keywords: Coordinate descent; Graph embedding; Manifold learning; Multi-dimensional scaling; Network centrality; Network visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baingana, B. (2013). Embedding graphs under centrality constraints. (Masters Thesis). University of Minnesota. Retrieved from http://purl.umn.edu/157291

Chicago Manual of Style (16th Edition):

Baingana, Brian. “Embedding graphs under centrality constraints.” 2013. Masters Thesis, University of Minnesota. Accessed July 13, 2020. http://purl.umn.edu/157291.

MLA Handbook (7th Edition):

Baingana, Brian. “Embedding graphs under centrality constraints.” 2013. Web. 13 Jul 2020.

Vancouver:

Baingana B. Embedding graphs under centrality constraints. [Internet] [Masters thesis]. University of Minnesota; 2013. [cited 2020 Jul 13]. Available from: http://purl.umn.edu/157291.

Council of Science Editors:

Baingana B. Embedding graphs under centrality constraints. [Masters Thesis]. University of Minnesota; 2013. Available from: http://purl.umn.edu/157291


University of Guelph

19. Lee, Colin R. On Diffusion Character Matrices .

Degree: 2014, University of Guelph

 Graphs or networks are ubiquitous and useful mathematical objects, but comparing graphs can be computationally expensive and problematic for certain applications. This thesis introduces diffusion… (more)

Subjects/Keywords: graph theory; pseudometrics; diffusion character matrices; pseudometric embedding; combinatorial graphs; evolutionary computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, C. R. (2014). On Diffusion Character Matrices . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8326

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

Lee, Colin R. “On Diffusion Character Matrices .” 2014. Thesis, University of Guelph. Accessed July 13, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8326.

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

MLA Handbook (7th Edition):

Lee, Colin R. “On Diffusion Character Matrices .” 2014. Web. 13 Jul 2020.

Vancouver:

Lee CR. On Diffusion Character Matrices . [Internet] [Thesis]. University of Guelph; 2014. [cited 2020 Jul 13]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8326.

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

Council of Science Editors:

Lee CR. On Diffusion Character Matrices . [Thesis]. University of Guelph; 2014. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/8326

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


University of Minnesota

20. Baingana, Brian. Embedding graphs under centrality constraints.

Degree: MS, Electrical/Computer Engineering, 2013, University of Minnesota

 Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications… (more)

Subjects/Keywords: Coordinate descent; Graph embedding; Manifold learning; Multi-dimensional scaling; Network centrality; Network visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baingana, B. (2013). Embedding graphs under centrality constraints. (Masters Thesis). University of Minnesota. Retrieved from http://purl.umn.edu/157291

Chicago Manual of Style (16th Edition):

Baingana, Brian. “Embedding graphs under centrality constraints.” 2013. Masters Thesis, University of Minnesota. Accessed July 13, 2020. http://purl.umn.edu/157291.

MLA Handbook (7th Edition):

Baingana, Brian. “Embedding graphs under centrality constraints.” 2013. Web. 13 Jul 2020.

Vancouver:

Baingana B. Embedding graphs under centrality constraints. [Internet] [Masters thesis]. University of Minnesota; 2013. [cited 2020 Jul 13]. Available from: http://purl.umn.edu/157291.

Council of Science Editors:

Baingana B. Embedding graphs under centrality constraints. [Masters Thesis]. University of Minnesota; 2013. Available from: http://purl.umn.edu/157291


University of Windsor

21. Fatima, Nazia. iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps.

Degree: MS, Computer Science, 2019, University of Windsor

 Deep learning models are currently applied in diverse domains, including image recognition, text generation, and event prediction. With the advent of new high-throughput sequencing technologies,… (more)

Subjects/Keywords: convolutional neural networks; Gene similarity networks; graph embedding; multi-omics; representation learning; self-organizing maps

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fatima, N. (2019). iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7807

Chicago Manual of Style (16th Edition):

Fatima, Nazia. “iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps.” 2019. Masters Thesis, University of Windsor. Accessed July 13, 2020. https://scholar.uwindsor.ca/etd/7807.

MLA Handbook (7th Edition):

Fatima, Nazia. “iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps.” 2019. Web. 13 Jul 2020.

Vancouver:

Fatima N. iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps. [Internet] [Masters thesis]. University of Windsor; 2019. [cited 2020 Jul 13]. Available from: https://scholar.uwindsor.ca/etd/7807.

Council of Science Editors:

Fatima N. iSOM-GSN: An Integrative Approach for Transforming Multi-omic Data into Gene Similarity Networks via Self-organizing Maps. [Masters Thesis]. University of Windsor; 2019. Available from: https://scholar.uwindsor.ca/etd/7807

22. 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 13, 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. 13 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 13]. 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


The Ohio State University

23. Liang, Jiongqian. Human-in-the-loop Machine Learning: Algorithms and Applications.

Degree: PhD, Computer Science and Engineering, 2018, The Ohio State University

 Machine learning is the process of learning meaningful patterns and extracting useful knowledge from data using computational and statistical techniques. While the overall goal is… (more)

Subjects/Keywords: Computer Science; machine learning; human-in-the-loop; human guidance; outlier detection; graph mining; graph embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liang, J. (2018). Human-in-the-loop Machine Learning: Algorithms and Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1523988406039076

Chicago Manual of Style (16th Edition):

Liang, Jiongqian. “Human-in-the-loop Machine Learning: Algorithms and Applications.” 2018. Doctoral Dissertation, The Ohio State University. Accessed July 13, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1523988406039076.

MLA Handbook (7th Edition):

Liang, Jiongqian. “Human-in-the-loop Machine Learning: Algorithms and Applications.” 2018. Web. 13 Jul 2020.

Vancouver:

Liang J. Human-in-the-loop Machine Learning: Algorithms and Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2020 Jul 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1523988406039076.

Council of Science Editors:

Liang J. Human-in-the-loop Machine Learning: Algorithms and Applications. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1523988406039076

24. Schroeder, Justin Zane. Hamilton cycle embeddings of complete tripartite graphs and their applications.

Degree: PhD, Mathematics, 2012, Vanderbilt University

 A central problem in topological graph theory is determining the (orientable or nonorientable) genus of a given graph <i>G</i>. For a general graph <i>G</i>, this… (more)

Subjects/Keywords: covering triangulation; graph genus; graph embedding

…nonorientable surface is +1 or −1, respectively. An embedding of a graph G, denoted G → Σ, consists of… …An embedding of K5 on the projective plane. For more background on topological graph theory… …faces determines an embedding of a graph in a surface if the rotation graph around each vertex… …embedding of a graph G, possibly with loops and parallel edges, in some orientable surface Σ… …x28;G → Σ, α) we obtain an embedding of the derived graph Gα in the surface Σα as… 

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

Schroeder, J. Z. (2012). Hamilton cycle embeddings of complete tripartite graphs and their applications. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-03202012-170814/ ;

Chicago Manual of Style (16th Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed July 13, 2020. http://etd.library.vanderbilt.edu/available/etd-03202012-170814/ ;.

MLA Handbook (7th Edition):

Schroeder, Justin Zane. “Hamilton cycle embeddings of complete tripartite graphs and their applications.” 2012. Web. 13 Jul 2020.

Vancouver:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2020 Jul 13]. Available from: http://etd.library.vanderbilt.edu/available/etd-03202012-170814/ ;.

Council of Science Editors:

Schroeder JZ. Hamilton cycle embeddings of complete tripartite graphs and their applications. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://etd.library.vanderbilt.edu/available/etd-03202012-170814/ ;

25. Simonovsky, Martin. Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués.

Degree: Docteur es, Signal, Image, Automatique, 2018, Université Paris-Est

Le graphe est un concept puissant pour la représentation des relations entre des paires d'entités. Les données ayant une structure de graphes sous-jacente peuvent être… (more)

Subjects/Keywords: Apprentissage profond; Convolution sur de graphes; Plongement de graphes; Génération de graphes; Segmentation des nuage de points; Deep learning; Graph convolutions; Graph embedding; Graph generation; Point cloud segmentation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simonovsky, M. (2018). Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2018PESC1133

Chicago Manual of Style (16th Edition):

Simonovsky, Martin. “Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués.” 2018. Doctoral Dissertation, Université Paris-Est. Accessed July 13, 2020. http://www.theses.fr/2018PESC1133.

MLA Handbook (7th Edition):

Simonovsky, Martin. “Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués.” 2018. Web. 13 Jul 2020.

Vancouver:

Simonovsky M. Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués. [Internet] [Doctoral dissertation]. Université Paris-Est; 2018. [cited 2020 Jul 13]. Available from: http://www.theses.fr/2018PESC1133.

Council of Science Editors:

Simonovsky M. Deep learning on attributed graphs : L'apprentissage profond sur graphes attribués. [Doctoral Dissertation]. Université Paris-Est; 2018. Available from: http://www.theses.fr/2018PESC1133

26. Gutwenger, Carsten. Application of SPQR-trees in the planarization approach for drawing graphs.

Degree: 2010, Technische Universität Dortmund

Subjects/Keywords: Crossing minimization; Embedding constraints; Graph embedding; Planarity; Planarization; SPQR-tree; Triconnected components; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gutwenger, C. (2010). Application of SPQR-trees in the planarization approach for drawing graphs. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27430

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

Gutwenger, Carsten. “Application of SPQR-trees in the planarization approach for drawing graphs.” 2010. Thesis, Technische Universität Dortmund. Accessed July 13, 2020. http://hdl.handle.net/2003/27430.

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

MLA Handbook (7th Edition):

Gutwenger, Carsten. “Application of SPQR-trees in the planarization approach for drawing graphs.” 2010. Web. 13 Jul 2020.

Vancouver:

Gutwenger C. Application of SPQR-trees in the planarization approach for drawing graphs. [Internet] [Thesis]. Technische Universität Dortmund; 2010. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/2003/27430.

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

Council of Science Editors:

Gutwenger C. Application of SPQR-trees in the planarization approach for drawing graphs. [Thesis]. Technische Universität Dortmund; 2010. Available from: http://hdl.handle.net/2003/27430

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


Penn State University

27. Wang, Hongjian. Ubran Computing with Mobility Data: a Unified Approach.

Degree: 2018, Penn State University

 With the advent of the information age, various types of data are collected in thecontext of urban spaces, including taxi pickups/drop-offs, tweets from users, airquality… (more)

Subjects/Keywords: urban computing; graph embedding; data mining; mobility data; spatial non-stationary; geographically weighted regression; reinforcement learning; MCMC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2018). Ubran Computing with Mobility Data: a Unified Approach. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/15253hxw186

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

Wang, Hongjian. “Ubran Computing with Mobility Data: a Unified Approach.” 2018. Thesis, Penn State University. Accessed July 13, 2020. https://etda.libraries.psu.edu/catalog/15253hxw186.

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

MLA Handbook (7th Edition):

Wang, Hongjian. “Ubran Computing with Mobility Data: a Unified Approach.” 2018. Web. 13 Jul 2020.

Vancouver:

Wang H. Ubran Computing with Mobility Data: a Unified Approach. [Internet] [Thesis]. Penn State University; 2018. [cited 2020 Jul 13]. Available from: https://etda.libraries.psu.edu/catalog/15253hxw186.

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

Council of Science Editors:

Wang H. Ubran Computing with Mobility Data: a Unified Approach. [Thesis]. Penn State University; 2018. Available from: https://etda.libraries.psu.edu/catalog/15253hxw186

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


Université de Bordeaux I

28. Cassagnes, Cyril. Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet.

Degree: Docteur es, Informatique, 2012, Université de Bordeaux I

Les schémas de routage locaux basés sur des coordonnées prises dans le plan hyperbolique ont attiré un intérêt croissant depuis quelques années. Cependant, les solutions… (more)

Subjects/Keywords: Graphe Dynamique; Plongement Glouton; Pair-à-Pair; P2ptv; Dynamic Graph; Greedy Embedding; Peer-To-Peer; P2ptv

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cassagnes, C. (2012). Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2012BOR14600

Chicago Manual of Style (16th Edition):

Cassagnes, Cyril. “Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet.” 2012. Doctoral Dissertation, Université de Bordeaux I. Accessed July 13, 2020. http://www.theses.fr/2012BOR14600.

MLA Handbook (7th Edition):

Cassagnes, Cyril. “Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet.” 2012. Web. 13 Jul 2020.

Vancouver:

Cassagnes C. Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2012. [cited 2020 Jul 13]. Available from: http://www.theses.fr/2012BOR14600.

Council of Science Editors:

Cassagnes C. Architecture autonome et distribuée d’adressage et de routage pour la flexibilité des communications dans l’internet : Autonomous and distributed architecture for addressing and routing to improve the flexibility of communications in internet. [Doctoral Dissertation]. Université de Bordeaux I; 2012. Available from: http://www.theses.fr/2012BOR14600


University of Waterloo

29. Pei, Martin. List colouring hypergraphs and extremal results for acyclic graphs.

Degree: 2008, University of Waterloo

 We study several extremal problems in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of… (more)

Subjects/Keywords: graphs; hypergraphs; extremal graph theory; list colouring; tree embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pei, M. (2008). List colouring hypergraphs and extremal results for acyclic graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3715

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

Pei, Martin. “List colouring hypergraphs and extremal results for acyclic graphs.” 2008. Thesis, University of Waterloo. Accessed July 13, 2020. http://hdl.handle.net/10012/3715.

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

MLA Handbook (7th Edition):

Pei, Martin. “List colouring hypergraphs and extremal results for acyclic graphs.” 2008. Web. 13 Jul 2020.

Vancouver:

Pei M. List colouring hypergraphs and extremal results for acyclic graphs. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/10012/3715.

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

Council of Science Editors:

Pei M. List colouring hypergraphs and extremal results for acyclic graphs. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3715

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

30. Chen, Xiaofeng. Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements.

Degree: PhD, Mathematics, 2017, Virginia Tech

 Maps have been extensively studied and are important in many research fields. A map is a 2-cell embedding of a graph on an orientable surface.… (more)

Subjects/Keywords: Plane Permutation; Map; Graph Embedding; Genome Rearrangement

…a 1 !a2 ! . . . an ! . Graph embeddings, maps and fatgraphs Graph embedding is one of… …embedding of a given graph G on a closed surface of genus g, Sg , is an embedding on Sg such that… …use the terms graph embedding or map, depending on the specific topics they are working on… …graph embedding and surface. The minimum (resp. the maximum) genus g such that there… …changes if we reembed a vertex in a given graph embedding, i.e., rearrange the half-edges around… 

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

Chen, X. (2017). Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77535

Chicago Manual of Style (16th Edition):

Chen, Xiaofeng. “Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements.” 2017. Doctoral Dissertation, Virginia Tech. Accessed July 13, 2020. http://hdl.handle.net/10919/77535.

MLA Handbook (7th Edition):

Chen, Xiaofeng. “Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements.” 2017. Web. 13 Jul 2020.

Vancouver:

Chen X. Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements. [Internet] [Doctoral dissertation]. Virginia Tech; 2017. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/10919/77535.

Council of Science Editors:

Chen X. Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements. [Doctoral Dissertation]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/77535

[1] [2]

.