649 search results - page 3 / 130 » An Improved Construction of Progression-Free Sets |
SODA
1997
ACM
14 years 11 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
DMIN
2009
14 years 7 months ago
2009
- This paper demonstrates how methods borrowed from information fusion can improve the performance of a classifier by constructing (i.e., fusing) new features that are combinations...
COMBINATORICS
2007
14 years 10 months ago
2007
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
COMBINATORICS
2006
14 years 10 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...