Skip to search formSkip to main contentSkip to account menu

Binary tree

Known as: Binary, Left child, Bifurcating arborescence 
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
It's an basic requirement in cloud computing that scheduling virtual resources to physical resources with balance load, however… 
2008
2008
Efficient forest management increases the demand for detailed, timely information. High spatial resolution remotely sensed… 
Highly Cited
2004
Highly Cited
2004
An integrated circuit combining single-walled carbon nanotube (SWNT) devices with n-channel metal oxide semiconductor (NMOS… 
Review
2004
Review
2004
The Novamente AI Engine is briefly reviewed. The overall architecture is unique, drawing on system-theoretic ideas regarding… 
2002
2002
In the animation of deformable objects, collision detection and response are crucial for the performance. Contrary to volumetric… 
1998
1998
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of… 
1997
1997
This paper presents a new method for similarity retrieval of 3D surface segments in spatial database systems as used in molecular… 
1996
1996
A linear decision binary tree structure is proposed in constructing piecewise linear classifiers with the genetic algorithm (GA… 
Highly Cited
1986
Highly Cited
1986
A new modular, fault-tolerant scheme is proposed for the binary tree architecture. The approach uses redundant modular fault… 
1958
1958
This paper presents one phase of a cooperative field experiment dealing with the effects of nitrogen and irrigation treatments on…