Sciweavers

1391 search results - page 83 / 279
» Optimally Sparse Frames
Sort
View
CVPR
2007
IEEE
15 years 6 months ago
Dense mirroring surface recovery from 1D homographies and sparse correspondences
In this work we recover the 3D shape of mirroring objects such as mirrors, sunglasses, and stainless steel objects. A computer monitor displays several images of parallel stripes,...
Stas Rozenfeld, Ilan Shimshoni, Michael Lindenbaum
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 11 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
AIPS
2000
15 years 1 months ago
A New Perspective on Algorithms for Optimizing Policies under Uncertainty
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
Rina Dechter
AI
2006
Springer
14 years 12 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
CORR
2007
Springer
155views Education» more  CORR 2007»
14 years 12 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian