2252 search results - page 345 / 451 » Lower Bounds for Dynamic Algorithms |
133
Voted
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
123
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
110
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
128
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
94
Voted
DRM
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...