Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
SummaryThe quad tree is a data structure appropriate for storing information to be retrieved on composite keys. We discuss the… Expand
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1980
Highly Cited
1980
This second edition is throughly revised and corrected to take account of the many changes in the subject over the last 6 years… Expand
Is this relevant?
Highly Cited
1959
Highly Cited
1959
  • E. Dijkstra
  • Numerische Mathematik
  • 1959
  • Corpus ID: 123284777
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We… Expand
Is this relevant?