2924 search results - page 330 / 585 » Lower Bounds in Distributed Computing |
155
click to vote
EUROCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
148
click to vote
VISSYM
2004
15 years 6 months ago
2004
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
148
Voted
PVM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. MPI implementations are faced with growingly complex network configurations containing multiple network interfaces per node, NAT, or dual stacks. To implement handling l...
148
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
149
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...