2479 search results - page 151 / 496 » Random Event Structures |
160
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
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 ...
169
click to vote
GRC
2008
IEEE
15 years 7 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
181
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
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...
203
Voted
SIGMETRICS
2012
ACM
13 years 8 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
171
click to vote
PDP
2007
IEEE
16 years 13 days ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...