Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
tree construction algorithm
Description:
A computational procedure for building a tree structure, including routing or multicast trees in communication networks.
Related topics:
Algorithms and Data Compression (16%),
Peer-to-Peer Network Technologies (9%)
OpenAlex ID:
keywords/tree-construction-algorithm
On the construction of energy-efficient broadcast and multicast trees in wireless networks
2002
·
J.E. Wieselthier
, G.D. Nguyen
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
1,091
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
2002
·
Jeffrey E. Wieselthier
, Gam D. Nguyen
, et al.
·
Mobile Networks and Applications
·
363
Computing aggregates for monitoring wireless sensor networks
2003
·
J. Zhao
, R. Govindan
, et al.
·
339
A tree-based statistical language model for natural language speech recognition
1989
·
L.R. Bahl
, P.F. Brown
, et al.
·
IEEE Transactions on Acoustics Speech and Signal Processing
·
299
Tree-Based Broadcasting in Multihop Radio Networks
1987
·
Chlamtac
, Kutten
·
IEEE Transactions on Computers
·
154
Region representation: Quadtrees from binary arrays
1980
·
Hanan Samet
·
Computer Graphics and Image Processing
·
125
A Database Index to Large Biological Sequences
2001
·
Ela Hunt
, Malcolm P. Atkinson
, et al.
·
Very Large Data Bases
·
117
Building up rhetorical structure trees
1996
·
Daniel Marcu
·
National Conference on Artificial Intelligence
·
117
Free trees and bidirectional trees as representations of psychological distance
1978
·
James P Cunningham
·
Journal of Mathematical Psychology
·
109
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
2010
·
Yan Wu
, Zhoujia Mao
, et al.
·
IEEE/ACM Transactions on Networking
·
106
The giving tree: constructing trees for efficient offline and online multi-robot coverage
2008
·
The MAVERICK Group
, Noa Agmon
, et al.
·
Annals of Mathematics and Artificial Intelligence
·
101
Optimal Alphabetic Trees
1976
·
Alon Itai
·
SIAM Journal on Computing
·
85
Near-optimal routing lookups with bounded worst case performance
2002
·
P. Gupta
, B. Prabhakar
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
84
Local basis function networks for identification of a turbocharger
1996
·
O. Nelles
·
UKACC International Conference on Control
·
74
Combinatorial Merging
1976
·
Golumbic
·
IEEE Transactions on Computers
·
69
Box-Trees and R-Trees with Near-Optimal Query Time
2002
·
Agarwal
, de Berg
, et al.
·
Discrete & Computational Geometry
·
65
PDF
Supervised Hierarchical Clustering in Fuzzy Model Identification
2011
·
Benjamin Hartmann
, Oliver Banfer
, et al.
·
IEEE Transactions on Fuzzy Systems
·
57
Optimal binary search trees
1997
·
S.V. Nagaraj
·
Theoretical Computer Science
·
52
PDF
Predictive control based on local linear fuzzy models
1998
·
MARTIN FISCHER
, OLIVER NELLES
, et al.
·
International Journal of Systems Science
·
51
Extremal trees with fixed degree sequence for atom-bond connectivity index
2012
·
Rundan Xing
, Bo Zhou
·
Filomat
·
47
PDF
Path Length of Binary Search Trees
1972
·
T. C. Hu
, K. C. Tan
·
SIAM Journal on Applied Mathematics
·
43
Extremal trees with given degree sequence for the Randić index
2007
·
Hua Wang
·
Discrete Mathematics
·
42
PDF
Magnetostatics with edge elements: a numerical investigation in the choice of the tree
1994
·
N.A. Golias
, T.D. Tsiboukis
·
IEEE Transactions on Magnetics
·
39
Computing Aggregates for Monitoring Wireless Sensor Networks
2003
·
Yonggang Zhao
, Ramesh Govindan
, et al.
·
eScholarship (California Digital Library)
·
38
PDF
Height Restricted Optimal Binary Trees
1987
·
Lawrence L. Larmore
·
SIAM Journal on Computing
·
37
Show more works
View as search
Works count:
258
Citation count:
4,562
Year
Topic
Type