Compressive binary search

Details Compressive binary search Compressive binary search

2012-02-05

arxiv.org/abs/1202.0937v1

Computer Science

Information Theory

Scientific paper

In this paper we consider the problem of locating a nonzero entry in a high-dimensional vector from possibly adaptive linear measurements. We consider a recursive bisection method which we dub the compressive binary search and show that it improves on what any nonadaptive method can achieve. We establish a non-asymptotic bound that applies to all methods, regardless of their computational complexity. Combined, these results show that the compressive binary search is within a double logarithmic factor of the optimal performance.

Affiliated with

Also associated with

No associations

Rating

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 Compressive binary search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressive binary search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461482