Login / Signup

Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error.

T. S. JayramDavid P. Woodruff
Published in: ACM Trans. Algorithms (2013)
Keyphrases
  • worst case
  • error bounds
  • optimization problems
  • johnson lindenstrauss
  • data sets
  • dynamic programming
  • np complete
  • error rate
  • decision problems
  • estimation error
  • decision trees
  • search algorithm
  • peer to peer