221 search results - page 24 / 45 » On Approximating the Radii of Point Sets in High Dimensions |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
NIPS
2007
13 years 9 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
TOG
2012
11 years 10 months ago
2012
We present a technique for performing high-dimensional filtering of images and videos in real time. Our approach produces high-quality results and accelerates filtering by compu...