Sciweavers

220 search results - page 42 / 44
» Distributed Minimum Cut Approximation
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
WINE
2005
Springer
109views Economy» more  WINE 2005»
14 years 3 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
TSP
2010
13 years 4 months ago
Shrinkage algorithms for MMSE covariance estimation
We address covariance estimation in the sense of minimum mean-squared error (MMSE) when the samples are Gaussian distributed. Specifically, we consider shrinkage methods which are ...
Yilun Chen, Ami Wiesel, Yonina C. Eldar, Alfred O....
FOCS
2002
IEEE
14 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
IJAR
2008
118views more  IJAR 2008»
13 years 9 months ago
Dynamic multiagent probabilistic inference
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
Xiangdong An, Yang Xiang, Nick Cercone