5170 search results - page 265 / 1034 » Consistency of the FastSLAM Algorithm |
LATA
2010
Springer
15 years 8 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
137
click to vote
MCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We propose AdaBoost.BHC, a novel multi-class boosting algorithm. AdaBoost.BHC solves a C class problem by using C − 1 binary classifiers defined by a hierarchy that i...
114
click to vote
TACAS
2009
Springer
15 years 8 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
3DIM
2007
IEEE
15 years 8 months ago
2007
IEEE
A limitation of the state-of-art multi-view reconstruction algorithms is in their ability to handle scenes with very little texture or a lot of clutter. Texture-less scenes with c...