3341 search results - page 321 / 669 » On Bounded Queries and Approximation |
148
click to vote
IH
2009
Springer
16 years 1 months ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
162
click to vote
QEST
2006
IEEE
16 years 23 days ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
151
click to vote
ICALP
2005
Springer
16 years 8 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 ...
171
click to vote
ICTCS
2005
Springer
16 years 8 days ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
161
click to vote
EOR
2006
15 years 6 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...