Sciweavers

6251 search results - page 267 / 1251
» Randomness, Computability, and Density
Sort
View
CIE
2010
Springer
15 years 8 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
135
Voted
ASIACRYPT
2005
Springer
15 years 10 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 11 months ago
A Probabilistic Graphical Approach to Computing Electricity Price Duration Curves under Price and Quantity Competition
Abstract— The electricity price duration curve (EPDC) represents the probability distribution function of the electricity price considered as a random variable. The price uncerta...
Pascal Michaillat, Shmuel S. Oren
165
Voted
CIARP
2009
Springer
15 years 2 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
ICIP
2001
IEEE
16 years 6 months ago
Hierarchical watermarking depending on local constraints
In this paper we propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The se...
Christopher D. Coltman, Adrian G. Bors