Sciweavers

1523 search results - page 23 / 305
» The Computational Complexity of Linear Optics
Sort
View
CVPR
1999
IEEE
14 years 9 months ago
Explaining Optical Flow Events with Parameterized Spatio-Temporal Models
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
Michael J. Black
ICPR
2000
IEEE
13 years 11 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 8 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
JC
2011
87views more  JC 2011»
13 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski