847 search results - page 38 / 170 » Approximation algorithms for projective clustering |
103
Voted
VISSYM
2003
15 years 1 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
79
Voted
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
ICPR
2010
IEEE
15 years 23 days ago
2010
IEEE
We propose a method for multi-object segmentation in a projection plane. Our algorithm requires a stereo camera system called Subtraction Stereo, which extracts foreground informa...
114
click to vote
COMPGEOM
2000
ACM
15 years 5 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
102
click to vote
VDA
2010
15 years 3 months ago
2010
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...