516 search results - page 1 / 104 » Sets of k-Independent Strings |
IJFCS
2010
13 years 3 months ago
2010
AGI
2011
12 years 9 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
GBRPR
2007
Springer
13 years 9 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
DEBU
2010
13 years 5 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...