Sciweavers

172 search results - page 13 / 35
» Approximate low-rank factorization with structured factors
Sort
View
ICIP
1999
IEEE
14 years 10 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura
UAI
2008
13 years 10 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
IJCAI
2003
13 years 10 months ago
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
ACCV
2006
Springer
14 years 2 months ago
Fast Approximated SIFT
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
Michael Grabner, Helmut Grabner, Horst Bischof
JAT
2007
84views more  JAT 2007»
13 years 8 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...