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:
Main Author: | Srinivasan, Aravind |
---|---|
Other Authors: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/99537 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
by: Tan, J., et al.
Published: (2014) -
The consecutive ones submatrix problem for sparse matrices
by: Tan, J., et al.
Published: (2014) -
Sparse low-rank matrix approximation for data compression
by: Hou, Junhui, et al.
Published: (2018) -
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
by: Srinivasan, Aravind
Published: (2014) -
Blind motion deblurring from a single image using sparse approximation
by: Cai, J.-F., et al.
Published: (2014)