43 search results - page 6 / 9 » Optimal Two-Dimensional Compressed Matching |
ASPLOS
1996
ACM
13 years 10 months ago
1996
ACM
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
DCC
2006
IEEE
14 years 6 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
DCC
2004
IEEE
14 years 6 months ago
2004
IEEE
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
TCS
2008
13 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
ICIP
2007
IEEE
14 years 27 days ago
2007
IEEE
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...