Sciweavers

250 search results - page 36 / 50
» Reorganizing compressed text
Sort
View
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
13 years 11 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
LREC
2008
143views Education» more  LREC 2008»
13 years 8 months ago
Condensing Sentences for Subtitle Generation
Text condensation aims at shortening the length of an utterance without losing essential textual information. In this paper, we report on the implementation and preliminary evalua...
Prokopis Prokopidis, Vassia Karra, Aggeliki Papagi...
LREC
2008
130views Education» more  LREC 2008»
13 years 8 months ago
Detecting Co-Derivative Documents in Large Text Collections
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...
Jan Pomikálek, Pavel Rychlý
MOBISYS
2003
ACM
14 years 7 months ago
Energy Aware Lossless Data Compression
Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to re...
Kenneth C. Barr, Krste Asanovic
SPIRE
2009
Springer
14 years 1 months ago
A Two-Level Structure for Compressing Aligned Bitexts
A bitext, or bilingual parallel corpus, consists of two texts, each one in a different language, that are mutual translations. Bitexts are very useful in linguistic engineering bec...
Joaquín Adiego, Nieves R. Brisaboa, Miguel ...