Sciweavers

2924 search results - page 89 / 585
» Lower Bounds in Distributed Computing
Sort
View
SPAA
2009
ACM
14 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
TSP
2008
103views more  TSP 2008»
13 years 8 months ago
Bounds for Estimation of Covariance Matrices From Heterogeneous Samples
Abstract--This correspondence derives lower bounds on the meansquare error (MSE) for the estimation of a covariance matrix , using samples k = 1; . . . ; K, whose covariance matric...
Olivier Besson, Stéphanie Bidon, Jean-Yves ...
ASIACRYPT
2000
Springer
14 years 1 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
ICALP
2005
Springer
14 years 2 months ago
Online Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Leah Epstein, Meital Levy
CLUSTER
2008
IEEE
13 years 9 months ago
Translating Service Level Objectives to lower level policies for multi-tier services
Service providers and their customers agree on certain quality of service guarantees through Service Level Agreements (SLA). An SLA contains one or more Service Level Objectives (S...
Yuan Chen, Subu Iyer, Xue Liu, Dejan S. Milojicic,...