5624 search results - page 225 / 1125 » On Conditional Covering Problem |
150
click to vote
ESWS
2007
Springer
16 years 23 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...
150
click to vote
ICALP
2005
Springer
16 years 3 days 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 ...
138
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...
196
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...
156
click to vote
BIS
2006
15 years 8 months ago
2006
In this paper we discuss the possible application of new concepts in web content extraction: utility assessment, utility annealing, and dynamic aggregated document generation. Aft...