On the hardness of finding optimal multiple preset dictionaries

Data Compression Conference Proceedings

Volumn , Issue , 2001, Pages 411-418

  Mitzenmacher, M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FACSIMILE; IMAGE CODING; IMAGE COMMUNICATION SYSTEMS; OPTIMIZATION; STANDARDS;

HUFFMAN CODES; JOINT PHOTOGRAPHERS EXPERT GROUP; MULTIPLE PRESET DICTIONARIES;

IMAGE COMPRESSION;

EID: 0035016783     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Some simplified NP-complete graph problems
2. Segmentation problems: A micro-economic view of data mining