402 search results - page 36 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
146
click to vote
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
134
click to vote
Publication
In this note, improvements to the non-local means
image denoising method introduced in [2], [3] are presented.
The original non-local means method replaces a noisy pixel by
the ...
116
click to vote
CONIELECOMP
2005
IEEE
15 years 8 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
130
click to vote
ACIVS
2008
Springer
15 years 9 months ago
2008
Springer
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
115
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...