1688 search results - page 61 / 338 » The Complexity of Rationalizing Matchings |
WSCG
2001
13 years 11 months ago
2001
A procedure is described for synthesizing an image with the same texture as a given input image. To achieve this, the output image is built up by successively adding pixels select...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 10 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
Image registration is considered one of the most fundamental and crucial pre-processing tasks in digital imaging. This paper describes a fast multimodal automatic image registrati...
MICCAI
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a new method for computing elastic and plastic deformations in the context of discrete deformable model-based registration. Internal forces are estimated by ave...