27 search results - page 1 / 6 » Interval Stabbing Problems in Small Integer Ranges |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
STOC
2003
ACM
14 years 10 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...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
ICALP
1999
Springer
14 years 1 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
JDA
2011
13 years 4 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...