Sciweavers

441 search results - page 33 / 89
» A Method for Proving Observational Equivalence
Sort
View
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
CORR
2011
Springer
209views Education» more  CORR 2011»
13 years 18 days ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 3 months ago
Estimation of non-stationary Markov Chain transition models
— Many decision systems rely on a precisely known Markov Chain model to guarantee optimal performance, and this paper considers the online estimation of unknown, nonstationary Ma...
Luca F. Bertuccelli, Jonathan P. How
WACV
2008
IEEE
14 years 3 months ago
Mosaicfaces: a discrete representation for face recognition
Most face recognition algorithms use a “distancebased” approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are b...
Jania Aghajanian, Simon J. D. Prince
PAMI
2007
131views more  PAMI 2007»
13 years 8 months ago
Photo-Consistent Reconstruction of Semitransparent Scenes by Density-Sheet Decomposition
—This paper considers the problem of reconstructing visually realistic 3D models of dynamic semitransparent scenes, such as fire, from a very small set of simultaneous views (eve...
Samuel W. Hasinoff, Kiriakos N. Kutulakos