Approximation algorithms for grammar-based data compression
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Main Author: | Lehman, Eric (Eric Allen), 1970- |
---|---|
Other Authors: | Madhu Sudan. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/87172 |
Similar Items
-
Deadlock-free routing in a faulty hypercube
by: Lehman, Eric (Eric Allen), 1970-
Published: (2009) -
Sparse low-rank matrix approximation for data compression
by: Hou, Junhui, et al.
Published: (2018) -
Approximation Algorithms for Model-Based Compressive Sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Sublinear Algorithms for Approximating String Compressibility
by: Raskhodnikova, Sofya, et al.
Published: (2012) -
Approximation algorithms for disjoint paths problems
by: Kleinberg, Jon M
Published: (2005)