876 search results - page 153 / 176 » Limits on the Usefulness of Random Oracles |
126
Voted
SIGMOD
2002
ACM
16 years 25 days ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
123
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
124
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
MM
2010
ACM
15 years 27 days ago
2010
ACM
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
183
click to vote
SIGMOD
2009
ACM
16 years 28 days ago
2009
ACM
The past few decades have witnessed a chronic and widening imbalance among processor bandwidth, disk capacity, and access speed of disk. According to Amdhal's law, the perfor...