261 search results - page 23 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
103
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
130
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
118
Voted
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...