1457 search results - page 34 / 292 » On the Uniform Distribution of Strings |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
CSCW
2004
ACM
14 years 1 months ago
2004
ACM
Modern workplaces often bring together virtual teams where some members are collocated, and some participate remotely. We are using a simulation game to study collaborations of 10...
EVOW
2004
Springer
14 years 1 months ago
2004
Springer
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
IPPS
1998
IEEE
14 years 23 days ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...