Results 1  10
of
16,572
Pattern Avoidance in Ternary Trees
"... This paper considers the enumeration of ternary trees (i.e., rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, for more complex trees, we compute generating funct ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper considers the enumeration of ternary trees (i.e., rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, for more complex trees, we compute generating
Embedding Ternary Trees into the Hypercube
"... We consider the complete ternary tree with k levels and its embedding as a subgraph into the binary hypercube of possibly small dimension n. The known from [3] upper bound n 2k + 1 is improved up to n 5k=3 ß 1:66k as k ! 1. 1 Introduction Denote by B n the ndimensional binary hypercube and by ..."
Abstract
 Add to MetaCart
We consider the complete ternary tree with k levels and its embedding as a subgraph into the binary hypercube of possibly small dimension n. The known from [3] upper bound n 2k + 1 is improved up to n 5k=3 ß 1:66k as k ! 1. 1 Introduction Denote by B n the ndimensional binary hypercube
Using Ternary Trees in Logic Synthesis
 WORKSHOP ČVUT
, 2011
"... We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application of bas ..."
Abstract
 Add to MetaCart
We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application
Ternary Tree & A Coding Technique
 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.9
, 2008
"... In this paper, the focus is on the use of Ternary Trees over Binary Tress. First of all, we give the memory representation for Ternary Trees. Huffman coding technique is developed using ternary trees, which benefits in computer implementation, efficient memory, compression, fast searching and error ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, the focus is on the use of Ternary Trees over Binary Tress. First of all, we give the memory representation for Ternary Trees. Huffman coding technique is developed using ternary trees, which benefits in computer implementation, efficient memory, compression, fast searching and error
Ternary Tree and MemoryEfficient Huffman Decoding Algorithm
"... In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the en ..."
Abstract
 Add to MetaCart
In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property
A NOTE ON NATURALLY EMBEDDED TERNARY TREES
"... Abstract. In this note we consider ternary trees naturally embedded in the plane in a deterministic way. The root has position zero, or in other words label zero, and the three children of a node with position j ∈ Z have positions j − 1, j, and j + 1. We derive the generating function of embedded te ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In this note we consider ternary trees naturally embedded in the plane in a deterministic way. The root has position zero, or in other words label zero, and the three children of a node with position j ∈ Z have positions j − 1, j, and j + 1. We derive the generating function of embedded
Ternary Tree Optimaliz tion for ngram Indexing
"... Abstract. Ngram indexing is used in many practical applications. Spam detection, plagiarism detection or comparison of DNA reads. There are many data structures that can be used for this purpose, each with different characteristics. In this article the ternary search tree data structure is used. On ..."
Abstract
 Add to MetaCart
Abstract. Ngram indexing is used in many practical applications. Spam detection, plagiarism detection or comparison of DNA reads. There are many data structures that can be used for this purpose, each with different characteristics. In this article the ternary search tree data structure is used
Unit Rectangle Visibility Representation of Binary and Ternary Tree
"... Abstract: The Visibility Representations [1] of a graph has been promoted for research extensively because of their significance in algorithmic graph theory as well as in VLSI layout, algorithm animation, visual languages and CASE tools etc. [2][3]. Rectangle Visibility Graph (RVG) used in VLSI chip ..."
Abstract
 Add to MetaCart
in computer chip applications. In this research, binary tree and ternary tree have been characterized as URV representations which will not only enhance URVR (Unit Rectangle Visibility Representation) but also expected to reduce both cost and labor in the field of various graph applications. To achieve this
On Embedding Ternary Trees into Boolean Hypercubes (Extended Abstract)
"... ) Ajay K. Gupta Hong Wang Department of Computer Science Department of Computer Sciences Western Michigan University Purdue University Kalamazoo, MI 49008 West Lafayette, IN 47907 1 Introduction Given two graphs G and H , an embedding ! f; g ? of G into H is defined by an injective mapping f from ..."
Abstract
 Add to MetaCart
) Ajay K. Gupta Hong Wang Department of Computer Science Department of Computer Sciences Western Michigan University Purdue University Kalamazoo, MI 49008 West Lafayette, IN 47907 1 Introduction Given two graphs G and H , an embedding ! f; g ? of G into H is defined by an injective mapping f from the nodes of G to the nodes of H together with a mapping g that maps every edge e = (v; w) of G onto a path g(e) connecting f(v) and f(w) in H . We refer to the mapping f as the assignment and for clarity reasons, we refer to the nodes of H as PEs. Three commonly and extensively studied cost measures of an embedding are the dilation, the congestion and the expansion [1, 4, 9, 13, 15, 17]. The dilation ffi is defined as the maximum distance in H between two adjacent nodes in G. The congestion of an edge in H is defined to be the number of paths passing through it, and the maximum congestion of any edge in H is the congestion of the embedding. The expansion ffl is defined to be the ratio o...
Results 1  10
of
16,572