948 search results - page 166 / 190 » What can we achieve by arbitrary announcements |
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
TC
2010
13 years 2 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The ability to accurately identify the network traffic associated with different P2P applications is important to a broad range of network operations including application-specifi...
EUROCRYPT
2003
Springer
14 years 23 days ago
2003
Springer
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...