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:(Hypergraph Partitioning). Showing records 1 – 14 of 14 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.

Degree: 2016, Indian Institute of Science

Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf

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

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Thesis, Indian Institute of Science. Accessed July 13, 2020. http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.

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

MLA Handbook (7th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Web. 13 Jul 2020.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2020 Jul 13]. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf.

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

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/handle/2005/2947 ; http://etd.ncsi.iisc.ernet.in/abstracts/3809/G27845-Abs.pdf

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


Indian Institute of Science

2. Ghoshdastidar, Debarghya. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.

Degree: 2016, Indian Institute of Science

Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is… (more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghoshdastidar, D. (2016). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2947

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

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Thesis, Indian Institute of Science. Accessed July 13, 2020. http://hdl.handle.net/2005/2947.

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

MLA Handbook (7th Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2016. Web. 13 Jul 2020.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/2005/2947.

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

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2947

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


University of Melbourne

3. Jiang, Wenkai. Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning.

Degree: 2018, University of Melbourne

 Hypergraphs have been shown to be highly effective when modeling a wide range of applications where high-order relationships are of interest, such as social network… (more)

Subjects/Keywords: Hypergraph; graph framework; graph partitioning; deep neural network training; quantized learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jiang, W. (2018). Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/220744

Chicago Manual of Style (16th Edition):

Jiang, Wenkai. “Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning.” 2018. Masters Thesis, University of Melbourne. Accessed July 13, 2020. http://hdl.handle.net/11343/220744.

MLA Handbook (7th Edition):

Jiang, Wenkai. “Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning.” 2018. Web. 13 Jul 2020.

Vancouver:

Jiang W. Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. [Internet] [Masters thesis]. University of Melbourne; 2018. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/11343/220744.

Council of Science Editors:

Jiang W. Highly efficient distributed hypergraph analysis: real-time partitioning and quantized learning. [Masters Thesis]. University of Melbourne; 2018. Available from: http://hdl.handle.net/11343/220744


Clemson University

4. 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

5. Taviani, D. Iterative sparse matrix partitioning.

Degree: 2013, Universiteit Utrecht

 At the core of many numerical methods lies one simple operation: the sparse matrix-vector multiplication. Because the systems involved are usually of large size, to… (more)

Subjects/Keywords: matrix; partitioning; sparse matrix; hypergraph; heuristics

…problem is through the concept of hypergraph partitioning [5]. A hypergraph is simply… …particular the hypergraph partitioning problem are already well known in literature: they have a… …application basis, translating our matrix partitioning problem to a hypergraph partitioning problem… …The definition of hypergraph partitioning problems is identical to the case of a graph, with… …ones given in the previous section: it is clear that the hypergraph partitioning problem… 

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

Taviani, D. (2013). Iterative sparse matrix partitioning. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/285045

Chicago Manual of Style (16th Edition):

Taviani, D. “Iterative sparse matrix partitioning.” 2013. Masters Thesis, Universiteit Utrecht. Accessed July 13, 2020. http://dspace.library.uu.nl:8080/handle/1874/285045.

MLA Handbook (7th Edition):

Taviani, D. “Iterative sparse matrix partitioning.” 2013. Web. 13 Jul 2020.

Vancouver:

Taviani D. Iterative sparse matrix partitioning. [Internet] [Masters thesis]. Universiteit Utrecht; 2013. [cited 2020 Jul 13]. Available from: http://dspace.library.uu.nl:8080/handle/1874/285045.

Council of Science Editors:

Taviani D. Iterative sparse matrix partitioning. [Masters Thesis]. Universiteit Utrecht; 2013. Available from: http://dspace.library.uu.nl:8080/handle/1874/285045


Universitat Politècnica de Catalunya

6. Sapena Masip, Emili. A constraint-based hypergraph partitioning approach to coreference resolution.

Degree: Departament de Llenguatges i Sistemes Informàtics, 2012, Universitat Politècnica de Catalunya

 La resolució de correferències és una tasca de processament del llenguatge natural que consisteix en determinar les expressions d'un discurs que es refereixen a la… (more)

Subjects/Keywords: coreference resolution; hypergraph partitioning; constraint satisfaction; relaxation labeling; natural language processing; artificial intelligence; machine learning; information extraction; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sapena Masip, E. (2012). A constraint-based hypergraph partitioning approach to coreference resolution. (Thesis). Universitat Politècnica de Catalunya. Retrieved from http://hdl.handle.net/10803/83904

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

Sapena Masip, Emili. “A constraint-based hypergraph partitioning approach to coreference resolution.” 2012. Thesis, Universitat Politècnica de Catalunya. Accessed July 13, 2020. http://hdl.handle.net/10803/83904.

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

MLA Handbook (7th Edition):

Sapena Masip, Emili. “A constraint-based hypergraph partitioning approach to coreference resolution.” 2012. Web. 13 Jul 2020.

Vancouver:

Sapena Masip E. A constraint-based hypergraph partitioning approach to coreference resolution. [Internet] [Thesis]. Universitat Politècnica de Catalunya; 2012. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/10803/83904.

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

Council of Science Editors:

Sapena Masip E. A constraint-based hypergraph partitioning approach to coreference resolution. [Thesis]. Universitat Politècnica de Catalunya; 2012. Available from: http://hdl.handle.net/10803/83904

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

7. Buurlage, J. Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming.

Degree: 2016, Universiteit Utrecht

 One of the backbone operations in numerical mathematics is multiplying a sparse matrix with a vector. In computations involving very large linear systems, the sparse… (more)

Subjects/Keywords: parallel algorithm; BSP; sparse matrix; partitioning; graph; hypergraph; distributed computing

…weights w : N → R. Definition 10 (Hypergraph partitioning). A partitioning of a… …hypergraph has the same definition as the partitioning of a graph, with G substituted by H. The… …hypergraph partitioning problem is also stated completely analogous to the graph partitioning… …cut-net metric for a hypergraph H = (V , N , w) with a kway partitioning π, is the… …conclude that the hypergraph partitioning for both metrics with k = 2 is also NP-complete… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buurlage, J. (2016). Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/327908

Chicago Manual of Style (16th Edition):

Buurlage, J. “Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming.” 2016. Masters Thesis, Universiteit Utrecht. Accessed July 13, 2020. http://dspace.library.uu.nl:8080/handle/1874/327908.

MLA Handbook (7th Edition):

Buurlage, J. “Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming.” 2016. Web. 13 Jul 2020.

Vancouver:

Buurlage J. Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2020 Jul 13]. Available from: http://dspace.library.uu.nl:8080/handle/1874/327908.

Council of Science Editors:

Buurlage J. Self-Improving Sparse Matrix Partitioning and Bulk-Synchronous Pseudo-Streaming. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/327908


Indian Institute of Science

8. Pai, Nithish. A GPU Accelerated Tensor Spectral Method for Subspace Clustering.

Degree: 2016, Indian Institute of Science

 In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may… (more)

Subjects/Keywords: Subspace Clustering; Tensors Spectral Method; Hypergraphs and Tensors; Uniform Hypergraph Partitioning Algorithm; Tensor Factorization; Spectral Clustering based Algorithms; GPU Accelerated Algorithm; GPU Computing; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pai, N. (2016). A GPU Accelerated Tensor Spectral Method for Subspace Clustering. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2837 ; http://etd.ncsi.iisc.ernet.in/abstracts/3688/G27278-Abs.pdf

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

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2016. Thesis, Indian Institute of Science. Accessed July 13, 2020. http://etd.iisc.ernet.in/handle/2005/2837 ; http://etd.ncsi.iisc.ernet.in/abstracts/3688/G27278-Abs.pdf.

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

MLA Handbook (7th Edition):

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2016. Web. 13 Jul 2020.

Vancouver:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2020 Jul 13]. Available from: http://etd.iisc.ernet.in/handle/2005/2837 ; http://etd.ncsi.iisc.ernet.in/abstracts/3688/G27278-Abs.pdf.

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

