Efficient construction of Optimal Binary Search Trees using Data Preprocessing to improve Quality and Attribute Post computing to save Space and time through modified Dynamic Programming Technique
Journal Title: International Journal on Computer Science and Engineering - Year 2016, Vol 8, Issue 1
Abstract
There are various methods of handling Optimal Binary search trees in order to improve the performance. One of the methods is Dynamic programming which incurs O(n3) time complexity to store involved computations in a table. The data mining technique called Data Preprocessing is used to remove noise early in the data and enhance consistency of given data. The data postcomputing (opposite to Data Preprocessing) is applied using dynamic programming principle which starts with only required data and computes only the necessary attributes required to construct Optimal Binary Search Tree with time complexity O(n) if there are n identifiers / integers / any complex objects. This approach avoids computing all table attributes. Hence, the complexity or cost of Data post computing using Dynamic Programming is proved to be less than O(n3) or even less than specified in some cases with experimental results.
Authors and Affiliations
S. Hrushikesava Raju , Dr. T. Swarna Latha
Keywords
Related Articles
- EP ID EP138434
- DOI -
- Views 116
- Downloads 0
Recognition of Isolated Handwritten Kannada Numerals based on Decision Fusion Approach
combining classifiers appears as a natural step forward when a critical mass of knowledge of single classifier models has been accumulated. Although there are many unanswered questions about matching classifiers to real-...
CIRS: A State-Conscious Concurrency Control Protocol for Replicated Real-Time Databases
Replication [5] is the technique of using multiple copies of a server or a resource for better availability and erformance.Each copy is called a replica. The main goal of replication is to improve availability, since a...
Appearance Based Recognition of American Sign Language Using Gesture Segmentation
The work presented in this paper goals to develop a system for automatic translation of static gestures of alphabets in American Sign Language. In doing so three feature extraction methods and neural network is used to r...
Application Based Utility Adaptation with Prioritized Weight Assignment Strategy for Minimizing Delay in Multimedia Applications
The aim of this paper is to propose a joint cross-layer approach between application layer and MAC layer for enhancing Quality of Service (QoS) for multimedia applications. Bandwidth adaptation scheme based on applicatio...
Task Scheduling Algorithm to Reduce the Number of Processors using Merge Conditions
Some task scheduling algorithms generate the shortest schedule, when its input DAG satisfies a specified condition. Among those scheduling algorithms, TDS algorithm proposed a DAG condition where allocation of two parent...