Variable block size motion estimation (VBS-ME) is one of the contributors to H.264/AVC’s excellent coding efficiency. Due to its high computational complexity, however, VBS-ME needs acceleration for real-time high-resolution applications. This paper proposes a high throughput and cost efficient VLSI architecture for integer full-search VBS-ME in H.264/AVC. A new scan order is introduced to re-u...

Frequent Path tree (FP-tree) is a popular method to compute association rules and is faster than Aprioribased solutions in some cases. Association rule mining using FP-tree method cannot ensure entire privacy since frequency of the itemsets are required to share among participants at the first stage. Moreover, FP-tree method requires two scans of database transactions which may not be the best ...

Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...

In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-con...

Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...

In this paper we show how the two well-known integer representation theorems which are associated with the name of Zeckendorf may be generalized as dual systems by constructing colored tree sequences whose shade sets partition Z = {1, 2, . . . } . Many interesting properties of the representations can be observed directly from the tree diagrams, and the proofs of the properties can truly be sai...