Ternary tree

In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2016
0519792016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Interconnect fabric requires easy integration of computational block operating with unrelated clocks. This paper presents… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 9
Is this relevant?
2011
2011
In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
In this note we consider ternary trees naturally embedded in the plane in a deterministic way such that the root has position… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
In this study, the focus was on the use of ternary tree over binary tree. Here, a new two pass Algorithm for encoding Huffman… (More)
  • table I
Is this relevant?
2010
2010
This paper considers the enumeration of ternary trees (i.e. rooted trees in which each vertex has 0 or 3 children) avoiding a… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new method for clustering based on compression. The method does not use subject-specific features or background… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Two models of algebraic decision trees have been studied. The binary model allows queries of the form ``is p(x 1 ,... , x n ) ≤ 0… (More)
Is this relevant?
1992
1992
Sorting is a significant activity for which better methods are always sought. In many computing scenarios, sorting must be done… (More)
  • figure 5
  • table 2
Is this relevant?
1979
1979
In the book of Knuth (1972) an extensive discussion can be found on some problems concerning rooted trees. Given a prescribed… (More)
  • figure 2
  • table I
  • figure 3
  • figure 4
  • figure 5
Is this relevant?