Sciweavers

258 search results - page 51 / 52
» Weak Bisimulation Approximants
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 5 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
IJRR
2007
100views more  IJRR 2007»
13 years 5 months ago
Exactly Sparse Extended Information Filters for Feature-based SLAM
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...
Matthew Walter, Ryan Eustice, John J. Leonard
INFORMS
1998
150views more  INFORMS 1998»
13 years 5 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
SCHOLARPEDIA
2008
92views more  SCHOLARPEDIA 2008»
13 years 5 months ago
Computational models of classical conditioning
: We describe computer simulation of a number of associative models of classical conditioning in an attempt to assess the strengths and weaknesses of each model. The behavior of th...
Nestor A. Schmajuk
IGPL
2010
158views more  IGPL 2010»
13 years 4 months ago
Ontology-revision operators based on reinterpretation
Communication between natural or artificial agents relies on the use of a common vocabulary. Since sharing terms does not necessarily imply that the terms have exactly the same m...
Carola Eschenbach, Özgür L. Öz&cced...