Sciweavers

11565 search results - page 74 / 2313
» Computing Minimal Mappings
Sort
View
107
Voted
ENTCS
2007
91views more  ENTCS 2007»
15 years 3 months ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán
CVPR
2004
IEEE
16 years 5 months ago
A Variational Approach to Scene Reconstruction and Image Segmentation from Motion-Blur Cues
In this paper we are interested in the joint reconstruction of geometry and photometry of scenes with multiple moving objects from a collection of motion-blurred images. We make s...
Paolo Favaro, Stefano Soatto
148
Voted
SIGGRAPH
1999
ACM
15 years 8 months ago
Pattern-Based Texturing Revisited
We present a texturing method that correctly maps homogeneous non-periodic textures to arbitrary surfaces without any of the difficulties usually encountered using existing tools...
Fabrice Neyret, Marie-Paule Cani