2033 search results - page 17 / 407 » Ranking on Data Manifolds |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
CVPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
