Sciweavers

3495 search results - page 54 / 699
» On the random satisfiable process
Sort
View
ICIP
2007
IEEE
14 years 2 months ago
Sensitivity Analysis Attacks Against Randomized Detectors
Sensitivity analysis attacks present a serious threat to the security of popular spread spectrum watermarking schemes. Randomization of the detector is thought to increase the imm...
Maha El Choubassi, Pierre Moulin
ICIP
2009
IEEE
14 years 12 months ago
A New Random Color Filter Array With Good Spectral Properties
We propose in this work a new random pattern with R,G,B colors, which can be used to design color filter arrays (CFA) with good spectral properties, since the chrominance is modul...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 11 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
CPC
2007
101views more  CPC 2007»
13 years 10 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
ICA
2007
Springer
14 years 2 months ago
Conjugate Gamma Markov Random Fields for Modelling Nonstationary Sources
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
Ali Taylan Cemgil, Onur Dikmen