4255 search results - page 119 / 851 » Cover |
137
click to vote
NIPS
2007
15 years 5 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
139
click to vote
SSWMC
2004
15 years 5 months ago
2004
The goal of image steganography is to embed information in a cover image using modifications that are undetectable. In actual practice, however, most techniques produce stego imag...
143
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
174
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
154
click to vote
IPCO
2007
15 years 5 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...