RESEARCH PAPERS

binary search research papers



Optimum binary search trees
free download

Note that it is sometimes best to put B at the root even when both A and C occur more frequently. And on the other hand, it is not sufficient simply to choose the root so as to equalize the left and right search probabilities as much as possible, contrary to a remark of

Delayed binary search, or playing Twenty Questions with a procrastinator
free download

Abstract We study the classic binary search problem, with a delay between query and answer. For all constant delays, we give matching upper and lower bounds on the number of queries. Key Words: binary search, delay, Fibonacci series, Golden Ratio, monotone,

IP address lookup for internet routers using balanced binary search with prefix vector.
free download

IP address lookup in the Internet routers. While most of the previous binary search algorithms do not provide a balanced search, the proposed algorithm provides a perfectly balanced search, and hence it provides excellent search performance and scalability

Halftone visual cryptography via direct binary search
free download

ABSTRACT This paper considers the problem of encoding a secret binary image SI into n shares of meaningful halftone images within the scheme of visual cryptography (VC). Secret pixels encoded into shares introduce noise to the halftone images. We extend our

Novel binary search algorithm of backtracking for RFID tag anti-collision
free download

ABSTRACT In RFID system, tag collision is a main problem for fast tag identification. On the base of binary search algorithm of backtracking, an enhanced binary anti-collision search algorithm for radio frequency identification (RFID) system is presented in this paper. By

Printer models and the direct binary search algorithm
free download

ABSTRACT We incorporate a higher order measurement-based model for printer dot interactions within the iterative direct binary search (DBS) halftoning algorithm. We also present an efficient strategy for evaluating the change in computational cost as the search

A lower bound framework for binary search trees with rotations
free download

Abstract This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and

Combining truncated binary search tree and direct search for flexible piecewise function evaluation for explicit MPC in embedded microcontrollers
free download

ABSTRACT Algorithms for efficient evaluation of general piecewise functions defined over convex polyhedral partitions are considered. As an important application, the explicit model predictive control (eMPC) problem requires a piecewise affine (PWA) control law to be

Test data generation based on binary search for class-level testing
free download

Abstract One of the important tasks during software testing is the generation of appropriate test data. Various techniques have been proposed to automate this task. The techniques available, however, often have problems limiting their use. In the case of dynamic test data

Profile and height of random binary search trees
free download

Probably the most widely used sorting algorithm is the algorithm Quicksort which was invented by CAR Hoare [14, 15]. It is the standard sorting procedure in Unix systems, and the basis idea can be described as follows: A list of n (different) real numbers A = (x,x2, . . .xn) is given.

A Verification of Binary Search
free download

Abstract. We demonstrate the use of the/eriFun system with a verification of the Binary Search method. We present the challenges encountered when working on this problem, illustrate the operation and performance of the system and finally discuss technical

Relief Mapping in a Pixel Shader Using Binary Search
free download

