2924 search results - page 331 / 585 » Lower Bounds in Distributed Computing |
137
Voted
PE
2002
Springer
15 years 4 months ago
2002
Springer
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
158
click to vote
ACSAC
2010
IEEE
14 years 8 months ago
2010
IEEE
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
176
Voted
ICDT
2012
ACM
13 years 7 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
168
click to vote
TCS
2010
15 years 3 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
139
click to vote
PPOPP
2009
ACM
16 years 5 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...