Tree (data structure)

Known as: Sibling node, Tree leaf, Root Node 
In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We consider the tree structured group Lasso where the structure over the features can be represented as a tree with leaf nodes as… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a tree data structure for fast nearest neighbor operations in general <i>n</i>-point metric spaces (where the data set… (More)
  • figure 4.1
  • figure 4.2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Mining frequent trees is very useful in domains like bioinformatics, Web mining, mining semistructured data, etc. We formulate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semistructured data, and so on. We… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A denial-of-service bandwidth attack is an attempt to disrupt an online service by generating a traffic overload that clogs links… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Most statistical and machine-learning algorithms assume that the data is a random sample drawn from a stationary distribution… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The traditional approach to representing tree structures is as a rooted, directed graph with the root node at the top of the page… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T', the distance from T to T' as measured… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
The quad tree is a data structure appropriate for storing information to be retrieved on composite keys. We discuss the specific… (More)
  • table 2
  • figure 2
  • table 3
Is this relevant?