2137 search results - page 167 / 428 » Experiments on Graph Clustering Algorithms |
154
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
115
Voted
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The out...
101
click to vote
UAI
2008
15 years 3 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
103
Voted
SKG
2006
IEEE
15 years 8 months ago
2006
IEEE
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...
118
click to vote
SCAM
2006
IEEE
15 years 8 months ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...