141 search results - page 10 / 29 » Bounding basis reduction properties |
ICASSP
2011
IEEE
13 years 1 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 ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
WG
2004
Springer
14 years 3 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
PAMI
2007
13 years 9 months ago
2007
—We formalize the notion of style context, which accounts for the increased accuracy of the field classifiers reported in this journal recently. We argue that style context forms...
TNN
2008
13 years 9 months ago
2008
Abstract--This paper presents a full state feedback adaptive dynamic inversion method for uncertain systems that depend nonlinearly upon the control input. Using a specialized set ...