153 search results - page 11 / 31 » On the Optimal Compression of Sets in PSPACE |
100
click to vote
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...
ESA
2010
Springer
15 years 17 days ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
107
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
100
click to vote
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we investigate the benefits of a flexible, application-specific instruction set by adding a run-time Reconfigurable Functional Unit (RFU) to a VLIW processor. Preli...
129
click to vote
TIT
2010
14 years 6 months ago
2010
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...