Sciweavers

657 search results - page 14 / 132
» Recovering architectural assumptions
Sort
View
TIT
2010
130views Education» more  TIT 2010»
14 years 8 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ICDCS
2006
IEEE
15 years 7 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld
127
Voted
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 11 days ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
ECCV
1994
Springer
16 years 3 months ago
Recursive Non-Linear Estimation of Discontinuous Flow Fields
Abstract. This paper de nes a temporal continuity constraint that expresses assumptions about the evolution of 2D image velocity, or optical ow, over a sequence of images. Temporal...
Michael J. Black
104
Voted
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 1 months ago
Data Fusion Trees for Detection: Does Architecture Matter?
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win