Sciweavers

170 search results - page 10 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
AHS
2006
IEEE
124views Hardware» more  AHS 2006»
15 years 3 months ago
Embedded Reconfigurable Array Fabrics for Efficient Implementation of Image Compression Techniques
The discrete wavelet Transform (DWT), as defined by the Image Compression Standard JPEG-2000, is one of the most time-consuming computations which cannot be efficiently executed o...
Sajid Baloch, Tughrul Arslan, Adrian Stoica
CNIS
2006
14 years 11 months ago
Towards effective packet classification
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
Yaxuan Qi, Jun Li
91
Voted
COCOON
2008
Springer
14 years 11 months ago
Damaged BZip Files Are Difficult to Repair
bzip is a program written by Julian Seward that is often used under Unix to compress single files. It splits the file into blocks which are compressed individually using a combinat...
Christian Hundt, Ulf Ochsenfahrt
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
SPIRE
2005
Springer
15 years 3 months ago
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
Inbok Lee, Yoan José Pinzón Ardila