90 search results - page 6 / 18 » An improved approximation ratio for the minimum linear arran... |
IEICET
2006
13 years 7 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we study transmission schemes for a novel OFDMbased MIMO system which performs adaptive signal combining in radio-frequency (RF). Specifically, we consider the prob...
IPL
2008
13 years 7 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...