Sciweavers

441 search results - page 52 / 89
» A Method for Proving Observational Equivalence
Sort
View
IJCV
2007
120views more  IJCV 2007»
13 years 8 months ago
Projective Visual Hulls
This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersect...
Svetlana Lazebnik, Yasutaka Furukawa, Jean Ponce
TIT
2008
84views more  TIT 2008»
13 years 7 months ago
A Note on Rate-Distortion Functions for Nonstationary Gaussian Autoregressive Processes
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
Robert M. Gray, Takeshi Hashimoto
CVPR
2011
IEEE
13 years 4 months ago
Scene Flow Estimation by Growing Correspondence Seeds
A simple seed growing algorithm for estimating scene flow in a stereo setup is presented. Two calibrated and synchronized cameras observe a scene and output a sequence of image p...
Jan Cech, Jordi Sanchez-Riera, Radu Horaud
FSTTCS
1998
Springer
14 years 1 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
MICAI
2000
Springer
14 years 13 days ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green