690 search results - page 5 / 138 » Dense Admissible Sets |
APAL
2010
13 years 7 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
APAL
2006
13 years 7 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
IJCV
2006
13 years 7 months ago
2006
We propose a new algorithm for dense optical flow computation. Dense optical flow schemes are challenged by the presence of motion discontinuities. In state of the art optical flo...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...