Sciweavers

388 search results - page 52 / 78
» Robust Lower Bounds for Communication and Stream Computation
Sort
View
ICPADS
1998
IEEE
15 years 10 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
SPDP
1991
IEEE
15 years 9 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
TOG
2012
237views Communications» more  TOG 2012»
13 years 8 months ago
An algebraic model for parameterized shape editing
We present an approach to high-level shape editing that adapts the structure of the shape while maintaining its global characteristics. Our main contribution is a new algebraic mo...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel, V...
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
172
Voted
CCS
2010
ACM
15 years 6 months ago
Recruiting new tor relays with BRAIDS
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a lar...
Rob Jansen, Nicholas Hopper, Yongdae Kim