Sciweavers

1209 search results - page 57 / 242
» Approximation by pseudo-linear operators
Sort
View
LATIN
2010
Springer
15 years 12 days ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
ECCV
2002
Springer
16 years 3 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
IJNS
2000
130views more  IJNS 2000»
15 years 1 months ago
A Programmable VLSI Filter Architecture for Application in Real-Time Vision Processing Systems
An architecture is proposed for the realization of real-time edge-extraction filtering operation in an Address-Event-Representation (AER) vision system. Furthermore, the approach ...
Teresa Serrano-Gotarredona, Andreas G. Andreou, Be...
AAIM
2008
Springer
90views Algorithms» more  AAIM 2008»
15 years 8 months ago
Facility Location Problems: A Parameterized View
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
Michael R. Fellows, Henning Fernau
ICA
2007
Springer
15 years 8 months ago
Dictionary Learning for L1-Exact Sparse Coding
We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, b...
Mark D. Plumbley