Sciweavers

393 search results - page 49 / 79
» Direct Sparse Deblurring
Sort
View
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 8 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
ICASSP
2010
IEEE
13 years 8 months ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 6 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...
IJRR
2010
132views more  IJRR 2010»
13 years 5 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...