562 search results - page 93 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
STOC
1997
ACM
14 years 20 days ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
SIAMCOMP
1998
13 years 8 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...