4066 search results - page 109 / 814 » Almost Complete Sets |
157
click to vote
VCIP
2003
15 years 7 months ago
2003
In this paper, we present a simple method to almost quadruple the spatial resolution of aliased images. From a set of four low resolution, undersampled and shifted images, a new i...
153
click to vote
RSA
2011
15 years 1 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
181
click to vote
MST
2010
15 years 4 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
156
click to vote
ECCC
2002
15 years 6 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
149
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Shape From Shading is known to be an ill-posed problem. We show in this paper that if we model the problem in a different way than it is usually done, more precisely by taking int...