258 search results - page 26 / 52 » Weak Bisimulation Approximants |
104
click to vote
COMPGEOM
1993
ACM
15 years 3 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
SARA
2007
Springer
15 years 5 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
JEA
2008
14 years 11 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...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
IJCV
2010
14 years 10 months ago
2010
This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This lea...