Sciweavers

115 search results - page 5 / 23
» Compressed text indexes: From theory to practice
Sort
View
CCP
2011
92views more  CCP 2011»
12 years 7 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
SIGIR
2009
ACM
14 years 1 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
VLDB
2002
ACM
193views Database» more  VLDB 2002»
13 years 7 months ago
REFEREE: An Open Framework for Practical Testing of Recommender Systems using ResearchIndex
Automated recommendation (e.g., personalized product recommendation on an ecommerce web site) is an increasingly valuable service associated with many databases--typically online ...
Dan Cosley, Steve Lawrence, David M. Pennock
COMPSAC
2002
IEEE
14 years 10 days ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
IPL
2010
84views more  IPL 2010»
13 years 5 months ago
Wee LCP
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the su...
Johannes Fischer