9 search results - page 2 / 2 » Parallelizability of Some P-Complete Problems |
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
ICVGIP
2004
13 years 8 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
MICCAI
2010
Springer
13 years 5 months ago
2010
Springer
The 3-D reconstruction of cardiac vasculature using C-arm CT is an active and challenging field of research. In interventional environments patients often do have arrhythmic heart ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...