231 search results - page 5 / 47 » Context Matching for Compressed Terms |
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
CSB
2005
IEEE
14 years 29 days ago
2005
IEEE
Microarray experiments are characterized by a massive amount of data, usually in the form of an image. Based on the nature of microarray images, we consider the microarray in term...
NIPS
2008
13 years 8 months ago
2008
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
EUSAI
2004
Springer
14 years 22 days ago
2004
Springer
Service discovery is a process of locating, or discovering, one or more documents, that describe a particular service. Most of the current service discovery approaches perform synt...
CCP
2011
12 years 7 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...