360 search results - page 28 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
106
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
P2P
2006
IEEE
15 years 5 months ago
2006
IEEE
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query r...
126
click to vote
MOR
2007
14 years 11 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
ICNP
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...