259 search results - page 28 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
109
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
124
click to vote
BTW
2009
Springer
14 years 10 months ago
2009
Springer
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
91
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
114
click to vote
MM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...