Despite the growth of Internet and the advances in WWW technology, current methods for web users to make good use of information from so enormous web pages are not as efficient as ...
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, E...
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
We study the extraction of characteristics of user behavior in video session encoded as stochastic matrices of finite Markov chain. These behaviors are clustered using a dissimil...