315 search results - page 45 / 63 » Cell-probe lower bounds for the partial match problem |
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
SIGIR
1998
ACM
13 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
PVLDB
2010
13 years 5 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...