Sciweavers

14165 search results - page 697 / 2833
» The generalized two-server problem
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 7 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
DCC
2006
IEEE
16 years 7 months ago
Practical Low Delay Broadcast of Compressed Variable Bit Rate Movies
H.264 is currently the best way to compress media to achieve high quality at low bandwidth. Since its inception, technologies such as video-on-demand are increasingly realizable. ...
Neva Cherniavsky
ICMLA
2009
16 years 4 months ago
Statistical Decision Making for Authentication and Intrusion Detection
User authentication and intrusion detection differ from standard classification problems in that while we have data generated from legitimate users, impostor or intrusion data is s...
Christos Dimitrakakis, Aikaterini Mitrokotsa
STACS
2010
Springer
16 years 2 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund