Sciweavers

4 search results - page 1 / 1
» Embedding a Markov Chain into a Random Walk on a Permutation...
Sort
View
CPC
2004
83views more  CPC 2004»
13 years 4 months ago
Embedding a Markov Chain into a Random Walk on a Permutation Group
Using representation theory, we obtain a necessary and sufficient condition for a discrete
Steven N. Evans
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 4 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
EC
2006
163views ECommerce» more  EC 2006»
13 years 4 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 4 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin