Sciweavers

65 search results - page 6 / 13
» Lower Bounds for Lucas Chains
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 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
ECCC
2010
87views more  ECCC 2010»
13 years 4 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
INFOCOM
1990
IEEE
13 years 11 months ago
Fault Tolerance of a Class of Double-Loop Networks
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
Jon M. Peha, Fouad A. Tobagi
IJBRA
2006
107views more  IJBRA 2006»
13 years 7 months ago
Probabilistic models for biological sequences: selection and Maximum Likelihood estimation
: Probabilistic models for biological sequences (DNA and proteins) are frequently used in bioinformatics. We describe statistical tests designed to detect the order of dependency a...
Svetlana Ekisheva, Mark Borodovsky