Sciweavers

452 search results - page 8 / 91
» A convex optimization approach to the mode acceleration prob...
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
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...
Carl Olsson, Magnus Oskarsson
FPL
1998
Springer
99views Hardware» more  FPL 1998»
13 years 12 months ago
Exploiting Contemporary Memory Techniques in Reconfigurable Accelerators
This paper discusses the memory interface of custom computing machines. We present a high speed parallel memory for the MoM-PDA machine, which is based on the Xputer paradigm. The ...
Reiner W. Hartenstein, Michael Herz, Thomas Hoffma...
CGO
2003
IEEE
14 years 1 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
PAMI
2011
13 years 2 months ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev
ICASSP
2009
IEEE
13 years 5 months ago
Comparison of convex combination and affine combination of adaptive filters
In the area of combination of adaptive filters, two main approaches, namely convex and affine combinations have been introduced. In this article, the relation between these two ap...
Alper T. Erdogan, Suleyman Serdar Kozat, Andrew C....