2252 search results - page 82 / 451 » Lower Bounds for Dynamic Algorithms |
118
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
113
click to vote
SIAMCO
2010
14 years 8 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
101
click to vote
CODES
2006
IEEE
15 years 7 months ago
2006
IEEE
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
123
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...