Sciweavers

113 search results - page 19 / 23
» Data structures with dynamical random transitions
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 10 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
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 8 months ago
BioBlender: a Software for Intuitive Representation of Surface Properties of Biomolecules
In this and the associated article BioBlender: A Software for Intuitive Representation of Surface Properties of Biomolecules [1], we present BioBlender as a complete instrument fo...
Raluca Mihaela Andrei, Marco Callieri, Maria Franc...
ICCV
2005
IEEE
14 years 3 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
14 years 2 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 3 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki