152 search results - page 28 / 31 » Minimality in a Linear Calculus with Iteration |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
CVPR
2009
IEEE
14 years 2 months ago
2009
IEEE
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...