Sciweavers

179 search results - page 3 / 36
» Distributed Algorithms for Constructing a Depth-First-Search...
Sort
View
LCN
2008
IEEE
13 years 11 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
SMA
2003
ACM
120views Solid Modeling» more  SMA 2003»
13 years 10 months ago
Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
Suzanne F. Buchele, Richard H. Crawford
IPPS
2002
IEEE
13 years 10 months ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
FLAIRS
2009
13 years 3 months ago
Join Tree Propagation Utilizing Both Arc Reversal and Variable Elimination
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
Cory J. Butz, Ken Konkel, Pawan Lingras
IPPS
1998
IEEE
13 years 9 months ago
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...