66 search results - page 10 / 14 » Spatio-temporal data reduction with deterministic error boun... |
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
116
Voted
LMCS
2007
15 years 3 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
146
Voted
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
163
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
161
click to vote
CRV
2008
IEEE
15 years 10 months ago
2008
IEEE
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...