581 search results - page 31 / 117 » EM in High Dimensional Spaces |
163
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
175
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a manifold learning approach to dimensionality
reduction that explicitly models the manifold as a mapping
from low to high dimensional space. The manifold is
represen...
171
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
213
Voted
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
153
click to vote
JEA
2008
15 years 6 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...