Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
Johan van Leeuwaarden, Dee Denteneer, Jacques Resi...
Abstract--Cognitive radio networks require fast and reliable spectrum sensing to achieve high network utilization by secondary users. Current optimization approaches to spectrum se...
The detection and estimation of signals in noisy, limited data is a problem of interest to many scientific and engineering communities. We present a mathematically justifiable, com...
In order to improve efficiency of video coding, temporal redundancy between neighboring frames can be reduced. In MPEG-2, some frames, named interframes, are predicted using a mot...