2252 search results - page 130 / 451 » Lower Bounds for Dynamic Algorithms |
111
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
128
Voted
FS
2010
15 years 1 months ago
2010
We find robust model-free hedges and price bounds for options on the realized variance of [the returns on] an underlying price process. Assuming only that the underlying process ...
182
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
144
click to vote
ISCAPDCS
2007
15 years 4 months ago
2007
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
88
Voted
IPL
2008
15 years 3 months ago
2008
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...