The Internet network provides access to several hundreds of million sites and expands at a rate of a million pages a day. Yet, given the rapid and anarchical nature of its evoluti...
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
The Student’s-t hidden Markov model (SHMM) has been recently proposed as a robust to outliers form of conventional continuous density hidden Markov models, trained by means of t...
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
A call admission control scheme named thinning scheme, which smoothly throttles the admission rates of calls according to their priorities and aims to provide multiple prioritized ...