Sciweavers

6274 search results - page 201 / 1255
» From query complexity to computational complexity
Sort
View
133
Voted
CVPR
1996
IEEE
16 years 6 months ago
Minimal operator set for passive depth from defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
Masahiro Watanabe, Shree K. Nayar
166
Voted
CVPR
2011
IEEE
14 years 12 months ago
FlowBoost - Appearance Learning from Sparsely Annotated Video
We propose a new learning method which exploits temporal consistency to successfully learn a complex appearance model from a sparsely labeled training video. Our approach consists...
Karim Ali, Francois Fleuret, David Hasler
ECCV
1998
Springer
16 years 6 months ago
From Regular Images to Animated Heads: A Least Squares Approach
Abstract. We show that we can e ectively t arbitrarily complex animation models to noisy image data. Our approach is based on leastsquares adjustment using of a set of progressivel...
Pascal Fua, C. Miccio
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 4 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
VLDB
1991
ACM
111views Database» more  VLDB 1991»
15 years 8 months ago
The Power of Methods With Parallel Semantics
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
Karl Denninghoff, Victor Vianu