Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Searching in the Presence of Linearly Bounded Errors (Extended Abstract)
 

Summary: Searching in the Presence of Linearly Bounded Errors
(Extended Abstract)
Javed A. Aslam
Laboratory for Computer Science
Massachusetts Institute of Technology
Cambridge, MA 02139
Aditi Dhagat
Department of Mathematics
Massachusetts Institute of Technology
Cambridge, MA 02139
Abstract
We consider the problem of determining an unknown
quantity x by asking "yes-no" questions, where some of
the answers may be erroneous. In particular, we focus
on a linearly bounded model of errors where for some
known constant r, 0 < r < 1
2 , each initial sequence of
i answers is guaranteed to have no more than ri errors.
This model allows the errors to occur in a somewhat ma-
licious way: for example, we must deal with a scenario

  

Source: Aslam, Javed - College of Computer Science, Northeastern University

 

Collections: Computer Technologies and Information Sciences