Two Error Bounds of Imperfect Binary Search

10/31/2017
by   Haoze Wu, et al.
0

Suppose we know that an object is in a sorted table and we want to determine the index of that object. To achieve this goal we could perform a binary search. However, suppose it is time-consuming to determine the relative position of that object to any other objects in the table. In this scenario, we might want to resort to an incomplete solution: we could device an algorithm that quickly predicts the result of comparing two objects, and replace the actual comparison with this algorithm during a binary search. The question then is how far away are the results yielded by the imperfect binary search from the correct answers. We present two quick lemmas that answer this question.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

05/23/2020

Summarizing and Exploring Tabular Data in Conversational Search

Tabular data provide answers to a significant portion of search queries....
04/18/2021

Explaining the Entombed Algorithm

In <cit.>, John Aycock and Tara Copplestone pose an open question, namel...
07/19/2021

Learned Sorted Table Search and Static Indexes in Small Model Space

Machine Learning Techniques, properly combined with Data Structures, hav...
03/04/2014

Dynamic Move Chains -- a Forward Pruning Approach to Tree Search in Computer Chess

This paper proposes a new mechanism for pruning a search game-tree in co...
10/18/2018

Adversarial TableQA: Attention Supervision for Question Answering on Tables

The task of answering a question given a text passage has shown great de...
04/19/2018

VeriTable: Fast Equivalence Verification of Multiple Large Forwarding Tables

Due to network practices such as traffic engineering and multi-homing, t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References

  • [1] D. E. Knuth. The Art of Computer Programming, Volume 3: (2Nd Ed.) Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1998.