1105 search results - page 129 / 221 » Approximate Spectral Clustering. |
103
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
124
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
116
click to vote
TCS
2010
14 years 11 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
108
click to vote
CGF
2008
15 years 1 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
102
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...