Sciweavers

74 search results - page 10 / 15
» Improved Approximate String Matching Using Compressed Suffix...
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
Dither-modulation data hiding with distortion-compensation: exact performance analysis and an improved detector for JPEG attacks
The binary Distortion Compensated Dither-Modulation (DCDM), which can be regarded to as a baseline for quantizationbased data-hiding methods, is rigorously analyzed. A novel and a...
Félix Balado, Fernando Pérez-Gonz&aa...
DCC
2008
IEEE
15 years 3 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson
VLDB
2003
ACM
147views Database» more  VLDB 2003»
15 years 9 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
FOCS
2000
IEEE
15 years 1 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
JDA
2008
87views more  JDA 2008»
14 years 9 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...