259 search results - page 30 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
110
Voted
KDD
2008
ACM
15 years 10 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
100
click to vote
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In this paper, we present an image-based markerless human motion capture system, intended for humanoid robot systems. The restrictions set by this ambitious goal are nu...
103
click to vote
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...