1424 search results - page 97 / 285 » The Multi-radius Cover Problem |
139
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
103
click to vote
ESWS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we propose an algorithm for personalized learning based on a user’s query and a repository of lecture subparts —i.e., learning objects— both are descr...
117
click to vote
AINA
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...
109
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
105
click to vote
ASPDAC
2004
ACM
15 years 6 months ago
2004
ACM
In the well-known "prisoners' problem", a representative example of steganography, two persons attempt to communicate covertly without alerting the warden. One appr...