332 search results - page 37 / 67 » Space Complexity vs. Query Complexity |
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
ESOP
2009
Springer
14 years 1 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
ICTAI
2008
IEEE
14 years 4 months ago
2008
IEEE
A major challenge in building recommender systems is organizing the recommendation space since, the underlying data organization scheme has a significant impact on the overall pe...