12519 search results - page 354 / 2504 » Approximation Problems Categories |
335
click to vote
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
202
Voted
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
164
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
172
click to vote
CASC
2009
Springer
16 years 1 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
147
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...