Sciweavers

1503 search results - page 81 / 301
» Self-optimizing distributed trees
Sort
View
COR
2004
111views more  COR 2004»
13 years 9 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 4 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
ICDCN
2009
Springer
14 years 4 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman
IPPS
2008
IEEE
14 years 4 months ago
Junction tree decomposition for parallel exact inference
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...
Yinglong Xia, Viktor K. Prasanna
HPCC
2007
Springer
14 years 4 months ago
Quantification of Cut Sequence Set for Fault Tree Analysis
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Hai...