Sciweavers

6251 search results - page 206 / 1251
» Randomness, Computability, and Density
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Stereo matching using random walks
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
Rui Shen, Irene Cheng, Xiaobo Li, Anup Basu
DSN
2006
IEEE
15 years 10 months ago
Randomized Intrusion-Tolerant Asynchronous Services
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ICMCS
2005
IEEE
87views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Correlation-based model of color picture watermarking against random geometric distortion
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
Isao Echizen, Yasuhiro Fujii, Takaaki Yamada, Sato...
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
OPNETEC
2004
Springer
15 years 9 months ago
Routing and Wavelength Assignment for Scheduled and Random Lightpath Demands: Bifurcated Routing versus Non-Bifurcated Routing
: We consider the routing and the wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength switching mesh network without wavelength conversion functio...
Mohamed Koubàa, Nicolas Puech, Maurice Gagn...