Graph partition

Results: 275



#Item
1Spectral clustering is a well-known way to partition a graph or network into clusters or communities with provable guarantees on the quality of the clusters. This guarantee is known as the Cheeger inequality and it holds

Spectral clustering is a well-known way to partition a graph or network into clusters or communities with provable guarantees on the quality of the clusters. This guarantee is known as the Cheeger inequality and it holds

Add to Reading List

Source URL: mmds-data.org

- Date: 2016-06-23 15:50:48
    2A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

    A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

    Add to Reading List

    Source URL: eda.mmci.uni-saarland.de

    Language: English - Date: 2014-10-01 09:01:01
    3Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

    Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

    Add to Reading List

    Source URL: www.cs.yale.edu

    Language: English - Date: 2005-06-30 12:02:51
    4Aydın Buluc¸ C ONTACT I NFORMATION Lawrence Berkeley National Laboratory. Mailstop 59R4104

    Aydın Buluc¸ C ONTACT I NFORMATION Lawrence Berkeley National Laboratory. Mailstop 59R4104

    Add to Reading List

    Source URL: gauss.cs.ucsb.edu

    Language: English - Date: 2016-04-13 03:04:20
    5Sparse Matrix-Matrix Multiplication: Applications, Algorithms, and Implementations Organizers: Grey Ballard and Alex Druinsky SIAM Conference on Applied Linear Algebra  October 26, 2015

    Sparse Matrix-Matrix Multiplication: Applications, Algorithms, and Implementations Organizers: Grey Ballard and Alex Druinsky SIAM Conference on Applied Linear Algebra October 26, 2015

    Add to Reading List

    Source URL: www.sandia.gov

    Language: English - Date: 2015-12-15 18:34:11
    6PSBLAS 2.4 & MLD2P4 1.2: Sparse Computations and Iterative Solvers on Parallel Computers  PSBLAS 2.4 &

    PSBLAS 2.4 & MLD2P4 1.2: Sparse Computations and Iterative Solvers on Parallel Computers PSBLAS 2.4 &

    Add to Reading List

    Source URL: people.uniroma2.it

    Language: English - Date: 2014-10-09 08:41:31
    7Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department  of Computer Science and Engineering, Uni

    Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni

    Add to Reading List

    Source URL: www.jevinwest.org

    Language: English - Date: 2015-11-11 00:05:03
    8Local Partitioning using PageRank Reid Andersen Fan Chung  UCSD, UCSD, Yahoo!

    Local Partitioning using PageRank Reid Andersen Fan Chung UCSD, UCSD, Yahoo!

    Add to Reading List

    Source URL: www.math.ucsd.edu

    Language: English - Date: 2006-11-11 09:59:27
    9PHYSICAL REVIEW E 91, Estimating the resolution limit of the map equation in community detection Tatsuro Kawamoto1 and Martin Rosvall2 1

    PHYSICAL REVIEW E 91, Estimating the resolution limit of the map equation in community detection Tatsuro Kawamoto1 and Martin Rosvall2 1

    Add to Reading List

    Source URL: www.mapequation.org

    Language: English - Date: 2016-03-19 09:17:24
    10Incremental spectral clustering by efficiently updating the eigen-system

    Incremental spectral clustering by efficiently updating the eigen-system

    Add to Reading List

    Source URL: www.ifp.illinois.edu

    Language: English - Date: 2010-07-25 04:16:40