4930 search results - page 358 / 986 » Learning minimal abstractions |
210
click to vote
MIRAGE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper is concerned itself with the analysis of the twophase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It c...
173
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— In this paper we show how to optimize the computational cost and maximize consistency in EKF-based SLAM for large environments. We combine Local Mapping with Map Joinin...
186
click to vote
EUC
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
191
click to vote
FPL
2005
Springer
16 years 1 months ago
2005
Springer
Abstract— Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness...
262
click to vote
ICOIN
2003
Springer
16 years 25 days ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...