15 search results - page 3 / 3 » Coresets and Sketches for High Dimensional Subspace Approxim... |
CORR
1999
Springer
13 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
We present a dynamic inference algorithm in a globally parameterized nonlinear manifold and demonstrate it on the problem of visual tracking. An appearance manifold is usually non...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
EUROSYS
2006
ACM
14 years 1 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
SC
2009
ACM
13 years 9 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...