Sciweavers

1806 search results - page 118 / 362
» Randomness and halting probabilities
Sort
View
ICC
2007
IEEE
288views Communications» more  ICC 2007»
14 years 4 months ago
Joint Channel State Based Random Access and Adaptive Modulation in Wireless LAN with Multi-Packet Reception
—Conventional 802.11 medium access control (MAC) characteristics. In particular, all of these designs adopted a protocols have been designed separately from the characteristics s...
Wei Lan Huang, Khaled Ben Letaief, Ying Jun Zhang
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 11 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 10 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
EMMCVPR
2007
Springer
14 years 4 months ago
Bayesian Inference for Layer Representation with Mixed Markov Random Field
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
Ru-Xin Gao, Tianfu Wu, Song Chun Zhu, Nong Sang
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin