150
click to vote
CIDR
15 years 3 months ago
2003 
With the rapid increase in the use of inexpensive, location-aware sensors in a variety of new applications, large amounts of time-sequenced location data will soon be accumulated....
131
click to vote
ISAAC
15 years 7 months ago
2003 Springer 
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
246
click to vote
STOC
16 years 2 months ago
2003 ACM 
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
158
click to vote
ESA
15 years 7 months ago
2003 Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
116
Voted
STOC
16 years 2 months ago
2003 ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
|
Algorithms