485 search results - page 69 / 97 » Iterative Bounding LAO |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
OPODIS
2010
14 years 8 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
85
Voted
WWW
2011
ACM
14 years 5 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...