Sciweavers

283 search results - page 11 / 57
» Versatile spectral methods for point set matching
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
CCCG
2006
13 years 8 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...
MICCAI
2004
Springer
14 years 8 months ago
Integrated Intensity and Point-Feature Nonrigid Registration
Abstract. In this work, we present a method for the integration of feature and intensity information for non rigid registration. Our method is based on a free-form deformation mode...
Xenophon Papademetris, Andrea P. Jackowski, Robert...
ECCV
2010
Springer
14 years 18 days ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
FOCS
1994
IEEE
13 years 11 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle