1802 search results - page 229 / 361 » Sparse Computations with PEI |
100
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
123
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
108
click to vote
CONSTRAINTS
2008
15 years 1 months ago
2008
When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to th...
110
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
127
click to vote
AROBOTS
2006
15 years 1 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...