7150 search results - page 243 / 1430 » An Approximation Algorithm for Approximation Rank |
157
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
174
click to vote
ADHOCNOW
2008
Springer
16 years 29 days ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
178
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
141
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
166
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper describes a scalable, technology-independent algorithm for the synthesis of approximate logic circuits. A low overhead, non-intrusive solution for concurrent error dete...