Improving the discrepancy bound for sparse matrices: Better approximations for sparse lattice approximation problems
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Saved in:
主要作者: | Srinivasan, Aravind |
---|---|
其他作者: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
格式: | Conference or Workshop Item |
出版: |
2014
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/99537 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
由: Tan, J., et al.
出版: (2014) -
Sparse low-rank matrix approximation for data compression
由: Hou, Junhui, et al.
出版: (2018) -
The consecutive ones submatrix problem for sparse matrices
由: Tan, J., et al.
出版: (2014) -
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
由: Srinivasan, Aravind
出版: (2014) -
Blind motion deblurring from a single image using sparse approximation
由: Cai, J.-F., et al.
出版: (2014)