Sciweavers

1207 search results - page 37 / 242
» On distributed optimization using generalized gossip
Sort
View
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
15 years 4 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
156
Voted
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
13 years 8 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
107
Voted
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 4 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
83
Voted
WSC
2004
15 years 1 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
IFL
2004
Springer
131views Formal Methods» more  IFL 2004»
15 years 6 months ago
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
Alfredo Cristóbal-Salas, Andrey Chernykh, E...