562 search results - page 36 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
96
Voted
SODA
2003
ACM
14 years 11 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
111
Voted
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
We study the cosegmentation problem where the objective
is to segment the same object (i.e., region) from a pair
of images. The segmentation for each image can be cast
using a p...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...