Sciweavers

43 search results - page 2 / 9
» Optimal Two-Dimensional Compressed Matching
Sort
View
CCCG
2007
13 years 6 months ago
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
Peyman Afshani, Arash Farzan
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
14 years 1 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
CGO
2003
IEEE
13 years 10 months ago
Code Optimization for Code Compression
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
Milenko Drinic, Darko Kirovski, Hoi Vo
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
13 years 11 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 12 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski