818 search results - page 122 / 164 » Network bargaining: algorithms and structural results |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
In online content voting networks, aggregate user activities (e.g., submitting and rating content) make high-quality content thrive through the unprecedented scale, high dynamics ...
CIA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Recent advances in peer to peer (P2P) search algorithms have presented viable structured and unstructured approaches for full-text search. We posit that these existing ap...
MICCAI
2006
Springer
14 years 8 months ago
2006
Springer
The concept of the Logarithm of the Odds (LogOdds) is frequently used in areas such as artificial neural networks, economics, and biology. Here, we utilize LogOdds for a shape repr...