Sciweavers

8 search results - page 1 / 2
» The Partition Technique for Overlays of Envelopes
Sort
View
FOCS
2002
IEEE
13 years 8 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
EUROPAR
2004
Springer
13 years 9 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
ICNP
2006
IEEE
13 years 9 months ago
Mitigating Attacks Against Measurement-Based Adaptation Mechanisms in Unstructured Multicast Overlay Networks
— Many multicast overlay networks maintain application-specific performance goals such as bandwidth, latency, jitter and loss rate by dynamically changing the overlay structure ...
Aaron Walters, David John Zage, Cristina Nita-Rota...
STACS
2000
Springer
13 years 7 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
OSDI
2002
ACM
14 years 3 months ago
Secure Routing for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, a...
Miguel Castro, Peter Druschel, Ayalvadi J. Ganesh,...