Compatibility between Three Well-Known Broadcast Tree Construction Algorithms and Various Metrics

Chuan Han; Yaling Yang

doi:10.1109/tmc.2010.228

WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations

IEICE Transactions on Communications ◽

10.1587/transcom.e93.b.2282 ◽

2010 ◽

Vol E93-B (9) ◽

pp. 2282-2290

Author(s):

Tsutomu MAKABE ◽

Taiju MIKOSHI ◽

Toyofumi TAKENAKA

Keyword(s):

Multicast Tree ◽

Tree Construction ◽

Construction Algorithms ◽

Multicast Tree Construction

Download Full-text

OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA

Parallel Processing Letters ◽

10.1142/s0129626496000054 ◽

1996 ◽

Vol 06 (01) ◽

pp. 35-44 ◽

Cited By ~ 5

Author(s):

DANY BRESLAUER ◽

RAMESH HARIHARAN

Keyword(s):

Parallel Algorithms ◽

Data Structures ◽

Suffix Tree ◽

Finite Automata ◽

Suffix Trees ◽

Deterministic Finite Automata ◽

Tree Construction ◽

Parallel Construction ◽

Construction Algorithms

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Download Full-text

Normalized L1 regularization for axis-oblique tree construction algorithms

2017 IEEE Symposium Series on Computational Intelligence (SSCI) ◽

10.1109/ssci.2017.8280892 ◽

2017 ◽

Cited By ~ 1

Author(s):

Julian Belz ◽

Oliver Nelles

Keyword(s):

L1 Regularization ◽

Tree Construction ◽

Construction Algorithms

Download Full-text

Suffix tree construction algorithms on modern hardware

Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10 ◽

10.1145/1739041.1739075 ◽

2010 ◽

Cited By ~ 7

Author(s):

Dimitris Tsirogiannis ◽

Nick Koudas

Keyword(s):

Suffix Tree ◽

Tree Construction ◽

Construction Algorithms

Download Full-text

Data Aggregation Tree Construction: Algorithms and Challenges

Wireless Sensor Networks ◽

10.5772/38730 ◽

2011 ◽

Author(s):

Zahra Eskandari ◽

Fatemeh Ayughi

Keyword(s):

Data Aggregation ◽

Tree Construction ◽

Aggregation Tree ◽

Construction Algorithms

Download Full-text

A novel expert system for the prediction of accurate multiple sequence alignment and phylogenetic tree construction algorithms

2017 IEEE AFRICON ◽

10.1109/afrcon.2017.8095462 ◽

2017 ◽

Author(s):

Fanaja Harianja Randriamahenintsoa ◽

Toky Hajatiana Raboanary ◽

Heriniaina Andry Raboanary ◽

Julien Amedee Raboanary

Keyword(s):

Expert System ◽

Phylogenetic Tree ◽

Sequence Alignment ◽

Multiple Sequence Alignment ◽

Multiple Sequence ◽

Phylogenetic Tree Construction ◽

Tree Construction ◽

Construction Algorithms

Download Full-text

Efficient Routing Tree Construction Algorithms for Multi-Channel WiMax Networks

2007 16th International Conference on Computer Communications and Networks ◽

10.1109/icccn.2007.4317941 ◽

2007 ◽

Cited By ~ 3

Author(s):

Alireza Ghiamatyoun ◽

Mohammad Nekoui ◽

Said Nader Esfahani ◽

Mehdi Soltan

Keyword(s):

Wimax Networks ◽

Tree Construction ◽

Routing Tree ◽

Construction Algorithms

Download Full-text

Performance comparisons of the routing tree construction algorithms for IEEE 802.16 centralized scheduling mesh networks

2014 Sixth International Conference on Ubiquitous and Future Networks (ICUFN) ◽

10.1109/icufn.2014.6876745 ◽

2014 ◽

Author(s):

Po-Yuan Wang ◽

Shih-Tsung Liang

Keyword(s):

Mesh Networks ◽

Ieee 802.16 ◽

Tree Construction ◽

Centralized Scheduling ◽

Routing Tree ◽

Construction Algorithms ◽

Performance Comparisons

Download Full-text

Effective location-guided tree construction algorithms for small group multicast in MANET

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies ◽

10.1109/infcom.2002.1019368 ◽

2003 ◽

Cited By ~ 112

Author(s):

K. Chen ◽

K. Nahrstedt

Keyword(s):

Small Group ◽

Tree Construction ◽

Construction Algorithms

Download Full-text

Optimal Parallel Construction of Minimal Suffix and Factor Automata

BRICS Report Series ◽

10.7146/brics.v2i16.19884 ◽

1995 ◽

Vol 2 (16) ◽

Author(s):

Dany Breslauer ◽

Ramesh Hariharan

Keyword(s):

Parallel Algorithms ◽

Data Structures ◽

Suffix Tree ◽

Finite Automata ◽

Suffix Trees ◽

Deterministic Finite Automata ◽

Tree Construction ◽

Parallel Construction ◽

Construction Algorithms

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Download Full-text