Sciweavers

379 search results - page 28 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
14 years 8 months ago
Using nondeterminism to amplify hardness
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
Alexander Healy, Salil P. Vadhan, Emanuele Viola
GLOBECOM
2008
IEEE
14 years 2 months ago
Adaptive Multicast Tree Construction for Elastic Data Streams
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
Ying Zhu, Ken Q. Pu
ICC
2009
IEEE
165views Communications» more  ICC 2009»
13 years 5 months ago
Coding-Aware Scheduling for Reliable Many-to-One Flows
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
Osameh M. Al-Kofahi, Ahmed E. Kamal
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
On Optimal Single-Item Auctions
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...
Christos H. Papadimitriou, George Pierrakos
TISSEC
2010
115views more  TISSEC 2010»
13 years 2 months ago
A Simple and Generic Construction of Authenticated Encryption with Associated Data
We revisit the problem of constructing a protocol for performing authenticated encryption with associated data (AEAD). A technique is described which combines a collision resistant...
Palash Sarkar