1671 search results - page 146 / 335 » On the Covering Steiner Problem |
203
click to vote
FOCS
2008
IEEE
16 years 1 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...
154
click to vote
ESWS
2007
Springer
16 years 26 days 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...
163
click to vote
AINA
2006
IEEE
16 years 23 days 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...
140
click to vote
ASPDAC
2004
ACM
15 years 10 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...
200
click to vote
DBVIS
1995
15 years 10 months ago
1995
More and more of our customers have to deal with very large datasets like elevation data and digital roadmaps covering Europe or even the entire world, very large images e.g. from...