Sciweavers

854 search results - page 90 / 171
» Abstracting from Failure Probabilities
Sort
View
ALT
2007
Springer
15 years 8 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
UAI
2003
15 years 6 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
120
Voted
TROB
2008
136views more  TROB 2008»
15 years 4 months ago
Fast and Incremental Method for Loop-Closure Detection Using Bags of Visual Words
Abstract--In robotic applications of visual simultaneous localization and mapping techniques, loop-closure detection and global localization are two issues that require the capacit...
Adrien Angeli, David Filliat, Stéphane Donc...
NC
2007
123views Neural Networks» more  NC 2007»
15 years 4 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an in...
Emilio Kropff, Alessandro Treves
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 3 months ago
Maximum likelihood mapping with spectral image registration
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
Max Pfingsthorn, Andreas Birk 0002, Sören Sch...