MICAI 2004: Advances in Artificial Intelligence

DOI10.1007/B96521MaRDI QIDQ5901924zbMATH OpenOpenAlexDBLPFDO

Authors Angel Kuri, José Galaviz

Publication date 12 May 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96521

zbMATH Keywords

genetic algorithmsNP-hardnessoptimization

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the Hardness of Finding Optimal Multiple Preset Dictionaries
• Parallelism and dictionary based data compression
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• The macro model for data compression (extended abstract)

Cited in

(7)

• Rearranging data to maximize the efficiency of compression
• Hierarchical dictionary model and dictionary management policies for data compression
• Optimal data compression algorithm
• scientific article; zbMATH DE number 2086337 (Why is no real title available?)
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery
• On the Hardness of Finding Optimal Multiple Preset Dictionaries
• Bridging Lossy and Lossless Compression by Motif Pattern Discovery

This page was built for publication: MICAI 2004: Advances in Artificial Intelligence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901924)