Sciweavers

SPIRE
2010
Springer
13 years 10 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
SPIRE
2010
Springer
13 years 10 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
SPIRE
2010
Springer
13 years 10 months ago
Text Comparison Using Soft Cardinality
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbu...
SPIRE
2010
Springer
13 years 10 months ago
Querying the Web Graph - (Invited Talk)
This paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of ...
Marc Najork
SPIRE
2010
Springer
13 years 10 months ago
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
Yoram Bachrach, Ralf Herbrich
SPIRE
2010
Springer
13 years 10 months ago
On the Hardness of Counting and Sampling Center Strings
Christina Boucher, Mohamed Omar
SPIRE
2010
Springer
13 years 10 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
SPIRE
2010
Springer
13 years 10 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro