Sciweavers

364 search results - page 28 / 73
» Belief Update Using Graphs
Sort
View
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
14 years 5 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi
ICCV
2007
IEEE
14 years 5 months ago
Monocular SLAM as a Graph of Coalesced Observations
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
Ethan Eade, Tom Drummond
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 4 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
LCPC
1991
Springer
14 years 2 months ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...