Sciweavers

1809 search results - page 12 / 362
» Weakly Computable Real Numbers
Sort
View
CIE
2009
Springer
14 years 2 months ago
Numberings and Randomness
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Paul Brodhead, Bjørn Kjos-Hanssen
CVPR
1996
IEEE
14 years 9 months ago
Epipolar Geometry and Linear Subspace Methods: A New Approach to Weak Calibration
This paper addresses the problem of estimating the epipolar geometry from point correspondences between two images taken by uncalibrated perspective cameras. It is shown that Jeps...
Jean Ponce, Yakup Genc
VLSID
2000
IEEE
164views VLSI» more  VLSID 2000»
14 years 2 hour ago
A Fast Algorithm for Computing the Euler Number of an Image and its VLSI Implementation
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...
Sabyasachi Dey, Bhargab B. Bhattacharya, Malay Kum...
CVPR
2007
IEEE
14 years 9 months ago
Mumford-Shah Meets Stereo: Integration of Weak Depth Hypotheses
Recent results on stereo indicate that an accurate segmentation is crucial for obtaining faithful depth maps. Variational methods have successfully been applied to both image segm...
Thomas Pock, Christopher Zach, Horst Bischof
ENTCS
2007
86views more  ENTCS 2007»
13 years 7 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée