334 search results - page 24 / 67 » Boosting with structural sparsity |
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
Most existing RCL−1 circuit reductions stamp inverse inductance L−1 elements by a second-order nodal analysis (NA). The NA formulation uses nodal voltage variables and describ...
TSP
2008
13 years 8 months ago
2008
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
TIT
2010
13 years 2 months ago
2010
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In a number of signal processing applications, problem formulations based on the 1 norm as a sparsity inducing signal prior lead to simple algorithms with good performance. Howeve...