174 search results - page 13 / 35 » Algorithms for center and Tverberg points |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
IPMI
2007
Springer
14 years 8 months ago
2007
Springer
A novel framework for joint clustering and point-by-point mapping of white matter fiber pathways is presented. Accurate clustering of the trajectories into fiber bundles requires p...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
TKDE
2008
13 years 7 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...