4212 search results - page 215 / 843 » On Compressible Pairings and Their Computation |
200
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
159
click to vote
SPIRE
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
239
click to vote
CASES
2004
ACM
16 years 1 days ago
2004
ACM
Title of thesis: MEMORY OVERFLOW PROTECTION FOR EMBEDDED SYSTEMS USING RUN-TIME CHECKS, REUSE AND COMPRESSION Surupa Biswas, Master of Science, 2004 Thesis directed by: Assistant ...
177
click to vote
CSREAESA
2003
15 years 8 months ago
2003
Future embedded systems (ES) will offer higher computation capacity than existing embedded systems. New applications of these ES require more and more memory resources and more an...
165
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...