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

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Wollongong

1. Lewin, Peter. The structure and ergodic theory of higher-rank graph algebras.

Degree: PhD, 2011, University of Wollongong

  A higher-rank graph is a higher-dimensional analogue of a directed graph. These were introduced by Kumjian and Pask in 2000 as a combinatorial model… (more)

Subjects/Keywords: Higher rank graph algebra tructure ergodic operator; entropy C*-algebras C^*-algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lewin, P. (2011). The structure and ergodic theory of higher-rank graph algebras. (Doctoral Dissertation). University of Wollongong. Retrieved from 010108 Operator Algebras and Functional Analysis, 010109 Ordinary Differential Equations, Difference Equations and Dynamical Systems ; https://ro.uow.edu.au/theses/3500

Chicago Manual of Style (16th Edition):

Lewin, Peter. “The structure and ergodic theory of higher-rank graph algebras.” 2011. Doctoral Dissertation, University of Wollongong. Accessed July 14, 2020. 010108 Operator Algebras and Functional Analysis, 010109 Ordinary Differential Equations, Difference Equations and Dynamical Systems ; https://ro.uow.edu.au/theses/3500.

MLA Handbook (7th Edition):

Lewin, Peter. “The structure and ergodic theory of higher-rank graph algebras.” 2011. Web. 14 Jul 2020.

Vancouver:

Lewin P. The structure and ergodic theory of higher-rank graph algebras. [Internet] [Doctoral dissertation]. University of Wollongong; 2011. [cited 2020 Jul 14]. Available from: 010108 Operator Algebras and Functional Analysis, 010109 Ordinary Differential Equations, Difference Equations and Dynamical Systems ; https://ro.uow.edu.au/theses/3500.

Council of Science Editors:

Lewin P. The structure and ergodic theory of higher-rank graph algebras. [Doctoral Dissertation]. University of Wollongong; 2011. Available from: 010108 Operator Algebras and Functional Analysis, 010109 Ordinary Differential Equations, Difference Equations and Dynamical Systems ; https://ro.uow.edu.au/theses/3500

2. Mihelich, Martin. Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle.

Degree: Docteur es, Physique, 2015, Université Paris-Saclay (ComUE)

Dans cette thèse nous essayons de comprendre pourquoi le Principe de Maximisation de Production d'Entropie (MEP) donne de très bons résultats dans de nombreux domaines… (more)

Subjects/Keywords: Entropie; Physique Statistique; Chaîne de Marlov; Graphe; Entropy; Statistical Physics; Markov chain; Graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mihelich, M. (2015). Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2015SACLS038

Chicago Manual of Style (16th Edition):

Mihelich, Martin. “Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle.” 2015. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed July 14, 2020. http://www.theses.fr/2015SACLS038.

MLA Handbook (7th Edition):

Mihelich, Martin. “Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle.” 2015. Web. 14 Jul 2020.

Vancouver:

Mihelich M. Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2015. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2015SACLS038.

Council of Science Editors:

Mihelich M. Vers une compréhension du principe de maximisation de production d'entropie : Towards an understanding of the maximum entropy production principle. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2015. Available from: http://www.theses.fr/2015SACLS038


Mississippi State University

3. Hossain, Mahmood. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.

Degree: PhD, Accountancy, School of, 2006, Mississippi State University

 Traditional clustering is typically based on a single feature set. In some domains, several feature sets may be available to represent the same objects, but… (more)

Subjects/Keywords: Ensemble Clustering; Heterogeneous Datasets; Graph Theoretic Clustering; Mutual Entropy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. (2006). CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;

Chicago Manual of Style (16th Edition):

Hossain, Mahmood. “CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.” 2006. Doctoral Dissertation, Mississippi State University. Accessed July 14, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;.

MLA Handbook (7th Edition):

Hossain, Mahmood. “CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.” 2006. Web. 14 Jul 2020.

Vancouver:

