7 search results - page 2 / 2 » Hardness of Nearest Neighbor under L-infinity |
KDD
2004
ACM
16 years 17 days ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
153
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...