Sciweavers

961 search results - page 96 / 193
» Significance-Driven Graph Clustering
Sort
View
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 5 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
ECCV
2006
Springer
16 years 6 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
BMCBI
2005
253views more  BMCBI 2005»
15 years 4 months ago
The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks
Background: This paper describes an automated method for finding clusters of interconnected proteins in protein interaction networks and retrieving protein annotations associated ...
Ruth Dunn, Frank Dudbridge, Christopher M. Sanders...
BMCBI
2010
144views more  BMCBI 2010»
15 years 4 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
AAAI
2010
15 years 6 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He