85 search results - page 1 / 17 » Tight lower bounds for the size of epsilon-nets |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
CCCG
2006
13 years 9 months ago
2006
We study the problem of finding small weak -nets in three dimensions and provide new upper and lower bounds on the value of for which a weak -net of a given small constant size e...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...