Near-Optimal Compressive Binary Search

Details Near-Optimal Compressive Binary Search Near-Optimal Compressive Binary Search

2012-03-08

arxiv.org/abs/1203.1804v1

Computer Science

Information Theory

Scientific paper

We propose a simple modification to the recently proposed compressive binary search. The modification removes an unnecessary and suboptimal factor of log log n from the SNR requirement, making the procedure optimal (up to a small constant). Simulations show that the new procedure performs significantly better in practice as well. We also contrast this problem with the more well known problem of noisy binary search.

Affiliated with

Also associated with

No associations

Rating

Near-Optimal Compressive Binary Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Near-Optimal Compressive Binary Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Near-Optimal Compressive Binary Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-17432