Sciweavers

2924 search results - page 59 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
UmaMaheswari C. Devi, James H. Anderson
NIPS
2000
13 years 10 months ago
On Reversing Jensen's Inequality
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
Tony Jebara, Alex Pentland
SPAA
2010
ACM
14 years 1 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
FS
2006
102views more  FS 2006»
13 years 9 months ago
Bounds for Functions of Dependent Risks
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
Paul Embrechts, Giovanni Puccetti
PODC
2009
ACM
14 years 9 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer