Sciweavers

630 search results - page 19 / 126
» Hardness results for approximating the bandwidth
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
89
Voted
DASFAA
2008
IEEE
106views Database» more  DASFAA 2008»
15 years 4 months ago
Flood Little, Cache More: Effective Result-Reuse in P2P IR Systems
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...
Christian Zimmer, Srikanta J. Bedathur, Gerhard We...
CN
2007
88views more  CN 2007»
14 years 9 months ago
Channel sharing by multi-class rate adaptive streams: Performance region and optimization
We consider the problem of channel sharing by rate adaptive streams belonging to various classes. The performance measure per class is the average scaled bandwidth allocated to co...
Nikos Argiriou, Leonidas Georgiadis
ACSC
2006
IEEE
15 years 3 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 2 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans