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 distances). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Washington State University

1. [No author]. Feature extraction from network data .

Degree: 2019, Washington State University

 This work explores different approaches to feature extraction from network data. The first part focuses on Boolean networks, a simplistic discrete dynamical system built over… (more)

Subjects/Keywords: Applied mathematics; anomaly detection; Boolean networks; computational geometry; graph matching; Gromov–Hausdorff distances; shape analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2019). Feature extraction from network data . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/17893

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

author], [No. “Feature extraction from network data .” 2019. Thesis, Washington State University. Accessed January 19, 2021. http://hdl.handle.net/2376/17893.

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

MLA Handbook (7th Edition):

author], [No. “Feature extraction from network data .” 2019. Web. 19 Jan 2021.

Vancouver:

author] [. Feature extraction from network data . [Internet] [Thesis]. Washington State University; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/2376/17893.

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

Council of Science Editors:

author] [. Feature extraction from network data . [Thesis]. Washington State University; 2019. Available from: http://hdl.handle.net/2376/17893

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


University of Colorado

2. Monnig, Nathan D. From Nonlinear Embedding to Graph Distances: A Spectral Perspective.

Degree: PhD, Applied Mathematics, 2015, University of Colorado

  In this thesis, we explore applications of spectral graph theory to the analysis of complex datasets and networks. We consider spectral embeddings of general… (more)

Subjects/Keywords: effective resistance; graph distances; graph theory; nonlinear dimension reduction; radial basis functions; spectral algorithms; Numerical Analysis and Computation; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monnig, N. D. (2015). From Nonlinear Embedding to Graph Distances: A Spectral Perspective. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/64

Chicago Manual of Style (16th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Doctoral Dissertation, University of Colorado. Accessed January 19, 2021. https://scholar.colorado.edu/appm_gradetds/64.

MLA Handbook (7th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Web. 19 Jan 2021.

Vancouver:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2021 Jan 19]. Available from: https://scholar.colorado.edu/appm_gradetds/64.

Council of Science Editors:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/appm_gradetds/64


Universiteit Utrecht

3. Koutsoumpas, I. Intrinsic mesh matching for near-isometric deformations using double-order affinities.

Degree: 2015, Universiteit Utrecht

 Shape matching is among the most basic research fields in digital geometry processing, with applications ranging from industrial design to three-dimensional medical image analysis. Our… (more)

Subjects/Keywords: differential geometry; shape matching; TOSCA dataset; geodesic distances; isometric deformation; shape analysis; nonrigid shape deformation; graph matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koutsoumpas, I. (2015). Intrinsic mesh matching for near-isometric deformations using double-order affinities. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/311174

Chicago Manual of Style (16th Edition):

Koutsoumpas, I. “Intrinsic mesh matching for near-isometric deformations using double-order affinities.” 2015. Masters Thesis, Universiteit Utrecht. Accessed January 19, 2021. http://dspace.library.uu.nl:8080/handle/1874/311174.

MLA Handbook (7th Edition):

Koutsoumpas, I. “Intrinsic mesh matching for near-isometric deformations using double-order affinities.” 2015. Web. 19 Jan 2021.

Vancouver:

Koutsoumpas I. Intrinsic mesh matching for near-isometric deformations using double-order affinities. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Jan 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/311174.

Council of Science Editors:

Koutsoumpas I. Intrinsic mesh matching for near-isometric deformations using double-order affinities. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/311174

4. Bellitto, Thomas. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.

Degree: Docteur es, Informatique, 2018, Bordeaux

Cette thèse étudie les aspects combinatoires, algorithmiques et la complexité de problèmes de théorie des graphes, et tout spécialement de problèmes liés aux notions de… (more)

Subjects/Keywords: Graphes; Marches; Transitions interdites; Homomorphismes de graphes; Nombre de stabilité; Distances géometriques; Ensemble évitant la distance 1; NP-complétude; Graphs; Walks; Forbidden transitions; Graph homomorphisms; Independence number; Geometric distances; Sets avoiding distance 1; NP-completeness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bellitto, T. (2018). Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2018BORD0124

Chicago Manual of Style (16th Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Doctoral Dissertation, Bordeaux. Accessed January 19, 2021. http://www.theses.fr/2018BORD0124.

MLA Handbook (7th Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Web. 19 Jan 2021.

Vancouver:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Internet] [Doctoral dissertation]. Bordeaux; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018BORD0124.

Council of Science Editors:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Doctoral Dissertation]. Bordeaux; 2018. Available from: http://www.theses.fr/2018BORD0124

5. Ferdjoukh, Adel. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.

Degree: Docteur es, Informatique, 2016, Montpellier

Disposer de données dans le but de valider ou tester une approche ou un concept est d'une importance primordiale dans beaucoup de domaines différents. Malheureusement,… (more)

Subjects/Keywords: Méta-Modèles; Génération de Modèles; Contraintes CSP; Lois de probabilités usuelles; Distances de graphe; Meta-Models; Model Generation; Constraint Programming; Probability distribution; Graph distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferdjoukh, A. (2016). Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2016MONTT325

Chicago Manual of Style (16th Edition):

Ferdjoukh, Adel. “Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.” 2016. Doctoral Dissertation, Montpellier. Accessed January 19, 2021. http://www.theses.fr/2016MONTT325.

MLA Handbook (7th Edition):

Ferdjoukh, Adel. “Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.” 2016. Web. 19 Jan 2021.

Vancouver:

Ferdjoukh A. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. [Internet] [Doctoral dissertation]. Montpellier; 2016. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2016MONTT325.

Council of Science Editors:

Ferdjoukh A. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. [Doctoral Dissertation]. Montpellier; 2016. Available from: http://www.theses.fr/2016MONTT325


Kent State University

6. Harbart, Robert Allan. Addressing and Distances for Cellular Networks with Holes.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2009, Kent State University

 There is still much research in the areas of routing and location updates in cellular communication networks. Given the limited amount of memory and power… (more)

Subjects/Keywords: Computer Science; communication; network; graph; routing; addressing; distances; shortest; path; hexagonal; triangular

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harbart, R. A. (2009). Addressing and Distances for Cellular Networks with Holes. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485

Chicago Manual of Style (16th Edition):

Harbart, Robert Allan. “Addressing and Distances for Cellular Networks with Holes.” 2009. Masters Thesis, Kent State University. Accessed January 19, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.

MLA Handbook (7th Edition):

Harbart, Robert Allan. “Addressing and Distances for Cellular Networks with Holes.” 2009. Web. 19 Jan 2021.

Vancouver:

Harbart RA. Addressing and Distances for Cellular Networks with Holes. [Internet] [Masters thesis]. Kent State University; 2009. [cited 2021 Jan 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.

Council of Science Editors:

Harbart RA. Addressing and Distances for Cellular Networks with Holes. [Masters Thesis]. Kent State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485

7. Planche, Léo. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.

Degree: Docteur es, Mathématiques informatique, 2018, Sorbonne Paris Cité

En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes… (more)

Subjects/Keywords: Théorie des graphes; Cycle isométrique; Excentricité; Plus court chemin; Domination; Graphe de reads; Label de distances; Laminaire; Graph theory; Isometric cycle; Eccentricity; Shortest path; Domination; Read graphs; Distance labeling; Laminarity; 511.5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Planche, L. (2018). Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2018USPCB224

Chicago Manual of Style (16th Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.” 2018. Doctoral Dissertation, Sorbonne Paris Cité. Accessed January 19, 2021. http://www.theses.fr/2018USPCB224.

MLA Handbook (7th Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.” 2018. Web. 19 Jan 2021.

Vancouver:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018USPCB224.

Council of Science Editors:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. [Doctoral Dissertation]. Sorbonne Paris Cité; 2018. Available from: http://www.theses.fr/2018USPCB224


Georgia Tech

8. Das Sarma, Atish. Algorithms for large graphs.

Degree: PhD, Computing, 2010, Georgia Tech

Subjects/Keywords: Random walks; Distances; Distributed computing; Graphs; PageRank; Distributed algorithms; Online algorithms; Streaming algorithms; Algorithms; Electronic data processing Distributed processing; Parallel algorithms; Graph algorithms; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das Sarma, A. (2010). Algorithms for large graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34709

Chicago Manual of Style (16th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 19, 2021. http://hdl.handle.net/1853/34709.

MLA Handbook (7th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Web. 19 Jan 2021.

Vancouver:

Das Sarma A. Algorithms for large graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1853/34709.

Council of Science Editors:

Das Sarma A. Algorithms for large graphs. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34709

9. Van Langelaar, C.M. (author). Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.

Degree: 2011, Delft University of Technology

 We all have walked on a street when suddenly someone comes over to you asking for directions. Sometimes, people do not know where they are… (more)

Subjects/Keywords: urban environment; historic; city centre; visualisation; pedestrian movement; walking; measuring; understanding; improving; spatial quality; GPS; tracking; good public space; wayfinding; environmental psychology; urban economy; GIS; SPSS; city centre evaluation; urban facilities; three-step analysis; walking distances; visibility graph analysis; quality analysis perception; visual quality analysis; density analysis; used streets; non-used streets; mission; vision; strategy; spatial interventions; BCG-matrix; star; cash cow; question mark; dog

…53 11.4 Walking distances: 400-800m from garages… …55 11.5 Visibility graph analysis… …x28;Van der Spek, 2008-b). Is this the case for Delft as well? The visibility graph… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Langelaar, C. M. (. (2011). Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0

Chicago Manual of Style (16th Edition):

Van Langelaar, C M (author). “Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.” 2011. Masters Thesis, Delft University of Technology. Accessed January 19, 2021. http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0.

MLA Handbook (7th Edition):

Van Langelaar, C M (author). “Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.” 2011. Web. 19 Jan 2021.

Vancouver:

Van Langelaar CM(. Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2021 Jan 19]. Available from: http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0.

Council of Science Editors:

Van Langelaar CM(. Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0

.