507 search results - page 28 / 102 » Computing Sparse Multiples of Polynomials |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We propose an algorithm to improve the quality of depth-maps used for Multi-View Stereo (MVS). Many existing MVS techniques make use of a two stage approach which estimates depth-m...
WACV
2005
IEEE
14 years 1 months ago
2005
IEEE
Instead of the conventional background and foreground definition, we propose a novel method that decomposes a scene into time-varying background and foreground intrinsic images. T...
ICPR
2002
IEEE
14 years 20 days ago
2002
IEEE
Abstract—A novel approach for reconstruction of sparse highresolution data from lower-resolution dense spatio-temporal data is introduced. The basic idea is to compute the dense ...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...