876 search results - page 170 / 176 » Limits on the Usefulness of Random Oracles |
105
Voted
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
112
click to vote
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
123
click to vote
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
113
click to vote
USENIX
2007
15 years 3 months ago
2007
Current disk prefetch policies in major operating systems track access patterns at the level of the file abstraction. While this is useful for exploiting application-level access...
105
click to vote
ACL
1994
15 years 2 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...