Sciweavers

132 search results - page 11 / 27
» On Optimally Partitioning a Text to Improve Its Compression
Sort
View
JEA
2008
120views more  JEA 2008»
13 years 8 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
IJCAI
2007
13 years 9 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 8 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
14 years 11 days ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
CIIT
2004
13 years 9 months ago
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...
Sanjay Baberwal, Ben Choi