Council of Science Editors:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/handle/2005/2837 ; http://etd.ncsi.iisc.ernet.in/abstracts/3688/G27278-Abs.pdf

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

9. Kaya, Oguz. High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.

Degree: Docteur es, Informatique, 2017, Lyon

 La factorisation des tenseurs est au coeur des méthodes d'analyse des données massives multidimensionnelles dans de nombreux domaines, dont les systèmes de recommandation, les graphes,… (more)

Subjects/Keywords: Décompositions des tenseurs; Algorithmes parallèles; Partitionnement des hypergraphes; Factorisation des matrices; Arbres de dimension; Tensor decompositions; Parallel algorithms; Hypergraph partitioning; Matrix factorization; Dimension trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaya, O. (2017). High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEN051

Chicago Manual of Style (16th Edition):

Kaya, Oguz. “High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.” 2017. Doctoral Dissertation, Lyon. Accessed July 13, 2020. http://www.theses.fr/2017LYSEN051.

MLA Handbook (7th Edition):

Kaya, Oguz. “High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.” 2017. Web. 13 Jul 2020.

Vancouver:

Kaya O. High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Jul 13]. Available from: http://www.theses.fr/2017LYSEN051.

Council of Science Editors:

Kaya O. High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEN051


Indian Institute of Science

