2698 search results - page 371 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
159
click to vote
ICMLA
2008
15 years 8 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
190
click to vote
PAMI
2011
15 years 1 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
160
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
181
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
180
click to vote
MST
2006
15 years 6 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...