Sciweavers

235 search results - page 22 / 47
» The impact of randomization in smoothing networks
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
MST
2011
184views Hardware» more  MST 2011»
13 years 2 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 7 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
Abstract—This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence...
Ye Wang, Prakash Ishwar, Venkatesh Saligrama
UAI
2008
13 years 9 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash