ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2306.01869
  4. Cited By
Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix
  Factorization

Fast (1+ε)(1+\varepsilon)(1+ε)-Approximation Algorithms for Binary Matrix Factorization

2 June 2023
A. Velingker
Maximilian Vötsch
David P. Woodruff
Samson Zhou
ArXivPDFHTML

Papers citing "Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization"

2 / 2 papers shown
Title
Guessing Efficiently for Constrained Subspace Approximation
Guessing Efficiently for Constrained Subspace Approximation
Aditya Bhaskara
S. Mahabadi
Madhusudhan Reddy Pittu
A. Vakilian
David P. Woodruff
35
0
0
29 Apr 2025
Symmetric Sparse Boolean Matrix Factorization and Applications
Symmetric Sparse Boolean Matrix Factorization and Applications
Sitan Chen
Zhao-quan Song
Runzhou Tao
Ruizhe Zhang
31
5
0
02 Feb 2021
1