For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
1
views
0
references
 Top references
cited by
64
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,092
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Conference Proceedings: not found

      Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

      proceedings-article
      Author(s): ,
      Publication date (Print):
      Conference name: the thirty-eighth annual ACM symposium (STOC '06)
      Conference date: June 21, 2006 - June 23, 2006

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Conference
          Publication date (Print): 2006
          Page: 557
          Article
          DOI: 10.1145/1132516.1132597
          SO-VID: d2dba452-4e08-40a5-a1ad-9cdfcfe61e7e
          Copyright © © 2006
          Conference name: the thirty-eighth annual ACM symposium
          Conference acronym: STOC '06
          Conference number: 38
          Conference location: Seattle, WA, USA
          Conference date: June 21, 2006 - June 23, 2006
          Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory
          Conference sponsor: ACM, Association for Computing Machinery
          History

          Data availability:

          Comments

          Comment on this article