1982 search results - page 22 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
IMC
2010
ACM
14 years 7 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Block-level sampling is far more efficient than true uniform-random sampling over a large database, but prone to significant errors if used to create database statistics. In this ...
GPEM
2000
14 years 9 months ago
2000
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
CRYPTO
2010
Springer
14 years 10 months ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...