516 search results - page 4 / 104 » Sets of k-Independent Strings |
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
VLDB
2005
ACM
14 years 29 days ago
2005
ACM
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...