1566 search results - page 126 / 314 » On a Cone Covering Problem |
147
click to vote
ESWS
2007
Springer
16 years 18 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...
160
click to vote
AINA
2006
IEEE
16 years 15 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...
148
click to vote
ICALP
2005
Springer
15 years 12 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 ...
136
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...
189
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...