Sciweavers

186 search results - page 29 / 38
» The Partial Augment-Relabel Algorithm for the Maximum Flow P...
Sort
View
UAI
2004
13 years 8 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
WSNA
2003
ACM
13 years 12 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
EJWCN
2010
119views more  EJWCN 2010»
13 years 1 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
PAMI
2010
207views more  PAMI 2010»
13 years 1 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf