Sciweavers

1802 search results - page 137 / 361
» Sparse Computations with PEI
Sort
View
141
Voted
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 10 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
ICASSP
2010
IEEE
15 years 2 months ago
Human detection in images via L1-norm Minimization Learning
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...
Ran Xu, Baochang Zhang, Qixiang Ye, Jianbin Jiao
PC
2010
101views Management» more  PC 2010»
14 years 11 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
142
Voted
ICRA
2008
IEEE
206views Robotics» more  ICRA 2008»
15 years 10 months ago
Memory-based learning for visual odometry
Abstract— We present and examine a technique for estimating the ego-motion of a mobile robot using memory-based learning and a monocular camera. Unlike other approaches that rely...
Richard Roberts, Hai Nguyen, Niyant Krishnamurthi,...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 9 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...