332 search results - page 4 / 67 » Space Complexity vs. Query Complexity |
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
CC
2007
Springer
13 years 9 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
SIGIR
2005
ACM
14 years 3 months ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
COCO
2001
Springer
14 years 2 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...