The idea of this shader (called Relief Mapping) is to implement a better quality Bump Mapping1 technique similar to Parallax Mapping2 (also called Offset Bump Mapping) and Relief Texture Mapping3. Actually, Relief Mapping corresponds to an inverse (or

Subtree weight ratios for optimal binary search trees
free download

Abstract For an optimal binary search tree T with a subtree S (d) at a distance d from the root of T, we study the ratio of the weight of S (d) to the weight of T. The maximum possible value, which we call (d), of the ratio of weights, is found to have an upper bound of 2/F d+ 3

Analytic derivation of comparisons in binary search
free download

Numerous authors of programming texts and algorithms/data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes--the key is to the left of the midpoint, to the right of the

Binary Search on a Linked List---A Research Project in Experimental Computer Science
free download

O. INTRODUCTION This investigation started as a student research project during a junior- level Programming Algorithms course. Now it will be presented as a basis for a variety of research projects that can be used in teaching a large group of computer science courses.

New bounds on optimal binary search trees
free download

Abstract Binary search trees (BSTs) are a class of simple data structures used to store and access keys from an ordered set. They have been around for about half a century. Despite their ubiquitous use in practical programs, surprisingly little is known about their optimal

Suffix binary search trees and suffix arrays
free download

Abstract Suffix arrays and suffix binary search trees are two data structures that have been proposed as alternatives to the classical suffix tree to facilitate efficient on-line string searching. Here, we explore the relationship between these two structures. In particular, In the class of half-balanced binary search trees, HBB-trees for short, was introduced. HBB-trees have as a remarkable property that at most a constant number of rotations must be performed during the insertion or the deletion of a key. Here a general family of classes

Balanced binary search trees
free download

Balanced binary search trees are among the most important data structures in Computer Science. This is because they are efficient, versatile, and extensible in many ways. They are used as a black-box in numerous algorithms and even other data structures. The main

Parallel generation of binary search trees
free download

ABSTRACT A method of constructing binary search trees in a multiprocessor computer system is proposed. Asymptotically, this method achieves the maximum possible increase in speed as compared with a single processor computer system. To make better use of this method,

Adaptive Binary Search Trees
free download

Abstract A ubiquitous problem in the field of algorithms and data structures is that of searching for an element from an ordered universe. The simple yet powerful binary search tree (BST) model provides a rich family of solutions to this problem. Although BSTs require

Iterated tabu search for the unconstrained binary quadratic optimization problem
free download

Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized. In

Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm
free download

Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo's behaviour and the mechanism of L vy flights. Unfortunately, the standard CS algorithm is proposed only for continuous optimisation

Insertion and Deletion on Binary Search Tree using Modified Insert Delete Pair: An Empirical Study
free download

Summary Recently, a new version of the insert-delete pair has been proposed that maintains a random binary search tree in such a way that all the grandparents in the tree always have both of their sub-trees full. For a tree with 'n'nodes, if such an arrangement is

Parallel balancing of binary search trees
free download

ABSTRACT A method for the balancing of binary search trees on a highly parallel computeris described. This method can be adapted for execution on a multiprocessor computer system. Index Terms-Binary search trees, highly parallel computer, information retrieval, parallel

Direct binary search with adaptive search and swap
free download

Grayscale halftoning is the technique of approximating a grayscale image by a black-and- white image. Black-and-white printers use halftoning to replicate grayscale images on paper. The printers have only the black of ink and the white of paper as the colors at their

Designing optimal binary search tree using parallel genetic algorithms
free download

Summary Evolutionary algorithms (EAs) are modern techniques for searching complex spaces for on optimum [11]. Genetic algorithms (GAs) are developed as random search methods, which have not so sensitivity on primary data of the problems. They can be used

Modified group generalized binary search with near-optimal performance guarantees
free download

Abstract Group Generalized Binary Search (Group GBS) is an extension of the well known greedy algorithm GBS, for identifying the group of an unknown object while minimizing the number of binary questions posed about that object. This problem referred to as group

New search techniques for binary pulsars
free download

Abstract W e have developed two ne w methods for finding binary pulsars that search complementary portions of parameter space. B oth techniques ex amine small regions of the F ourier transform of a time series and identify the distinctive but very lo w signal-to-noise

Approximability of cycle covers and smoothed analysis of binary search trees.
free download

ABSTRACT In the first part of this thesis, we are concerned with the approximability of restricted cycle covers. A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every
Given a set of m records with an ordering on their keys, and given a fixed distribution p of their access probabilities, it is well known that a binary search tree can then be constructed such that its weighted path length is less than H (p)+ 2, where H (p) is the Shannon

A New Efficient Binary Search on Range for IP Address Lookup
free download

Abstract IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall performance of the routers. The biggest problem of IP address lookup is that prefixes has a variable length so that longest prefix

Combining Local Search and Fitness Function Adaptation in a GA for Solving BinaryConstraint Satisfaction Problems.
free download

Both genetic local search (GLs) and genetic algorithms (GAs) with on-line adaptation of a penaltybased fitness function, separately, have produced promising results when they have been used to solve random binary constraint satisfaction problems (BC-sPs). In this paper

Exploring Different Methods for 2DR-tree Binary Search on a FPGA
free download

ABSTRACT Many data structures are proposed for managing spatial data. However, they are limited in their software implementations. This paper analyses two hardware

Asymmetric Binary Search of Mobile Agents
free download

Abstract In a mobile computing environment that supports mobile agents, a client can send an agent to visit a sequence of servers in the network. Tracking the'location of agents becomes a critical problem in managing a mobile agent servic~ network. In our previous

An Online Self-Balancing Binary Search Tree for Hierarchical Shape Matching.
free download

ABSTRACT In this paper we propose a self-balanced binary search tree data structure for shape matching. This was originally developed as a fast method of silhouette matching in videos recorded from IR cameras by firemen during rescue operations. We introduce a

Height Size Performance of Complete and Nearly Complete Binary Search Trees in Dictionary Applications
free download

ABSTRACT Trees are frequently used data structures for fast access to the stored data. Data structures like arrays, vectors and linked lists are limited by the trade-off between the ability to perform a fast search and the ability to resize easily. Binary Search Trees are an

A New Approach for Multiple Element Binary Search in Database Applications
free download

ABSTRACT Binary Search is fundamental to the study and analysis of Discrete Computational Structures. This is an efficient search strategy due to it's logarithmic time complexity. It is used to identify the position of a key in a sorted list. Often, database applications require

Reliability improvement in distribution systems by optimal placement of DSTATCOM usingbinary gravitational search algorithm
free download

Abstract. In this paper, a new method for improving reliability level of distribution systems is presented by employing optimal placement of DSTATCOM. The binary version of the Gravitational Search algorithm (BGSA) is used to solve the DSTATCOM optimal

Multiplication-free one-bit transform and diamond search combination for fast binary block motion estimation
free download

Abstract Combination of multiplication-free one-bit transform based block estimation with the diamond sparse search pattern is presented is this paper. Unification of sparse search patterns with low-bit representation motion estimation methods are rarely investigated and

Application of quantum-inspired binary gravitational search algorithm for optimal power quality monitor placement
free download

ABSTRACT This paper presents a combinational quantum-inspired binary gravitational search algorithm (QBGSA) for solving the optimal power quality monitor (PQM) placement problem in power systems for voltage sag assessment. In this algorithm, the standard binary
It is well known that if a binary search tree of n nodes is height balanced, then the operations of search, insertion and deletion of a tree node can be carded out in 0 (log n) time. There are several efficient dynamic tree balancing methods that can be used to balance a binary

A partitioned binary search scheme on multiple trees for efficient IP address lookup
free download

Abstract IP address lookup is becoming critical because of increasing entries in a forwarding table, linespeed and traffic in the Internet. Binary search is the most popular scheme based on S/W implementation. This search scheme has problems according to

Time-of-flight estimation using binary search system identification technique
free download

Time of flight (TOF) estimation is the process of determining the relative shift D between a reference x (t)(or transmitted) signal and delayed s (t)(or received) signal:()()() tgx trtx+=,(1a)()()() tgs Dtrts+-=,(1b) where the x (t) consists of a reference signal r (t), and

Analysis of Time complexity in Binary Search Tree
free download

ABSTRACT Data structure is essential for designing of software's. As most of operating systems uses tree or tree like data structure to store the data in it. Trees are used in text processing, searching algorithms, sorting algorithms, compiler designing etc. Trees are

Context Indexing in Search Engine Using Binary Search Tree
free download

ABSTRACT Indexing in search engines is an active area of current researches and the aim of search engines is to provide the most relevant documents to the users in least possible time. In this paper a context based indexing is proposed where the index list stores the

Game-based Learning Approach to Binary Search Tree Basic Operations
free download

Abstract Games perform a certain number of educational purposes. In this respect, they aim to motivate students to learn more effectively and encourage them to learn from their mistakes. Subjects of Data Structure and Algorithms course offered to computer science

Binary search tree visualization algorithm
free download

ABSTRACT Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a

Generalized Binary Search Trees and Clock Tree Revisited
free download

In this paper, we study two diverse problems from a random matrix perspective. The first one is the problem of binary testing (or object/entity identification) that arises in applications such as active learning, fault diagnosis and computer vision, and the second is the problem of

AN ADAPTIVE INDEXED BINARY SEARCH TREE FOR EFFICIENT HOM OM ORPHIC COERCION RESISTANT VOTING SCHEM E
free download

ABSTRACT This paper presents a voting scheme that coalesces many of the advantageous features of an efficient e-voting scheme like receipt-freeness, uncoercibility and write-in ballot, without requiring untappable channels. Some of the previous schemes in the

Multi-key binary search and the related performance
free download

ABSTRACT Binary Search is efficient due to it's logarithmic time complexity. It is used to identify the position of a key in a sorted list. Often, computer applications require searching for two to more different keys at the same execution. In this paper, a hybrid algorithm to perform the

A local search heuristic based on column generation applied to the binary multicommodity flow problem
free download

Abstract In this paper, we apply a multi-start local search heuristic based on column generation to the binary multicommodity flow problem. One solution is represented as a set of paths, one of each commodity. A neighbor solution is obtained by selecting a different

Improved direct binary search-based algorithm for generating holograms for the application of holographic optical tweezers
free download

Abstract. This paper presents an improved direct binary search (DBS)-based algorithm for generating holograms to holographic optical tweezers. The simulations show that the improved algorithm greatly enhances computation speed while maintaining high
Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring matrices. Trinary scoring matrices (containing only the values 1, 0, and 1) allow for significant acceleration without

Feature subset selection using improved binary gravitational search algorithm
free download

Feature selection is one of the important activities in various fields such as computer vision and pattern recognition. In this paper, an improved version of the binary gravitational search algorithm (BGSA) is proposed and used as a tool to select the best subset of features with

A binary search algorithm for a special case of minimizing the lateness on a single machine
free download

ABSTRACT We study the problem of scheduling jobs with release times and due-dates on a single machine with the objective to minimize the maximal job lateness. This problem is strongly NP-hard, however it is known to be polynomially solvable for the case when the

Persistent Su x Trees and Su x Binary Search Trees as DNA Sequence Indexes
free download

Abstract We constructed, stored on disk and reused su x trees and su x binary search trees for C. elegans chromosomes, and measured their performance using orthogonal persistence for Java (PJama). We compare our implementation with the performance of a

Scaling limit of successive approximations for w=- w 2 and its consequences on the theories of random sequential bisections and height of binary search trees
free download

ABSTRACT We prove existence of scaling limits of sequences of functions defined by the recursion relation w n+ 1 (x)=- wn (x) 2. Namely, wn approach the exact solution as n8 in asymptotically conformal ways, wn (x) qn w (qnx), for a sequence of numbers {qn}. We

binary search research papers-2014



Implementation of Binary Search on a Singly Linked List Using Dual Pointers.
free download

Conquer Algorithm, determination middle element of a series of elements is necessary. But memory allocation for a singly linked list is dynamic and not contiguous. Hence, determination of middle element becomes difficult. This paper aims to provide an
This paper presents an efficient coarse grain multicomputer (CGM) parallel algorithm for the cost of the optimal binary search tree problem (OBST problem). In the previous best CGM algorithm for this problem, the size of the local memory of each processor is not bounded.

A Fast Lock-Free Internal Binary Search Tree
free download

ABSTRACT We present a new lock-free algorithm for concurrent manipulation of a binary search tree in an asynchronous shared memory system that supports search, insert and delete operations. It combines ideas from two recently proposed lockfree algorithms: one

The Connection between the Binary Search Tree and the Dynamical Systems Trees
free download

Dynamical Systems Trees H. El-Zohny S. Redwan Z. Mohammed Abstract In this paper we will study the connection between binary search tree and the dynamical system trees.

An Initialization Method for K-Means Algorithm Using Binary Search Technique
free download

ABSTRACT K Means algorithm is most popular partition based algorithm that is widely used in data clustering. A lot of algorithms have been proposed for data clustering using K Means algorithm due to its simplicity, efficiency and ease convergence. In spite this K-

Performance Analysis of Binary Search Algorithm in RFID
free download

ABSTRACT Binary search algorithm (BS) is a kind of important anti-collision algorithm in the Radio Frequency Identification (RFID), is also one of the key technologies which determine whether the information in the tag is identified by the reader-writer fast and reliably. The

Feature subset selection using improved binary gravitational search algorithm
free download

Feature selection is one of the important activities in various fields such as computer vision and pattern recognition. In this paper, an improved version of the binary gravitational search algorithm (BGSA) is proposed and used as a tool to select the best subset of features with

Binary Block Motion Estimation Using an Adaptive Search Range Adjustment Technique
free download

ABSTRACT This study proposes an adaptive search range adjustment algorithm to enhance the effectiveness of current binary block motion estimation methods. This is because the binary block ME approaches, which perform FS by using different criterion from the


FREE ENGINEERING RESEARCH PAPERS