Sciweavers

269 search results - page 10 / 54
» random 2001
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
Disparity map restoration by integration of confidence in Markov random fields models
This paper proposes some Markov Random Field (MRF) models for restoration of stereo disparity maps. The main aspect is the use of confidence maps provided by the Symmetric Multipl...
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
FSTTCS
2001
Springer
14 years 2 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
ICALP
2001
Springer
14 years 2 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
PCM
2001
Springer
130views Multimedia» more  PCM 2001»
14 years 2 months ago
Data Encryption Using MRF with an RSA Key
In a digital multimedia era, the security of multimedia over network transmission becomes a challenging issue. A strategy, combining cryptography with steganography, is investigat...
Chaur-Chin Chen
ASIACRYPT
2001
Springer
14 years 2 months ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund