562 search results - page 56 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
148
click to vote
DAM
2007
15 years 6 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
140
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
147
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
152
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
157
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...