Sciweavers

75 search results - page 2 / 15
» Computing Applicability Conditions for Plans with Loops
Sort
View
TSP
2008
116views more  TSP 2008»
13 years 5 months ago
Computation of Delay-Free Nonlinear Digital Filter Networks: Application to Chaotic Circuits and Intracellular Signal Transducti
Abstract--A method for the computation of nonlinear digital filter networks containing delay-free loops is proposed. By preserving the topology of the network this method permits t...
Federico Fontana, Federico Avanzini
TROB
2008
154views more  TROB 2008»
13 years 3 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
AIPS
1996
13 years 6 months ago
Computing Parameter Domains as an Aid to Planning
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
Alfonso Gerevini, Lenhart K. Schubert
CVPR
2009
IEEE
14 years 2 months ago
Visual loop closing using multi-resolution SIFT grids in metric-topological SLAM
We present an image-based Simultaneous Localization and Mapping (SLAM) framework with online, appearanceonly loop closing. We adopt a layered approach with metric maps over small ...
Vivek Pradeep, Gérard G. Medioni, James Wei...
ISSS
2002
IEEE
154views Hardware» more  ISSS 2002»
13 years 10 months ago
Optimal Code Size Reduction for Software-Pipelined and Unfolded Loops
Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application sign...
Bin Xiao, Zili Shao, Chantana Chantrapornchai, Edw...