3875 search results - page 341 / 775 » Approximation algorithms for the 0-extension problem |
170
click to vote
ICNP
2006
IEEE
16 years 26 days ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
161
click to vote
CSE
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
172
click to vote
WEA
2005
Springer
16 years 9 days ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
173
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper describes an optimization framework for reconstructing nonnegative image intensities from linear projections contaminated with Poisson noise. Such Poisson inverse probl...
219
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...