— As people move through their environments, they do not move randomly. Instead, they are often engaged in typical motion patterns, related to specific locations they might be i...
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
In this paper, ranging process in IEEE 802.16e OFDMA systems is analyzed and performance is evaluated. Ranging process provides initial network entry, uplink synchronization, and ...
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...