367 search results - page 46 / 74 » Tight lower bounds for the online labeling problem |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
COMPGEOM
2004
ACM
14 years 29 days ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
JCO
2007
13 years 7 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
JDA
2006
13 years 7 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...