Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Ailon, Nir Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Ailon N., Liberty E. ACM Transactions on Algorithms 9(3): 1-12, 2013.  Type: Article

This paper deals with the randomized construction of efficiently computable Johnson-Lindenstrauss transforms. The paper greatly improves previous results in the literature by establishing an almost optimal result in terms of the dimens...
...
Oct 15 2013  
  Self-improving algorithms
Ailon N., Chazelle B., Comandur S., Liu D.  Discrete algorithms (Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, Jan 22-26, 2006) 261-270, 2006.  Type: Proceedings

Sorting and clustering are considered very important operations. As a consequence, the existence of efficient algorithms for these operations is of vital importance in several scientific fields, such as database systems and data mining...
...
Aug 21 2006  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy