3049 search results - page 324 / 610 » On the Convergence of Bound Optimization Algorithms |
188
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
192
click to vote
TVCG
2008
15 years 5 months ago
2008
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
173
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
177
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
187
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— Recent investigations into the pricing of multiclass loss networks have shown that static prices are optimal in the asymptotic regime of many small sources. These results sugge...