2924 search results - page 200 / 585 » Lower Bounds in Distributed Computing |
130
click to vote
ICDCS
2010
IEEE
15 years 7 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
148
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
244
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
160
Voted
SOCO
2010
Springer
14 years 10 months ago
2010
Springer
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
135
Voted
ICMCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reac...