1040 search results - page 131 / 208 » Rounding algorithms for covering problems |
JNW
2006
14 years 9 months ago
2006
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Change-point detection is the problem of discovering time points at which properties of time-series data change. This covers a broad range of real-world problems and has been acti...
105
click to vote
INFSOF
2008
14 years 9 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
JACM
2006
14 years 9 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...