Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,588,516 papers from all fields of science
Search
Sign In
Create Free Account
Tree (data structure)
Known as:
Sibling node
, Tree leaf
, Root Node
Expand
In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract data type
Adaptive k-d tree
Adjacency list
Binary tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Energy efficient green routing protocol for Internet of Multimedia Things
S. Alvi
,
G. Shah
,
Waqar Mahmood
International Conference on Intelligent Sensors…
2015
Corpus ID: 17515906
Internet of Things (IoT) envisions the notion of ubiquitous connectivity of `everything'. However, the current research and…
Expand
Highly Cited
2010
Highly Cited
2010
An Energy Aware Routing Protocol with Sleep Scheduling for Wireless Sensor Networks
Amulya Ratna Swain
,
R. Hansdah
,
V. Chouhan
24th IEEE International Conference on Advanced…
2010
Corpus ID: 14561971
Wireless Sensor Networks (WSNs) consist of a large number of small and low cost sensor nodes powered by small batteries and…
Expand
Highly Cited
2007
Highly Cited
2007
Figure-ground segmentation using a hierarchical conditional random field
Jordan Reynolds
,
Kevin P. Murphy
Canadian Conference on Computer and Robot Vision
2007
Corpus ID: 1676517
We propose an approach to the problem of detecting and segmenting generic object classes that combines three "off the shelf…
Expand
Highly Cited
2007
Highly Cited
2007
Learning the Taxonomy and Models of Categories Present in Arbitrary Images
N. Ahuja
,
S. Todorovic
IEEE International Conference on Computer Vision
2007
Corpus ID: 13240424
This paper proposes, and presents a solution to, the problem of simultaneous learning of multiple visual categories present in an…
Expand
Highly Cited
2006
Highly Cited
2006
Symbolic Execution Techniques for Test Purpose Definition
Christophe Gaston
,
P. L. Gall
,
Nicolas Rapin
,
A. Touil
International Conference on Testing (of Software…
2006
Corpus ID: 16470772
We propose an approach to test whether a system conforms to its specification given in terms of an Input/Output Symbolic…
Expand
Highly Cited
2004
Highly Cited
2004
Practical Suffix Tree Construction
Sandeep Tata
,
R. Hankins
,
J. Patel
Very Large Data Bases Conference
2004
Corpus ID: 14144538
Highly Cited
2002
Highly Cited
2002
Language Models and Structured Document Retrieval
Paul Ogilvie
,
Jamie Callan
INEX Workshop
2002
Corpus ID: 13511648
We discuss possibilities for the use of language models in structured document retrieval. We use a tree-based generative language…
Expand
Highly Cited
1997
Highly Cited
1997
Computing Optimized Rectilinear Regions for Association Rules
K. Yoda
,
T. Fukuda
,
Y. Morimoto
,
S. Morishita
,
T. Tokuyama
Knowledge Discovery and Data Mining
1997
Corpus ID: 10892081
We address the problem of finding useful regions for two-dimensional association rules and decision trees. In a previous paper we…
Expand
Highly Cited
1992
Highly Cited
1992
Changes in dry weight and nitrogen partitioning induced by elevated CO2 depend on soil nutrient availability in sweet chestnut (Castanea sativa Mill)
A. Kohen
,
H. Rouhier
,
M. Mousseau
1992
Corpus ID: 59290465
On a etudie l'effet d'un doublement de la concentration en CO 2 de l'atmosphere (soit 350 vpm, teneur actuelle et 700 vpm) sur la…
Expand
Highly Cited
1990
Highly Cited
1990
Two Principles of Parse Preference
Jerry R. Hobbs
,
J. Bear
International Conference on Computational…
1990
Corpus ID: 1502797
The DIALOGIC system for syntactic analysis and semantic translation has been under development for over ten years, and during…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE