2252 search results - page 93 / 451 » Lower Bounds for Dynamic Algorithms |
131
click to vote
MST
2011
14 years 8 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
113
click to vote
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
112
click to vote
TACAS
2009
Springer
15 years 8 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
116
click to vote
WSC
2007
15 years 3 months ago
2007
Recently developed dual techniques allow us to evaluate a given sub-optimal dynamic portfolio policy by using the policy to construct an upper bound on the optimal value function....
117
click to vote
CCCG
2010
15 years 3 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...