4894 search results - page 328 / 979 » The Guarding Problem - Complexity and Approximation |
154
click to vote
PODC
2006
ACM
16 years 19 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
193
click to vote
JMLR
2006
15 years 6 months ago
2006
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
154
click to vote
MMAS
2010
Springer
15 years 1 months ago
2010
Springer
The accuracy of atomistic-to-continuum hybrid methods can be guaranteed only for deformations where the lattice configuration is stable for both the atomistic energy and the hybrid...
160
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
191
click to vote
VLDB
2004
ACM
16 years 1 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...