2200 search results - page 252 / 440 » Bloch's Constant is Computable |
225
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
168
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
185
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
215
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
193
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Image matting is the task of estimating a fore- and background
layer from a single image. To solve this ill posed
problem, an accurate modeling of the scene’s appearance
is ne...