PublicationsPapers

We study the problem of locating an unknown point in $\mathbb{R}^d$ given linear queries $\langle u,x \rangle$ (where $u$ is a unit vector) which are answered with an additive error bounded by $\delta$. We show that the best error achievable given an unlimited number of queries is $\sqrt{\frac{2d}{d+1}} \delta$, and study the speed of convergence.