97 search results - page 3 / 20 » Tight lower bounds for halfspace range searching |
161
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
134
click to vote
CCCG
2006
15 years 7 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...
210
click to vote
WADS
2007
Springer
16 years 2 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
149
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
170
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...