Sciweavers

82 search results - page 6 / 17
» Optimal core-sets for balls
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
GLOBECOM
2007
IEEE
14 years 1 months ago
Volume Growth and General Rate Quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu
DAM
2007
177views more  DAM 2007»
13 years 7 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
KI
2007
Springer
14 years 1 months ago
Making a Robot Learn to Play Soccer Using Reward and Punishment
In this paper, we show how reinforcement learning can be applied to real robots to achieve optimal robot behavior. As example, we enable an autonomous soccer robot to learn interce...
Heiko Müller, Martin Lauer, Roland Hafner, Sa...
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 8 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo