Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
— In order to assist surgeons during surgery on moving organs, e.g. minimally invasive beating heart bypass surgery, a master-slave system which synchronizes surgical instruments...
Thomas Bader, Alexander Wiedemann, Kathrin Roberts...