Compressing rectilinear pictures and minimizing access control lists
From MaRDI portal
Publication:2934701
zbMATH Open1302.68297MaRDI QIDQ2934701FDOQ2934701
Authors: David A. Applegate, Gruia Calinescu, Katrina Ligett, Jia Wang, D. S. Johnson, Howard Karloff Edit this on Wikidata
Publication date: 18 December 2014
Recommendations
Computing methodologies for image processing (68U10) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (7)
- Snipperclips: cutting tools into desired polygons using themselves
- A hybrid heuristic for the rectilinear picture compression problem
- Composing Functions to Minimize Image Size
- Faster compression of patterns to rectangle rule lists
- Faster compression of patterns to rectangle rule lists
- The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
- The 2D subarray polytope
This page was built for publication: Compressing rectilinear pictures and minimizing access control lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934701)