2924 search results - page 106 / 585 » Lower Bounds in Distributed Computing |
122
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
115
Voted
EUROCRYPT
2003
Springer
15 years 5 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
CLUSTER
2008
IEEE
15 years 7 months ago
2008
IEEE
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
114
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
104
Voted
PPOPP
2006
ACM
15 years 6 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...