562 search results - page 69 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
128
click to vote
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
100
click to vote
ECCC
2000
14 years 9 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
116
click to vote
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....