10. Pai, Nithish. A GPU Accelerated Tensor Spectral Method for Subspace Clustering.

Degree: 2016, Indian Institute of Science

 In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may… (more)

Subjects/Keywords: Subspace Clustering; Tensors Spectral Method; Hypergraphs and Tensors; Uniform Hypergraph Partitioning Algorithm; Tensor Factorization; Spectral Clustering based Algorithms; GPU Accelerated Algorithm; GPU Computing; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pai, N. (2016). A GPU Accelerated Tensor Spectral Method for Subspace Clustering. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2837

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

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2016. Thesis, Indian Institute of Science. Accessed July 13, 2020. http://hdl.handle.net/2005/2837.

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

MLA Handbook (7th Edition):

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2016. Web. 13 Jul 2020.

Vancouver:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/2005/2837.

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

Council of Science Editors:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2837

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

11. Liu, Zifan. Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires.

Degree: Docteur es, Informatique, 2015, Versailles-St Quentin en Yvelines

Le calcul des valeurs propres intervient dans des modèles de maladies d’épidémiques et pourrait être utilisé comme un allié des campagnes de vac- cination dans… (more)

Subjects/Keywords: Épidémie; PageRank; Théorie de graphe; Loi de puissance; IRAM; Grande donnée; Hypergraphe partitionnement; Epidemic; PageRank; Scale free networks; Power law; IRAM; Big data; Hypergraph partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2015). Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires. (Doctoral Dissertation). Versailles-St Quentin en Yvelines. Retrieved from http://www.theses.fr/2015VERS001V

Chicago Manual of Style (16th Edition):

Liu, Zifan. “Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires.” 2015. Doctoral Dissertation, Versailles-St Quentin en Yvelines. Accessed July 13, 2020. http://www.theses.fr/2015VERS001V.

MLA Handbook (7th Edition):

Liu, Zifan. “Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires.” 2015. Web. 13 Jul 2020.

Vancouver:

Liu Z. Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires. [Internet] [Doctoral dissertation]. Versailles-St Quentin en Yvelines; 2015. [cited 2020 Jul 13]. Available from: http://www.theses.fr/2015VERS001V.

Council of Science Editors:

Liu Z. Complex systems and health systems, computational challenges : Systèmes complexes et systèmes de santé, défis calculatoires. [Doctoral Dissertation]. Versailles-St Quentin en Yvelines; 2015. Available from: http://www.theses.fr/2015VERS001V

12. Coullon, Hélène. Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations.

Degree: Docteur es, Informatique, 2014, Université d'Orléans

Le calcul scientifique parallèle est un domaine en plein essor qui permet à la fois d’augmenter la vitesse des longs traitements, de traiter des problèmes… (more)

