3415 search results - page 315 / 683 » Lower bounds on kernelization |
214
click to vote
COMPGEOM
2004
ACM
16 years 25 days ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
151
click to vote
COMPGEOM
2004
ACM
16 years 25 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...
193
click to vote
ICALP
2004
Springer
16 years 24 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
195
click to vote
ISAAC
2004
Springer
16 years 23 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
186
click to vote
FOCS
2003
IEEE
16 years 21 days ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...