• Home
  • About
  • A Brief History of AI
  • AI-Alerts
  • AI Magazine
  • AAAI Conferences
  • NeurIPS
  • Books
  • Classics

Sublinear Time Low-Rank Approximation of Distance Matrices

Ainesh Bakshi, David Woodruff

Feb-14-2026, 12:09:19 GMT–Neural Information Processing Systems 

In an attempt to reduce their description size, we study low rank approximation of such matrices.

  artificial intelligence, machine learning, matrix, (16 more...)

Neural Information Processing Systems

Feb-14-2026, 12:09:19 GMT

Conferences    PDF

Add feedback

  • Country:
    • Europe > Spain
      • Catalonia > Barcelona Province > Barcelona (0.04)
    • North America
      • Canada > Quebec
        • Montreal (0.04)
      • United States
        • California > Alameda County
          • Berkeley (0.05)
        • District of Columbia > Washington (0.04)
        • Oregon > Multnomah County
          • Portland (0.04)
        • Pennsylvania > Allegheny County
          • Pittsburgh (0.05)
        • Virginia > Arlington County
          • Arlington (0.04)
    • Oceania > Australia
      • Australian Capital Territory > Canberra (0.04)
  • Technology:
    • Information Technology > Artificial Intelligence > Machine Learning (0.47)

  • By text
  • By views
  • By concept tags

Duplicate Docs Excel Report

Title
Sublinear Time Low-Rank Approximation of Distance Matrices
Sublinear Time Low-Rank Approximation of Distance Matrices

Similar Docs  Excel Report  more

TitleSimilaritySource
None found

Site Feedback

© 2026, i2k Connect Inc  ·  All Rights Reserved.
Privacy policy  ·  Terms of use  ·  License  ·  Legal Notices
This is i2kweb version 7.1.0-SNAPSHOT. Logged in as aitopics-guest for 60 more minutes (idle timeout).

Site Feedback

powered by
i2k Connect

aitopics.org uses cookies to deliver the best possible experience. By continuing to use this site, you consent to the use of cookies. Learn more ยป

Add feedback

Send feedback to help us improve this new enhanced search experience.

Thank You!