Sciweavers

239 search results - page 4 / 48
» A Simple Algorithm for Computing the Lempel Ziv Factorizatio...
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 6 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
MM
2009
ACM
144views Multimedia» more  MM 2009»
14 years 10 days ago
Manipulating lossless video in the compressed domain
A compressed-domain transformation is one that operates directly on the compressed format, rather than requiring conversion to an uncompressed format prior to processing. Performi...
William Thies, Steven Hall, Saman P. Amarasinghe
IJCGA
2002
73views more  IJCGA 2002»
13 years 5 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu
DCC
2006
IEEE
14 years 5 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
PRDC
2000
IEEE
13 years 10 months ago
Transient errors and rollback recovery in LZ compression
This paper analyzes the data integrity of one of the most widely used lossless data compression techniques, Lempel-Ziv (LZ) compression. In this algorithm, because the data recons...
Wei-Je Huang, Edward J. McCluskey