320 search results - page 6 / 64 » A New Compression Method with Fast Searching on Large Databa... |
CPM
1999
Springer
13 years 11 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
TSP
2008
13 years 5 months ago
2008
A new hierarchical nonparametric Bayesian framework is proposed for the problem of multi-task learning (MTL) with sequential data. The models for multiple tasks, each characterize...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
IR
2007
13 years 7 months ago
2007
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...