1433 search results - page 107 / 287 » On Covering Problems of Rado |
147
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 ...
133
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...
184
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...
148
click to vote
BIS
2006
15 years 7 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...
183
click to vote
NCI
2004
15 years 7 months ago
2004
This paper describes a method for hierarchical reinforcement learning in which high-level policies automatically discover subgoals, and low-level policies learn to specialize for ...