1813 search results - page 17 / 363 » Calculi of Approximation Spaces |
STOC
2006
ACM
16 years 4 hour ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
NIPS
2007
15 years 1 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...
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
MOC
2000
14 years 11 months ago
2000
We consider sequences of s
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...