1578 search results - page 197 / 316 » Direct Routing: Algorithms and Complexity |
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— The recent progress in robot mapping (or SLAM) algorithms has focused on estimating either point features (such as landmarks) or grid-based representations. Both of these repre...
DLOG
2007
14 years 15 days ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
DAIS
2009
13 years 11 months ago
2009
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
JMLR
2010
13 years 8 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
PAMI
2010
13 years 5 months ago
2010
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...