Alexander Stollenwerk

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider the problem of encoding a finite set of vectors into a small number of bits while approximately retaining information on the angular distances between the vectors. By deriving improved variance bounds related to binary Gaussian circulant embeddings, we largely fix a gap in the proof of the best known fast binary embedding method. Our bounds also(More)
  • 1