Sciweavers

65 search results - page 8 / 13
» Local Enumeration Techniques for Sparse Algorithms
Sort
View
ISER
2000
Springer
147views Robotics» more  ISER 2000»
15 years 1 months ago
Incorporation of Delayed Decision Making into Stochastic Mapping
Abstract: This paper presents a technique for incorporating delayed decision making into stochastic mapping algorithms for concurrent mapping and localization. The approach explici...
John J. Leonard, Richard J. Rikoski
JMLR
2010
144views more  JMLR 2010»
14 years 4 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko
ECCV
2006
Springer
15 years 11 months ago
Modeling 3D Objects from Stereo Views and Recognizing Them in Photographs
Local appearance models in the neighborhood of salient image features, together with local and/or global geometric constraints, serve as the basis for several recent and effective...
Akash Kushal, Jean Ponce
SIAMSC
2011
151views more  SIAMSC 2011»
14 years 4 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li
CPAIOR
2006
Springer
14 years 11 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams