961 search results - page 166 / 193 » Significance-Driven Graph Clustering |
136
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
144
click to vote
ECCV
2008
Springer
16 years 6 days ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
114
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
153
click to vote
WAW
2004
Springer
15 years 7 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
113
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...