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â€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

- B. Fei, Jinbai Liu
- IEEE Transactions on Neural Networks
- 2006

We present a new architecture named Binary Tree of support vector machine (SVM), or BTS, in order to achieve high classificationâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Gerth StÃ¸lting Brodal, Rolf Fagerberg, Riko Jacob
- SODA
- 2002

We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farachâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Yun-Chih Chang, Yao-Wen Chang, Guang-Ming Wu, Shu-Wei Wu
- DAC
- 2000

We present in this paper an efficient, flexible, and effective data structure, <italic>B<supscrpt>*</supscrpt>-trees</italic> forâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Jean-Louis Loday, O. Ronco
- 1997

is a sub-Hopf algebra. There is a basis Qn of Soln such that the composite map k[Qn]&Soln k[Sn] has the following property: itsâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens
- IEEE Trans. Information Theory
- 1995

We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Usingâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Thilo Hafer, Wolfgang Thomas
- ICALP
- 1987

In this paper we study the expressive power of the full branching time logic CTL* (of Clarke, Emerson, Halpern and Sistla), byâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- William C. Thibault, Bruce F. Naylor
- SIGGRAPH
- 1987

We introduce a new representation for polyhedra by showing how Binary Space Partitioning Trees (BSP trees) can be used toâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Naofumi Takagi, Hiroto Yasuura, Shuzo Yajima
- IEEE Transactions on Computers
- 1985

A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integerâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Philippe Flajolet, Andrew M. Odlyzko
- J. Comput. Syst. Sci.
- 1982

The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stackâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Rudolf Bayer
- Acta Informatica
- 1972

A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keysâ€¦Â (More)

Is this relevant?