Subjects/Keywords: Parallélisme implicite; Modèle de haut niveau; Effort de programmation; Structures de données distribuées; Partitionnement d’hypergraphes; Distribution de données; Simulations numériques; Équations aux dérivées partielles; Maillages cartésiens; Réseaux; Implicit parallelism; High level programming models; Development effort; Distributed data structures; Hypergraph partitioning; Data distribution; Numerical simulations; Partial differential equations; Cartesian meshes; Networks; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Coullon, H. (2014). Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2014ORLE2029

Chicago Manual of Style (16th Edition):

Coullon, Hélène. “Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations.” 2014. Doctoral Dissertation, Université d'Orléans. Accessed July 13, 2020. http://www.theses.fr/2014ORLE2029.

MLA Handbook (7th Edition):

Coullon, Hélène. “Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations.” 2014. Web. 13 Jul 2020.

Vancouver:

Coullon H. Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations. [Internet] [Doctoral dissertation]. Université d'Orléans; 2014. [cited 2020 Jul 13]. Available from: http://www.theses.fr/2014ORLE2029.

Council of Science Editors:

Coullon H. Modélisation et implémentation de parallélisme implicite pour les simulations scientifiques basées sur des maillages : Model and implementation of implicit parallélism for mesh-based scientific simulations. [Doctoral Dissertation]. Université d'Orléans; 2014. Available from: http://www.theses.fr/2014ORLE2029

13. Kolodziej, Scott Parker. Computational Optimization Techniques for Graph Partitioning.

Degree: PhD, Computer Science, 2019, Texas A&M University

Partitioning graphs into two or more subgraphs is a fundamental operation in computer science, with applications in large-scale graph analytics, distributed and parallel data processing,… (more)

Subjects/Keywords: Graph partitioning; Graph algorithms; Numerical optimization; Computational optimization; Mathematical programming; Quadratic programming; Vertex separators; Edge cuts; Hypergraph Partitioning; Sparse matrix algorithms

Hypergraph Partitioning… …hypergraph (where each hyperedge can connect two or more vertices). Graph partitioning… …hMETIS (for hypergraph partitioning) [27], and MT-METIS (for use with… …xiii 1. INTRODUCTION TO GRAPH PARTITIONING… …1.1 1.2 1.3 1.4 1.5 Graph Partitioning… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolodziej, S. P. (2019). Computational Optimization Techniques for Graph Partitioning. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186247

Chicago Manual of Style (16th Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Doctoral Dissertation, Texas A&M University. Accessed July 13, 2020. http://hdl.handle.net/1969.1/186247.

MLA Handbook (7th Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Web. 13 Jul 2020.

Vancouver:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/1969.1/186247.

Council of Science Editors:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186247

14. Kolodziej, Scott Parker. Computational Optimization Techniques for Graph Partitioning.

Degree: PhD, Computer Science, 2019, Texas A&M University

Partitioning graphs into two or more subgraphs is a fundamental operation in computer science, with applications in large-scale graph analytics, distributed and parallel data processing,… (more)

Subjects/Keywords: Graph partitioning; Graph algorithms; Numerical optimization; Computational optimization; Mathematical programming; Quadratic programming; Vertex separators; Edge cuts; Hypergraph Partitioning; Sparse matrix algorithms

Hypergraph Partitioning… …hypergraph (where each hyperedge can connect two or more vertices). Graph partitioning… …hMETIS (for hypergraph partitioning) [27], and MT-METIS (for use with… …xiii 1. INTRODUCTION TO GRAPH PARTITIONING… …1.1 1.2 1.3 1.4 1.5 Graph Partitioning… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolodziej, S. P. (2019). Computational Optimization Techniques for Graph Partitioning. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186207

Chicago Manual of Style (16th Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Doctoral Dissertation, Texas A&M University. Accessed July 13, 2020. http://hdl.handle.net/1969.1/186207.

MLA Handbook (7th Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Web. 13 Jul 2020.

Vancouver:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Jul 13]. Available from: http://hdl.handle.net/1969.1/186207.

Council of Science Editors:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186207

.