3341 search results - page 257 / 669 » On Bounded Queries and Approximation |
335
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
166
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
148
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
239
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...