Hossain M. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. [Internet] [Doctoral dissertation]. Mississippi State University; 2006. [cited 2020 Jul 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;.

Council of Science Editors:

Hossain M. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. [Doctoral Dissertation]. Mississippi State University; 2006. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;

4. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

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

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 14, 2020. http://hdl.handle.net/10045/98110.

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

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 14 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10045/98110.

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

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

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

5. Karam, Steve. Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces.

Degree: Docteur es, Mathématiques pures, 2013, Université François-Rabelais de Tours

Dans le cadre de la géométrie riemannienne globale sans hypothèse de courbure en lien avec la topologie, nous nous intéressons au volume maximal des boules… (more)

Subjects/Keywords: Surface; Graphe; Revêtement universel; Entropie; Aire des boules; Systole; Lacets homotopiquement indépendants; Inégalités géometriques; Surface; Graph; Universal cover; Entropy; Area of balls; Systole; Homologically independent loops; Geometric inequalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karam, S. (2013). Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2013TOUR4049

Chicago Manual of Style (16th Edition):

Karam, Steve. “Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces.” 2013. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed July 14, 2020. http://www.theses.fr/2013TOUR4049.

MLA Handbook (7th Edition):

Karam, Steve. “Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces.” 2013. Web. 14 Jul 2020.

Vancouver:

Karam S. Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2013. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2013TOUR4049.

Council of Science Editors:

Karam S. Croissance du volume des boules dans les revêtements universels des graphes et des surfaces : Growth of balls in the universal cover of graphs and surfaces. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2013. Available from: http://www.theses.fr/2013TOUR4049


Université de Lorraine

6. Faghraoui, Ahmed. Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems.

Degree: Docteur es, Automatique, Traitement du Signal et des Images, Génie Informatique, 2013, Université de Lorraine

Cette thèse s'inscrit dans le cadre du projet européen PAPYRUS (7th FWP (Seventh Framework Program) et concerne le développement de modèles et d'outils permettant l'analyse… (more)

Subjects/Keywords: Graphe de causalité; Transfert entropie; Diagnostic plug & play; Pronostic; Indicateurs des performances; Système de grande dimension; Causality graph; Transfer entropy; Plug & Play Diagnostic; Prognosis; Performance indicators; Large-scale systems; 670

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Faghraoui, A. (2013). Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2013LORR0235

Chicago Manual of Style (16th Edition):

Faghraoui, Ahmed. “Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems.” 2013. Doctoral Dissertation, Université de Lorraine. Accessed July 14, 2020. http://www.theses.fr/2013LORR0235.

MLA Handbook (7th Edition):

Faghraoui, Ahmed. “Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems.” 2013. Web. 14 Jul 2020.

Vancouver:

Faghraoui A. Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems. [Internet] [Doctoral dissertation]. Université de Lorraine; 2013. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2013LORR0235.

Council of Science Editors:

Faghraoui A. Modélisation de causalité et diagnostic des systèmes complexes de grande dimension : Causality modeling and diagnosis of large-scale complex systems. [Doctoral Dissertation]. Université de Lorraine; 2013. Available from: http://www.theses.fr/2013LORR0235


University of Florida

7. VEREMYEV,ALEXANDER F. Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems.

Degree: PhD, Industrial and Systems Engineering, 2011, University of Florida

Our work develops theoretical principles and optimization Advisors/Committee Members: Uryasev, Stanislav (committee chair), Pardalos, Panagote M (committee member), Yan, Liqing (committee member).

Subjects/Keywords: Connectivity; Credit ratings; Data smoothing; Diameters; Entropy; Linear programming; Mathematical robustness; Natural logarithms; Optimal solutions; Payments; ATTACK  – CDO  – CLIQUE  – CLUSTER  – DESIGN  – ENTROPY  – GRAPH  – NETWORK  – OPTIMIZATION  – RANDOM  – ROBUST

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

F, V. (2011). Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0042699

Chicago Manual of Style (16th Edition):

F, VEREMYEV,ALEXANDER. “Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems.” 2011. Doctoral Dissertation, University of Florida. Accessed July 14, 2020. https://ufdc.ufl.edu/UFE0042699.

MLA Handbook (7th Edition):

F, VEREMYEV,ALEXANDER. “Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems.” 2011. Web. 14 Jul 2020.

Vancouver:

F V. Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems. [Internet] [Doctoral dissertation]. University of Florida; 2011. [cited 2020 Jul 14]. Available from: https://ufdc.ufl.edu/UFE0042699.

Council of Science Editors:

F V. Modeling and Optimization Approaches for Ensuring Robustness in Networked and Financial Systems. [Doctoral Dissertation]. University of Florida; 2011. Available from: https://ufdc.ufl.edu/UFE0042699

8. Ben salah, Imeen. Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud.

Degree: Docteur es, Informatique, 2019, Normandie

Les caméras sont devenues de plus en plus communes dans les véhicules, les smartphones et les systèmes d'aide à la conduite ADAS (Advanced Driver Assistance… (more)

Subjects/Keywords: Navigabilité; Vision; Perception; Carte; Nuage 3D; Résumé; Maillage texturé; Sphère; Entropie; Graphe; Saillance; Recalage; Visibilité; Navigability; Graph; Vision; Perception; Map; 3D cloud; Summary; Textured mesh; Sphere; Entropy; Saliency; Registration; Visibility; 006.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ben salah, I. (2019). Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud. (Doctoral Dissertation). Normandie. Retrieved from http://www.theses.fr/2019NORMR070

Chicago Manual of Style (16th Edition):

Ben salah, Imeen. “Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud.” 2019. Doctoral Dissertation, Normandie. Accessed July 14, 2020. http://www.theses.fr/2019NORMR070.

MLA Handbook (7th Edition):

Ben salah, Imeen. “Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud.” 2019. Web. 14 Jul 2020.

Vancouver:

Ben salah I. Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud. [Internet] [Doctoral dissertation]. Normandie; 2019. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2019NORMR070.

Council of Science Editors:

Ben salah I. Extraction d'un graphe de navigabilité à partir d'un nuage de points 3D enrichis. : Extraction of navigability graph from large-scale 3D point cloud. [Doctoral Dissertation]. Normandie; 2019. Available from: http://www.theses.fr/2019NORMR070

9. Talon, Alexandre. Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires.

Degree: Docteur es, Informatique, 2019, Lyon

Nous cherchons à prouver de nouveaux résultats en théorie des graphes et combinatoire grâce à la vitesse de calcul des ordinateurs, couplée à des algorithmes… (more)

Subjects/Keywords: Théorie des graphes; Nombre de domination; Grilles; Entropie de sous-shift; Dénombrement d’ensembles dominants; Déchargement; Polyominos; Pavages; Domination totale; Domination romaine; Graph theory; Domination number; Grid graphs; Subshift entropy; Counting dominating sets; Discharging; Polyominoes; Tiling; Total domination; Roman domination

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Talon, A. (2019). Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2019LYSEN079

Chicago Manual of Style (16th Edition):

Talon, Alexandre. “Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires.” 2019. Doctoral Dissertation, Lyon. Accessed July 14, 2020. http://www.theses.fr/2019LYSEN079.

MLA Handbook (7th Edition):

Talon, Alexandre. “Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires.” 2019. Web. 14 Jul 2020.

Vancouver:

Talon A. Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires. [Internet] [Doctoral dissertation]. Lyon; 2019. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2019LYSEN079.

Council of Science Editors:

Talon A. Intensive use of computing resources for dominations in grids and other combinatorial problems : Utilisation intensive de l’ordinateur : dominations dans les grilles et autres problèmes combinatoires. [Doctoral Dissertation]. Lyon; 2019. Available from: http://www.theses.fr/2019LYSEN079

10. Carroll, Christina C. Enumerative combinatorics of posets.

Degree: PhD, Mathematics, 2008, Georgia Tech

 This thesis contains several results concerning the combinatorics of partially ordered sets (posets) which are either of enumerative or extremal nature. The first concerns conjectures… (more)

Subjects/Keywords: Enumeration; Entropy; Dedekind's problem; Combinatorial analysis; Partially ordered sets; Graph theory

entropy-based approach to provide an upper bound. Additionally, we show that DKN,d , the graph… …gives background on the entropy function and how it is used; though this material is… …Let G be a bipartite graph on N vertices with partition classes |A| A and B. Suppose that… …x29; ri . i=1 It is a consequence of this theorem that when 2d divides N , the graph… …perfect matchings, the theorem is not strong enough to give us information about the graph which… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carroll, C. C. (2008). Enumerative combinatorics of posets. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/22659

Chicago Manual of Style (16th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/22659.

MLA Handbook (7th Edition):

Carroll, Christina C. “Enumerative combinatorics of posets.” 2008. Web. 14 Jul 2020.

Vancouver:

Carroll CC. Enumerative combinatorics of posets. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/22659.

Council of Science Editors:

Carroll CC. Enumerative combinatorics of posets. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/22659

.