Sciweavers

2366 search results - page 386 / 474
» Mapping time
Sort
View
NIPS
2007
13 years 11 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
AAAI
2006
13 years 11 months ago
The Keystone Scavenger Team
Stereo vision for small mobile robots is a challenging problem, particularly when employing embedded systems with limited processing power. However, it holds the promise of greatl...
Jacky Baltes, John Anderson
AAAI
2006
13 years 11 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 11 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
CADUI
2006
13 years 11 months ago
The Comets Inspector
Three types of representation are typically produced during the User Interface (UI) development life cycle: a conceptual representation holding the models used for elaborating a UI...
Alexandre Demeure, Gaëlle Calvary, Joëll...