321 search results - page 20 / 65 » Approximate Models for General Cache Networks |
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper develops simple cost models for provisioning content distribution networks that use the simple and highly scalable bandwidth skimming protocol for streaming. New insight...
IWANN
2001
Springer
14 years 27 days ago
2001
Springer
One of the main research concern in neural networks is to find the appropriate network size in order to minimize the trade-off between overfitting and poor approximation. In this ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
ICDCS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
SIAMJO
2011
13 years 3 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...