724 search results - page 93 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
109
click to vote
NIPS
2008
15 years 4 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
125
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
121
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
- Delays on Internet paths, especially including wireless links, can be highly variable. On the other hand, a current trend for modern TCPs is to deploy a fine-grain retransmission...
133
click to vote
CISS
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
129
click to vote
JMLR
2006
15 years 3 months ago
2006
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...