Sciweavers

459 search results - page 54 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
ICRA
2008
IEEE
149views Robotics» more  ICRA 2008»
15 years 6 months ago
Single camera vision-only SLAM on a suburban road network
—Simultaneous Localization And Mapping (SLAM) is one of the major challenges in mobile robotics. Probabilistic techniques using high-end range finding devices are well establishe...
Michael Milford, Gordon Wyeth
MFCS
2007
Springer
15 years 6 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
UAI
2008
15 years 1 months ago
Inference for Multiplicative Models
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
Ydo Wexler, Christopher Meek
IPMI
2007
Springer
16 years 19 days ago
Bayesian Tracking of Elongated Structures in 3D Images
Tracking of tubular elongated structures is an important goal in a wide range of biomedical imaging applications. A Bayesian tube tracking algorithm is presented that allows to eas...
Michiel Schaap, Ihor Smal, Coert Metz, Theo van Wa...
NCA
2005
IEEE
15 years 5 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman