@Preamble{
"\input path.sty " #
"\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" #
"\ifx \undefined \pkg \def \pkg #1{{{\tt #1}}} \fi"
}
@String{ack-ds = "David Salomon,
Professor Emeritus,
Department of Computer Science,
California State University, Northridge,
Northridge, CA 91330, USA"}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{inst-CLSC = "College of Science Computer, University of
Utah"}
@String{inst-CLSC:adr = "Salt Lake City, UT 84112, USA"}
@String{j-ACM-J-EXP-ALGORITHMICS = "ACM Journal of Experimental Algorithmics"}
@String{j-ACTA-INFO = "Acta Informatica"}
@String{j-ADV-COMPUT-MATH = "Advances in Computational Mathematics"}
@String{j-ALGORITHMICA = "Algorithmica"}
@String{j-ALGORITHMS-BASEL = "Algorithms ({Basel})"}
@String{j-AM-DOC = "American Documentation"}
@String{j-AMER-MATH-MONTHLY = "American Mathematical Monthly"}
@String{j-ANN-MATH-STAT = "Annals of Mathematical Statistics"}
@String{j-ANN-PROBAB = "Annals of Probability"}
@String{j-APPL-MATH-COMP = "Applied Mathematics and Computation"}
@String{j-APPL-NUM-MATH = "Applied Numerical Mathematics: Transactions
of IMACS"}
@String{j-ATT-BELL-LAB-TECH-J = "AT\&T Bell Laboratories Technical Journal"}
@String{j-ATT-TECH-J = "AT\&T Technical Journal"}
@String{j-AUSTRALIAN-COMP-J = "Australian Computer Journal"}
@String{j-AUSTRALIAN-COMP-SCI-COMM = "Australian Computer Science
Communications"}
@String{j-BELL-SYST-TECH-J = "The Bell System Technical Journal"}
@String{j-BIT = "BIT (Nordisk tidskrift for
informationsbehandling)"}
@String{j-BULL-SOC-R-SCI-LIEGE = "Bulletin de la Soci{\'e}t{\'e} royale des
sciences de Li{\`e}ge"}
@String{j-BYTE = "Byte Magazine"}
@String{j-CACM = "Communications of the ACM"}
@String{j-CCCUJ = "C/C++ Users Journal"}
@String{j-CCPE = "Concurrency and Computation: Prac\-tice and
Experience"}
@String{j-CELL-SYST = "Cell Systems"}
@String{j-CGF = "Computer Graphics Forum"}
@String{j-CGIP = "Computer Graphics and Image Processing"}
@String{j-COMM-PURE-APPL-MATH = "Communications on Pure and Applied
Mathematics (New York)"}
@String{j-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"}
@String{j-COMP-GRAPHICS = "Computer Graphics"}
@String{j-COMP-J = "The Computer Journal"}
@String{j-COMP-LANG-MAG = "Computer Language Magazine"}
@String{j-COMP-NET-AMSTERDAM = "Computer Networks (Amsterdam, Netherlands:
1999)"}
@String{j-COMP-PHYS-COMM = "Computer Physics Communications"}
@String{j-COMP-SURV = "ACM Computing Surveys"}
@String{j-COMP-SYS = "Computing systems: the journal of the
USENIX Association"}
@String{j-COMP-VIS-IMAGE-UNDERSTANDING = "Computer Vision and Image
Understanding: CVIU"}
@String{j-COMPUT-ANIM-VIRTUAL-WORLDS = "Computer Animation and Virtual Worlds"}
@String{j-COMPUT-MATH-APPL = "Computers and Mathematics with Applications"}
@String{j-COMPUT-MECH = "Computational mechanics"}
@String{j-COMPUT-SCI-ENG = "Computing in Science and Engineering"}
@String{j-COMPUT-SECUR = "Computers \& Security"}
@String{j-COMPUT-SOFTW-BIG-SCI = "Computing and Software for Big Science"}
@String{j-COMPUT-STAT-DATA-ANAL = "Computational Statistics \& Data Analysis"}
@String{j-COMPUT-SYST-SCI-ENG = "Computer Systems Science and Engineering"}
@String{j-COMPUTER = "Computer"}
@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}
@String{j-COMPUTING = "Computing: Archiv f{\"u}r informatik und
numerik"}
@String{j-CPE = "Concurrency: Prac\-tice and Experience"}
@String{j-CROSSROADS = "ACM Crossroads"}
@String{j-CRYPTOLOGIA = "Cryptologia"}
@String{j-CUJ = "C Users Journal"}
@String{j-CVGIP = "Computer Vision, Graphics, and Image
Processing"}
@String{j-CVGIP-GMIP = "Computer Vision, Graphics, and Image
Processing. Graphical Models and Image
Processing"}
@String{j-DATAMATION = "Datamation"}
@String{j-DDJ = "Dr. Dobb's Journal of Software Tools"}
@String{j-DEC-TECH-J = "Digital Technical Journal"}
@String{j-DESIGNS-CODES-CRYPTOGR = "Designs, Codes, and Cryptography"}
@String{j-DISCRETE-APPL-MATH = "Discrete Applied Mathematics"}
@String{j-ELECT-COMPOSITION-IMAGING = "Electronic Composition and Imaging"}
@String{j-EPODD = "Electronic
Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion,
Dissemination, and Design"}
@String{j-ESAIM-PROBAB-STATIST = "ESAIM: Probability and Statistics"}
@String{j-FIB-QUART = "Fibonacci Quarterly"}
@String{j-FRACTALS = "Fractals"}
@String{j-FUJITSU-SCI-TECH-J = "Fujitsu scientific and technical journal"}
@String{j-FUND-INFO = "Fundamenta Informaticae"}
@String{j-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"}
@String{j-FUTURE-INTERNET = "Future Internet"}
@String{j-GRAPH-MODELS = "Graphical Models"}
@String{j-GRAPH-MODELS-IMAGE-PROC = "Graphical models and image processing:
GMIP"}
@String{j-HEWLETT-PACKARD-J = "Hewlett--Packard Journal"}
@String{j-IBM-JRD = "IBM Journal of Research and Development"}
@String{j-IBM-SYS-J = "IBM Systems Journal"}
@String{j-IBM-TDB = "IBM Technical Disclosure Bulletin"}
@String{j-IEEE-ACM-TASLP = "IEEE\slash ACM Transactions on Audio, Speech,
and Language Processing"}
@String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"}
@String{j-IEEE-CGA = "IEEE Computer Graphics and Applications"}
@String{j-IEEE-COMPUT-ARCHIT-LETT = "IEEE Computer Architecture Letters"}
@String{j-IEEE-COMMUN-LET = "IEEE Communications Letters"}
@String{j-IEEE-J-SEL-AREAS-COMMUN = "IEEE Journal on Selected Areas in
Communications"}
@String{j-IEEE-MICRO = "IEEE Micro"}
@String{j-IEEE-MULTIMEDIA = "IEEE MultiMedia"}
@String{j-IEEE-SIGNAL-PROCESS-MAG = "IEEE signal processing magazine"}
@String{j-IEEE-SPECTRUM = "IEEE Spectrum"}
@String{j-IEEE-TRANS-BIG-DATA = "IEEE Transactions on Big Data"}
@String{j-IEEE-TRANS-BROADCAST = "IEEE Transactions on Broadcasting"}
@String{j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH = "IEEE Transactions on Circuits
and Systems for Video Technology"}
@String{j-IEEE-TRANS-COMM = "IEEE Transactions on Communications"}
@String{j-IEEE-TRANS-COMPUT = "IEEE Transactions on Computers"}
@String{j-IEEE-TRANS-IMAGE-PROCESS = "IEEE Transactions on Image Processing"}
@String{j-IEEE-TRANS-INF-THEORY = "IEEE Transactions on Information Theory"}
@String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"}
@String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and
Distributed Systems"}
@String{j-IEEE-TRANS-PATT-ANAL-MACH-INTEL = "IEEE Transactions on Pattern
Analysis and Machine Intelligence"}
@String{j-IEEE-TRANS-PROF-COMMUN = "IEEE Transactions on Professional
Communication"}
@String{j-IEEE-TRANS-SIG-PROC = "IEEE Transactions on Signal Processing"}
@String{j-IEEE-TRANS-SOFTW-ENG = "IEEE Transactions on Software Engineering"}
@String{j-IEEE-TRANS-VIS-COMPUT-GRAPH = "IEEE Transactions on Visualization
and Computer Graphics"}
@String{j-IEICE-TRANS-FUND-ELECT = "IEICE Transactions on Fundamentals of
Electronics Communications and Computer
Sciences"}
@String{j-IEICE-TRANS-FUND-ELECT= "IEICE Transactions on Fundamentals of
Electronics Communications and Computer
Sciences"}
@String{j-IJHPCA = "The International Journal of High
Performance Computing Applications"}
@String{j-IJQC = "International Journal of Quantum Chemistry"}
@String{j-IMAGE-VIDEO-PROCESS = "Image and Video Processing"}
@String{j-IMWUT = "Proceedings of the ACM on Interactive,
Mobile, Wearable and Ubiquitous
Technologies (IMWUT)"}
@String{j-INF-RETR = "Information Retrieval"}
@String{j-INFO-PROC-LETT = "Information Processing Letters"}
@String{j-INFO-PROC-MAN = "Information Processing and Management"}
@String{j-INFO-SCI = "Information Sciences"}
@String{j-INFOWORLD = "InfoWorld"}
@String{j-INT-J-COMP-PROC-ORIENTAL-LANG = "International Journal of Computer
Processing of Oriental Languages (IJCPOL)"}
@String{j-INT-J-COMPUT-APPL = "International Journal of Computer
Applications"}
@String{j-INT-J-COMPUT-INF-SCI = "International Journal of Computer and
Information Sciences"}
@String{j-INT-J-COMPUT-MATH = "International Journal of Computer
Mathematics"}
@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations of
Computer Science (IJFCS)"}
@String{j-INT-J-HIGH-SPEED-COMPUTING = "International Journal of High Speed
Computing (IJHSC)"}
@String{j-INT-J-IMAGE-GRAPHICS = "International Journal of Image and Graphics
(IJIG)"}
@String{j-INT-J-INFO-SEC = "International Journal of Information
Security"}
@String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel,
Emergent and Distributed Systems: IJPEDS"}
@String{j-INT-J-PARALLEL-PROG = "International Journal of Parallel
Programming"}
@String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER = "International Journal on
Software Tools for Technology Transfer (STTT)"}
@String{j-INT-J-WAVELETS-MULTIRESOLUT-INF-PROCESS = "International Journal of
Wavelets, Multiresolution and
Information Processing"}
@String{j-INTERNET-MATH = "Internet Mathematics"}
@String{j-IRE-TRANS-ELEC-COMPUT = "IRE Transactions on Electronic Computers"}
@String{j-IRE-TRANS-INF-THEORY = "IRE Transactions on Information Theory"}
@String{j-J-ACM = "Journal of the ACM"}
@String{j-J-ALG = "Journal of Algorithms"}
@String{j-J-AM-SOC-INF-SCI = "Journal of the American Society for
Information Science"}
@String{j-J-AM-SOC-INF-SCI-TECHNOL = "Journal of the American Society for
Information Science and Technology: JASIST"}
@String{j-J-AM-STAT-ASSOC = "Journal of the American Statistical
Association"}
@String{j-J-AUDIO-ENG-SOC = "Journal of the Audio Engineering Society"}
@String{j-J-AUTOM-REASON = "Journal of Automated Reasoning"}
@String{j-J-COMP-SYS-SCI = "Journal of Computer and System Sciences"}
@String{j-J-COMPUT-APPL-MATH = "Journal of Computational and Applied
Mathematics"}
@String{j-J-COMPUT-BIOL = "Journal of Computational Biology"}
@String{j-J-COMPUT-CHEM = "Journal of Computational Chemistry"}
@String{j-J-COMPUT-PHYS = "Journal of Computational Physics"}
@String{j-J-CRYPTOLOGY = "Journal of Cryptology: the journal of the
International Association for Cryptologic
Research"}
@String{j-J-DISCR-MATH-SCI-CRYPTO = "Journal of Discrete Mathematical Sciences
and Cryptography"}
@String{j-J-ELECTRON-IMAGING = "Journal of Electronic Imaging"}
@String{j-J-GRAPHICS-TOOLS = "Journal of Graphics Tools: JGT"}
@String{j-J-GRID-COMP = "Journal of Grid Computing"}
@String{j-J-INFO-SCI-PRINCIPLES-PRACTICE = "Journal of Information Science,
Principles and Practice"}
@String{j-J-MATH-PHYS = "Journal of Mathematical Physics"}
@String{j-J-NETW-COMPUT-APPL = "Journal of Network and Computer
Applications"}
@String{j-J-OPT-SOC-AM = "Journal of the Optical Society of America"}
@String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
@String{j-J-SCI-COMPUT = "Journal of Scientific Computing"}
@String{j-J-SIAM = "Journal of the Society for Industrial and
Applied Mathematics"}
@String{j-J-STAT-COMPUT-SIMUL = "Journal of Statistical Computation and
Simulation"}
@String{j-J-SUPERCOMPUTING = "The Journal of Supercomputing"}
@String{j-J-SYST-SOFTW = "The Journal of Systems and Software"}
@String{j-J-THEOR-BIOL = "Journal of Theoretical Biology"}
@String{j-J-UCS = "J.UCS: The Journal of Universal Computer
Science"}
@String{j-J-VIS-COMMUN-IMAGE-REPRESENT = "Journal of Visual Communication and
Image Representation"}
@String{j-J-VIS-COMP-ANIMATION = "Journal of Visualization and Computer
Animation"}
@String{j-JDIQ = "Journal of Data and Information
Quality (JDIQ)"}
@String{j-JOCCH = "Journal on Computing and Cultural Heritage
(JOCCH)"}
@String{j-JOURNAL-Q = "Journalism Quarterly"}
@String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in Computer Science"}
@String{j-LINEAR-ALGEBRA-APPL = "Linear Algebra and its Applications"}
@String{j-LINUX-J = "Linux Journal"}
@String{j-LOGIN = ";login: the USENIX Association newsletter"}
@String{j-MATH-ANN = "Mathematische Annalen"}
@String{j-MATH-COMPUT = "Mathematics of Computation"}
@String{j-MATH-COMPUT-SCI = "Mathematics in Computer Science"}
@String{j-MATH-INTEL = "The Mathematical Intelligencer"}
@String{j-MATH-MAG = "Mathematics Magazine"}
@String{j-MATHEMATICA-J = "Mathematica Journal"}
@String{j-MULTISCALE-MODELING-SIMUL = "Multiscale Modeling \& Simulation"}
@String{j-NAMS = "Notices of the {American Mathematical
Society}"}
@String{j-NATURE = "Nature"}
@String{j-NEW-ZEALAND-J-MATH = "{New Zealand} Journal of Mathematics"}
@String{j-NORDIC-J-COMPUT = "Nordic Journal of Computing"}
@String{j-NUMER-ALGORITHMS = "Numerical Algorithms"}
@String{j-NATURE = "Nature"}
@String{j-NUM-LIN-ALG-APPL = "Numerical Linear Algebra with Applications"}
@String{j-ONLINE = "Online"}
@String{j-OPER-SYS-REV = "Operating Systems Review"}
@String{j-OPTICAL-ENG = "Optical Engineering"}
@String{j-PARALLEL-COMPUTING = "Parallel Computing"}
@String{j-PARALLEL-DIST-COMP-PRACT = "PDCP: Parallel and Distributed Computing
Practices"}
@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}
@String{j-PHOTOGR-SCI-ENG = "Photographic Science and Engineering"}
@String{j-PROBAB-ENGRG-INFORM-SCI = "Probability in the Engineering and
Informational Sciences"}
@String{j-PROBAB-THEORY-RELAT-FIELDS = "Probability Theory and Related Fields"}
@String{j-PROC-IEEE = "Proceedings of the IEEE"}
@String{j-PROC-IRE = "Proceedings of the Institute of Radio
Engineers"}
@String{j-PROC-SPIE = "Proceedings of the SPIE --- The
International Society for Optical
Engineering"}
@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}
@String{j-REV-INST-INT-STATIST = "Revue de l'Institut international de
statistique = Review of the International
Statistical Institute"}
@String{j-SCI-AMER = "Scientific American"}
@String{j-SCI-COMPUT-PROGRAM = "Science of Computer Programming"}
@String{j-SCI-PROG = "Scientific Programming"}
@String{j-SIAM-J-COMPUT = "SIAM Journal on Computing"}
@String{j-SIAM-J-CONTROL-OPTIM = "SIAM Journal on Control and Optimization"}
@String{j-SIAM-J-DISCR-MATH = "SIAM Journal on Discrete Mathematics"}
@String{j-SIAM-J-IMAGING-SCI = "SIAM Journal on Imaging Sciences"}
@String{j-SIAM-J-NUMER-ANAL = "SIAM Journal on Numerical Analysis"}
@String{j-SIAM-J-SCI-COMP = "SIAM Journal on Scientific Computing"}
@String{j-SIAM-REVIEW = "SIAM Review"}
@String{j-SIGACT = "ACM SIGACT News"}
@String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest Group
on Computer Science Education)"}
@String{j-SIGMETRICS = "ACM SIGMETRICS Performance Evaluation
Review"}
@String{j-SIGMICRO = "ACM SIGMICRO Newsletter"}
@String{j-SIGMOD = "ACM SIG{\-}MOD Record"}
@String{j-SIGPLAN = "ACM SIGPLAN Notices"}
@String{j-SOFTWAREX = "SoftwareX"}
@String{j-SPE = "Soft\-ware --- Prac\-tice and Experience"}
@String{j-SPELMAN-SCI-MATH-J = "Spelman Science and Mathematics Journal"}
@String{j-SUPERFRI = "Supercomputing Frontiers and Innovations"}
@String{j-TACO = "ACM Transactions on Architecture and
Code Optimization"}
@String{j-TALG = "ACM Transactions on Algorithms"}
@String{j-TCBB = "IEEE\slash ACM Transactions on
Computational Biology and Bioinformatics"}
@String{j-TECHNOMETRICS = "Technometrics"}
@String{j-TECS = "ACM Transactions on Embedded Computing
Systems"}
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
@String{j-TISSEC = "ACM Transactions on Information and System
Security"}
@String{j-TMIS = "ACM Transactions on Management Information
Systems (TMIS)"}
@String{j-TOCS = "ACM Transactions on Computer Systems"}
@String{j-TOCL = "ACM Transactions on Computational Logic"}
@String{j-TODAES = "ACM Transactions on Design Automation of
Electronic Systems (TODAES)"}
@String{j-TODS = "ACM Transactions on Database Systems"}
@String{j-TOG = "ACM Transactions on Graphics"}
@String{j-TOIS = "ACM Transactions on Information Systems"}
@String{j-TOMCCAP = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOMM = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOMPECS = "ACM Transactions on Modeling and Performance
Evaluation of Computing Systems (TOMPECS)"}
@String{j-TOMS = "ACM Transactions on Mathematical Software"}
@String{j-TOPLAS = "ACM Transactions on Programming Languages
and Systems"}
@String{j-TOS = "ACM Transactions on Storage"}
@String{j-TOSN = "ACM Transactions on Sensor Networks"}
@String{j-TRANS-AMER-INST-ELEC-ENG = "Transactions of the {American Institute
of Electrical Engineers}"}
@String{j-TRANS-IRE = "Transactions of the IRE"}
@String{j-TRETS = "ACM Transactions on Reconfigurable
Technology and Systems (TRETS)"}
@String{j-TSAS = "ACM Transactions on Spatial Algorithms and
Systems (TSAS)"}
@String{j-TUGBOAT = "TUGboat"}
@String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"}
@String{j-WIN-MAGAZINE = "Win magazine"}
@String{j-X-J = "The {X} Journal: Computing Technology with
the {X Window System}"}
@String{pub-ACADEMIC = "Academic Press"}
@String{pub-ACADEMIC:adr = "New York, USA"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-AFIPS = "AFIPS Press"}
@String{pub-AFIPS:adr = "Montvale, NJ, USA"}
@String{pub-AMS = "American Mathematical Society"}
@String{pub-AMS:adr = "Providence, RI, USA"}
@String{pub-ARTECH = "Artech House Inc."}
@String{pub-ARTECH:adr = "Norwood, MA, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-BUTTERWORTH-HEINEMANN = "Butterworth-Heinemann"}
@String{pub-BUTTERWORTH-HEINEMANN:adr = "Oxford, UK / Boston, MA, USA"}
@String{pub-CAMBRIDGE = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr = "Cambridge, UK"}
@String{pub-CHAPMAN-HALL = "Chapman and Hall, Ltd."}
@String{pub-CHAPMAN-HALL:adr = "London, UK"}
@String{pub-CRC = "CRC Press"}
@String{pub-CRC:adr = "2000 N.W. Corporate Blvd., Boca Raton, FL
33431-9868, USA"}
@String{pub-CSP = "Computer Science Press, Inc."}
@String{pub-CSP:adr = "11 Taft Court, Rockville, MD 20850, USA"}
@String{pub-DUKE = "Duke University Press"}
@String{pub-DUKE:adr = "Durham, NC, USA"}
@String{pub-ECMA = "ECMA (European Association for
Standardizing Information and
Communication Systems)"}
@String{pub-ECMA:adr = "Geneva, Switzerland"}
@String{pub-ELSEVIER = "Elsevier"}
@String{pub-ELSEVIER:adr = "Amsterdam, The Netherlands"}
@String{pub-ELSEVIER-SCIENCE = "Elsevier Science, Inc."}
@String{pub-ELSEVIER-SCIENCE:adr = "Amsterdam, The Netherlands"}
@String{pub-ESP = "Elsevier Science Publishers B.V."}
@String{pub-ESP:adr = "Amsterdam, The Netherlands"}
@String{pub-FRONTIERES = "Editions Fronti{\`{e}}res"}
@String{pub-FRONTIERES:adr = "Gif-sur-Yvette, France"}
@String{pub-IBM = "IBM Corporation"}
@String{pub-IBM:adr = "San Jose, CA, USA"}
@String{pub-IEEE = "IEEE Computer Society Press"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-ISO = "International Organization for
Standardization"}
@String{pub-ISO:adr = "Geneva, Switzerland"}
@String{pub-ITCP = "International Thomson Computer Press"}
@String{pub-ITCP:adr = "20 Park Plaza Suite 1001, Boston,
MA 02116 USA"}
@String{pub-KLUWER = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr = "Norwell, MA, USA, and Dordrecht, The
Netherlands"}
@String{pub-MATH-ASSOC-AMER = "Mathematical Association of America"}
@String{pub-MATH-ASSOC-AMER:adr = "Washington, DC, USA"}
@String{pub-MCGRAW-HILL = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr = "New York, NY, USA"}
@String{pub-MIT = "MIT Press"}
@String{pub-MIT:adr = "Cambridge, MA, USA"}
@String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}
@String{pub-MORGAN-KAUFMANN:adrnew = "2929 Campus Drive, Suite 260, San
Mateo, CA 94403, USA"}
@String{pub-MORGAN-KAUFMANN:adrsf = "San Francisco, CA, USA"}
@String{pub-MT = "M\&T Books"}
@String{pub-MT:adr = "M\&T Publishing, Inc., 501 Galveston Drive,
Redwood City, CA 94063, USA"}
@String{pub-NASA = "NASA"}
@String{pub-NASA:adr = "Washington, DC, USA"}
@String{pub-NIST = "National Institute for Standards and
Technology"}
@String{pub-NIST:adr = "Gaithersburg, MD, USA"}
@String{pub-ORA = "O'Reilly \& Associates, Inc."}
@String{pub-ORA:adr = "103a Morris Street,
Sebastopol, CA 95472,
USA,
Tel: +1 707 829 0515,
and
90 Sherman Street,
Cambridge, MA 02140,
USA,
Tel: +1 617 354 5800"}
@String{pub-ORA-FRANCE = "O'Reilly"}
@String{pub-ORA-FRANCE:adr = "Paris, France"}
@String{pub-PENGUIN = "Penguin Books"}
@String{pub-PENGUIN:adr = "Harmondsworth, UK"}
@String{pub-PH = "Pren{\-}tice-Hall"}
@String{pub-PH:adr = "Upper Saddle River, NJ 07458, USA"}
@String{pub-PLENUM = "Plenum Press"}
@String{pub-PLENUM:adr = "New York, NY, USA; London, UK"}
@String{pub-PRINCETON = "Princeton University Press"}
@String{pub-PRINCETON:adr = "Princeton, NJ, USA"}
@String{pub-SAMS = "SAMS Publishing"}
@String{pub-SAMS:adr = "Indianapolis, IN, USA"}
@String{pub-SPIE = "SPIE Optical Engineering Press"}
@String{pub-SPIE:adr = "Bellingham, WA, USA"}
@String{pub-SV = "Springer-Verlag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/
London, UK~/ etc."}
@String{pub-UNICODE = "The Unicode Consortium"}
@String{pub-UNICODE:adr = "Mountain View, CA, USA"}
@String{pub-UNICODE-SAN-JOSE:adr = "P.O. Box 700519, San Jose, CA 95170-0519,
USA, Phone: +1-408-777-5870, Fax:
+1-408-777-5082, E-mail:
\path=unicode-inc@unicode.org="}
@String{pub-USENIX = "USENIX"}
@String{pub-USENIX:adr = "Berkeley, CA, USA"}
@String{pub-VAN-NOSTRAND-REINHOLD = "Van Nostrand Reinhold"}
@String{pub-VAN-NOSTRAND-REINHOLD:adr = "New York, NY, USA"}
@String{pub-W-H-FREEMAN = "W. H. Freeman"}
@String{pub-W-H-FREEMAN:adr = "New York, NY, USA"}
@String{pub-WCP = "Wellesley-Cambridge Press"}
@String{pub-WCP:adr = "Wellesley, MA, USA"}
@String{pub-WILEY = "John Wiley"}
@String{pub-WILEY:adr = "New York, NY, USA"}
@String{pub-WILEY-INTERSCIENCE = "Wiley-In{\-}ter{\-}sci{\-}ence"}
@String{pub-WILEY-INTERSCIENCE:adr = "New York, NY, USA"}
@String{pub-WINDCREST = "Windcrest\slash McGraw-Hill"}
@String{pub-WINDCREST:adr = "Blue Ridge Summit, PA, USA"}
@String{pub-WORLD-SCI = "World Scientific Publishing
Co. Pte. Ltd."}
@String{pub-WORLD-SCI:adr = "P. O. Box 128, Farrer Road,
Singapore 9128"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
@String{ser-LNCSE = "Lecture Notes in Computational
Science and Engineering"}
@Book{dellaPorta:1558:MN,
author = "Giambattista della Porta",
title = "Magia Naturalis",
publisher = "????",
address = "Naples[, Italy]",
pages = "??",
year = "1558",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "First edition, four volumes 1558, second edition, 20
volumes 1589. Translated by Thomas Young and Samuel
Speed, \booktitle{Natural Magick by John Baptista
Porta, a Neopolitane}, London 1658",
acknowledgement = ack-ds,
rawdata = "della Porta, Giambattista (1558) {\it Magia
Naturalis}, Naples, first edition, four volumes 1558,
second edition, 20 volumes 1589. Translated by Thomas
Young and Samuel Speed, {\it Natural Magick by John
Baptista Porta, a Neopolitane}, London 1658.",
}
@Article{Peano:1890:CQR,
author = "G. Peano",
title = "Sur une Courbe Qui Remplit Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = j-MATH-ANN,
volume = "36",
pages = "157--160",
year = "1890",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "French",
rawdata = "Peano, G. (1890) ``Sur Une Courbe Qui Remplit Toute
Une Aire Plaine,'' {\it Math. Annalen},
{\bf36}:157--160.",
xxtitle = "Sur Une Courbe Qui Remplit Toute Une Aire Plaine",
}
@Article{Hilbert:1891:SAL,
author = "D. Hilbert",
title = "{{\"U}ber stetige Abbildung einer Linie auf ein
Fl{\"a}chenst{\"u}ck}. ({German}) [{On} a continuous
map of a line on a surface element]",
journal = j-MATH-ANN,
volume = "38",
pages = "459--460",
year = "1891",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata-1 = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459--460.",
rawdata-2 = "Hilbert, D. (1891) ``Ueber stetige Abbildung einer
Linie auf ein Fl{\"a}chenst{\"u}ck,'' {\it Math.
Annalen}, {\bf38}:459--460.",
}
@Article{Haar:1910:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = j-MATH-ANN,
volume = "69",
pages = "331--371",
year = "1910",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331--371, second part {\bf71}:38--53,
1912.",
}
@Article{Haar:1912:TOF,
author = "A. Haar",
title = "{Zur Theorie der Orthogonalen Funktionensysteme}.
({German}) [{On} the theory of orthogonal function
systems]",
journal = j-MATH-ANN,
volume = "71",
pages = "38--53",
year = "1912",
CODEN = "MAANA3",
ISSN = "0025-5831 (print), 1432-1807 (electronic)",
ISSN-L = "0025-5831",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Mathematische Annalen",
language = "German",
rawdata = "Haar, A. (1910) ``Zur Theorie der Orthogonalen
Funktionensysteme,'' {\it Mathematische Annalen} first
part {\bf69}:331--371, second part {\bf71}:38--53,
1912.",
}
@Article{Sierpinski:1912:CQR,
author = "W. Sierpi{\'n}ski",
title = "Sur une Courbe Qui Remplit Toute une Aire plane.
({French}) [{On} a Curve that Completely Fills a Planar
Area]",
journal = "Bull. Acad. Sci. Cracovie, Serie A",
pages = "462--478",
year = "1912",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Sierpinski:1990:NCQ}.",
acknowledgement = ack-ds,
language = "French",
rawdata = "Sierpi\'nski, W. (1912) ``Sur Une Nouvelle Courbe Qui
Remplit Toute Une Aire Plaine,'' {\it Bull. Acad. Sci.
Cracovie}, {\bf Serie~A}:462--478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143--192.",
xxtitle = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine",
}
@Article{Nyquist:1928:CTT,
author = "Harry Nyquist",
title = "Certain Topics in Telegraph Transmission Theory",
journal = j-TRANS-AMER-INST-ELEC-ENG,
volume = "47",
pages = "617--644",
year = "1928",
CODEN = "TAEEA5",
ISSN = "0096-3860",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xiph.org/ogg/flac.html",
acknowledgement = ack-ds,
fjournal = "Transactions of the American Institute of Electrical
Engineers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6413714",
rawdata = "Nyquist, Harry (1928) ``Certain Topics in Telegraph
Transmission Theory,'' {\it AIEE Transactions},
{\bf47}:617--644. Ogg squish (2006)
|http://www.xiph.org/ogg/flac.html|.",
}
@Article{Osterberg:1935:TLR,
author = "G. Osterberg",
title = "Topography of the Layer of Rods and Cones in the Human
Retina",
journal = "Acta Ophthalmologica",
volume = "(suppl. 6)",
number = "??",
pages = "1--103",
month = "????",
year = "1935",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Osterberg, G. (1935) ``Topography of the Layer of Rods
and Cones in the Human Retina,'' {\it Acta
Ophthalmologica}, (suppl. 6):1--103.",
}
@Book{Wright:1939:GSW,
author = "Ernest Vincent Wright",
title = "{Gadsby}; a story of over 50,000 words without using
the letter ``{E}''",
publisher = "Wetzel Publishing Co., Inc.",
address = "Los Angeles, CA, USA",
pages = "267",
year = "1939",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
note = "Reprinted by University Microfilms, Ann Arbor, MI,
1991.",
URL = "http://gadsby.hypermart.net/",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wright, E. V. (1939) {\it Gadsby}, Los Angeles,
Wetzel. Reprinted by University Microfilms, Ann Arbor,
MI, 1991.",
}
@Article{Hecht:1942:EQV,
author = "S. Hecht and S. Schlaer and M. H. Pirenne",
title = "Energy, Quanta and Vision",
journal = j-J-OPT-SOC-AM,
volume = "38",
pages = "196--208",
year = "1942",
CODEN = "JOSAAH",
ISSN = "0030-3941",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of the Optical Society of America",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.
Hecht, S., S. Schlaer, and M. H. Pirenne (1942)
``Energy, Quanta and Vision,'' {\it Journal of the
Optical Society of America}, {\bf38}:196--208.",
}
@Article{Levinson:1947:WRE,
author = "N. Levinson",
title = "The {Weiner} {RMS} Error Criterion in Filter Design
and Prediction",
journal = j-J-MATH-PHYS,
volume = "25",
pages = "261--278",
year = "1947",
CODEN = "JMAPAQ",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
rawdata = "Levinson, N. (1947) ``The Weiner RMS Error Criterion
in Filter Design and Prediction,'' {\it Journal of
Mathematical Physics}, {\bf25}:261--278.",
}
@Article{Shannon:1948:MTCa,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication",
journal = j-BELL-SYST-TECH-J,
volume = "27",
number = "3",
pages = "379--423",
month = jul,
year = "1948",
CODEN = "BSTJAN",
ISSN = "0005-8580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2703.html;
http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue03.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}. From the first
page: ``If the base $2$ is used the resulting units may
be called binary digits, or more briefly, {\em bits}, a
word suggested by J. W. Tukey.''. This is the first
known printed instance of the word `bit' with the
meaning of binary digit.",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol27/bstj27-3-379.pdf;
http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-3-379.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379--423 and 623--656, July and October",
}
@Article{Shannon:1948:MTCb,
author = "Claude E. Shannon",
title = "A Mathematical Theory of Communication (continued)",
journal = j-BELL-SYST-TECH-J,
volume = "27",
number = "4",
pages = "623--656",
month = oct,
year = "1948",
CODEN = "BSTJAN",
ISSN = "0005-8580",
MRclass = "60.0X",
MRnumber = "0026286 (10,133e)",
MRreviewer = "J. L. Doob",
bibdate = "Tue Nov 9 11:15:54 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1948/BSTJ.1948.2704.html;
http://www.alcatel-lucent.com/bstj/vol27-1948/bstj-vol27-issue04.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1940.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol27/bstj27-4-623.pdf;
http://www.alcatel-lucent.com/bstj/vol27-1948/articles/bstj27-4-623.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude E. (1948), ``A Mathematical Theory of
Communication,'' {\it Bell System Technical Journal},
{\bf27}:379--423 and 623--656, July and October",
}
@TechReport{Fano:1949:TI,
author = "R. M. Fano",
title = "The Transmission of Information",
type = "Technical Report",
number = "65",
institution = "Research Laboratory for Electronics, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Fano, R. M. (1949) ``The Transmission of
Information,'' Research Laboratory for Electronics,
MIT, Tech Rep. No. 65.",
}
@MastersThesis{Kraft:1949:DQG,
author = "L. G. Kraft",
title = "A Device for Quantizing, Grouping, and Coding
Amplitude Modulated Pulses",
type = "{Master}'s Thesis",
school = "Department of Electrical Engineering, MIT",
address = "Cambridge, MA, USA",
pages = "??",
year = "1949",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Kraft, L. G. (1949) {\it A Device for Quantizing,
Grouping, and Coding Amplitude Modulated Pulses},
Master's Thesis, Department of Electrical Engineering,
MIT, Cambridge, MA.",
}
@Article{Shannon:1951:PEP,
author = "Claude E. Shannon",
title = "Prediction and Entropy of Printed {English}",
journal = j-BELL-SYST-TECH-J,
volume = "30",
number = "1",
pages = "50--64",
month = jan,
year = "1951",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1951.tb01366.x",
ISSN = "0005-8580",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1951/BSTJ.1951.3001.html;
http://www.alcatel-lucent.com/bstj/vol30-1951/bstj-vol30-issue01.html;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in \cite{Slepian:1974:KPD}.",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol30/bstj30-1-50.pdf;
http://www.alcatel-lucent.com/bstj/vol30-1951/articles/bstj30-1-50.pdf",
abstract = "A new method of estimating the entropy and redundancy
of a language is described. This method exploits the
knowledge of the language statistics possessed by those
who speak the language, and depends on experimental
results in prediction of the next letter when the
preceding text is known. Results of experiments in
prediction are given, and some properties of an ideal
predictor are developed.",
acknowledgement = ack-ds # " and " # ack-nhfb,
attnote = "Included in Part A.",
author-dates = "Claude Elwood Shannon (April 30, 1916--February 24,
2001)",
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata = "Shannon, Claude (1951) ``Prediction and Entropy of
Printed English,'' {\it Bell System Technical Journal},
{\bf30}(1):50--64, January.",
received = "September 15, 1950",
}
@Article{Huffman:1952:MCM,
author = "David Huffman",
title = "A Method for the Construction of Minimum Redundancy
Codes",
journal = j-PROC-IRE,
volume = "40",
number = "9",
pages = "1098--1101",
year = "1952",
CODEN = "PIREAE",
DOI = "https://doi.org/10.1109/jrproc.1952.273898",
ISSN = "0096-8390",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the Institute of Radio Engineers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10933",
rawdata = "Huffman, David (1952) ``A Method for the Construction
of Minimum Redundancy Codes,'' {\it Proceedings of the
IRE}, {\bf40}(9):1098--1101.",
}
@Misc{Gray:1953:PCC,
author = "Frank Gray",
title = "Pulse Code Communication",
pages = "??",
day = "17",
month = mar,
year = "1953",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "United States Patent 2,632,058.",
acknowledgement = ack-ds,
rawdata = "Gray, Frank (1953) ``Pulse Code Communication,''
United States Patent 2,632,058, March 17.",
}
@Article{Chomsky:1956:TMD,
author = "N. Chomsky",
title = "Three Models for the Description of Language",
journal = j-IRE-TRANS-INF-THEORY,
volume = "2",
number = "3",
pages = "113--124",
year = "1956",
CODEN = "IRITAY",
DOI = "https://doi.org/10.1109/tit.1956.1056813",
ISSN = "0096-1000",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IRE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Chomsky, N. (1956) ``Three Models for the Description
of Language,'' {\it IRE Transactions on Information
Theory}, {\bf2}(3):113--124.",
}
@Article{McMillan:1956:TII,
author = "Brockway McMillan",
title = "Two Inequalities Implied by Unique Decipherability",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "2",
number = "4",
pages = "115--116",
month = dec,
year = "1956",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1956.1056818",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "McMillan, Brockway (1956) ``Two Inequalities Implied
by Unique Decipherability,'' {\it IEEE Transactions on
Information Theory}, {\bf2}(4):115--116, December.",
}
@Article{Givens:1958:CPU,
author = "Wallace Givens",
title = "Computation of Plane Unitary Rotations Transforming a
General Matrix to Triangular Form",
journal = j-J-SIAM,
volume = "6",
number = "1",
pages = "26--50",
month = mar,
year = "1958",
CODEN = "JSIMAV",
DOI = "https://doi.org/10.1137/0106004",
ISSN = "0368-4245 (print), 1095-712X (electronic)",
ISSN-L = "0368-4245",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siam.bib; JSTOR
database",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Society for Industrial and Applied
Mathematics",
rawdata = "Givens, Wallace (1958) ``Computation of Plane Unitary
Rotations Transforming a General Matrix to Triangular
Form,'' {\it Journal of the Society for Industrial and
Applied Mathematics}, {\bf6}(1):26--50, March.",
}
@Article{Capon:1959:PMR,
author = "J. Capon",
title = "A Probabilistic Model for Run-length Coding of
Pictures",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "5",
number = "4",
pages = "157--163",
month = dec,
year = "1959",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1959.1057512",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capon, J. (1959) ``A Probabilistic Model for
Run-length Coding of Pictures,'' {\it IEEE Transactions
on Information Theory}, {\bf5}(4):157--163, December.",
}
@Article{Gilbert:1959:VLB,
author = "E. N. Gilbert and E. F. Moore",
title = "Variable Length Binary Encodings",
journal = j-BELL-SYST-TECH-J,
volume = "38",
number = "4",
pages = "933--967",
month = jul,
year = "1959",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1959.tb01583.x",
ISSN = "0005-8580",
ISSN-L = "",
MRclass = "94.00",
MRnumber = "0108413 (21 \#7129)",
MRreviewer = "S. W. Golomb",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1959/BSTJ.1959.3804.html;
http://www.alcatel-lucent.com/bstj/vol38-1959/bstj-vol38-issue04.html;
https://www.math.utah.edu/pub/tex/bib/bstj1950.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Monograph 3515.",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol38/bstj38-4-933.pdf;
http://www.alcatel-lucent.com/bstj/vol38-1959/articles/bstj38-4-933.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
rawdata-1 = "Gilbert, E. N., and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal, Monograph 3515}, {\bf38}:933--967, July.",
rawdata-2 = "Gilbert, E. N. and E. F. Moore (1959) ``Variable
Length Binary Encodings,'' {\it Bell System Technical
Journal}, {\bf38}:933--967.",
}
@Article{Durbin:1960:FTS,
author = "J. Durbin",
title = "The Fitting of Time-Series Models",
journal = j-REV-INST-INT-STATIST,
volume = "28",
pages = "233--344",
year = "1960",
CODEN = "",
DOI = "https://doi.org/10.2307/1401322",
ISSN = "0373-1138",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Revue de l'Institut international de statistique =
Review of the International Statistical Institute",
rawdata = "Durbin J. (1960) ``The Fitting of Time-Series
Models,'' {\it JSTOR: Revue de l'Institut International
de Statistique}, {\bf28}:233--344.",
xxjournal = "JSTOR: Revue de l'Institut International de
Statistique",
}
@Article{Max:1960:QMD,
author = "Joel Max",
title = "Quantizing for minimum distortion",
journal = j-IRE-TRANS-INF-THEORY,
volume = "IT-6",
pages = "7--12",
month = mar,
year = "1960",
CODEN = "IRITAY",
DOI = "https://doi.org/10.1109/tit.1960.1057548",
ISSN = "0096-1000",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IRE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4547527",
rawdata = "Max, Joel (1960) ``Quantizing for minimum
distortion,'' {\it IRE Transactions on Information
Theory}, {\bf IT-6}:7--12, March.",
}
@Article{Freeman:1961:EAG,
author = "Herbert Freeman",
title = "On the Encoding of Arbitrary Geometric
Configurations",
journal = j-IRE-TRANS-ELEC-COMPUT,
volume = "EC-10",
number = "2",
pages = "260--268",
month = jun,
year = "1961",
CODEN = "IRELAO",
DOI = "https://doi.org/10.1109/TEC.1961.5219197",
ISSN = "0367-9950",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219197",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IRE Transactions on Electronic Computers",
rawdata = "Freeman, H. (1961) ``On The Encoding of Arbitrary
Geometric Configurations,'' {\it IRE Transactions on
Electronic Computers}, {\bf EC-10}(2):260--268, June.",
}
@Article{Karp:1961:MRC,
author = "R. S. Karp",
title = "Minimum-Redundancy Coding for the Discrete Noiseless
Channel",
journal = j-TRANS-IRE,
volume = "7",
pages = "27--38",
year = "1961",
CODEN = "",
DOI = "https://doi.org/10.1109/tit.1961.1057615",
ISSN = "",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Transactions of the IRE",
rawdata = "Karp, R. S. (1961) ``Minimum-Redundancy Coding for the
Discrete Noiseless Channel,'' {\it Transactions of the
IRE}, {\bf7}:27--38.",
}
@Book{Kendall:1961:CGD,
author = "Maurice G. Kendall",
title = "A Course in the Geometry of $n$-Dimensions",
publisher = "Hafner",
address = "New York, NY, USA",
pages = "??",
year = "1961",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Kendall, Maurice G. (1961) {\it A Course in the
Geometry of n-Dimensions}, New York, Hafner.",
}
@InCollection{Vorobev:1961:FN,
author = "Nikolai N. Vorobev",
editor = "Ian Naismith Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
volume = "2",
publisher = "Pergamon Press",
address = "Oxford, UK",
pages = "viii + 66",
year = "1961",
ISBN = "0-932750-03-6",
ISBN-13 = "978-0-932750-03-7",
LCCN = "QA241 .V613 1961",
bibdate = "Mon Jan 28 18:47:14 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprinted in
\cite{Vorobev:1983:FN}.",
series = "Popular lectures in mathematics series",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}
@Book{Abramson:1963:ITC,
author = "N. Abramson",
title = "Information Theory and Coding",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "??",
year = "1963",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Abramson, N. (1963) {\it Information Theory and
Coding}, New York, McGraw-Hill.",
}
@PhdThesis{Davisson:1964:TDC,
author = "Lee David Davisson",
title = "Theory of Data Compression",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "46",
year = "1964",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302143966",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6502683",
subject = "Electrical engineering",
}
@Article{Eisenberger:1965:SSU,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Systematic Statistics Used for Data Compression in
Space Telemetry",
journal = j-J-AM-STAT-ASSOC,
volume = "60",
number = "309",
pages = "97--133",
month = mar,
year = "1965",
CODEN = "JSTNAL",
DOI = "https://doi.org/10.1080/01621459.1965.10480778",
ISSN = "0162-1459 (print), 1537-274X (electronic)",
ISSN-L = "0162-1459",
bibdate = "Wed Jan 25 08:05:37 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314190;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See corrigenda \cite{Eisenberger:1967:CSS}.",
URL = "http://www.jstor.org/stable/2283140",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Statistical Association",
journal-URL = "http://www.tandfonline.com/loi/uasa20",
}
@Article{Chaitin:1966:LPC,
author = "Gregory J. Chaitin",
title = "On the Length of Programs for Computing Finite Binary
Sequences",
journal = j-J-ACM,
volume = "13",
number = "4",
pages = "547--569",
month = oct,
year = "1966",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/321356.321363",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "The use of Turing machines for calculating finite
binary sequences is studied from the point of view of
information theory and the theory of recursive
functions. Various results are obtained concerning the
number of:instructions ia programs. A modified form of
Turing machine is studied from the same point of view.
Aa application to the problem of defining a patternless
sequence is proposed in terms of the concepts here
developed.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Chaitin, Gregory J. (1966) ``On the Lengths of
Programs for Computing Finite Binary Sequences,'' {\it
Journal of the ACM}, {\bf13}(4):547--569, October.",
}
@Article{Davisson:1966:CST,
author = "I. D. Davisson",
title = "Comments on `Sequence Time Coding for Data
Compression'",
journal = j-PROC-IEEE,
volume = "54",
pages = "2010",
month = dec,
year = "1966",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1966.5167",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Davisson, I. D. (1966) ``Comments on `Sequence Time
Coding for Data Compression','' {\it Proceedings of the
IEEE}, {\bf54}:2010, December.",
}
@Article{Fang:1966:IIE,
author = "I. Fang",
title = "It Isn't {ETAOIN} {SHRDLU}; {It}'s {ETAONI} {RSHDLC}",
journal = j-JOURNAL-Q,
volume = "43",
pages = "761--762",
year = "1966",
CODEN = "JOQUAX",
DOI = "https://doi.org/10.1177/107769906604300418",
ISSN = "0196-3031",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journalism Quarterly",
rawdata = "Fang I. (1966) ``It Isn't ETAOIN SHRDLU; It's ETAONI
RSHDLC,'' {\it Journalism Quarterly},
{\bf43}:761--762.",
}
@Article{Golomb:1966:RLE,
author = "Solomon W. Golomb",
title = "Run-Length Encodings",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-12",
number = "3",
pages = "399--401",
year = "1966",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1966.1053907",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Golomb, Solomon W. (1966) ``Run-Length Encodings,''
{\it IEEE Transactions on Information Theory}, {\bf
IT-12}(3):399--401.",
}
@PhdThesis{Lynch:1966:DCE,
author = "Thomas Joseph Lynch",
title = "Data Compression with Error-Control Coding for Space
Telemetry",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "130",
year = "1966",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302201464",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6702337",
subject = "Electrical engineering",
}
@Article{Lynch:1966:STC,
author = "T. J. Lynch",
title = "Sequence Time Coding for Data Compression",
journal = j-PROC-IEEE,
volume = "54",
pages = "1490--1491",
month = oct,
year = "1966",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1966.5167",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Lynch, T. J. (1966) ``Sequence Time Coding for Data
Compression,'' {\it Proceedings of the IEEE},
{\bf54}:1490--1491, October.",
}
@Article{Eisenberger:1967:CSS,
author = "Isidore Eisenberger and Edward C. Posner",
title = "Corrigenda: Systematic Statistics used for Data
Compression in Space Telemetry",
journal = j-J-AM-STAT-ASSOC,
volume = "62",
number = "320",
pages = "1518--1518",
month = dec,
year = "1967",
CODEN = "JSTNAL",
DOI = "https://doi.org/10.2307/2283812",
ISSN = "0162-1459 (print), 1537-274X (electronic)",
ISSN-L = "0162-1459",
bibdate = "Wed Jan 25 08:05:39 MST 2012",
bibsource = "http://www.jstor.org/journals/01621459.html;
http://www.jstor.org/stable/i314202;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jamstatassoc1960.bib",
note = "See \cite{Eisenberger:1965:SSU}.",
URL = "http://www.jstor.org/stable/2283812",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Statistical Association",
journal-URL = "http://www.tandfonline.com/loi/uasa20",
}
@Article{Fraser:1967:DCA,
author = "A. G. Fraser",
title = "Data Compression and Automatic Programming",
journal = j-COMP-J,
volume = "10",
number = "2",
pages = "165--167",
month = aug,
year = "1967",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/10.2.165",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/10/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1960.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/10/2/165.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/100165.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_10/Issue_02/tiff/167.tif",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Kortman:1967:DCR,
author = "C. M. Kortman",
title = "Data compression by redundancy reduction",
journal = j-IEEE-SPECTRUM,
volume = "4",
number = "3",
pages = "133--139",
month = mar,
year = "1967",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1967.5216262",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 09:12:12 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1960.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Aircraft; Automotive engineering; Bandwidth; Data
communication; Data compression; Data engineering; Data
mining; Pressing; Sampling methods; Vehicles",
}
@Article{Marron:1967:ADC,
author = "B. A. Marron and P. A. D. de Maine",
title = "Automatic Data Compression",
journal = j-CACM,
volume = "10",
number = "11",
pages = "711--715",
month = nov,
year = "1967",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/363790.363813",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Fri Nov 25 18:20:16 MST 2005",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in/as: File Organization, Siwerts and
Zeitlinge (Amsterdam), 1969.",
abstract = "The ``information explosion'' noted in recent years
makes it essential that storage requirements for all
information be kept to a minimum. A fully automatic and
rapid three-part compressor which can be used with
``any'' body of information to greatly reduce slow
external storage requirements and to increase the rate
of information transmission through a computer is
described in this paper. The system will also
automatically decode the compressed information on an
item-by-item basis when it is required. The three
component compressors, which can be used separately to
accomplish their specific tasks, are discussed: NUPAK
for the automatic compression of numerical data, ANPAK
for the automatic compression of ``any'' information,
and IOPAK for further compression of information to be
stored on tape or cards.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@PhdThesis{Stanley:1967:CMD,
author = "Thomas Patrick Stanley",
title = "Compression of {Markov} Data",
type = "{Ph.D.} thesis",
school = "Princeton University",
address = "Princeton, NJ, USA",
pages = "106",
year = "1967",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302264732",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "6802519",
subject = "Electrical engineering",
}
@PhdThesis{Tunstall:1967:SNC,
author = "B. P. Tunstall",
title = "Synthesis of Noiseless Compression Codes",
type = "{Ph.D.} Dissertation",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "??",
year = "1967",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Tunstall, B. P., (1967) ``Synthesis of Noiseless
Compression Codes,'' Ph.D. dissertation, Georgia
Institute of Technology, Atlanta, GA.",
}
@PhdThesis{Bruckheim:1969:OSO,
author = "Arthur Jay Bruckheim",
title = "Optimum and Sub-Optimum Compression of Second Order
{Markov} Data",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "155",
year = "1969",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302460376",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7011656",
subject = "Electrical engineering",
}
@Article{Lynn:1969:QCC,
author = "Kenneth C. Lynn",
title = "A quantitative comparison of conventional information
compression techniques in dental literature",
journal = j-AM-DOC,
volume = "20",
number = "2",
pages = "149--151",
month = apr,
year = "1969",
CODEN = "AMDOA7",
DOI = "https://doi.org/10.1002/asi.4630200206",
ISSN = "0096-946X",
ISSN-L = "0096-946X",
bibdate = "Fri Sep 11 06:21:31 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/amdoc.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "American Documentation",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643/",
onlinedate = "19 Apr 2007",
}
@PhdThesis{Bowyer:1970:DCT,
author = "Duane Ernest Bowyer",
title = "Data Compression and Transmission",
type = "{Ph.D.} thesis",
school = "University of Florida",
address = "Gainesville, FL, USA",
pages = "146",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302406194",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7116765",
subject = "Electrical engineering",
}
@MastersThesis{Husson:1970:DCS,
author = "Georges Eugene Husson",
title = "Data compression systems",
type = "{Dip.Eng. (Elec.), M.Eng.}",
school = "McGill University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 125",
year = "1970",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile49103.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TC-QMM-49103.pdf",
acknowledgement = ack-nhfb,
}
@PhdThesis{Schneider:1970:RDC,
author = "Kenneth Stuart Schneider",
title = "Reliable Data Compression of Constant Rate {Markov}
Sources for Fixed Rate Channels",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "343",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302518830",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7101075",
subject = "Electrical engineering",
}
@PhdThesis{Wilkins:1970:SDC,
author = "Larry Clarke Wilkins",
title = "Studies on Data Compression. {Part I}: Picture Coding
By Contours. {Part II}: Error Analysis of Run-Length
Codes",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "318",
year = "1970",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302522243",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7109481",
subject = "Electrical engineering",
}
@Article{Amidon:1971:ASB,
author = "E. L. Amidon and G. S. Akin",
title = "Algorithmic Selection of the Best Method for
Compressing Map Data Strings",
journal = j-CACM,
volume = "14",
number = "12",
pages = "769--774",
month = dec,
year = "1971",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/362919.362931",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 06:21:16 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#AmidonA71;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "The best of a dozen different methods for compressing
map data is illustrated. The choices are generated by
encoding data strings-sequence of like codes-by three
methods and in four directions. Relationships are
developed between compression alternatives to avoid
comparing all of them. The technique has been used to
compress data from forest resource maps, but is widely
applicable to map and photographic data reduction.",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques); C7890 (Other special
applications of computing)",
corpsource = "Pacific Southwest Forest and Range Experiment Station,
Berkeley, CA, USA",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "data compression; data reduction; data reduction and
analysis; data strings; forest resource maps;
information retrieval; input/output; map; map storage;
run coding; storage",
oldlabel = "AmidonA71",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AmidonA71",
}
@Book{Berger:1971:RDT,
author = "Toby Berger",
title = "Rate distortion theory; a mathematical basis for data
compression",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xiii + 311",
year = "1971",
ISBN = "0-13-753103-6",
ISBN-13 = "978-0-13-753103-5",
LCCN = "Q385 .B47",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Prentice-Hall series in information and system
sciences; Prentice-Hall electrical engineering series",
acknowledgement = ack-nhfb,
subject = "Rate distortion theory; Coding theory; Information
theory",
}
@Article{Posner:1971:EED,
author = "Edward C. Posner and Eugene R. Rodemich",
title = "Epsilon Entropy and Data Compression",
journal = j-ANN-MATH-STAT,
volume = "42",
number = "6",
pages = "2079--2125",
month = dec,
year = "1971",
CODEN = "AASTAD",
DOI = "https://doi.org/10.1214/aoms/1177693077",
ISSN = "0003-4851",
ISSN-L = "0003-4851",
bibdate = "Sat May 31 09:11:21 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annmathstat.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aoms/1177693077",
acknowledgement = ack-nhfb,
fjournal = "Annals of Mathematical Statistics",
journal-URL = "http://projecteuclid.org/all/euclid.aoms/",
}
@Article{Rudner:1971:CMR,
author = "B. Rudner",
title = "Construction of Minimum-Redundancy Codes with an
Optimum Synchronization Property",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "17",
number = "4",
pages = "478--487",
month = jul,
year = "1971",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1971.1054657",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Rudner, B. (1971) ``Construction of Minimum-Redundancy
Codes with an Optimum Synchronization Property,'' {\it
IEEE Transactions on Information Theory},
{\bf17}(4):478--487, July.",
}
@Misc{Anonymous:1972:G,
author = "Anonymous",
title = "{G.711}",
pages = "??",
year = "1972",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/G.711",
acknowledgement = ack-ds,
rawdata = "G.711 (1972) |http://en.wikipedia.org/wiki/G.711|.",
}
@PhdThesis{Dosik:1972:OBC,
author = "Paul H. Dosik",
title = "An Optimal Buffer Controlled Data Compression System",
type = "{Ph.D.} thesis",
school = "Polytechnic University",
address = "New York, NY, USA",
pages = "190",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302676863",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "7228226",
subject = "Systems design",
}
@Article{Gardner:1972:MG,
author = "Martin Gardner",
title = "Mathematical Games",
journal = j-SCI-AMER,
volume = "227",
number = "2",
pages = "106--106",
month = aug,
year = "1972",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0872-106",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.gemstartvguide.com;
http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm",
acknowledgement = ack-ds,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
rawdata-1 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2006) is\hfil\break
|http://www.macrovision.com/products/ce_manufacturers/ipg_ce/vcr_plus.htm|.",
rawdata-2 = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Gemstar
(2007) |http://www.gemstartvguide.com|.",
}
@Article{Golomb:1972:RLE,
author = "S. W. Golomb",
title = "Run-Length Encodings",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-12",
number = "3",
pages = "399--401",
year = "1972",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1966.1053907",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gardner, Martin (1972) ``Mathematical Games,'' {\it
Scientific American}, {\bf227}(2):106, August. Golomb,
S. W. (1966) ``Run-Length Encodings,'' {\it IEEE
Transactions on Information Theory}
IT-12(3):399--401.",
}
@Article{Heath:1972:OBC,
author = "F. G. Heath",
title = "Origins of the Binary Code",
journal = j-SCI-AMER,
volume = "227",
number = "2",
pages = "76--76",
month = aug,
year = "1972",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0872-76",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
rawdata = "Heath, F. G. (1972) ``Origins of the Binary Code,''
{\it Scientific American}, {\bf227}(2):76, August.",
}
@PhdThesis{Kohlhaas:1972:CFC,
author = "Charles Albert Kohlhaas",
title = "Calculation of Formation Compression From Core and
Well-Tested Data",
type = "{Ph.D.} thesis",
school = "Colorado School of Mines",
address = "Golden, CO, USA",
pages = "????",
year = "1972",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302554471",
acknowledgement = ack-nhfb,
classification = "0373: Geophysics",
dissertation-thesis-number = "0231563",
subject = "Geophysics",
}
@Article{Paez:1972:MMS,
author = "M. D. Paez and T. H. Glisson",
title = "Minimum Mean Squared Error Quantization in Speech
{PCM} and {DPCM} Systems",
journal = j-IEEE-TRANS-COMM,
volume = "COM-20",
number = "2",
pages = "225--230",
year = "1972",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1972.1091123",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Paez, M. D. and T. H. Glisson (1972) ``Minimum Mean
Squared Error Quantization in Speech PCM and DPCM
Systems,'' {\it IEEE Transactions on Communications},
{\bf COM-20}(2):225--230",
}
@PhdThesis{Ready:1972:MDC,
author = "Patrick John Ready",
title = "Multispectral Data Compression Through Transform
Coding and Block Quantization",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "164",
year = "1972",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302618152",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7230964",
subject = "Electrical engineering",
}
@Article{Schalkwijk:1972:ASC,
author = "J. Pieter M. Schalkwijk",
title = "An Algorithm for Source Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "18",
number = "3",
pages = "395--399",
month = may,
year = "1972",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1972.1054832",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Schalkwijk, J. Pieter M. ``An Algorithm for Source
Coding,'' {\it IEEE Transactions on Information
Theory}, {\bf18}(3):395--399, May.",
}
@MastersThesis{Tsui:1972:DCP,
author = "Stephen S. T. Tsui",
title = "Data Compression with Particular Applications to Video
Signals",
type = "{M.Eng.}",
school = "Department of Electrical Engineering, McGill
University",
address = "Montr{\'e}al, QC, Canada",
pages = "iii + 151",
month = dec,
year = "1972",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://digitool.library.mcgill.ca/thesisfile51654.pdf;
http://www.collectionscanada.ca/obj/thesescanada/vol1/QMM/TC-QMM-51654.pdf",
acknowledgement = ack-nhfb,
advisor = "M. Fukada",
}
@Article{Wells:1972:FCU,
author = "M. Wells",
title = "File Compression Using Variable Length Encodings",
journal = j-COMP-J,
volume = "15",
number = "4",
pages = "308--313",
month = nov,
year = "1972",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/15.4.308",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:50 MST 2012",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/15/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/",
note = "See correspondence \cite{Gibbons:1973:CFC}.",
URL = "http://comjnl.oxfordjournals.org/content/15/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150308.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/308.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/309.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/310.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/311.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/312.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/313.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723; 911",
corpsource = "Univ. Leeds, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "codes; computer programming languages; computers,
digital; data handling; data processing; decoding;
encoding; file compression; hardware; software
techniques; variable length encodings",
treatment = "P Practical",
}
@Article{Zeckendorf:1972:RNN,
author = "E. Zeckendorf",
title = "Repr{\'e}sentation des Nombres naturels par une Somme
de Nombres de {Fibonacci} ou de Nombres de {Lucas}.
({French}) [{Representation} of the natural numbers by
a sum of {Fibonacci} or {Lucas} numbers]",
journal = j-BULL-SOC-R-SCI-LIEGE,
volume = "41",
pages = "179--182",
year = "1972",
CODEN = "BSRSA6",
ISSN = "0037-9565",
ISSN-L = "0037-9565",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
acknowledgement = ack-ds,
fjournal = "Bulletin de la Soci{\'e}t{\'e} royale des sciences de
Li{\`e}ge",
language = "French",
rawdata = "Zeckendorf, E. (1972) ``Repr\'esentation des Nombres
Naturels par Une Somme de Nombres de Fibonacci ou de
Nombres de Lucas,'' {\it Bull. Soc. Roy. Sci. Li\`ege},
{\bf41}:179--182.",
}
@InProceedings{Faller:1973:ASD,
author = "N. Faller",
booktitle = "Record of the 7th Asilomar Conference on Circuits,
Systems, and Computers",
title = "An Adaptive System for Data Compression",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "593--597",
year = "1973",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Faller N. (1973) ``An Adaptive System for Data
Compression,'' {\it Record of the 7th Asilomar
Conference on Circuits, Systems, and Computers}, pp.
593--597.",
}
@Article{Gibbons:1973:CFC,
author = "Charles J. Gibbons and M. Wells",
title = "Correspondence: On {``File Compression Using Variable
Length Encodings''}",
journal = j-COMP-J,
volume = "16",
number = "3",
pages = "287--287",
month = aug,
year = "1973",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/16.3.287",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Oct 07 17:13:59 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/",
note = "See \cite{Wells:1972:FCU}.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/287.tif",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Grimm:1973:ALP,
author = "Richard E. Grimm",
title = "The Autobiography of {Leonardo Pisano}",
journal = j-FIB-QUART,
volume = "11",
number = "1",
pages = "99--104",
month = feb,
year = "1973",
CODEN = "FIBQAU",
ISSN = "0015-0517",
ISSN-L = "0015-0517",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.fq.math.ca/11-1.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
URL = "http://www.fq.math.ca/Scanned/11-1/grimm.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
ajournal = "Fib. Quart",
fjournal = "Fibonacci Quarterly",
journal-URL = "http://www.fq.math.ca/",
rawdata = "Grimm, R. E. (1973) ``The Autobiography of Leonardo
Pisano,'' {\it Fibonacci Quarterly},
{\bf11}(1):99--104, February.",
}
@PhdThesis{Joglekar:1973:DCR,
author = "Anil Narayan Joglekar",
title = "Data Compression In Recursive Estimation with
Applications to Navigation Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "149",
year = "1973",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302696388",
acknowledgement = ack-nhfb,
classification = "0538: Aerospace materials",
dissertation-thesis-number = "7406491",
subject = "Aerospace materials",
}
@Book{Knuth:1973:ACP,
author = "Donald E. Knuth",
title = "The Art of Computer Programming, Volume 1, Fundamental
Algorithms",
publisher = pub-AW,
address = pub-AW:adr,
edition = "Second",
pages = "xxi + 634",
year = "1973\noopsort{a}",
ISBN = "0-201-03821-8",
ISBN-13 = "978-0-201-03821-7",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Knuth, Donald E. (1973) {\it The Art of Computer
Programming}, Vol. 1, 2nd Ed., Reading, MA,
Addison-Wesley.",
}
@PhdThesis{Pore:1973:FAD,
author = "Michael David Pore",
title = "Factor Analysis as a Data Compression Technique",
type = "{Ph.D.} thesis",
school = "Texas Tech University",
address = "Lubbock, TX, USA",
pages = "381",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302771096",
acknowledgement = ack-nhfb,
classification = "0405: Mathematics",
dissertation-thesis-number = "7405821",
subject = "Mathematics",
}
@PhdThesis{Wang:1973:SST,
author = "Robert Tien Pei Wang",
title = "A Study of the Structure of Television Pictures as
Applied to Practical Data Compression Techniques",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "106",
year = "1973",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302674792",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7314996",
subject = "Electrical engineering",
}
@Article{Ahmed:1974:DCT,
author = "N. Ahmed and T. Natarajan and K. R. Rao",
title = "{Discrete Cosine Transfom}",
journal = j-IEEE-TRANS-COMPUT,
volume = "C-23",
number = "1",
pages = "90--93",
month = jan,
year = "1974",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/T-C.1974.223784",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See comments \cite{Shanmugam:1975:CDC}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672377",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
rawdata-1 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers}, {\bf C-23}:90--93.",
rawdata-2 = "Ahmed, N., T. Natarajan, and R. K. Rao (1974)
``Discrete Cosine Transform,'' {\it IEEE Transactions
on Computers} C-23:90--93.",
}
@Article{Bahl:1974:IDC,
author = "L. R. Bahl and H. Kobayashi",
title = "Image data compression by predictive coding. {II}.
Encoding algorithms",
journal = j-IBM-JRD,
volume = "18",
number = "2",
pages = "172--179",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of two-level (black and white)
digital images are examined. Algorithms for prediction
are discussed as well as coding techniques for encoding
the prediction error pattern. First, the authors survey
some schemes for encoding if the error pattern is
assumed to be memoryless. Then a method is developed
for encoding certain run-length distributions. Finally,
some experimental results for sample documents are
presented.",
acknowledgement = ack-nhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "algorithms; applications of computers; codes,
symbolic; communication; communications applications of
computers; data compression; digital signals; encoding;
image data compression; information theory ---
Filtering and Prediction Theory; predictive coding; two
level digital images; video signals",
treatment = "P Practical; X Experimental",
}
@PhdThesis{Felt:1974:DCT,
author = "Douglas Charles Felt",
title = "Data-Compression Techniques Using Adaptive
Translation-Permutation Codes",
type = "{Ph.D.} thesis",
school = "Washington State University",
address = "Pullman, WA, USA",
pages = "113",
year = "1974",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302713192",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "7416362",
subject = "Computer science",
}
@Article{Hahn:1974:NTC,
author = "Bruce Hahn",
title = "A New Technique for Compression and Storage of Data",
journal = j-CACM,
volume = "17",
number = "8",
pages = "434--436",
month = aug,
year = "1974",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/361082.361086",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 06:47:50 MST 2001",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Hahn74;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper describes techniques that can, in most
cases, decrease storage size by a factor of from two to
four. The techniques involve special handling of
leading and trailing blanks, and the encoding of other
symbols in groups of fixed size as unique fixed point
numbers. The efficiency of the system is considered and
pertinent statistics are given and compared with
statistics for other information coding techniques.",
acknowledgement = ack-nhfb,
annote = "Generation of a character dictionary and its use to
minimize space.",
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "731",
corpsource = "Univ. Waterloo, Ont., Canada",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "coding techniques; compression; data handling; data
management; data storage; efficiency; encoding; file
maintenance; file organisation; fixed point numbers;
information coding techniques; information theory;
programs; text compression; utility",
oldlabel = "Hahn74",
treatment = "A Application; P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hahn74",
}
@Article{Jordan:1974:COR,
author = "B. W. {Jordan, Jr.} and R. C. Barrett",
title = "A Cell Organized Raster Display for Line Drawings",
journal = j-CACM,
volume = "17",
number = "2",
pages = "70--77",
month = feb,
year = "1974",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/360827.360836",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#JordanB74;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Raster scan computer graphics displays with ``real
time'' character generators have previously been
limited to alphanumeric characters. A display is
described which extends the capabilities of this
organization to include general graphics. The
feasibility of such a display is shown by deriving the
minimum number of patterns required in the read only
memory of the character generator to synthesize an
arbitrary line. The synthesis process does not
compromise picture quality, since the resulting dot
patterns are identical with those of a conventional
raster display. The time constraints of a raster
display are shown to be satisfied for a typical design
for very complex line drawings.",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "C5540 (Terminals and graphic displays); C6130 (Data
handling techniques)",
classification = "722",
corpsource = "Northwestern Univ., Evanston, IL, USA",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "arbitrary line; cell organized raster display; complex
line drawings; computer; computer graphic equipment;
computer graphics; computer peripheral equipment;
discrete; dot; dot generation; graphics displays;
image; line drawing; line drawings; matrix displays;
minimum; number of patterns; patterns; read only
memory; real time character generators",
oldlabel = "JordanB74",
rawdata = "Jordan, B. W., and R. C. Barrett (1974) ``A Cell
Organized Raster Display for Line Drawings,'' {\it
Communications of the ACM}, {\bf17}(2):70--77.",
treatment = "P Practical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JordanB74",
}
@Article{Kobayashi:1974:IDC,
author = "H. Kobayashi and L. R. Bahl",
title = "Image data compression by predictive coding. {I}.
Prediction algorithms",
journal = j-IBM-JRD,
volume = "18",
number = "2",
pages = "164--171",
month = mar,
year = "1974",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "Predictive coding techniques for efficient
transmission or storage of two-level (black and white)
digital images are dealt with.",
acknowledgement = ack-nhfb,
classcodes = "B6120B (Codes); B6140 (Signal processing and
detection); C1260 (Information theory); C7410F
(Communications computing)",
classification = "723; 731",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "adaptive linear predictor; adaptive predictor with
finite; algorithms; codes, symbolic; communications
applications of computers; data compression; digital
signals; encoding; fixed predictor; image data
compression; information theory --- Filtering and
Prediction Theory; memory; prediction; predictive
coding; two level digital images; video signals",
treatment = "P Practical; X Experimental",
}
@Book{Slepian:1974:KPD,
editor = "David Slepian",
title = "Key papers in the development of information theory",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "vi + 463",
year = "1974",
ISBN = "0-87942-027-8, 0-87942-028-6 (paperback)",
ISBN-13 = "978-0-87942-027-7, 978-0-87942-028-4 (paperback)",
LCCN = "Q360 .S54",
bibdate = "Sat Nov 20 11:29:48 MST 2010",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "IEEE Press selected reprint series",
acknowledgement = ack-nhfb,
subject = "Information theory",
}
@Article{Elias:1975:UCS,
author = "P. Elias",
title = "Universal Codeword Sets and Representations of the
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-21",
number = "2",
pages = "194--203",
month = mar,
year = "1975",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1975.1055349",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-21}(2):194--203, March.",
rawdata-2 = "Elias, P. (1975) ``Universal Codeword Sets and
Representations of the Integers,'' {\it IEEE
Transactions on Information Theory},
{\bf21}(2):194--203, March.",
}
@Article{Gallager:1975:OSC,
author = "Robert G. Gallager and David C. van Voorhis",
title = "Optimal Source Codes for Geometrically Distributed
Integer Alphabets",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-21",
number = "3",
pages = "228--230",
month = mar,
year = "1975",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1975.1055357",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Gallager, Robert G., and David C. van Voorhis (1975)
``Optimal Source Codes for Geometrically Distributed
Integer Alphabets,'' {\it IEEE Transactions on
Information Theory}, {\bf IT-21}(3):228--230, March.",
}
@InProceedings{Gottlieb:1975:CCM,
author = "D. Gottlieb and others",
booktitle = "Proceedings of the National Computer Conference, May
19--22, 1975, Anaheim, California.",
title = "A Classification of Compression Methods and their
Usefulness for a Large Data Processing Center",
volume = "44",
publisher = pub-AFIPS,
address = pub-AFIPS:adr,
pages = "453--458",
year = "1975",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Gottlieb, D., et al. (1975) {\it A Classification of
Compression Methods and their Usefulness for a Large
Data Processing Center}, Proceedings of National
Computer Conference, {\bf44}:453--458.",
}
@PhdThesis{Hilbert:1975:JCS,
author = "Edward Erwin Hilbert",
title = "A Joint Clustering \slash Data Compression Concept",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1975",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302793284",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "0510317",
subject = "Electrical engineering",
}
@Article{Ling:1975:BOI,
author = "H. Ling and F. P. Palermo",
title = "Block-Oriented Information Compression",
journal = j-IBM-JRD,
volume = "19",
number = "2",
pages = "141--145",
month = mar,
year = "1975",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.192.0141",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A new scheme is presented for information compression
that does not use information statistics. Each
information block is represented by two sub-blocks
called the alphabet and the generator. The alphabet
contains the linearly independent elements; the
generator is computed through the linear combination of
the linearly dependent elements. The total length of
these two sub-blocks is generally shorter (never
greater) than the original block.",
acknowledgement = ack-nhfb,
classcodes = "B6110 (Information theory); C1260 (Information
theory); C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, White Plains, NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "binary; binary number compression; CPUs; data base;
data bases; data compression; data processing;
information block; information compression; information
statistics; information theory; information theory ---
Data Compression; number reconstruction; one pass
algorithm; statistical analysis; statistics",
treatment = "T Theoretical or Mathematical",
}
@Article{Mayne:1975:ICF,
author = "A. Mayne and E. B. James",
title = "Information Compression by Factorising Common
Strings",
journal = j-COMP-J,
volume = "18",
number = "2",
pages = "157--160",
month = may,
year = "1975",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/18.2.157",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:55 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/18/2/157.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/157.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/158.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/159.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_02/tiff/160.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques)",
classification = "723",
corpsource = "Dept. of Computing and Control, Imperial Coll. of Sci.
and Technol., London, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "bases; codes, symbolic; common factors; data; data
compression; data processing; data transmission time;
economy; factorising common strings; file organisation;
information compression; recoded; security; sequences
of characters; storage space; string processing",
treatment = "P Practical",
}
@Article{Shanmugam:1975:CDC,
author = "K. S. Shanmugam",
title = "Comments on {``Discrete Cosine Transform''}",
journal = j-IEEE-TRANS-COMPUT,
volume = "C-24",
number = "7",
pages = "759--759",
month = jul,
year = "1975",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/T-C.1975.224301",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 12 07:57:55 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib",
note = "See \cite{Ahmed:1974:DCT}.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672894",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Turner:1975:GCS,
author = "L. F. Turner",
title = "The `on-ground' compression of satellite data",
journal = j-COMP-J,
volume = "18",
number = "3",
pages = "243--247",
month = aug,
year = "1975",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/18.3.243",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:56 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/18/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/18/3/243.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/243.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/244.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/245.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/246.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_03/tiff/247.tif",
acknowledgement = ack-nhfb,
classcodes = "B6140 (Signal processing and detection); C1260
(Information theory); C7490 (Computing in other
engineering fields)",
classification = "655; 716; 717; 718",
corpsource = "Electrical Engng. Dept., Imperial Coll. of Sci. and
Technol., London, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "aerospace applications of computers; data compression;
ESRO 1; Hadamard; information theory; on ground
compression; Run length method; satellite data;
satellites; Shannon Fano method; transformation",
treatment = "A Application; P Practical",
}
@PhdThesis{Achterberg:1976:BCD,
author = "Donald Dean Achterberg",
title = "Block Code Data Compression: a Rate Distortion
Theoretic Approach",
type = "{Ph.D.} thesis",
school = "University of Southern California",
address = "Los Angeles, CA, USA",
pages = "????",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302800779",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "0513287",
subject = "Electrical engineering",
}
@Article{Bentley:1976:AOA,
author = "J. L. Bentley and A. Chi-Chih Yao",
title = "An Almost Optimal Algorithm for Unbounded Searching",
journal = j-INFO-PROC-LETT,
volume = "5",
number = "3",
pages = "82--87",
day = "??",
month = aug,
year = "1976",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(76)90071-5",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of North Carolina,
Chapel Hill, NC, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "algorithm; almost optimal; comparison searching;
table; table lookup; unbounded searching",
rawdata = "Bentley, J. L. and A. C. Yao (1976) ``An Almost
Optimal Algorithm for Unbounded Searching,'' {\it
Information Processing Letters}, {\bf5}(3):82--87.",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Budihardjo:1976:DCA,
author = "Peter Setiadi Budihardjo",
title = "Data Compression Algorithms for Encoding of Digital
Sources",
type = "[unknown]",
school = "Computer Communications Network Group, University of
Waterloo",
address = "Waterloo, ON, Canada",
pages = "xii + 152",
year = "1976",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Report E-69.",
URL = "http://search.proquest.com/docview/302833917",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NK28592",
subject = "Electrical engineering",
xxpages = "xiv [i.e., xv] + 153",
xxyear = "1977",
}
@Article{Dance:1976:ALD,
author = "D. L. Dance and U. W. Pooch",
title = "An adaptive on line data compression system",
journal = j-COMP-J,
volume = "19",
number = "3",
pages = "216--224",
month = aug,
year = "1976",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/19.3.216",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:47:58 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/19/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/19/3/216.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/216.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/217.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/218.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/219.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/220.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/221.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/222.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/223.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_19/Issue_03/tiff/224.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques); C6150E (General
utility programs)",
classification = "723",
corpsource = "Univ. of Arkansas, Little Rock, AR, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "adaptive; buffering; data compression; data
processing; data set; dynamic priority assignment;
FORTRAN; input/output control; interface; item
relocation; online information; programs; system;
utility programs",
treatment = "P Practical",
}
@Book{Davisson:1976:DC,
editor = "Lee D. Davisson and Robert M. Gray",
title = "Data compression",
volume = "14",
publisher = "Dowden, Hutchinson and Ross",
address = "Stroudsburg, PA, USA",
pages = "xv + 407",
year = "1976",
ISBN = "0-87933-089-9",
ISBN-13 = "978-0-87933-089-7",
LCCN = "TK5102.5 .D335 1976",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Benchmark papers in electrical engineering and
computer science",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Coding theory",
}
@TechReport{Hunt:1976:ADF,
author = "James W. Hunt and M. Douglas McIlroy",
title = "An Algorithm for Differential File Comparison",
type = "Computing Science Technical Report",
number = "41",
institution = "Bell Labs",
address = "Murray Hill, NJ, USA",
pages = "??",
month = jun,
year = "1976",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Hunt, James W. and M. Douglas McIlroy (1976) ``An
Algorithm for Differential File Comparison,'' Computing
Science Technical Report No. 41, Murray Hill, NJ, Bell
Labs, June.",
}
@Article{Lempel:1976:CFS,
author = "A. Lempel and J. Ziv",
title = "On the Complexity of Finite Sequences",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "22",
number = "1",
pages = "75--81",
year = "1976",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1976.1055501",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Lempel A. and J. Ziv (1976) ``On the Complexity of
Finite Sequences,'' {\it IEEE Transactions on
Information Theory}, {\bf22}(1):75--81.",
}
@Article{McCreight:1976:SES,
author = "Edward M. McCreight",
title = "A Space-Economical Suffix Tree Construction
Algorithm",
journal = j-J-ACM,
volume = "23",
number = "2",
pages = "262--272",
month = apr,
year = "1976",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/321941.321946",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "A new algorithm is presented for constructing
auxiliary digital search trees to aid in exact-match
substring searching. This algorithm has the same
asymptotic running time bound as previously published
algorithms, but is more economical in space. Some
implementation considerations are discussed, and new
work on the modification of these search trees in
response to incremental changes in the strings they
index (the update problem) is presented.",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "723; 901",
comment = "Algorithms to build, use, and modify suffix tree are
presented. The advantage of this algorithm over other
linear time algorithms to perform similar tasks is that
this algorithm uses less space. This seems to the
primary reference for suffix trees.",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming; information science ---
Information Retrieval",
rawdata = "McCreight, E. M (1976) ``A Space Economical Suffix
Tree Construction Algorithm,'' {\it Journal of the
ACM}, {\bf32}(2):262--272, April.",
}
@Article{Morrin:1976:CLC,
author = "T. H. {Morrin, II}",
title = "Chain-Link Compression of Arbitrary Black-White
Images",
journal = j-CGIP,
volume = "5",
number = "2",
pages = "172--189",
month = jun,
year = "1976",
CODEN = "CGIPBG",
DOI = "https://doi.org/10.1016/0146-664x(76)90026-5",
ISSN = "0146-664X",
ISSN-L = "0146-664X",
bibdate = "Fri Feb 7 08:07:49 MST 1997",
bibsource = "Compendex database; Graphics/imager/imager.76.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "Computer Graphics and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "character recognition equipment; data processing ---
Data Reduction and Analysis; encoding graphical data,
data compression; image processing",
}
@PhdThesis{Nussbaum:1976:SCA,
author = "Howard Steven Nussbaum",
title = "Source Coding and Adaptive Data Compression for
Communication Networks",
type = "{Ph.D.} thesis",
school = "University of California, Los Angeles",
address = "Los Angeles, CA, USA",
pages = "220",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302826487",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "7707677",
subject = "Systems design",
}
@PhdThesis{Pasco:1976:SCA,
author = "Richard Clark Pasco",
title = "Source Coding Algorithms for Fast Data Compression",
type = "{Ph.D.} Dissertation",
school = "Department of Electrical Engineering, Stanford
University",
address = "Stanford, CA, USA",
pages = "113",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302770683",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7626055",
rawdata = "Pasco, R. (1976) ``Source Coding Algorithms for Fast
Data Compression,'' Ph.D. dissertation, Dept. of
Electrical Engineering, Stanford University, Stanford,
CA.",
subject = "Electrical engineering",
}
@Article{Rissanen:1976:GKI,
author = "J. J. Rissanen",
title = "Generalized {Kraft} Inequality and Arithmetic Coding",
journal = j-IBM-JRD,
volume = "20",
number = "3",
pages = "198--203",
month = may,
year = "1976",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.203.0198",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
MRclass = "94A10",
MRnumber = "54 \#12359",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "arithmetic coding; associated entropy; coding speed;
decoding; encoding; finite alphabet; finite strings;
generalised Kraft inequality",
rawdata = "Rissanen, J. J. (1976) ``Generalized Kraft Inequality
and Arithmetic Coding,'' {\it IBM Journal of Research
and Development}, {\bf20}:198--203, May.",
reviewer = "Jack K. Wolf",
treatment = "T Theoretical or Mathematical",
}
@Article{Roetling:1976:HME,
author = "P. G. Roetling",
title = "Halftone Method with Edge Enhancement and Moir{\'e}
Suppression",
journal = j-J-OPT-SOC-AM,
volume = "66",
pages = "985--989",
year = "1976",
CODEN = "JOSAAH",
DOI = "https://doi.org/10.1364/josa.66.000985",
ISSN = "0030-3941",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of the Optical Society of America",
rawdata = "Roetling, P. G. (1976) ``Halftone Method with Edge
Enhancement and Moir\'e Suppression,'' {\it Journal of
the Optical Society of America}, {\bf66}:985--989.",
}
@Article{Rubin:1976:ETF,
author = "Frank Rubin",
title = "Experiments in Text File Compression",
journal = j-CACM,
volume = "19",
number = "11",
pages = "617--623",
month = nov,
year = "1976",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/360363.360368",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 07:17:30 MST 2001",
bibsource = "Compendex database;
http://dblp.uni-trier.de/db/journals/cacm/cacm19.html#Rubin76;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A system for the compression of data files, viewed as
strings of characters, is presented. \par
The method is general, and applies equally well to
English, to PL/I, or to digital data. The system
consists of an encoder, an analysis program, and a
decoder. \par
Two algorithms for encoding a string differ slightly
from earlier proposals. The analysis program attempts
to find an optimal set of codes for representing
substrings of the file. Four new algorithms for this
operation are described and compared. Various
parameters in the algorithms are optimized to obtain a
high degree of compression for sample texts.",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "IBM, Poughkeepsie, NY, USA",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
journalabr = "Commun ACM",
keywords = "analysis program; comparison of algorithms; computer
programming --- Subroutines; data file compaction; data
processing; decoder; encoder; Huffman codes; N-gram
encoding; strings of characters; text compression; text
editing; text file compression",
oldlabel = "Rubin76",
treatment = "P Practical; X Experimental",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Rubin76",
}
@MastersThesis{Snow:1976:ICT,
author = "Roderick Charles Snow",
title = "An investigation of clustering techniques, query
methods and data base compression with respect to the
enlist system",
type = "{M.Sc.C.S.}",
school = "The University of New Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1976",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302820785",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
dissertation-thesis-number = "MK30462",
subject = "Library science",
}
@Book{Wirth:1976:ADS,
author = "Niklaus Wirth",
title = "Algorithms $+$ Data Structures $=$ Programs",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Second",
pages = "xvii + 366",
year = "1976",
ISBN = "0-13-022418-9",
ISBN-13 = "978-0-13-022418-7",
LCCN = "QA76.6 .W561",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
series = "Prentice-Hall Series in Automatic Computation",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wirth, N. (1976) {\it Algorithms + Data Structures =
Programs}, 2nd ed., Englewood Cliffs, NJ,
Prentice-Hall.",
}
@TechReport{Aronson:1977:CST,
author = "Jules Aronson",
title = "Computer science and technology: data compression ---
a comparison of methods",
type = "NBS special publication",
number = "500-12",
institution = "Department of Commerce, National Bureau of Standards,
Institute for Computer Sciences and Technology",
address = "Washington, DC, USA",
pages = "iv + 31 + 1",
month = jun,
year = "1977",
CODEN = "XNBSAV",
ISSN = "0083-1883",
ISSN-L = "0083-1883",
LCCN = "QC100 .U57 no. 500-12",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC;
z3950.loc.gov:7090/Voyager",
note = "ERIC Document Number: ED149732",
URL = "http://ucblibraries.colorado.edu/circulation/forms/ericrequest.htm;
http://www.eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED149732",
abstract = "This report delineates the theory and terminology of
data compression. It surveys four data compression
methods--null suppression, pattern substitution,
statistical encoding, and telemetry compression--and
relates them to a standard statistical coding problem,
i.e., the noiseless coding problem. The well defined
solution to that problem can serve as a standard on
which to base the effectiveness of data compression
methods. The simple measure described for calculating
the effectiveness of a data compression method is based
on the characterization of the solution to the
noiseless coding problem. Finally, guidelines are
stated concerning the relevance of data compression to
data processing applications. (Author/DAG).",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Coding theory;
Comparative Analysis; Computer Programs; Computer
Storage Devices; Cost Effectiveness; Data Processing;
Databases; Federal Government; Guidelines; Information
Scientists; Information Storage; Information Theory;
Standards.",
}
@Article{Chaitin:1977:AIT,
author = "Gregory J. Chaitin",
title = "Algorithmic Information Theory",
journal = j-IBM-JRD,
volume = "21",
number = "4",
pages = "350--359",
month = jul,
year = "1977",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.214.0350",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
MRclass = "94A15 (68A20)",
MRnumber = "56 \#15151",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B0240Z (Other topics in statistics); B6110
(Information theory); C1260 (Information theory); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "algorithm theory; algorithmic information theory;
functions; information theory; probability; recursive;
recursive function theory",
rawdata = "Chaitin, Gregory J. (1977) ``Algorithmic Information
Theory,'' {\it IBM Journal of Research and
Development}, {\bf21}:350--359, July.",
reviewer = "Robert P. Daley",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Chen:1977:DCB,
author = "Po Hsiin Chen",
title = "Data Compression for Binary and Multi-Level Satellite
Imagery",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "176",
year = "1977",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302819991",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7730067",
subject = "Electrical engineering",
}
@Article{Chen:1977:FCA,
author = "Wen-Hsiung Chen and C. Harrison Smith and S. C.
Fralick",
title = "A Fast Computational Algorithm For the Discrete Cosine
Transform",
journal = j-IEEE-TRANS-COMM,
volume = "25",
number = "9",
pages = "1004--1009",
month = sep,
year = "1977",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1977.1093941",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Chen, Wen-Hsiung, C. Harrison Smith, and S. C. Fralick
(1977) ``A Fast Computational Algorithm For the
Discrete Cosine Transform,'' {\it IEEE Transactions on
Communications}, {\bf25}(9):1004--1009, September.",
}
@Article{Lawrence:1977:NUC,
author = "John C. Lawrence",
title = "A New Universal Coding Scheme for the Binary
Memoryless Source",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "23",
number = "4",
pages = "466--472",
month = jul,
year = "1977",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1977.1055749",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Lawrence, John C. (1977) ``A New Universal Coding
Scheme for the Binary Memoryless Source,'' {\it IEEE
Transactions on Information Theory},
{\bf23}(4):466--472, July.",
}
@Book{Mandelbrot:1977:FFC,
author = "Beno{\^\i}t B. Mandelbrot",
title = "Fractals: form, chance, and dimension",
publisher = pub-W-H-FREEMAN,
address = pub-W-H-FREEMAN:adr,
edition = "Revised",
pages = "xvi + 365",
year = "1977",
ISBN = "0-7167-0473-0, 0-7167-0474-9 (paperback)",
ISBN-13 = "978-0-7167-0473-7, 978-0-7167-0474-4 (paperback)",
LCCN = "QA447 .M3613 1977a",
MRclass = "69.00 (92A05)",
MRnumber = "0471493 (57 \#11224)",
MRreviewer = "Leon Glass",
bibdate = "Wed Sep 5 09:26:37 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Translated from the French",
ZMnumber = "Zbl 0376.28020",
acknowledgement = ack-nhfb,
tableofcontents = "I. Introduction \\
II. How long is the coast of Britain? \\
III. Uses of nonconstrained chance \\
IV. Fractal events and noises \\
V. Fractal clusters of stellar matter \\
VI. Turbulence, intermittency and curdling \\
VII. Meteorites, moon craters and soap \\
VIII. Uses of self constrained chance \\
IX. Fractional Brownian facets of rivers, relief and
turbulence \\
X. Miscellany \\
XI. Biographical and historical sketches \\
XII. Mathematical lexicon and addenda",
}
@Article{Roetling:1977:BAC,
author = "P. G. Roetling",
title = "Binary Approximation of Continuous Tone Images",
journal = j-PHOTOGR-SCI-ENG,
volume = "21",
pages = "60--65",
year = "1977",
CODEN = "PSENAC",
ISSN = "0031-8760",
ISSN-L = "0031-8760",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Photographic Science and Engineering",
rawdata = "Roetling, P. G. (1977) ``Binary Approximation of
Continuous Tone Images,'' {\it Photography Science and
Engineering}, {\bf21}:60--65.",
xxjournal = "Photography Science and Engineering",
}
@Article{Ting:1977:CHT,
author = "T. C. Ting",
title = "Compacting homogeneous text for minimizing storage
space",
journal = j-INT-J-COMPUT-INF-SCI,
volume = "6",
number = "3",
pages = "211--221",
month = sep,
year = "1977",
CODEN = "IJCIAH",
DOI = "https://doi.org/10.1007/bf01002332",
ISSN = "0091-7036",
bibdate = "Sat Apr 26 12:20:22 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "School of Information and Computer Sci., Georgia Inst.
of Technol., Atlanta, GA, USA",
fjournal = "International Journal of Computer and Information
Sciences",
keywords = "data compression; decoding; encoding; homogeneous
text; numerical coding method; storage; storage
allocation; storage space; text compaction; text
editing; text information",
treatment = "G General Review",
}
@Article{Ziv:1977:UAS,
author = "Jacob Ziv and Abraham Lempel",
title = "A Universal Algorithm for Sequential Data
Compression",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-23",
number = "3",
pages = "337--343",
month = may,
year = "1977",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1977.1055714",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Thu Jan 16 17:56:50 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A universal algorithm for sequential data compression
is presented. Its performance is investigated with
respect to a nonprobabilistic model of constrained
sources. The compression ratio achieved by the proposed
universal code uniformly approaches the lower bounds on
the compression ratios attainable by block-to-variable
codes and variable-to-block codes designed to match a
completely specified source.",
acknowledgement = ack-ds # " and " # ack-nhfb,
author-dates = "Jacob Ziv (27 November 1931--25 March 2023); Abraham
Lempel (10 February 1936--4 February 2023)",
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Ziv, Jacob, and A. Lempel (1977) ``A Universal
Algorithm for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-23}(3):337--343.",
rawdata-2 = "Ziv, J., and A. Lempel (1977) ``A Universal Algorithm
for Sequential Data Compression,'' {\it IEEE
Transactions on Information Theory},
IT-23(3):337--343.",
}
@PhdThesis{CapitantdeVillebonne:1978:DID,
author = "Patrice Jean-Marie {Capitant de Villebonne}",
title = "Design and Implementation of Distortion-Free
Compression Techniques for {LANDSAT} Data and
Television Images",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "79",
year = "1978",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302940557",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7822484",
subject = "Electrical engineering",
}
@Article{Even:1978:EEC,
author = "Shimon Even and Michael Rodeh",
title = "Economical Encoding of Commas Between Strings",
journal = j-CACM,
volume = "21",
number = "4",
pages = "315--317",
month = apr,
year = "1978",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/359460.359480",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68A10",
MRnumber = "58 3648",
MRreviewer = "John Cherniavsky",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#EvenR78;
https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
corpsource = "Israel Inst. of Technol., Haifa, Israel",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "commas; data handling; delimiters; encoding; extra
cost; strings",
oldlabel = "EvenR78",
rawdata = "Even, S. and M. Rodeh (1978) ``Economical Encoding of
Commas Between Strings,'' {\it Communications of the
ACM}, {\bf21}(4):315--317, April.",
treatment = "T Theoretical or Mathematical",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/EvenR78",
}
@Article{Gallager:1978:VTH,
author = "Robert G. Gallager",
title = "Variations On a Theme By {Huffman}",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-24",
number = "6",
pages = "668--674",
month = nov,
year = "1978",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1978.1055959",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Gallager, Robert G. (1978) ``Variations On a Theme By
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf IT-24}(6):668--674, November.",
rawdata-2 = "Gallager, Robert G. (1978) ``Variations on a Theme by
Huffman,'' {\it IEEE Transactions on Information
Theory}, {\bf24}(6):668--674, November.",
}
@PhdThesis{Hooker:1978:OSQ,
author = "Lawrence Eugene Hooker",
title = "Optimum Sampling and Quantizing for Multiple Channel
Data Compression Systems",
type = "{Ph.D.} thesis",
school = "North Carolina State University",
address = "Raleigh, NC, USA",
pages = "306",
year = "1978",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302897622",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7905490",
subject = "Electrical engineering",
}
@Article{Jakobsson:1978:HCB,
author = "M. Jakobsson",
title = "{Huffman} coding in bit-vector compression",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "304--307",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(78)90023-6",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94B25",
MRnumber = "80f:94026",
MRreviewer = "Ram Autar",
bibdate = "Tue Nov 17 10:49:43 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "bit vector compression; codes, symbolic; compression
gain; data compression; encoding; Huffman coding;
information theory --- Data Compression",
treatment = "T Theoretical or Mathematical",
}
@Article{Lea:1978:TCA,
author = "R. M. Lea",
title = "Text Compression with an Associative Parallel
Processor",
journal = j-COMP-J,
volume = "21",
number = "1",
pages = "45--56",
month = feb,
year = "1978",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/21.1.45",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:02 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/21/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1970.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/21/1/45.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/45.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/46.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/47.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/48.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/49.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/50.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/51.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/52.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/53.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/54.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/55.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_01/tiff/56.tif",
acknowledgement = ack-nhfb,
classcodes = "C0310 (EDP management); C6130 (Data handling
techniques)",
classification = "723; 901",
corpsource = "Dept. of Electrical Engng. and Electronics, Brunel
Univ., Uxbridge, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "associative parallel processor; byte; compression;
computer selection and evaluation; data compression;
data processing; fixed record length system; hardware;
information retrieval systems; microprocessor system;
organised variable record length; parallel processing;
text editing; textual information; textual information
decompression",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@PhdThesis{Linde:1978:DTT,
author = "Yoseph Linde",
title = "The Design of Tree and Trellis Data Compression
Systems",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "142",
year = "1978",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302929849",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7808809",
subject = "Electrical engineering",
}
@Article{Louis-Gavet:1978:DAI,
author = "Guy Louis-Gavet",
title = "Diverses applications issues d'une fonction $f$ de
compactage bas{\'e}e sur une {\'e}tude math{\'e}matique
du langage naturel (compactage de donn{\'e}es,
comparaison de textes, hash-coding). [Various
Applications Issued from a Compression Function $f$
Based on a Mathematical Study of the Natural Language
(Data Compression, Comparison of Texts, Hash-Coding)]",
journal = "RAIRO Informatique/Computer Science (Revue
Fran{\c{c}}aise d'Automatique, d'Informatique et de
Recherche Operationnelle)",
volume = "12",
number = "1",
pages = "47--71",
month = "????",
year = "1978",
CODEN = "RSINDN",
bibdate = "Sat Jan 25 17:38:12 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
abstract = "Various compression techniques are discussed, along
with numerous applications. A method of compression is
considered which is based on a mathematical study
concerned with the repartition of characters in a set
natural language. A high rate of compression without
risk of redundancies is obtained. It is about 1/30
(sometimes much higher) when operating in an
interrogational mode and about one quarter when we want
to find again the original data. The applications
described demonstrate the interest of this approach:
compression of keywords of a thesaurus, of names-first
names, of titles-authors of books; comparison of texts,
and applications in Hash-coding.",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "RAIRO Inf Comput Sci",
keywords = "computer programming languages",
language = "French",
}
@PhdThesis{Ma:1978:DC,
author = "Joong Soo Ma",
title = "Data Compression",
type = "{Ph.D.} thesis",
school = "University of Massachusetts Amherst",
address = "Amherst, MA, USA",
pages = "148",
year = "1978",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302919063",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7903802",
subject = "Electrical engineering",
}
@Book{Rabiner:1978:DPS,
author = "Lawrence R. Rabiner and Ronald W. Schafer",
title = "Digital Processing of Speech Signals",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1978",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Prentice-Hall Series in Signal Processing",
acknowledgement = ack-ds,
rawdata = "Rabiner, Lawrence R. and Ronald W. Schafer (1978) {\it
Digital Processing of Speech Signals}, Englewood
Cliffs, NJ, Prentice-Hall Series in Signal
Processing.",
}
@InProceedings{Storer:1978:MMD,
author = "James A. Storer and Thomas G. Szymanski",
title = "The macro model for data compression (Extended
Abstract)",
crossref = "ACM:1978:CRT",
pages = "30--39",
year = "1978",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Teuhola:1978:CMC,
author = "Jukka Teuhola",
title = "A Compression Method for Clustered Bit-Vectors",
journal = j-INFO-PROC-LETT,
volume = "7",
number = "6",
pages = "308--311",
day = "??",
month = oct,
year = "1978",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(78)90024-8",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "723; C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku,
Finland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "clustered bit vectors; codes, symbolic; compression
method; data compression; encoding; fixed to variable
encoding; information theory --- Data Compression;
variable to fixed encoding; variable to variable
encoding",
rawdata = "Teuhola, J. (1978) ``A Compression Method for
Clustered Bit-Vectors,'' {\it Information Processing
Letters}, {\bf7}:308--311, October.",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Yalabik:1978:CDC,
author = "Nese Yalabik",
title = "Contour Data Compression Exploiting Curve-To-Curve
Dependence",
type = "{Ph.D.} thesis",
school = "Brown University",
address = "Providence, RI, USA",
pages = "100",
year = "1978",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302882442",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "7906632",
subject = "Electrical engineering",
}
@Article{Ziv:1978:CIS,
author = "Jacob Ziv and A. Lempel",
title = "Compression of Individual Sequences via Variable-Rate
Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-24",
number = "5",
pages = "530--536",
month = sep,
year = "1978",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.1978.1055934",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
rawdata-1 = "Ziv, Jacob and A. Lempel (1978) ``Compression of
Individual Sequences via Variable-Rate Coding,'' {\it
IEEE Transactions on Information Theory}, {\bf
IT-24}(5):530--536.",
rawdata-2 = "Ziv, J., and A. Lempel (1978) ``Compression of
Individual Sequences via Variable-Rate Coding,'' {\it
IEEE Transactions on Information Theory}
IT-24(5):530--536.",
}
@TechReport{Beebe:1979:IFD,
author = "Nelson H. F. Beebe",
title = "Integral File Data Compression",
institution = inst-CLSC,
address = inst-CLSC:adr,
pages = "39",
day = "18",
month = may,
year = "1979",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Camana:1979:VBC,
author = "P. Camana",
title = "Video-bandwidth compression: a study in tradeoffs",
journal = j-IEEE-SPECTRUM,
volume = "16",
number = "6",
pages = "24--29",
month = jun,
year = "1979",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1979.6368035",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "bandwidth compression; Encoding; Facsimile; Hardware;
Image coding; image compression technology; image
quality; Image resolution; military application;
picture processing; Quantization; tradeoffs;
Transforms",
}
@PhdThesis{Evans:1979:SRE,
author = "Arnold Kerry Evans",
title = "Statistical Representation of Electrocardiographic
Body Surface Maps for Feature Identification, Data
Compression and Classification",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "96",
year = "1979",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302988278",
acknowledgement = ack-nhfb,
classification = "0541: Biomedical research",
dissertation-thesis-number = "7924352",
subject = "Biomedical research",
}
@InProceedings{Galil:1979:NFG,
author = "Zvi Galil and Amnon Naamad",
title = "Network flow and generalized path compression",
crossref = "ACM:1979:CRE",
pages = "13--26",
year = "1979",
bibdate = "Wed Feb 20 18:33:31 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@PhdThesis{Houston:1979:AFM,
author = "George Branston Houston",
title = "The Application of Formal Models to a Fully Adaptive
General Purpose Digital Data Compression System",
type = "{Ph.D.} thesis",
school = "University of Washington",
address = "Seattle, WA, USA",
pages = "359",
year = "1979",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302947120",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "7927805",
subject = "Computer science",
}
@Misc{Rice:1979:SPU,
author = "Robert F. Rice",
title = "Some Practical Universal Noiseless Coding Techniques",
type = "JPL Publication",
number = "79-22",
institution = "Jet Propulsion Laboratory",
address = "Pasadena, CA, USA",
pages = "??",
month = mar,
year = "1979",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rice, Robert F. (1979) ``Some Practical Universal
Noiseless Coding Techniques,'' Jet Propulsion
Laboratory, JPL Publication 79-22, Pasadena, CA,
March.",
}
@Article{Rubin:1979:ASC,
author = "F. Rubin",
title = "Arithmetic Stream Coding Using Fixed Precision
Registers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "25",
number = "6",
pages = "672--675",
month = nov,
year = "1979",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1979.1056107",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Rubin, F. (1979) ``Arithmetic Stream Coding Using
Fixed Precision Registers,'' {\it IEEE Transactions on
Information Theory}, {\bf25}(6):672--675, November.",
}
@Article{Rubin:1979:CAD,
author = "Frank Rubin",
title = "Cryptographic Aspects of Data Compression Codes",
journal = j-CRYPTOLOGIA,
volume = "3",
number = "4",
pages = "202--205",
month = oct,
year = "1979",
CODEN = "CRYPE6",
DOI = "https://doi.org/10.1080/0161-117991854061",
ISSN = "0161-1194 (print), 1558-1586 (electronic)",
ISSN-L = "0161-1194",
bibdate = "Mon Jun 30 15:38:28 MDT 2008",
bibsource = "http://ourworld.compuserve.com/homepages/crypto/BIBALL.HTM;
http://www.dean.usma.edu/math/pubs/cryptologia/;
https://www.math.utah.edu/pub/tex/bib/cryptologia.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also {\em Comm. ACM}, 19 (November 1976):
616--623.",
URL = "http://www.informaworld.com/smpp/content~content=a741902806~db=all~order=page",
acknowledgement = ack-nhfb,
fjournal = "Cryptologia",
journal-URL = "http://www.tandfonline.com/loi/ucry20",
romanvolume = "III",
xxtitle = "Crypto of Data Compression Codes",
xxtitle = "Experiments in Text File Compression",
}
@PhdThesis{Smith:1979:SPA,
author = "George Heavener Smith",
title = "Spectral Peak Amplitude Coding for Voice Data
Compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "101",
year = "1979",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/302972664",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8002017",
subject = "Electrical engineering",
}
@Article{Tarjan:1979:APC,
author = "Robert Endre Tarjan",
title = "Applications of Path Compression on Balanced Trees",
journal = j-J-ACM,
volume = "26",
number = "4",
pages = "690--715",
month = oct,
year = "1979",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322154.322161",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Several fast algorithms are presented for computing
functions defined on paths in trees under various
assumptions. The algorithms are based on tree
manipulation methods first used to efficiently
represent equivalence relations. The algorithms have $
O((m + n) \alpha (m + n, n)) $ running times, where $m$
and $n$ are measures of the problem size and $ \alpha $
is a functional inverse of Ackermann's function. By
using one or more of these algorithms in combination
with other techniques, it is possible to solve several
graph problems in $ O(m \alpha (m, n))$ time, where $m$
is the number of edges and $n$ is the number of
vertices in the problem graph.",
acknowledgement = ack-nhfb,
classification = "723; 921",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "computer programming --- Subroutines; data processing;
mathematical techniques --- Trees",
}
@PhdThesis{Borjesson:1980:DCS,
author = "Per Ola B{\"o}rjesson",
title = "Data compression and signal estimation with
application to digitized electrocardiograms",
type = "Doctoral thesis",
school = "Lunds universitet",
address = "Lund, Sweden",
pages = "44",
year = "1980",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:08 MST 2013",
bibsource = "catalog.crl.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Dunham:1980:AAS,
author = "James G. Dunham",
title = "Abstract Alphabet Sliding-Block Entropy Compression
Coding with a Fidelity Criterion",
journal = j-ANN-PROBAB,
volume = "8",
number = "6",
pages = "1085--1092",
month = dec,
year = "1980",
CODEN = "APBYAE",
DOI = "https://doi.org/10.1214/aop/1176994570",
ISSN = "0091-1798 (print), 2168-894X (electronic)",
ISSN-L = "0091-1798",
bibdate = "Sun Apr 20 10:44:17 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annprobab1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aop/1176994570",
acknowledgement = ack-nhfb,
fjournal = "Annals of Probability",
journal-URL = "http://projecteuclid.org/all/euclid.aop",
}
@Article{Frank:1980:PIT,
author = "Amalie J. Frank and J. D. Daniels and Diane R.
Unangst",
title = "Progressive Image Transmission Using a Growth-Geometry
Coding",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "897--909",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11755",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Frank, Amalie J., J. D. Daniels, and Diane R. Unangst
(1980) ``Progressive Image Transmission Using a
Growth-Geometry Coding,'' {\it Proceedings of the
IEEE}, {\bf68}(7):897--909, July.",
}
@Article{Hunter:1980:IDF,
author = "R. Hunter and A. H. Robinson",
title = "International Digital Facsimile Coding Standards",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "854--867",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11751",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Hunter, R., and A. H. Robinson (1980) ``International
Digital Facsimile Coding Standards,'' {\it Proceedings
of the IEEE}, {\bf68}(7):854--867, July.",
}
@Article{Knowlton:1980:PTG,
author = "Kenneth Knowlton",
title = "Progressive Transmission of Grey-Scale and Binary
Pictures by Simple, Efficient, and Lossless Encoding
Schemes",
journal = j-PROC-IEEE,
volume = "68",
number = "7",
pages = "885--896",
month = jul,
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11754",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Knowlton, Kenneth (1980) ``Progressive Transmission of
Grey-Scale and Binary Pictures by Simple, Efficient,
and Lossless Encoding Schemes,'' {\it Proceedings of
the IEEE}, {\bf68}(7):885--896, July.",
}
@Article{Linde:1980:AVQ,
author = "Y. Linde and A. Buzo and R. M. Gray",
title = "An Algorithm for Vector Quantization Design",
journal = j-IEEE-TRANS-COMM,
volume = "COM-28",
pages = "84--95",
month = jan,
year = "1980",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1980.1094577",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata-1 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, {\bf COM-28}:84--95,
January.",
rawdata-2 = "Linde,~Y., A. Buzo, and R. M. Gray (1980) ``An
Algorithm for Vector Quantization Design,'' {\it IEEE
Transactions on Communications}, COM-28:84--95,
January.",
}
@PhdThesis{Marr:1980:TDP,
author = "James Douglas Marr",
title = "Two-Dimensional Prediction for Data Rate Compression
of Lpc Parameters",
type = "{Ph.D.} thesis",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "154",
year = "1980",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303008916",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8105828",
subject = "Electrical engineering",
}
@Article{Netravali:1980:PCP,
author = "A. Netravali and J. O. Limb",
title = "Picture Coding: a Preview",
journal = j-PROC-IEEE,
volume = "68",
pages = "366--406",
year = "1980",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/proc.1980.11647",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Netravali, A. and J. O. Limb (1980) ``Picture Coding:
A Preview,'' {\it Proceedings of the IEEE},
{\bf68}:366--406.",
}
@Article{Peterson:1980:CPD,
author = "James Lyle Peterson",
title = "Computer Programs for Detecting and Correcting
Spelling Errors",
journal = j-CACM,
volume = "23",
number = "12",
pages = "676--687",
month = dec,
year = "1980",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/359038.359041",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:47:16 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See remarks
\cite{Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Stout:1980:IPE,
author = "Quentin F. Stout",
title = "Improved Prefix Encodings of the Natural Numbers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "26",
number = "5",
pages = "607--609",
month = sep,
year = "1980",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1980.1056237",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Stout, Quentin F. (1980) ``Improved Prefix Encodings
of the Natural Numbers,'' {\it IEEE Transactions on
Information Theory}, {\bf26}(5):607--609, September.",
}
@Article{Aleh:1981:DUB,
author = "Avner Aleh and K. Dan Levin",
title = "The determination of upper bounds for economically
effective compression in packet switching networks",
journal = j-SIGMETRICS,
volume = "11",
number = "1",
pages = "64--72",
month = "Spring",
year = "1981",
CODEN = "????",
DOI = "https://doi.org/10.1145/800047.801694",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 10:58:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "This paper deals with the economic tradeoffs
associated with data compression in a packet switching
environment. In section II we present the data profile
concept and the compression analysis of typical
file-transfer data strings. This is followed by a
compression cost saving model that is developed in
section III. Upper bounds for an economically effective
compression service are derived there, and the paper
concludes with an example of these bounds based on
state of the art technology.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@PhdThesis{Barba:1981:MAD,
author = "Joseph Barba",
title = "A Modified Adaptive Delta Modulator for Video Data
Compression",
type = "{Ph.D.} thesis",
school = "City University of New York",
address = "New York, NY, USA",
pages = "219",
year = "1981",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303098954",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8203266",
subject = "Electrical engineering",
}
@Article{Davis:1981:DCL,
author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock",
title = "Data Compression in Limited Capacity Microcomputer
Systems",
journal = j-INFO-PROC-LETT,
volume = "13",
number = "4--5",
pages = "138--141",
day = "??",
month = "End",
year = "1981",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(81)90043-0",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
annote = "This issue was labelled End 1981, instead of Day Month
1981.",
classification = "723; 731; C6120 (File organisation); C6130 (Data
handling techniques); C7250L (Non-bibliographic
retrieval systems)",
corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh,
UK",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "computers, microprocessor; data base systems; data
compression; data reduction; data reduction and
analysis; database; information retrieval; information
theory --- Data Compression; microcomputer systems;
storage capacity",
treatment = "P Practical",
}
@Article{Dunlavey:1981:LES,
author = "Michael R. Dunlavey",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "608--608",
month = sep,
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358746.383429",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:48:13 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Miller:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Eng:1981:SPB,
author = "K. Y. Eng and O. C. Yue",
title = "Spectral Properties and Band-Limiting Effects of
Time-Compressed {TV} Signals in a Time-Compression
Multiplexing System",
journal = j-BELL-SYST-TECH-J,
volume = "60",
number = "9",
pages = "2167--2185",
month = nov,
year = "1981",
CODEN = "BSTJAN",
DOI = "https://doi.org/10.1002/j.1538-7305.1981.tb00315.x",
ISSN = "0005-8580",
bibdate = "Tue Nov 9 11:15:56 MST 2010",
bibsource = "http://bstj.bell-labs.com/oldfiles/year.1981/BSTJ.1981.6009.html;
http://www.alcatel-lucent.com/bstj/vol60-1981/bstj-vol60-issue09.html;
https://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://bstj.bell-labs.com/BSTJ/images/Vol60/bstj60-9-2167.pdf;
http://www.alcatel-lucent.com/bstj/vol60-1981/articles/bstj60-9-2167.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Bell System Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}
@PhdThesis{Fong:1981:DOA,
author = "Chung-Bin Fong",
title = "The Decision Oriented Approach to
Information-Preserving Data Compression of Digitized
Images",
type = "{Ph.D.} thesis",
school = "University of Pittsburgh",
address = "Pittsburgh, PA, USA",
pages = "147",
year = "1981",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303140921",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8214505",
subject = "Electrical engineering",
}
@Article{Krichevsky:1981:PUC,
author = "R. E. Krichevsky and V. K. Trofimov",
title = "The Performance of Universal Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-27",
pages = "199--207",
month = mar,
year = "1981",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1981.1056331",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Krichevsky, R. E., and V. K. Trofimov (1981) ``The
Performance of Universal Coding,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-27}:199--207, March.",
}
@Article{Langdon:1981:CBW,
author = "Glen G. Langdon and ~and J. Rissanen",
title = "Compression of Black White Images with Arithmetic
Coding",
journal = j-IEEE-TRANS-COMM,
volume = "COM-29",
number = "6",
pages = "858--867",
month = jun,
year = "1981",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1981.1095052",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Langdon, Glen G.,~and J. Rissanen (1981) ``Compression
of Black White Images with Arithmetic Coding,'' {\it
IEEE Transactions on Communications}, {\bf
COM-29}(6):858--867, June.",
}
@PhdThesis{Lee:1981:DCS,
author = "Dong Hee Lee",
title = "Data Compression with Source Coding for Unknown Source
Statistics",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "86",
year = "1981",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303164012",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8205240",
subject = "Electrical engineering",
}
@InProceedings{Lynch:1981:ADC,
author = "Clifford A. Lynch and E. B. Brownrigg",
title = "Application of Data Compression to a Large
Bibliographic Data Base",
crossref = "Zaniolo:1981:VLD",
pages = "435--447",
year = "1981",
bibdate = "Fri Jan 12 07:50:27 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb81.html",
URL = "http://www.vldb.org/dblp/db/conf/vldb/LynchB81.html",
acknowledgement = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/l/Lynch:Clifford_A=.html;
http://www.vldb.org/dblp/db/indices/a-tree/b/Brownrigg:E=_B=.html",
}
@Article{Miller:1981:LES,
author = "Lance A. Miller",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "608--609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:49:22 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Dunlavey:1981:LES,Nix:1981:ESE,Peterson:1981:LES}.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Nix:1981:ESE,
author = "Robert P. Nix",
title = "Experience With a Space Efficient Way to Store a
Dictionary",
journal = j-CACM,
volume = "24",
number = "5",
pages = "297--298",
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358645.358654",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Nix81;
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "Nix81",
rawdata = "Nix, R. (1981) ``Experience With a Space Efficient Way
to Store a Dictionary,'' {\it Communications of the
ACM}, {\bf24}(5):297--298.",
remark = "Comment on \cite{Peterson:1981:LES}",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Nix81",
}
@Article{Peterson:1981:LES,
author = "James L. Peterson",
title = "Letter to the {Editor}: On Spelling Correction and
Beyond",
journal = j-CACM,
volume = "24",
number = "9",
pages = "609--609",
month = sep,
year = "1981",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sun Feb 04 16:49:21 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
note = "See
\cite{Peterson:1980:CPD,Dunlavey:1981:LES,Miller:1981:LES,Nix:1981:ESE}.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Reghbati:1981:ODC,
author = "H. K. Reghbati",
title = "An Overview of Data Compression Techniques",
journal = j-COMPUTER,
volume = "14",
number = "4",
pages = "71--76",
year = "1981",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/c-m.1981.220416",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Reghbati, H. K. (1981) ``An Overview of Data
Compression Techniques,'' {\it IEEE Computer},
{\bf14}(4):71--76.",
}
@Article{Robinson:1981:ASC,
author = "P. J. Robinson and Dave Singer",
title = "Another Spelling Correction Program",
journal = j-CACM,
volume = "24",
number = "5",
pages = "296--297",
year = "1981",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358645.358652",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#RobinsonS81;
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
mynote = "Computing Practices, Note",
oldlabel = "RobinsonS81",
rawdata = "Robinson, P. and D. Singer (1981) ``Another Spelling
Correction Program,'' {\it Communications of the ACM},
{\bf24}(5):296--297.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/RobinsonS81",
}
@Article{Rodeh:1981:LAD,
author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even",
title = "Linear Algorithm for Data Compression via String
Matching",
journal = j-J-ACM,
volume = "28",
number = "1",
pages = "16--24",
month = jan,
year = "1981",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322234.322237",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata = "Rodeh, Michael, Vaughan R. Pratt and Shimon Even
(1981) ``Linear Algorithm for Data Compression via
String Matching,'' Journal of the ACM,
{\bf28}(1):16--24, January.",
}
@PhdThesis{Stewart:1981:TDC,
author = "Lawrence Colm Stewart",
title = "Trellis Data Compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "137",
year = "1981",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303177936",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8124158",
subject = "Electrical engineering",
}
@PhdThesis{Yazdi:1981:ELD,
author = "Mohammad Ali Jezu Tabatabai Yazdi",
title = "Edge Location and Data Compression for Digital
Imagery",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "178",
year = "1981",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303174746",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8210265",
subject = "Electrical engineering",
}
@Book{Anonymous:1982:DCH,
author = "Anonymous",
title = "Data compression hardware and software market: Data
compression products in the {U.S}",
publisher = "Frost and Sullivan",
address = "106 Fulton Strett, New York 10038, NY, USA",
pages = "vii + 184",
month = may,
year = "1982",
LCCN = "HD9696.D383 U6316 1982",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data transmission equipment industry; United States;
Market surveys",
}
@Article{Bell:1982:KSC,
author = "D. A. Bell and S. M. Deen",
title = "Key Space Compression and Hashing in {PRECI}",
journal = j-COMP-J,
volume = "25",
number = "4",
pages = "486--492",
month = nov,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.4.486",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/25/4/486.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/486.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/487.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/488.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/489.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/490.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/491.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_04/tiff/492.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6130 (Data handling
techniques); C6160 (Database management systems
(DBMS))",
classification = "723",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtonabbey, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "data handling; data processing; database designer's;
database management systems; DBMS; direct access
performance; hash trees; hashing; key; PRECI;
sequential access; space compression; storage; table
lookup; tool-kit; utilization",
treatment = "P Practical",
}
@Article{Ishii:1982:HED,
author = "Atsushi Ishii and Kenji Kouno and Yasunori Maezawa",
title = "Highly Efficient Data Compression Method for Newspaper
Image Data",
journal = j-FUJITSU-SCI-TECH-J,
volume = "V 18",
number = "N 2",
pages = "199--225",
month = jun,
year = "1982",
CODEN = "FUSTA4",
ISSN = "0016-2523",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "A highly efficient image data compression unit is
considered which reduces data file size and data
transfer time in computerized typesetting systems. In a
study of the correlation between picture elements, it
is found that in the predictive coding method, which
reduces redundancy in screen dot image data, the most
efficient reference picture elements were information
on three neighboring screen dots. Based on this
finding, an adaptive predictive split coding method is
developed which predicts and encodes screen dot image
data and character image data according to the most
adaptive reference picture elements. This coding method
utilizes a variable length control code system to
prevent reduction of the compression factor when
different kinds of data are used. It proves to be a
highly efficient compression method for encoding
fullpage, page segment, and character font data.",
acknowledgement = ack-nhfb,
classification = "731; 741; 745",
fjournal = "Fujitsu scientific and technical journal",
keywords = "adaptive predictive split coding; codes, symbolic;
control code; image processing; information theory ---
data compression; screen dot image data; typesetting
--- computer applications",
}
@Article{Kundu:1982:CLM,
author = "S. Kundu",
title = "On a Class of Linear Maps for Data Compression",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-8",
number = "5",
pages = "530--532",
month = sep # "\slash " # oct,
year = "1982",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.1982.235877",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 08:07:37 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702981",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Article{Lloyd:1982:LSQ,
author = "S. P. Lloyd",
title = "Least Squares Quantization in {PCM}",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-28",
pages = "129--137",
month = mar,
year = "1982",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1982.1056489",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Lloyd, S. P. (1982) ``Least Squares Quantization in
PCM,'' {\it IEEE Transactions on Information Theory},
{\bf IT-28}:129--137, March.",
}
@Book{Mandelbrot:1982:FGN,
author = "Beno{\^\i}t B. Mandelbrot",
title = "The Fractal Geometry of Nature",
publisher = pub-W-H-FREEMAN,
address = pub-W-H-FREEMAN:adr,
pages = "v + 460",
year = "1982",
ISBN = "0-7167-1186-9",
ISBN-13 = "978-0-7167-1186-5",
LCCN = "QA447 .M25 1982; QA447 .M357 1982",
MRclass = "00A69 (51-01 54F45 85A35 86A99)",
MRnumber = "665254 (84h:00021)",
MRreviewer = "S. Dubuc",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Schriftenreihe f{\"u}r den Referenten. [Series for the
Referee]",
ZMnumber = "Zbl 0504.28001",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Mandelbrot, B. (1982) {\it The Fractal Geometry of
Nature}, San Francisco, CA, W. H. Freeman.",
remark = "Revised edition of \cite{Mandelbrot:1977:FFC}.",
}
@Article{Pechura:1982:FAT,
author = "Michael A. Pechura",
title = "File Archival Techniques Using Data Compression",
journal = j-CACM,
volume = "25",
number = "9",
pages = "605--609",
year = "1982",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/358628.358635",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 22 07:11:57 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm25.html#Pechura82;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
oldlabel = "Pechura82",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Pechura82",
}
@InProceedings{Ronson:1982:ABT,
author = "J. Ronson and J. Dewitte",
booktitle = "Proceedings of the IEEE International Conference on
Acoustics, Speech, and Signal Processing",
title = "Adaptive Block Truncation Coding Scheme Using an Edge
Following Algorithm",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1235--1238",
year = "1982",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Ronson, J. and J. Dewitte (1982) ``Adaptive Block
Truncation Coding Scheme Using an Edge Following
Algorithm,'' {\it Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal
Processing}, Piscataway, NJ, IEEE Press, pp.
1235--1238.",
}
@Article{Storer:1982:DCT,
author = "James A. Storer and Thomas G. Szymanski",
title = "Data Compression via Textual Substitution",
journal = j-J-ACM,
volume = "29",
number = "4",
pages = "928--951",
month = oct,
year = "1982",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/322344.322346",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
rawdata-1 = "Storer, James A. and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM}, {\bf29}:928--951.",
rawdata-2 = "Storer, J. A., and T. G. Szymanski (1982) ``Data
Compression via Textual Substitution,'' {\it Journal of
the ACM} {\bf29}:928--951.",
}
@MastersThesis{Tao:1982:RTS,
author = "Bertram P. M. Tao",
title = "Real-Time Speech Data Compression System Based Upon
Vector Quantization",
type = "{M.S.} thesis",
school = "California State University, Long Beach",
address = "Long Beach, CA, USA",
pages = "189",
year = "1982",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303109401",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1319587",
subject = "Electrical engineering",
}
@Article{Wu:1982:ABA,
author = "J. K. Wu and R. E. Burge",
title = "Adaptive Bit Allocation for Image Compression",
journal = j-CGIP,
volume = "19",
number = "4",
pages = "392--400",
month = aug,
year = "1982",
CODEN = "CGIPBG",
DOI = "https://doi.org/10.1016/0146-664x(82)90024-7",
ISSN = "0146-664X",
ISSN-L = "0146-664X",
bibdate = "Fri Feb 7 08:36:21 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "Computer Graphics and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0146664X",
journalabr = "Comput Graphics Image Process",
keywords = "image processing; pattern recognition systems",
}
@Article{Burt:1983:LPC,
author = "Peter J. Burt and Edward H. Adelson",
title = "The {Laplacian} Pyramid as a Compact Image Code",
journal = j-IEEE-TRANS-COMM,
volume = "COM-31",
number = "4",
pages = "532--540",
month = apr,
year = "1983",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1983.1095851",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Burt, Peter J., and Edward H. Adelson (1983) ``The
Laplacian Pyramid as a Compact Image Code,'' {\it IEEE
Transactions on Communications}, {\bf
COM-31}(4):532--540, April.",
}
@InProceedings{Dewitte:1983:OBC,
author = "J. Dewitte and J. Ronson",
editor = "H. W. Schussler",
booktitle = "Signal Processing II: Theories and
Applications---Proceedings of EUSIPCO 83",
title = "Original Block Coding Scheme for Low Bit Rate Image
Transmission",
publisher = pub-ELSEVIER-SCIENCE,
address = pub-ELSEVIER-SCIENCE:adr,
pages = "143--146",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Dewitte, J., and J. Ronson (1983) ``Original Block
Coding Scheme for Low Bit Rate Image Transmission,''
{\it Signal Processing II: Theories and
Applications---Proceedings of EUSIPCO 83}, H. W.
Schussler, ed., Amsterdam, Elsevier Science Publishers
B. V. (North-Holland), pp. 143--146.",
}
@Article{Fraenkel:1983:TCP,
author = "Aviezri S. Fraenkel and Moshe Mor and Y. Perl",
title = "Is Text Compression by Prefixes and Suffixes
Practical?",
journal = j-ACTA-INFO,
volume = "20",
number = "4",
pages = "371--389",
month = dec,
year = "1983",
CODEN = "AINFA2",
DOI = "https://doi.org/10.1007/BF00264280",
ISSN = "0001-5903 (print), 1432-0525 (electronic)",
ISSN-L = "0001-5903",
MRclass = "68U15 (94A29)",
MRnumber = "732312 (85c:68084)",
bibdate = "Mon May 26 18:16:34 2014",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
https://www.math.utah.edu/pub/tex/bib/actainfo.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
series = "Monographs in Visual Communication",
acknowledgement = ack-nhfb,
fjournal = "Acta Informatica",
journal-URL = "http://link.springer.com/journal/236",
}
@PhdThesis{Kurien:1983:PDC,
author = "Thomas Kurien",
title = "A Partitioned Data Compression Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Connecticut",
address = "Storrs, CT, USA",
pages = "167",
year = "1983",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303265149",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8319202",
subject = "Electrical engineering",
}
@Article{Langdon:1983:ARL,
author = "Glenn G. Langdon",
title = "An Adaptive Run Length Coding Algorithm",
journal = j-IBM-TDB,
volume = "26",
number = "7B",
pages = "3783--3785",
month = dec,
year = "1983",
CODEN = "IBMTAA",
ISSN = "0018-8689",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IBM Technical Disclosure Bulletin",
rawdata = "Langdon, Glenn G. (1983a) ``An Adaptive Run Length
Coding Algorithm,'' {\it IBM Technical Disclosure
Bulletin}, {\bf26}(7B):3783--3785, December.",
}
@Article{Langdon:1983:NZL,
author = "Glen G. Langdon",
title = "A Note on the {Ziv--Lempel} Model for Compressing
Individual Sequences",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-29",
number = "2",
pages = "284--287",
month = mar,
year = "1983",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1983.1056645",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Langdon, Glen G. (1983) ``A Note on the Ziv-Lempel
Model for Compressing Individual Sequences,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-29}(2):284--287, March.",
}
@MastersThesis{Nadim:1983:DCT,
author = "Galal Ezz E. Nadim",
title = "Data compression techniques as applied to the
electroencephalograph signal",
volume = "54443",
type = "{M.Sc.} thesis",
school = "The University of Manitoba",
address = "Winnipeg, MB, Canada",
pages = "????",
year = "1983",
ISBN = "0-315-06523-0",
ISBN-13 = "978-0-315-06523-9",
ISSN = "0227-3845",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "2 microfiches (150 frames).",
series = "Canadian theses on microfiche = Th{\`e}ses canadiennes
sur microfiche",
URL = "http://search.proquest.com/docview/303201518?accountid=14677",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "MK54443",
subject = "Engineering",
}
@PhdThesis{Poehler:1983:DCI,
author = "Paul Leonard Poehler",
title = "Data Compression of Imagery Using Linear Predictive
Coding Techniques",
type = "{Ph.D.} thesis",
school = "Florida Institute of Technology",
address = "Melbourne, FL, USA",
pages = "268",
year = "1983",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303271798",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "8319226",
subject = "Computer science",
}
@Article{Storer:1983:TAT,
author = "J. A. Storer",
title = "Toward an abstract theory of data compression",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "221--237",
month = aug,
year = "1983",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(83)90001-4",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B6140 (Signal processing and detection); C1260
(Information theory); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "abstract program size complexity; abstract theory;
computational complexity; cost function; data
compression; programming language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@InCollection{Vorobev:1983:FN,
author = "Nikolai N. Vorobev",
editor = "Ian Naismith Sneddon",
booktitle = "{Fibonacci} Numbers",
title = "{Fibonacci} Numbers",
publisher = "New Classics Library",
address = "????",
pages = "??",
year = "1983",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib",
note = "Translation by Halina Moss. Reprint of
\cite{Vorobev:1961:FN}.",
acknowledgement = ack-ds,
rawdata = "Vorobev, Nikolai N. (1983) in Ian N. Sneddon (ed.),
and Halina Moss (translator), {\it Fibonacci Numbers},
New Classics Library.",
xxauthor = "Nikolai N. Vorobiev",
}
@PhdThesis{Cathey:1984:DCN,
author = "Silvia Gilbert Cathey",
title = "Data Compression for Noiseless Channels ({Huffman}
Codes, Lattice Theory)",
type = "{Ph.D.} thesis",
school = "Clemson University",
address = "Clemson, SC, USA",
pages = "137",
year = "1984",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303289543",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8426762",
subject = "Electrical engineering",
}
@Article{Cleary:1984:DCU,
author = "John G. Cleary and I. H. Witten",
title = "Data Compression Using Adaptive Coding and Partial
String Matching",
journal = j-IEEE-TRANS-COMM,
volume = "COM-32",
number = "4",
pages = "396--402",
month = apr,
year = "1984",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1984.1096090",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata-1 = "Cleary, John G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications},
{\bf COM-32}(4):396--402, April.",
rawdata-2 = "Cleary, J. G., and I. H. Witten (1984) ``Data
Compression Using Adaptive Coding and Partial String
Matching,'' {\it IEEE Transactions on Communications}
COM-32(4):396--402, April.",
}
@Misc{Eastman:1984:AMC,
author = "Willard L. Eastman and Abraham Lempel and Jacob Ziv
and Martin Cohn",
title = "Apparatus and method for compressing data signals and
restoring the signal",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:33:02 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application 291,870 filed 10 August 1981.
See also the related patent \cite{Welch:1984:HSD}
issued on the same day. This patent was held by Sperry
and its successor, Unisys, and vigorously enforced
until its expiry on 7 August 2001. It led to
multimillion-dollar lawsuit settlements, and the move
away from LZW compression to several other methods that
are patent free.",
URL = "http://www.google.com/patents/US4464650;
https://en.wikipedia.org/wiki/Graphics_Interchange_Format",
acknowledgement = ack-nhfb,
}
@PhdThesis{Elnahas:1984:DCA,
author = "Sharaf Eldin Elnahas",
title = "Data Compression with Applications to Digital
Radiology",
type = "{D.Sc.} thesis",
school = "Washington University",
address = "St. Louis, MO, USA",
pages = "162",
year = "1984",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303316909",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8524758",
subject = "Electrical engineering",
}
@Article{Ernvall:1984:ELM,
author = "J. Ernvall and O. Nevalainen",
title = "Estimating the length of minimal spanning trees in
compression of files",
journal = j-BIT,
volume = "24",
number = "1",
pages = "19--32",
month = mar,
year = "1984",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01934512",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
MRclass = "68R10 (68P05)",
MRnumber = "85b:68040",
bibdate = "Wed Jan 4 18:52:18 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=24&issue=1;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=24&issue=1&spage=19",
acknowledgement = ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
}
@Article{Ferguson:1984:SSH,
author = "T. J. Ferguson and J. H. Rabinowitz",
title = "Self-Synchronizing {Huffman} codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "30",
number = "4",
pages = "687--693",
month = jul,
year = "1984",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1984.1056931",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Ferguson, T. J. and J. H. Rabinowitz (1984)
``Self-Synchronizing Huffman codes,'' {\it IEEE
Transactions on Information Theory},
{\bf30}(4):687--693, July.",
}
@InProceedings{Gamal:1984:IDC,
author = "A. El Gamal and A. Orlitsky",
title = "Interactive Data Compression",
crossref = "IEEE:1984:ASF",
pages = "100--108",
year = "1984",
bibdate = "Thu Apr 5 06:13:39 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Gharavi:1984:CVL,
author = "H. Gharavi",
title = "Conditional variable-length coding for gray-level
pictures",
journal = j-ATT-BELL-LAB-TECH-J,
volume = "63",
number = "2",
pages = "249--260",
year = "1984",
CODEN = "ABLJER",
DOI = "https://doi.org/10.1002/j.1538-7305.1984.tb00093.x",
ISSN = "0748-612X (print), 2376-7162 (electronic)",
ISSN-L = "0748-612X",
bibdate = "Fri Nov 12 09:17:39 2010",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/bstj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This paper presents a new variable-length coding
algorithm for bit-rate reduction of digital images. The
coding scheme is based on the fact that by taking into
account the local conditional statistics of the
picture, the coding efficiency can be improved
considerably. Results of computer simulations are
presented in terms of picture quality and required bit
rate. Simulations show that for various Differential
Pulse Code Modulation (DPCM) coded pictures, coding
efficiency is such that a bit rate below the entropy of
the DPCM quantizer output is attained. For a 3-bit DPCM
encoded picture, a bit rate of 1.64 bits/picture
element is achieved.",
acknowledgement = ack-nhfb,
fjournal = "AT\&T Bell Laboratories Technical Journal",
keywords = "data processing --- code converters; pulse code
modulation",
subject = "conditional variable-length coding; digital image
reduction; gray-level picture coding",
topic = "image processing",
}
@Misc{ISO:1984:IPS,
author = "ISO",
title = "Information Processing Systems --- Data Communication
High-Level Data Link Control Procedure-Frame Structure:
{IS 3309}",
edition = "Third",
pages = "??",
month = oct,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ISO (1984) ``Information Processing Systems-Data
Communication High-Level Data Link Control
Procedure-Frame Structure,'' IS 3309, 3rd ed.,
October.",
}
@Book{Knuth:1984:TB,
author = "Donald E. Knuth",
title = "The {\TeX}book",
volume = "{\noopsort{1984a}}A",
publisher = pub-AW,
address = pub-AW:adr,
pages = "ix + 483",
year = "1984",
ISBN = "0-201-13447-0 (hardcover), 0-201-13448-9 (paperback)",
ISBN-13 = "978-0-201-13447-6 (hardcover), 978-0-201-13448-3
(paperback)",
LCCN = "Z253.4.T47 K58 1986",
bibdate = "Wed Dec 15 10:36:52 1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Second printing, revised, October 1984. Sixth
printing, revised, January 1986; also published as {\sl
Computers \& Typesetting}, Vol.~A. Twenty-fourth
printing, summer 1993, contains final revisions.
Twenty-first printing, June 1992.",
price = "US\$15.95 (paperback), US\$32.95 (hardcover)",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
keywords = "computerized typesetting; documentation; languages;
mathematics printing -- computer programs; TeX
(computer file)",
remark = "See translations
\cite{Knuth:1989:TBK,Knuth:1993:VT}.",
subject = "TeX (Computer file); TeX (Logiciel); TeX (Computer
file); Computerized typesetting; Mathematics printing;
Computer programs; Imprimerie; Composition automatique;
Math{\'e}matiques; Impression; Logiciels;
Math{\'e}matiques; Imprimerie; Computerized
typesetting; Computer programs; TeX (logiciel); TeX;
I.7.2 Computing Methodologies, TEXT PROCESSING,
Document Preparation \\ J.7 Computer Applications,
COMPUTERS IN OTHER SYSTEMS, Publishing \\ I.7.1
Computing Methodologies, TEXT PROCESSING, Text
Editing",
tableofcontents = "1: The Name of the Game / 1 \\
2: Book Printing versus Ordinary Typing / 3 \\
3: Controlling \TeX{} / 7 \\
4: Fonts of Type / 13 \\
5: Grouping / 19 \\
6: Running \TeX{} / 23 \\
7: How \TeX{} Reads What You Type / 37 \\
8: The Characters You Type / 43 \\
9: \TeX{}'s Roman Fonts / 51 \\
10: Dimensions / 57 \\
11: Boxes / 63 \\
12: Glue / 69 \\
13: Modes / 85 \\
14: How \TeX{} Breaks Paragraphs into Lines / 91 \\
15: How \TeX{} Makes Lines into Pages / 109 \\
16: Typing Math Formulas / 127 \\
17: More about Math / 139 \\
18: Fine Points of Mathematics Typing / 161 \\
19: Displayed Equations / 185 \\
20: Definitions (also called Macros) / 199 \\
21: Making Boxes / 221 \\
22: Alignment / 231 \\
23: Output Routines / 251 \\
24: Summary of Vertical Mode / 267 \\
25: Summary of Horizontal Mode / 285 \\
26: Summary of Math Mode / 289 \\
27: Recovery from Errors / 295 \\
Appendices \\
A: Answers to All the Exercises / 305 \\
B: Basic Control Sequences / 339 \\
C: Character Codes / 367 \\
D: Dirty Tricks / 373 \\
E: Example Formats / 403 \\
F: Font Tables / 427 \\
G: Generating Boxes from Formulas / 441 \\
H: Hyphenation / 449 \\
I: Index / 457 \\
J: Joining the \TeX{} Community / 483",
}
@TechReport{Langdon:1984:PVM,
author = "Glen G. Langdon",
title = "On Parsing vs. Mixed-Order Model Structures for Data
Compression",
type = "IBM research report",
number = "RJ-4163 (46091)",
institution = pub-IBM,
address = pub-IBM:adr,
pages = "??",
day = "18",
month = jan,
year = "1984",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Langdon, Glen G. (1984) {\it On Parsing vs.
Mixed-Order Model Structures for Data Compression}, IBM
research report RJ-4163 (46091), January 18, 1984, San
Jose, CA.",
}
@PhdThesis{Liang:1984:WHP,
author = "Franklin Mark Liang",
title = "Word Hy-phen-a-tion by Com-pu-ter",
type = "{Ph.D.} dissertation",
school = "Computer Science Department, Stanford University",
address = "Stanford, CA, USA",
pages = "92",
month = mar,
year = "1984",
bibdate = "Fri Jul 08 14:48:58 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
URL = "http://www.tug.org/docs/liang/;
http://wwwlib.umi.com/dissertations/fullcit/8329742",
abstract = "This thesis describes research leading to an improved
word hyphenation algorithm for the T(,E)X82 typesetting
system. Hyphenation is viewed primarily as a data
compression problem, where we are given a dictionary of
words with allowable division points, and try to devise
methods that take advantage of the large amount of
redundancy present. The new hyphenation algorithm is
based on the idea of hyphenating and inhibiting
patterns. These are simply strings of letters that,
when they match in a word, give us information about
hyphenation at some point in the pattern. For example,
`-tion' and `c-c' are good hyphenating patterns. An
important feature of this method is that a suitable set
of patterns can be extracted automatically from the
dictionary. In order to represent the set of patterns
in a compact form that is also reasonably efficient for
searching, the author has developed a new data
structure called a packed trie. This data structure
allows the very fast search times characteristic of
indexed tries, but in many cases it entirely eliminates
the wasted space for null links usually present in such
tries. We demonstrate the versatility and practical
advantages of this data structure by using a variant of
it as the critical component of the program that
generates the patterns from the dictionary. The
resulting hyphenation algorithm uses about 4500
patterns that compile into a packed trie occupying 25K
bytes of storage. These patterns find 89\% of the
hyphens in a pocket dictionary word list, with
essentially no error. By comparison, the uncompressed
dictionary occupies over 500K bytes.",
acknowledgement = ack-nhfb,
}
@Article{Smith:1984:PFF,
author = "Alvy Ray {Smith III}",
title = "Plants, Fractals, and Formal Languages",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "18",
number = "3",
pages = "1--10",
month = jul,
year = "1984",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/964965.808571",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Ai/alife.bib;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Applications of formal grammars for generating graphic
fractals --- ``graftals'' --- in the modeling of
plants.",
acknowledgement = ack-ds,
annote = "Graftals. Methods for displaying natural objects based
on formal language models are presented. In particular,
deterministic models are shown to exhibit sufficient
variety to be used in production graphic systems.",
fjournal = "Computer Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
keyword = "fractals; models-graphics; plants; automata-theory",
rawdata = "Smith, Alvy Ray (1984) ``Plants, Fractals and Formal
Languages,'' {\it Computer Graphics},
{\bf18}(3):1--10.",
xxauthor = "Alvy Ray Smith",
}
@Misc{Welch:1984:HSD,
author = "Terry A. Welch",
title = "High speed data compression and decompression
apparatus and method",
howpublished = "US Patent 4,558,302.",
day = "7",
month = aug,
year = "1984",
bibdate = "Thu Feb 14 10:28:31 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "US Patent Application US19830505638 filed 20 June
1983. See also the related patent
\cite{Eastman:1984:AMC} issued on the same day.",
URL = "http://www.google.com/patents/US455830",
acknowledgement = ack-nhfb,
}
@Article{Welch:1984:THP,
author = "Terry A. Welch",
title = "A Technique for High-Performance Data Compression",
journal = j-COMPUTER,
volume = "17",
number = "6",
pages = "8--19",
month = jun,
year = "1984",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.1984.1659158",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
rawdata = "Welch, T. A. (1984) ``A Technique for High-Performance
Data Compression,'' {\it IEEE Computer},
{\bf17}(6):8--19, June.",
remark = "This is the paper with the Lempel--Ziv--Welch (LZW)
algorithm that led to the famous Unix
compress/decompress programs (and the {.Z} file
extension), written by Spence Thomas at the University
of Utah in June 1984. It builds on prior work by Ziv
and Lempel \cite{Ziv:1977:UAS,Ziv:19778CIS} in
1977--1978.\par
Welch (the inventor) and Sperry Corporation (the
employer) applied for (on 20 June 1983), and received
(on 10 December 1985), a United States Patent (No.
4,558,302) on the algorithm (see
\path|http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=/netahtml/srchnum.htm&r=1&f=G&l=50&s1=4,558,302.WKU.&OS=PN/4,558,302&RS=PN/4,558,302|),
and Unisys (which acquired Sperry in 1986) has since
regulated its use through licensing fees, notably from
Compuserv for its use in the GIF image format
compression.\par
The LZW decoding algorithm is widely held to be
unencumbered by patents.\par
About 1990, Adobe Systems licensed the LZW compression
algorithm from Unisys for use in the LZWEncode operator
in the Level 2 of the PostScript page description
language, so PostScript-producing programs are required
to have a Unisys license in order to produce data for
that operator. Aladdin Software, the creators of
ghostscript, chose not to license the patent, and
instead, developed a completely different compression
algorithm that just happens to be decompressable with
the LZW decompression algorithm.\par
According to Salomon \cite[p.~216]{Salomon:2000:DCC},
``The patent expires on 10 December 2002, or 20 June
2003, depending on whether the GATT agreements
grandfather in existing patents or no. The first date
is 17 years from issuance of the patent (old U.S. law),
and the second is 20 years from the date of first
filing (a GATT requirement).''\par
In 1992, the GNU Project countered with gzip/gunzip
(and the {.gz} file extension), based on patent-free
algorithms, with better compression performance, and by
2000, those utilities had largely replaced
compress/decompress for Internet archives. gunzip will
uncompress a {.Z} file, but gzip will not create such a
file because of the patent.\par
In 1996, Julian R. Seward developed the bzip2/bunzip2
programs (and the .bz2 file extension), believed to be
patent free, based on the Burrows--Wheeler
block-sorting text compression algorithm, and Huffman
coding, obtaining even better compression than gzip,
but at the expense of considerably longer running
times. The Unisys patent (United States Patent No.
4,558,302 (1985), Japanese Patent Numbers 2,123,602 and
2,610,084, and patents in Canada, France, Germany,
Italy and the United Kingdom) and license is discussed
at \path=http://www.unisys.com/about__unisys/lzw/= (URL
accurate on 16-Jan-2003).\par
In 1995, a collaborative group developed the Portable
Network Graphics (PNG) image file format in reaction to
the patent restrictions on the GIF format; see
\cite{Crocker:1995:PPN,Roelofs:1999:PDG}.",
}
@Article{Bassiouni:1985:DCS,
author = "M. A. Bassiouni",
title = "Data Compression in Scientific and Statistical
Databases",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "SE-11",
number = "10",
pages = "1047--1058",
month = oct,
year = "1985",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.1985.231852",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 08:07:37 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1701920",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Book{Berstel:1985:TC,
author = "Jean Berstel and Dominique Perrin",
title = "Theory of Codes",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Berstel, Jean and Dominique Perrin (1985) {\it Theory
of Codes}, Orlando, FL, Academic Press.",
}
@Book{Cappellini:1985:DCE,
editor = "Vito Cappellini",
title = "Data compression and error control techniques with
applications",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xiv + 304",
year = "1985",
ISBN = "0-12-159260-X",
ISBN-13 = "978-0-12-159260-8",
LCCN = "TK5102.5 .D336 1985",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Coding theory;
Error-correcting codes (Information theory)",
}
@InProceedings{Choueka:1985:EVH,
author = "Y. Choueka and Shmuel T. Klein and Y. Perl",
booktitle = "Proceedings of the 8th ACM-SIGIR Conference,
Montr{\'e}al, QC, Canada",
title = "Efficient Variants of {Huffman} Codes in High Level
Languages",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "122--130",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Choueka Y., Shmuel T. Klein, and Y. Perl (1985)
``Efficient Variants of Huffman Codes in High Level
Languages,'' {\it Proceedings of the 8th ACM-SIGIR
Conference}, Montreal, pp. 122--130.",
}
@Article{Cole:1985:NPP,
author = "A. J. Cole",
title = "A Note on {Peano} Polygons and Gray Codes",
journal = j-INT-J-COMPUT-MATH,
volume = "18",
pages = "3--13",
year = "1985",
CODEN = "IJCMAT",
DOI = "https://doi.org/10.1080/00207168508803475",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1985) ``A Note on Peano Polygons and Gray
Codes,'' {\it International Journal of Computer
Mathematics}, {\bf18}:3--13.",
}
@Article{Cormack:1985:DCD,
author = "Gordon V. Cormack",
title = "Data compression on a database system",
journal = j-CACM,
volume = "28",
number = "12",
pages = "1336--1342",
month = dec,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/214956.214963",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214963.html",
acknowledgement = ack-nhfb,
annote = "first partition into IMS based types, then Huffman.
Gives factor two space, adds 17pct time.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; IMS compression one (entire) record at a
time.; management; performance",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.2.0}: Information
Systems, DATABASE MANAGEMENT, General.",
}
@Article{Cottingham:1985:CDS,
author = "Marion S. Cottingham",
title = "A Compressed Data Structure for Surface
Representation",
journal = j-CGF,
volume = "4",
number = "3",
pages = "217--228",
month = sep,
year = "1985",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.1985.tb00222.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Mon Apr 14 10:23:20 MDT 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
affiliationaddress = "Univ of Glasgow, Computing Science Dep, Glasgow,
Scotl",
classification = "723; 741; 921; C6120 (File organisation); C6130B
(Graphics techniques)",
conflocation = "Bath, UK; 28-29 March 1985",
conftitle = "EUROGRAPHICS (UK) Conference",
corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
keywords = "compressed data structure; compressed data structure
(CDS); computer graphics; computer graphics --- Imaging
Techniques; constructive solid; data compression; data
processing; data structures; Data Structures; data
structures; facets; facets, design; geometrical
information; geometry; high curvature; image
processing; modelling; photometry information;
polyhedron; ray casting; sculptured surface; shaded
image; smooth image; solid object; solids ---
Mathematical Models; surface patches; surface
representation; surfaces --- Mathematical Models;
topological information; vertices",
subject = "I.3 Computing Methodologies, COMPUTER GRAPHICS,
Miscellaneous \\ I.3.5 Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations",
treatment = "P Practical",
}
@Article{Demko:1985:CFO,
author = "Stephen Demko and Laurie Hodges and Bruce Naylor",
title = "Construction of Fractal Objects with Iterated Function
Systems",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "19",
number = "3",
pages = "271--278",
month = jul,
year = "1985",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/325165.325245",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Graphics/imager/imager.85.bib; http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
conference = "held in San Francisco, CA; 22--26 July 1985",
fjournal = "Computer Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "I35 fractals, I35 iterative methods, I35 geometric
modeling",
rawdata = "Demko, S., L. Hodges, and B. Naylor (1985)
``Construction of Fractal Objects with Iterated
Function Systems,'' {\it Computer Graphics},
{\bf19}(3):271--278, July.",
}
@PhdThesis{Foulds:1985:DRT,
author = "Richard Arthur Foulds",
title = "A Data Reduction Technique for Minimum Bandwidth
Transmission of Intelligible {American Sign Language}
for the Deaf (Compression, Telecommunications,
Communication, Rehabilitation)",
type = "{Ph.D.} thesis",
school = "Tufts University",
address = "Medford, MA, USA",
pages = "215",
year = "1985",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303423885",
acknowledgement = ack-nhfb,
classification = "0300: Audiology; 0537: Engineering",
dissertation-thesis-number = "8602315",
subject = "Engineering; Audiology",
}
@InCollection{Fraenkel:1985:NCS,
author = "A. S. Fraenkel and S. T. Klein",
editor = "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Novel Compression of Sparse Bit-Strings---Preliminary
Report",
volume = "12",
publisher = pub-SV,
address = pub-SV:adr,
pages = "169--183",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI Series F",
acknowledgement = ack-ds,
rawdata = "Fraenkel, A. S., and S. T. Klein (1985) ``Novel
Compression of Sparse Bit-Strings---Preliminary
Report,'' in A. Apostolico and Z. Galil, eds. {\it
Combinatorial Algorithms on Words}, Vol. 12, NATO ASI
Series F:169--183, New York, Springer-Verlag.",
}
@TechReport{Fraenkel:1985:RUC,
author = "A. S. Fraenkel and Shmuel T. Klein",
title = "Robust Universal Complete Codes as Alternatives to
{Huffman} Codes",
type = "Technical Report",
number = "CS85-16",
institution = "Department of Applied Mathematics, Weizmann Institute
of Science",
address = "Rehovot, Israel",
pages = "??",
month = oct,
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Fraenkel, A. S. and Shmuel T. Klein (1985a) ``Robust
Universal Complete Codes as Alternatives to Huffman
Codes,'' Tech. Report CS85-16, Dept. of Applied
Mathematics, Weizmann Institute of Science, October.",
}
@MastersThesis{Fryer:1985:SDC,
author = "Jeffrey Keefe Fryer",
title = "A Survey of Data Compression Techniques and Their
Application to {VSPC} Data Sets",
type = "{M.Sc.C.S.}",
school = "The University of New Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1985",
ISBN = "0-315-23105-X",
ISBN-13 = "978-0-315-23105-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303433066",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
dissertation-thesis-number = "ML23105",
subject = "Library science",
}
@Article{GonzalezSmith:1985:PAD,
author = "M. E. {Gonzalez Smith} and J. A. Storer",
title = "Parallel Algorithms for Data Compression",
journal = j-J-ACM,
volume = "32",
number = "2",
pages = "344--373",
month = apr,
year = "1985",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/3149.3152",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Jan 15 18:12:53 MST 1997",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3152.html",
abstract = "Parallel algorithms for data compression by textual
substitution that are suitable for VLSI implementation
are studied. Both `static' and `dynamic' dictionary
schemes are considered.",
acknowledgement = ack-nhfb,
affiliationaddress = "Brandeis Univ, Waltham, MA, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "Algorithms; algorithms; computer programming; computer
systems, digital --- Parallel Processing; data
compression; image information; parallel algorithms;
statistics; theory; verification; VLSI",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.7.1}: Hardware,
INTEGRATED CIRCUITS, Types and Design Styles, VLSI
(very large scale integration). {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf
G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
General, Parallel algorithms. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Pattern matching. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout.",
}
@Misc{IEEE754:1985:ISB,
author = "IEEE754",
title = "{ANSI/IEEE Standard 754-1985}: {IEEE} Standard for
Binary Floating-Point Arithmetic.",
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "IEEE754 (1985) ANSI/IEEE Standard 754-1985, ``IEEE
Standard for Binary Floating-Point Arithmetic.''",
}
@Article{Jakobsson:1985:CCS,
author = "Matti Jakobsson",
title = "Compression of Character Strings by an Adaptive
Dictionary",
journal = j-BIT,
volume = "25",
number = "4",
pages = "593--603",
month = dec,
year = "1985",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01936138",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=25&issue=4;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=25&issue=4&spage=593",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
rawdata = "Jakobsson, Matti (1985) ``Compression of Character
Strings by an Adaptive Dictionary,'' {\it BIT},
{\bf25}(4):593--603, december.",
}
@Article{Knuth:1985:DHC,
author = "Donald E. Knuth",
title = "Dynamic {Huffman} Coding",
journal = j-J-ALG,
volume = "6",
number = "2",
pages = "163--180",
month = jun,
year = "1985",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/0196-6774(85)90036-7",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
MRclass = "94B45 (94A24)",
MRnumber = "86g:94050",
MRreviewer = "T. Nemetz",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jalg.bib;
MathSciNet database",
URL = "http://www.sciencedirect.com/science/article/pii/0196677485900367",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
keywords = "algorithms; theory",
rawdata-1 = "Knuth, Donald E. (1985) ``Dynamic Huffman Coding,''
{\it Journal of Algorithms}, {\bf6}:163--180.",
rawdata-2 = "Knuth, D. E. (1985) ``Dynamic Huffman Coding,'' {\it
Journal of Algorithms} {\bf6}:163--180.",
review = "ACM CR 8610-0919",
subject = "E Data, Coding and Information Theory",
}
@Article{McIntyre:1985:DCU,
author = "David R. McIntyre and Michael A. Pechura",
title = "Data compression using static {Huffman} code-decode
tables",
journal = j-CACM,
volume = "28",
number = "6",
institution = "Cleveland St U",
pages = "612--616",
month = jun,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3812.3815",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/3815.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf D.3.m}: Software,
PROGRAMMING LANGUAGES, Miscellaneous.",
}
@InProceedings{Miller:1985:VTZ,
author = "V. S. Miller and M. N. Wegman",
editor = "A. Apostolico and Z. Galil",
booktitle = "Combinatorial Algorithms on Words",
title = "Variations On a Theme by {Ziv} and {Lempel}",
volume = "F12",
publisher = pub-SV,
address = pub-SV:adr,
bookpages = "????",
pages = "131--140",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "NATO ASI series",
acknowledgement = ack-ds,
rawdata = "Miller, V. S., and M. N. Wegman (1985) ``Variations On
a Theme by Ziv and Lempel,'' in A. Apostolico and Z.
Galil, eds., NATO ASI series Vol. F12, {\it
Combinatorial Algorithms on Words}, Berlin, Springer,
pp. 131--140.",
}
@Book{Pohlmann:1985:PDA,
author = "Ken Pohlmann",
title = "Principles of Digital Audio",
publisher = pub-SAMS,
address = pub-SAMS:adr,
pages = "??",
year = "1985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Pohlmann, Ken (1985) {\it Principles of Digital
Audio}, Indianapolis, IN, Howard Sams \& Co.",
}
@PhdThesis{Ramamurthi:1985:VQI,
author = "Bhaskar Ramamurthi",
title = "Vector Quantization of Images Based on a Composite
Source Model (Coding, Data Compression, Picture)",
type = "{Ph.D.} thesis",
school = "University of California, Santa Barbara",
address = "Santa Barbara, USA",
pages = "377",
year = "1985",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303336232",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8605950",
subject = "Electrical engineering",
}
@Article{Rokicki:1985:PPF,
author = "Tomas Rokicki",
title = "Packed ({{\tt PK}}) Font File Format",
journal = j-TUGboat,
volume = "6",
number = "3",
pages = "115--120",
month = nov,
year = "1985",
CODEN = "????",
ISSN = "0896-3207",
ISSN-L = "0896-3207",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tugboat.bib",
URL = "http://www.tug.org/TUGboat/Articles/tb06-3/tb13pk.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "TUGboat",
rawdata = "Rokicki, Tomas (1985) ``Packed (PK) Font File
Format,'' {\it TUGboat}, {\bf6}(3):115--120. Available
at
|http://www.tug.org/TUGboat/Articles/tb06-3/tb13pk.pdf|.",
}
@Article{Samet:1985:DSQ,
author = "Hanan Samet",
title = "Data structures for quadtree approximation and
compression",
journal = j-CACM,
volume = "28",
number = "9",
institution = "U Md",
pages = "973--993",
month = sep,
year = "1985",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/4284.4290",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 27 13:21:19 1997",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/84.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/4290.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; image approximation; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf I.2.10}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Vision and Scene
Understanding, Representations, data structures, and
transforms. {\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf I.4.2}: Computing Methodologies, IMAGE PROCESSING,
Compression (Coding), Exact coding.",
}
@Article{Savoji:1985:DMB,
author = "M. H. Savoji and R. E. Burge",
title = "On Different Methods Based on the {Karhunen-Loeve}
Expansion and Used in Image Analysis",
journal = j-CVGIP,
volume = "29",
number = "2",
pages = "259--269",
month = feb,
year = "1985",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/0734-189x(85)90121-5",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1985.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "U London",
affiliationaddress = "Queen Elizabeth Coll, Dep of Physics, London,
Engl",
classification = "716; 718; 723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "data compression; eigendata problem; image analysis;
image processing; image transformation, space
frequency, digital; Karhunen-Loeve expansion; pattern
recognition; signal processing",
}
@Article{Todd:1985:PRC,
author = "Stephen Todd and Glen G. {Langdon, Jr.} and Jorma
Rissanen",
title = "Parameter Reduction and Context Selection for
Compression of Gray-Scale Images",
journal = j-IBM-JRD,
volume = "29",
number = "2",
pages = "188--193",
month = mar,
year = "1985",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.292.0188",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "In the compression of multilevel (color or gray) image
data, effective compression is obtained economically by
judicial selection of the predictor and the
conditioning states or contexts which determine what
probability distribution to use for the prediction
error. The authors provide a cost-effective approach to
the following two problems: (1) to reduce the number of
coding parameters to describe a distribution when
several contexts are involved, and (2) to choose
contexts for which variations in prediction error
distributions are expected. They solve Problem 1
(distribution description) by a partition of the range
of values of the outcomes into equivalence classes,
called buckets. The result is a special decomposition
of the error range. Cost-effectiveness is achieved by
using the many contexts only to predict the bucket
(equivalence class) probabilities. They solve Problem 2
(economical contexts) by using the buckets of the
surrounding pixels as components of the conditioning
class. The bucket values have the desirable properties
needed for the error distributions.",
acknowledgement = ack-nhfb,
affiliation = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
affiliationaddress = "IBM, United Kingdom Scientific Cent, Winchester,
Engl",
classcodes = "B6140C (Optical information, image and video signal
processing); C1250 (Pattern recognition)",
classification = "723; 741",
corpsource = "IBM UK Sci. Centre, Winchester, UK",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Analysis; buckets; classes; coding; compression;
conditioning class; context selection; data
compression; encoding; equivalence; error
distributions; gray-scale images; image processing;
parameter reduction; parameters; picture processing;
prediction error distributions",
treatment = "T Theoretical or Mathematical",
}
@TechReport{Wong:1985:FSCb,
author = "Willard Lee Wong",
title = "Font Storage, Compression, and Scaling for Networked
Professional Workstations",
type = "Report",
number = "UIUCDCS-R-85-1201",
institution = "Dept. of Computer Science, University of Illinois at
Urbana-Champaign",
address = "Urbana, IL, USA",
pages = "v + 80",
month = apr,
year = "1985",
bibdate = "Wed Feb 28 15:00:20 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Techreports/Uiuc.Tr.bib;
Techreports/university-of-illinois-urbana-champagne.bib",
acknowledgement = ack-nhfb,
annote = "Originally presented as the author's thesis (M.S.) ---
University of Illinois at Urbana-Champaign, 1985.
``April 1985.'' ``UILU-ENG-85-1712.'' --- Cover.
Bibliography: p. 80.",
keywords = "Data compression (Computer science); Data transmission
systems.; Information storage and retrieval systems.",
}
@Article{Young:1985:MFF,
author = "D. M. Young",
title = "{MacWrite} File Format",
journal = "Wheels for the Mind",
volume = "1",
pages = "34",
month = "Fall",
year = "1985",
CODEN = "????",
ISSN = "0891-8805",
ISSN-L = "0891-8805",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Young, D. M. (1985) ``MacWrite File Format,'' {\it
Wheels for the Mind}, {\bf1}:34, Fall.",
remark = "Discontinued periodical from Apple Computer.",
}
@MastersThesis{Aitken:1986:PMD,
author = "Robert Campbell Aitken",
title = "Performance measures of data compression techniques in
fault detection",
type = "Thesis ({M.Sc.})",
school = "University of Victoria",
address = "Victoria, BC, Canada",
pages = "????",
year = "1986",
ISBN = "0-315-31695-0",
ISBN-13 = "978-0-315-31695-9",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "0399: Library science",
subject = "Library science",
}
@Article{Amsterdam:1986:DCH,
author = "Jonathan Amsterdam",
title = "Data Compression with {Huffman} Coding",
journal = j-BYTE,
volume = "11",
number = "5",
pages = "99--108",
month = may,
year = "1986",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibsource = "https://www.math.utah.edu/pub/tex/bib/byte1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "BYTE Magazine",
}
@Article{Anonymous:1986:CDF,
author = "Anonymous",
title = "Compression\slash Decompression of Font Patterns",
journal = j-IBM-TDB,
volume = "28",
number = "8",
pages = "3563--3564",
month = jan,
year = "1986",
CODEN = "IBMTAA",
ISSN = "0018-8689",
bibdate = "Mon Dec 16 08:30:04 MST 1996",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "This article describes the generation or decompression
of font patterns from the compressed form data
including control bytes and data bytes.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "IBM Technical Disclosure Bulletin",
journalabr = "IBM Tech Discl Bull",
keywords = "compressed form data; compression/decompression;
control bytes; data bytes; Data Handling; data
processing; font patterns; information theory --- Data
Compression",
}
@Article{Anonymous:1986:DOD,
author = "Anonymous",
title = "Don't overlook data compression",
journal = j-COMPUT-SECUR,
volume = "5",
number = "1",
pages = "8--9",
month = mar,
year = "1986",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404886901100",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Anshel:1986:MIP,
editor = "Michael Anshel and William Gewirtz",
title = "Mathematics of information processing",
volume = "34",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "xi + 233",
year = "1986",
ISBN = "0-8218-0086-8",
ISBN-13 = "978-0-8218-0086-7",
LCCN = "QA76.9.M35 M39 1986",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of symposia in applied mathematics,
0160-7634; AMS short course lecture notes",
acknowledgement = ack-nhfb,
subject = "Computer science; Mathematics; Congresses",
tableofcontents = "Diameters of communication networks / F. R. K.
Chung \\
The theory of data dependencies / Ronald Fagin and
Moshe Y. Vardi \\
Transaction management / Hector Garcia-Molina \\
Fundamental database issues / Barry E. Jacobs \\
Data compression algorithms / Victor S. Miller \\
Application of category theory of structural sets to
modelling of information bases of systems / Augustin A.
Tuzhilin",
}
@Article{Bell:1986:BOT,
author = "Timothy C. Bell",
title = "Better {OPM/L} Text Compression",
journal = j-IEEE-TRANS-COMM,
volume = "34",
number = "12",
pages = "1176--1182",
month = dec,
year = "1986",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1986.1096485",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Bell, Timothy C. (1986) ``Better OPM/L Text
Compression,'' {\it IEEE Transactions on
Communications}, {\bf34}(12):1176--1182, December.",
}
@Article{Bentley:1986:LAD,
author = "Jon Louis Bentley and Daniel D. Sleator and Robert E.
Tarjan and Victor K. Wei",
title = "A Locally Adaptive Data Compression Scheme",
journal = j-CACM,
volume = "29",
number = "4",
pages = "320--330",
month = apr,
year = "1986",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/5684.5688",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P99 (94A24)",
MRnumber = "87e:68020",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/5688.html",
abstract = "A data compression scheme that exploits locality of
reference, such as occurs when words are used
frequently over short intervals and then fall into long
periods of disuse, is described. The scheme is based on
a simple heuristic for self-organizing sequential
search and on variable-length encodings of integers. We
prove that it never performs much worse than Huffman
coding and can perform substantially better;
experiments on real files show that its performance is
usually quite close to that of Huffman coding. Our
scheme has many implementation advantages: it is
simple, allows fast encoding and decoding, and requires
only one pass over the data to be compressed (static
Huffman coding takes two passes).",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "Exploits locality of reference when words are used
frequently over short intervals; is based on a
self-organizing search and on variable-length encodings
of integers. Its performance is close to that of
Huffman coding. Requires only one pass over the data.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; experimentation; image information;
measurement; performance; statistics; theory",
rawdata = "Bentley, J. L. et al. (1986) ``A Locally Adaptive Data
Compression Algorithm,'' {\it Communications of the
ACM}, {\bf29}(4):320--330, April.",
review = "ACM CR 8610-0918",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Lists.",
}
@Article{Cheng:1986:AAZ,
author = "L. M. Cheng and A. S. Ho and R. E. Burge",
title = "An Adaptive Asteroid Zonal Filter for Data
Compression",
journal = j-CVGIP,
volume = "34",
number = "3",
pages = "292--301",
month = jun,
year = "1986",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/s0734-189x(86)80044-5",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "King's Coll",
affiliationaddress = "King's Coll, London, Engl",
classification = "723",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "adaptive asteroid zonal filter; codes, symbolic ---
Encoding; data compression; image approximation; image
processing; information theory --- Data Compression;
transform image coding",
}
@Article{Cole:1986:DTB,
author = "A. J. Cole",
title = "Direct Transformations Between Sets of Integers and
{Hilbert} Polygons",
journal = j-INT-J-COMPUT-MATH,
volume = "20",
pages = "115--122",
year = "1986",
CODEN = "IJCMAT",
DOI = "https://doi.org/10.1080/00207168608803536",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "International Journal of Computer Mathematics",
rawdata = "Cole, A. J. (1986) ``Direct Transformations Between
Sets of Integers and Hilbert Polygons,'' {\it
International Journal of Computer Mathematics},
{\bf20}:115--122.",
}
@TechReport{Cormack:1986:DCU,
author = "Gordon V. Cormack",
title = "Data compression using dynamic {Markov} modelling",
volume = "CS-86-18",
institution = "Faculty of Mathematics, University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "19",
year = "1986",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Research report",
acknowledgement = ack-nhfb,
}
@Book{Knuth:1986:CMT,
author = "Donald E. Knuth",
title = "{Computer Modern} Typefaces",
volume = "E",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 588",
year = "1986",
ISBN = "0-201-13446-2",
ISBN-13 = "978-0-201-13446-9",
LCCN = "Z250.8.M46 K574 1986",
bibdate = "Wed Dec 15 10:37:33 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
keywords = "Font editors.; METAFONT.; Phototypesetting ---
Applications of microcomputer systems",
remark = "Reprinted with corrections July, 1987. Incorporates
the final corrections made in 1992.",
tableofcontents = "Introduction to the Parameters / 1 \\
Organization of the Files / 8 \\
Parameter Files / 10 \\
Driver Files / 36 \\
{\tt roman}: Roman text and typewriter text / 36 \\
{\tt title}: Caps and digits only / 38 \\
{\tt texset} : Extended ASCII character set / 38 \\
{\tt csc}: Caps and small caps / 40 \\
{\tt textit}: Italic text and typewriter text / 41 \\
{\tt mathit}: Math italic / 42 \\
{\tt mathsy}: Math symbols / 44 \\
{\tt mathex}: Math extension characters / 44 \\
Program Files / 46 \\
{\tt accent}: Accents common to roman and italic / 49
\\
{\tt bigacc}: Wide accents for math extension font / 63
\\
{\tt bigdel}: Delimiters for math extension font / 66
\\
{\tt bigop}: Operators for math extension font / 103
\\
{\tt calu}: Calligraphic capitals / 123 \\
{\tt comlig}: Ligatures common to roman and italic /
141 \\
{\tt cscspu}: Special uppercase for caps and small caps
/ 145 \\
{\tt greekl}: Lowercase Greek / 147 \\
{\tt greeku}: Upper case Greek / 171 \\
{\tt itald}: Italic digits / 193 \\
{\tt italig}: Italic f-ligatures / 199 \\
{\tt itall}: Italic lowercase / 209 \\
{\tt italms}: Italic math specials / 233 \\
{\tt italp}: Italic punctuation / 239 \\
{\tt italsp}: Special lowercase for italic / 245 \\
{\tt olddig}: Oldstyle digits / 251 \\
{\tt punct}: Punctuation common to roman and italic /
265 \\
{\tt romand}: Roman digits / 285 \\
{\tt romanl}: Roman lowercase / 305 \\
{\tt romanp}: Roman punctuation / 361 \\
{\tt romanu}: Roman uppercase / 369 \\
{\tt romlig}: Roman f-ligatures / 421 \\
{\tt romms}: Roman math specials / 431 \\
{\tt romspl}: Special lowercase for roman / 443 \\
{\tt romspu}: Special uppercase for roman / 451 \\
{\tt romsub}: Substitutes for ligatures / 457 \\
{\tt sym}: Math symbols common to several fonts / 459
\\
{\tt symbol}: Math symbols in symbol font only / 483
\\
{\tt tset}: Extended ASCII symbols / 542 \\
{\tt tsetsl}: Extended ASCII symbols to be slanted /
543 \\
The Base File / 545 \\
Font Specimens / 554 \\
General Index / 571 Index to Character Programs / 581",
}
@Book{Knuth:1986:CT,
author = "Donald Ervin Knuth",
title = "Computers and Typesetting",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1986",
ISBN = "0-201-13447-0 (v.A), 0-201-13437-3 (v.B),
0-201-13445-4 (v.C), 0-201-13438-1 (v.D), 0-201-13446-2
(v.E)",
ISBN-13 = "978-0-201-13447-6 (v.A), 978-0-201-13437-7 (v.B),
978-0-201-13445-2 (v.C), 978-0-201-13438-4 (v.D),
978-0-201-13446-9 (v.E)",
LCCN = "Z253.4.T47K58 1986",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Computerized typesetting.",
rawdata = "Knuth, D. E. (1986) {\it Computers and Typesetting},
Reading, Mass., Addison Wesley.",
}
@Book{Knuth:1986:MB,
author = "Donald E. Knuth",
title = "The {\METAFONT}book",
volume = "C",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xi + 361",
year = "1986",
ISBN = "0-201-13445-4 (hardcover), 0-201-13444-6 (paperback)",
ISBN-13 = "978-0-201-13445-2 (hardcover), 978-0-201-13444-5
(paperback)",
LCCN = "Z250.8.M46 K58 1986",
bibdate = "Wed Dec 15 10:37:29 1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 The Name of the Game / 1 \\
2 Coordinates / 5 \\
3 Curves / 13 \\
4 Pens / 21 \\
5 Running \METAFONT{} / 31 \\
6 How \METAFONT{} Reads What You Type / 49 \\
7 Variables / 53 \\
8 Algebraic Expressions / 59 \\
9 Equations / 75 \\
10 Assignments / 87 \\
11 Magnification and Resolution / 91 \\
12 Boxes / 101 \\
13 Drawing, Filling, and Erasing / 109 \\
14 Paths / 123 \\
15 Transformations / 141 \\
16 Calligraphic Effects / 147 \\
17 Grouping / 155 \\
18 Definitions ( also called Macros) / 159 \\
19 Conditions and Loops / 169 \\
20 More about Macros / 175 \\
21 Random Numbers / 183 \\
22 Strings / 187 \\
23 Online Displays / 191 \\
24 Discreteness and Discretion / 195 \\
25 Summary of Expressions / 209 \\
26 Summary of the Language / 217 \\
27 Recovering from Errors / 223 \\
Appendices \\
A Answers to All the Exercises / 233 \\
B Basic Operations / 257 \\
C Character Codes / 281 \\
D Dirty Tricks / 285 \\
E Examples / 301 \\
F Font Metric Information / 315 \\
G Generic Font Files / 323 \\
H Hardcopy Proofs / 327 \\
I Index / 345 \\
J Joining the \TeX{} Community / 361",
}
@Book{Knuth:1986:MP,
author = "Donald E. Knuth",
title = "{\METAFONT}: The Program",
volume = "D",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 560",
year = "1986",
ISBN = "0-201-13438-1",
ISBN-13 = "978-0-201-13438-4",
LCCN = "Z250.8.M46 K578 1986",
bibdate = "Wed Dec 15 10:37:32 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Third printing, xviii + 566 pp., 1991.",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 Introduction / \S 1 \\
2 The character set / \S 17 \\
3 Input and output / \S 24 \\
4 String handling / \S 37 \\
5 On-line and off-line printing / \S 54 \\
6 Reporting errors / \S 67 \\
7 Arithmetic with scaled numbers / \S 95 \\
8 Algebraic and transcendental functions / \S 120 \\
9 Packed data / \S 153 \\
10 Dynamic memory allocation / \S 158 \\
11 Memory layout / \S 175 \\
12 The command codes / \S 186 \\
13 The hash table / \S 200 \\
14 Token lists / \S 214 \\
15 Data structures for variables / \S 228 \\
16 Saving and restoring equivalents / \S 250 \\
17 Data structures for paths / \S 255 \\
18 Choosing control points / \S 269 \\
19 Generating discrete moves / \S 303 \\
20 Edge structures / \S 323 \\
21 Subdivision into octants / \S 386 \\
22 Filling a contour / \S 460 \\
23 Polygonal pens / \S 469 \\
24 Filling an envelope / \S 490 \\
25 Elliptical pens / \S 524 \\
26 Direction and intersection times / \S 538 \\
27 Online graphic output / \S 564 \\
28 Dynamic linear equations / \S 585 \\
29 Dynamic nonlinear equations / \S 618 \\
30 Introduction to the syntactic routines / \S 624 \\
31 Input stacks and states / \S 627 \\
32 Maintaining the input stacks / \S 647 \\
33 Getting the next token / \S 658 \\
34 Scanning macro definitions / \S 683 \\
35 Expanding the next token / \S 706 \\
36 Conditional processing / \S 738 \\
37 Iterations / \S 752 \\
38 File names / \S 766 \\
39 Introduction to the parsing routines / \S 796 \\
40 Parsing primary expressions / \S 823 \\
41 Parsing secondary and higher expressions / \S 862
\\
42 Doing the operations / \S 893 \\
43 Statements and commands / \S 989 \\
44 Commands / \S 1020 \\
45 Font metric data / \S 1087 \\
46 Generic font file format / \S 1142 \\
47 Shipping characters out / \S 1149 \\
48 Dumping and undumping the tables / \S 1183 \\
49 The main program / \S 1202 \\
50 Debugging / \S 1212 \\
51 System-dependent changes / \S 1214 \\
52 Index / \S 1215",
}
@Book{Knuth:1986:TP,
author = "Donald E. Knuth",
title = "{\TeX}: The Program",
volume = "B",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xv + 594",
year = "1986",
ISBN = "0-201-13437-3",
ISBN-13 = "978-0-201-13437-7",
LCCN = "Z253.4.T47 K578 1986",
bibdate = "Wed Dec 15 10:36:54 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/texgraph.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
note = "Reprinted with corrections May 1988. Fourth printing,
xviii + 600 pp., 1991.",
series = "Computers and Typesetting",
acknowledgement = ack-nhfb,
tableofcontents = "1 Introduction / \S 1 \\
2 The character set / \S 17 \\
3 Input and output / \S 25 \\
4 String handling / \S 38 \\
5 On-line and off-line printing / \S 54 \\
6 Reporting errors / \S 72 \\
7 Arithmetic with scaled dimensions / \S 99 \\
8 Packed data / \S 110 \\
9 Dynamic memory allocation / \S 115 \\
10 Data structures for boxes and their friends / \S 133
\\
11 Memory layout / \S 162 \\
12 Displaying boxes / \S 173 \\
13 Destroying boxes / \S 199 \\
14 Copying boxes / \S 203 \\
15 The command codes / \S 207 \\
16 The semantic nest / \S 211 \\
17 The table of equivalents / \S 220 \\
18 The hash table / \S 256 \\
19 Saving and restoring equivalents / \S 268 \\
20 Token lists / \S 289 \\
21 Introduction to the syntactic routines / \S 297 \\
22 Input stacks and states / \S 300 \\
23 Maintaining the input stacks / \S 321 \\
24 Getting the next token / \S 332 \\
25 Expanding the next token / \S 366 \\
26 Basic scanning subroutines / \S 402 \\
27 Building token lists / \S 464 \\
28 Conditional processing / \S 487 \\
29 File names / \S 511 \\
30 Font metric data / \S 539 \\
31 Device-independent file format / \S 583 \\
32 Shipping pages out / \S 592 \\
33 Packaging / \S 644 \\
34 Data structures for math mode / \S 680 \\
35 Subroutines for math mode / \S 699 \\
36 Typesetting math formulas / \S 719 \\
37 Alignment / \S 768 \\
38 Breaking paragraphs into lines / \S 813 \\
39 Breaking paragraphs into lines, continued / \S 862
\\
40 Pre-hyphenation / \S 891 \\
41 Post-hyphenation / \S 900 \\
42 Hyphenation / \S 919 \\
43 Initializing the hyphenation tables / \S 942 \\
44 Breaking vertical lists into pages / \S 967 \\
45 The page builder / \S 980 \\
46 The chief executive / \S 1029 \\
47 Building boxes and lists / \S 1055 \\
48 Building math lists / \S 1136 \\
49 Mode-independent processing / \S 1208 \\
50 Dumping and undumping the tables / \S 1299 \\
51 The main program / \S 1330 \\
52 Debugging / \S 1338 \\
53 Extensions / \S 1340 \\
54 System-dependent changes / \S 1376 \\
55 Index / \S 1377",
}
@MastersThesis{Li:1986:SIS,
author = "Yuk Lun Li",
title = "A Study of Invariant Speech Characteristics as Applied
to Phoneme Extrapolation (Speech Recognition, Data
Compression)",
type = "{M.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "176",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303473611",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertation-thesis-number = "1327133",
subject = "Electrical engineering; Artificial intelligence",
}
@PhdThesis{Moayeri:1986:FVQ,
author = "Nader Moayeri",
title = "Fast Vector Quantization (Communication Theory, Source
Coding, Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbor, MI, USA",
pages = "178",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303494436",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8702795",
subject = "Electrical engineering",
}
@Article{Myers:1986:DAV,
author = "Eugene W. Myers",
title = "An {$ O(N D) $} Difference Algorithm and its
Variations",
journal = j-ALGORITHMICA,
volume = "1",
number = "2",
pages = "251--266",
year = "1986",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/bf01840446",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica1.html#Meyers86;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica",
acknowledgement = ack-ds,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "Meyers86",
rawdata = "Myers, Eugene W. (1986) ``An $O(ND)$ Difference
Algorithm and its Variations,'' {\it Algorithmica},
{\bf1}(2):251--266.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/Meyers86",
}
@Book{Peitgen:1986:BF,
author = "Heinz-Otto Peitgen and Peter H. Richter",
title = "The Beauty of Fractals",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 199",
year = "1986",
ISBN = "0-387-15851-0",
ISBN-13 = "978-0-387-15851-8",
LCCN = "QA447 .P45 1986",
bibdate = "Wed Dec 15 10:40:44 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
abstract = "The authors present an unusual attempt to publicize
the field of Complex Dynamics, an exciting mathematical
discipline of respectable tradition that recently
sprang into new life under the impact of modern
computer graphics. Where previous generations of
scientists had to develop their own inner eye to
perceive the abstract aesthetics of their work, the
astounding pictures assembled here invite the reader to
share in a new mathematical experience, to revel in the
charm of fractal frontiers.",
acknowledgement = ack-nhfb,
subject = "Fractals; Fractales; Fractals; Fractals; Dynamisches
System; Fraktal; Fractales; Mathematics",
tableofcontents = "Frontiers of Chaos / 1 \\
Special Sections \\
1 Verhulst Dynamics / 23 \\
2 Julia Sets and Their Computergraphical Generation /
27 \\
3 Sullivan's Classification of Critical Points / 53 \\
4 The Mandelbrot Set / 56 \\
5 External Angles and Hubbard Trees / 63 \\
6 Newton's Method for Complex Polynomials: Cayley's
Problem / 93 \\
7 Newton's Method for Real Equations / 103 \\
8 A Discrete Volterra--Lotka System / 125 \\
Magnetism and Complex Boundaries / 129 \\
Special Sections \\
9 Yang-Lee Zeros / 139 \\
10 Renormalization / 142 \\
References / 147 \\
Invited Contributions / 151 \\
B. B. Mandelbrot: Fractals and the Rebirth of Iteration
Theory / 151 \\
A. Douady: Julia Sets and the Mandelbrot Set / 161 \\
G. Eilenberger: Freedom, Science, and Aesthetics / 175
\\
H. W. Franke: Refractions of Science into Art / 181 \\
Do It Yourself / 189 \\
Documentation / 193 \\
Index / 197",
}
@Article{Posner:1986:CES,
author = "E. C. Posner and R. L. Horttor and T. L. Grant",
title = "Communicating from the edge of the solar system:
Centimeter-band transmissions, three-dimensional data
compression, and laser-based systems may launch
unmanned missions to deep space",
journal = j-IEEE-SPECTRUM,
volume = "23",
number = "6",
pages = "60--65",
month = jun,
year = "1986",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.1986.6370934",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "antennas; Antennas; centimetre band transmission;
communications link; Deep Space Network; Earth; Galileo
craft; Galileo project; Jupiter; laser beam
applications; laser-based systems; optical links;
orbiting weather satellite; Probes; Receivers; space
communication links; Space vehicles; three-dimensional
data compression",
}
@Article{Prenter:1986:TAD,
author = "P. M. Prenter and E. R. Westwater",
title = "Three Adaptive Discrete Least Squares Cubic Spline
Procedures for the Compression of Data",
journal = j-CVGIP,
volume = "33",
number = "3",
pages = "327--345",
month = mar,
year = "1986",
CODEN = "CVGPDB",
DOI = "https://doi.org/10.1016/0734-189x(86)90181-7",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database; Graphics/rosenfeld/1986.bib;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Colo St U/NOAA",
affiliationaddress = "Colorado State Univ, Fort Collins, CO, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Algorithms; computer programming; data compression;
image approximation; image processing; integer strings;
mathematical transformations --- Fast Fourier
Transforms; spline knots",
}
@MastersThesis{Prountzos:1986:DIM,
author = "Demetrios A. Prountzos",
title = "The Design and Implementation of a Microprocessor
Based Data Compression System",
type = "{M.E.E.} thesis",
school = "The Cooper Union for the Advancement of Science and
Art",
address = "New York, NY, USA",
pages = "134",
year = "1986",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303488933",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1329773",
subject = "Electrical engineering",
}
@Article{Richards:1986:DCG,
author = "Dana Richards",
title = "Data compression and {Gray}-code sorting",
journal = j-INFO-PROC-LETT,
volume = "22",
number = "4",
pages = "201--205",
day = "17",
month = apr,
year = "1986",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(86)90029-3",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA",
classification = "723; 731; C1160 (Combinatorial mathematics); C6120
(File organisation)",
corpsource = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "codes, symbolic; comparison based sorting;
comparison-based sorting; computer systems programming
--- Sorting; data compression; data processing --- File
Organization; differencing; full mixed-radix case; gray
codes; Gray-code sorting; radix sorting; sorting;
storage management; theory; verification",
pubcountry = "Netherlands A09",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ E.4 Data, CODING AND
INFORMATION THEORY, Data compaction and compression",
treatment = "T Theoretical or Mathematical",
}
@MastersThesis{Schmidt:1986:SRC,
author = "Alfred Rudolf Schmidt",
title = "Secondary Range Compression for Improved Range\slash
{Doppler} Processing of {SAR} Data with High Squint",
type = "{M.A.Sc}",
school = "The University of British Columbia",
address = "Vancouver, BC, Canada",
pages = "xviii + 213",
year = "1986",
ISBN = "0-315-36707-5",
ISBN-13 = "978-0-315-36707-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303539025",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML36707",
subject = "Engineering",
}
@InProceedings{Adelson:1987:OPT,
author = "E. H. Adelson and E. Simoncelli and R. Hingorani",
booktitle = "Proceedings SPIE",
title = "Orthogonal Pyramid Transforms for Image Coding",
publisher = "vol. 845",
address = "Cambridge, MA, USA",
pages = "50--58",
month = oct,
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Adelson, E. H., E. Simoncelli, and R. Hingorani (1987)
``Orthogonal Pyramid Transforms for Image Coding,''
{\it Proceedings SPIE}, vol. 845, Cambridge, MA, pp.
50--58, October.",
}
@Article{Anderson:1987:BIM,
author = "K. L. Anderson and others",
title = "Binary-Image-Manipulation Algorithm in the Image View
Facility",
journal = j-IBM-JRD,
volume = "31",
number = "1",
pages = "16--31",
month = jan,
year = "1987",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.311.0016",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
rawdata = "Anderson, K. L., et al., (1987)
``Binary-Image-Manipulation Algorithm in the Image View
Facility,'' {\it IBM Journal of Research and
Development}, {\bf31}(1):16--31, January.",
}
@Article{Apostolico:1987:RTU,
author = "Alberto Apostolico and A. S. Fraenkel",
title = "Robust Transmission of Unbounded Strings {Using}
{Fibonacci} Representations",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "33",
number = "2",
pages = "238--245",
month = mar,
year = "1987",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.1987.1057284",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Apostolico, Alberto and A. S. Fraenkel (1987) ``Robust
Transmission of Unbounded Strings Using Fibonacci
Representations,'' {\it IEEE Transactions on
Information Theory}, {\bf33}(2):238--245, March.",
}
@PhdThesis{Bell:1987:UTI,
author = "Timothy C. Bell",
title = "A Unifying Theory and Improvements for Existing
Approaches to Text Compression",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Canterbury, Christchurch, New Zealand",
address = "????",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bell, Timothy C. (1987) {\it A Unifying Theory and
Improvements for Existing Approaches to Text
Compression}, PhD thesis, Department of Computer
Science, University of Canterbury, Christchurch, New
Zealand.",
}
@Misc{Blackstock:1987:LGE,
author = "Steve Blackstock",
title = "{LZW} and {GIF} Explained",
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html",
acknowledgement = ack-ds,
rawdata = "Blackstock, Steve (1987) ``LZW and GIF Explained,''
available from\hfil\break
|http://www.cis.udel.edu/~amer/CISC651/lzw.and.gif.explained.html|.",
}
@Article{Brent:1987:LAD,
author = "R. P. Brent",
title = "A linear Algorithm for Data Compression",
journal = j-AUSTRALIAN-COMP-J,
volume = "19",
number = "2",
pages = "64--68",
month = may,
year = "1987",
CODEN = "ACMJB2",
ISSN = "0004-8917",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Australian Computer Journal",
rawdata = "Brent, R. P. (1987) ``A linear Algorithm for Data
Compression,'' {\it Australian Computer Journal},
{\bf19}(2):64--68, May.",
}
@MastersThesis{Chan:1987:NST,
author = "Barry Wai Kwong Chan",
title = "A new subword-tree based data compression algorithm",
type = "Thesis {(M.Sc.)(C.S.)}",
school = "School of Computer Science, The University of New
Brunswick",
address = "Fredericton, NB, Canada",
pages = "????",
year = "1987",
ISBN = "0-315-35212-4",
ISBN-13 = "978-0-315-35212-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303653948",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML35212",
subject = "Engineering",
}
@Article{Cole:1987:CTR,
author = "A. J. Cole",
title = "Compaction Techniques for Raster Scan Graphics Using
Space-Filling Curves",
journal = j-COMP-J,
volume = "30",
number = "1",
pages = "87--92",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.1.87",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/87.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/87.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/88.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/89.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/90.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/91.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/92.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of St. Andrews, St. Andrews, Scotl",
affiliationaddress = "Univ of St. Andrews, St. Andrews, Scotl",
classcodes = "C4130 (Interpolation and function approximation);
C6130B (Graphics techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "codes, symbolic --- Encoding; compaction techniques;
computation; computational geometry; computer graphics;
curve fitting; data compression; graphics; Hilbert
space; image processing; Peano space; quadtree coding;
raster scan; raster scan graphics; space-filling
curves; space-filling polygons",
treatment = "P Practical",
}
@Article{Cormack:1987:DCU,
author = "G. V. Cormack and R. N. S. Horspool",
title = "Data Compression Using Dynamic {Markov} {Modelling}",
journal = j-COMP-J,
volume = "30",
number = "6",
pages = "541--550",
month = dec,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.6.541",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://comjnl.oxfordjournals.org/content/30/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/30/6/541.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/541.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/542.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/543.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/544.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/545.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/546.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/547.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/548.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/549.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_06/tiff/550.tif",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classcodes = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1140Z (Other and
miscellaneous); C1260 (Information theory); C6130 (Data
handling techniques)",
classification = "723; 922",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic coding; binary messages; codes, symbolic;
data compression; dynamic Markov modelling; encoding;
Encoding; Guazzo; information theory --- Data
Compression; Markov chain models; Markov processes;
probability --- Random Processes",
rawdata = "Cormack G. V., and R. N. S. Horspool (1987) ``Data
Compression Using Dynamic Markov Modelling,'' {\it The
Computer Journal}, {\bf30}(6):541--550.",
treatment = "T Theoretical or Mathematical",
}
@Article{Einarsson:1987:DCD,
author = "Goran Einarsson and Goran Roth",
title = "Data compression of digital color pictures",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "11",
number = "4",
pages = "409--426",
year = "1987",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/0097-8493(87)90057-4",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 17:22:01 2012",
bibsource = "Graphics/imager/imager.87.bib;
Graphics/siggraph/87.bib;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
keywords = "color encoding",
}
@Article{Gharavi:1987:CRL,
author = "H. Gharavi",
title = "Conditional Run-Length and Variable-Length Coding of
Digital Pictures",
journal = j-IEEE-TRANS-COMM,
volume = "COM-35",
number = "6",
pages = "671--677",
month = jun,
year = "1987",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/tcom.1987.1096817",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Gharavi, H. (1987) ``Conditional Run-Length and
Variable-Length Coding of Digital Pictures,'' {\it IEEE
Transactions on Communications}, {\bf
COM-35}(6):671--677, June.",
}
@Book{Held:1987:DCT,
author = "Gilbert Held and Thomas (Thomas R.) Marshall",
title = "Data compression: techniques and applications:
hardware and software considerations",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xii + 206",
year = "1987",
ISBN = "0-471-91280-8",
ISBN-13 = "978-0-471-91280-4",
LCCN = "QA76.9.D33 H44 1987",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
}
@Article{Lelewer:1987:DC,
author = "Debra A. Lelewer and Daniel S. Hirschberg",
title = "Data Compression",
journal = j-COMP-SURV,
volume = "19",
number = "3",
pages = "261--296",
month = sep,
year = "1987",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/45072.45074",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "ACM Computing Archive;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprinted in Japanese BIT Special issue in Computer
Science (1989), 16--195.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/45074.html;
http://www.ics.uci.edu/~dan/pubs/DataCompression.html",
abstract = "This paper surveys a variety of data compression
methods spanning almost 40 years of research, from the
work of Shannon, Fano, and Huffman in the late 1940s to
a technique developed in 1986. The aim of data
compression is to reduce redundancy in stored or
communicated data, thus increasing effective data
density. Data compression has important application in
the areas of file storage and distributed systems.
Concepts from information theory as they relate to the
goals and evaluation of data compression methods are
discussed briefly. A framework for evaluation and
comparison of methods is constructed and applied to the
algorithms presented. Comparisons of both theoretical
and empirical natures are reported, and possibilities
for future research are suggested.",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "Reviews techniques that are reversible.",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "adaptive coding; algorithms; data compression; Huffman
coding; text compression; theory",
rawdata = "Lelewer, D. A., and D. S. Hirschberg (1987) ``Data
compression,'' {\it Computing Surveys} {\bf19},3,
261--297. Reprinted in Japanese BIT Special issue in
Computer Science (1989), 16--195. Available in HTML at
|http://www.ics.uci.edu/~dan/pubs/DataCompression.html|.",
review = "ACM CR 8902-0069",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage. {\bf D.4.3}: Software, OPERATING SYSTEMS, File
Systems Management, Distributed file systems.",
}
@Article{Llewellyn:1987:DCS,
author = "J. A. Llewellyn",
title = "Data Compression for a Source with {Markov}
Characteristics",
journal = j-COMP-J,
volume = "30",
number = "2",
pages = "149--156",
month = apr,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.2.149",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/30/2/149.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/149.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/150.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/151.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/152.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/153.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/154.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/155.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_02/tiff/156.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Lancaster, Lancaster, Engl",
affiliationaddress = "Univ of Lancaster, Lancaster, Engl",
classcodes = "B0240Z (Other and miscellaneous); B6120B (Codes);
B6140 (Signal processing and detection); C1140Z (Other
and miscellaneous); C1260 (Information theory)",
classification = "723; 922",
corpsource = "Dept. of Comput., Lancaster Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "average; average code/source ratio; code symbols;
code/source ratio; codes, symbolic --- Encoding; coding
transformation; data compression; Data Compression;
encoding; encoding transformation; entropy; finite;
Huffman method; information source; information theory;
Markov characteristics; Markov processes; probability;
source coding; source strings; source with Markov
characteristics; state models; statistical structure;
symbol groups; zero probability",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Mullin:1987:ATD,
author = "J. K. Mullin",
title = "Accessing textual documents using compressed indexes
of arrays of small {Bloom} filters",
journal = j-COMP-J,
volume = "30",
number = "4",
pages = "343--348",
month = aug,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.4.343",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/30/4/343.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/343.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/344.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/345.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/346.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/347.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_04/tiff/348.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Western Ontario, London, Ont, Can",
affiliationaddress = "Univ of Western Ontario, London, Ont, Can",
classcodes = "C7240 (Information analysis and indexing); C7250L
(Non-bibliographic systems)",
classification = "723; 903",
corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compressed indexes; computer systems, digital ---
Parallel Processing; data compression; data processing
--- File Organization; document access; indexing;
Information Retrieval; information retrieval;
information science; large; large text files; parallel
processing; small bloom filters; small Bloom filters;
text accessing; text files; textual documents;
variable-sized documents; words",
treatment = "P Practical",
}
@Article{Nelson:1987:AWM,
author = "Russell Nelson",
title = "{ARC} Wars: {MS-DOS} Archiving Utilities",
journal = j-DDJ,
volume = "12",
number = "3",
pages = "26--28, 30",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "arc archiving utility; computer operating systems;
data processing; File Organization; file sets;
information theory --- Data Compression",
}
@Book{Parsons:1987:VSP,
author = "Thomas W. Parsons",
title = "Voice and Speech Processing",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "??",
year = "1987",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Parsons, Thomas W. (1987) {\it Voice and Speech
Processing}, New York, McGraw-Hill.",
}
@Article{Raita:1987:ASF,
author = "T. Raita",
title = "An Automatic System for File Compression",
journal = j-COMP-J,
volume = "30",
number = "1",
pages = "80--86",
month = feb,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.1.80",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:22 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/30/1/80.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/80.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/81.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/82.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/83.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/84.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/85.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_01/tiff/86.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Turku, Turku, Finl",
affiliationaddress = "Univ of Turku, Turku, Finl",
classcodes = "C5320C (Storage on moving magnetic media); C6120 (File
organisation); C6130 (Data handling techniques)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer operating systems --- Storage Allocation;
data compression; data processing; DEC2060; directory
pages; disc files; disk files; file compression; file
organisation; File Organization; information theory ---
Data Compression; magnetic disc storage; text
compression; university use",
treatment = "P Practical",
}
@InProceedings{Raite:1987:PTC,
author = "T. Raita and J. Teuhola",
title = "Predictive Test Compression by Hashing",
crossref = "Yu:1987:RDI",
pages = "223--233",
year = "1987",
bibdate = "Tue Jul 19 08:43:39 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
}
@PhdThesis{Ramabadran:1987:ASM,
author = "Tenkasi V. Ramabadran",
title = "Adaptive Source Models for Data Compression",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "162",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303617541",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8712954",
subject = "Electrical engineering",
}
@PhdThesis{Roy:1987:CES,
author = "Bimal Chandra Roy",
title = "Compression of Equally Spaced Digital Elevation Model
(Dem) Data",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "268",
year = "1987",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303501021",
acknowledgement = ack-nhfb,
classification = "0370: Earth",
dissertation-thesis-number = "8726719",
subject = "Earth",
}
@Article{Ryabko:1987:CLA,
author = "B. Ya. Ryabko and R. Nigel Horspool and Gordon V.
Cormack",
title = "Comments to: {``A locally adaptive data compression
scheme'' [Comm. ACM {\bf 29}, 1986, 4, 320--330, MR
87e:68020] by J. L. Bentley, D. D. Sleator, R. E.
Tarjan and V. K. Wei}",
journal = j-CACM,
volume = "30",
number = "9",
pages = "792--794",
month = sep,
year = "1987",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/5684.5688",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P99 (94A29)",
MRnumber = "89a:68045",
bibdate = "Tue Dec 26 13:35:07 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Tischer:1987:MLD,
author = "Peter Tischer",
title = "A Modified {LZW} Data Compression Scheme",
journal = j-AUSTRALIAN-COMP-SCI-COMM,
volume = "9",
number = "1",
pages = "262--272",
year = "1987",
CODEN = "ACSCDD",
ISSN = "0157-3055",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Australian Computer Science Communications",
rawdata = "Tischer, Peter (1987) ``A Modified LZW Data
Compression Scheme,'' {\it Australian computer science
communications}, {\bf9}(1):262--272.",
}
@PhdThesis{Tran:1987:DCB,
author = "Thao Duy Tran",
title = "Data Compression of Bauded Signals Using the Baseband
Residual Vector Quantization Algorithm",
type = "{Ph.D.} thesis",
school = "The University of Utah",
address = "Salt Lake City, UT 84112, USA",
pages = "167",
year = "1987",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303609161",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8727361",
subject = "Electrical engineering",
}
@Article{Vitter:1987:DAD,
author = "Jeffrey Scott Vitter",
title = "Design and Analysis of Dynamic {Huffman} Codes",
journal = j-J-ACM,
volume = "34",
number = "4",
pages = "825--845",
month = oct,
year = "1987",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/31846.42227",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/42227.html",
abstract = "A new one-pass algorithm for constructing dynamic
Huffman codes is introduced and analyzed. We also
analyze the one-pass algorithm due to N. Faller, R. G.
Gallager, and D. E. Knuth. In each algorithm, both the
sender and the receiver maintain equivalent dynamically
varying Huffman trees, and the coding is done in real
time. We show that the number of bits used by the new
algorithm to encode a message containing t letters is
less than t bits more than that used by the
conventional two-pass Huffman scheme, independent of
the alphabet size. This is best possible in the worst
case, for any one-pass Huffman method. Tight upper and
lower bounds are derived. Empirical tests show that the
encodings produced by the new algorithm are shorter
than those of the other one-pass algorithm and, except
for long messages, are shorter than those of the
two-pass method. The new algorithm is well suited for
online encoding\slash decoding in data networks and for
file compression.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliationaddress = "Brown Univ, Providence, RI, USA",
classification = "723",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
journalabr = "J Assoc Comput Mach",
keywords = "algorithms; codes, symbolic; computer networks;
computer programming --- Algorithms; Design; design;
dynamic Huffman codes; file compression; one-pass
algorithm; performance; theory",
rawdata = "Vitter, Jeffrey S. (1987) ``Design and Analysis of
Dynamic Huffman Codes,'' {\it Journal of the ACM},
{\bf34}(4):825--845, October.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems. {\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees. {\bf C.2.0}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, General,
Data communications.",
}
@Article{White:1987:CID,
author = "Ronald G. White",
title = "Compressing Image Data with Quadtrees",
journal = j-DDJ,
volume = "12",
number = "3",
pages = "16--??",
month = mar,
year = "1987",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723; 741; 921",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools",
keywords = "computer graphics --- Imaging Techniques; Data
Compression; data processing --- Data Structures;
graphical image representations; image data
compression; information theory; locational codes;
mathematical techniques --- Trees; quadtrees",
pagecount = "11p between p 16 and 45",
}
@Article{Witten:1987:ACD,
author = "Ian H. Witten and Radford M. Neal and John G. Cleary",
title = "Arithmetic Coding for Data Compression",
journal = j-CACM,
volume = "30",
number = "6",
pages = "520--540",
month = jun,
year = "1987",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/214762.214771",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/214771.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
annote = "From an input string of symbols and a model, an
encoded string is produced. The decoder must have
access to the same model; the model may assign a
predetermined probability to each symbol in ASCII. Such
a fixed model is communicated in advance. Huffman
coding performs optimally if all symbol probabilities
are integral powers of 1/2. Arithmetic coding dispenses
with the restriction that each symbol must translate
into an integral number of bits, thereby coding more
efficiently.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; performance",
rawdata = "Witten, Ian H., Radford M. Neal, and John G. Cleary
(1987) ``Arithmetic Coding for Data Compression,'' {\it
Communications of the ACM}, {\bf30}(6):520--540.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression.",
}
@TechReport{Aldus:1988:TIF,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 622-5500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
98073-9717, Tel: (206) 882-8080",
day = "8",
month = aug,
year = "1988",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Aldus:tiff,
author = "Aldus Corporation and Microsoft Corporation",
title = "Tag Image File Format ({TIFF}) Specification Revision
5.0",
institution = "Aldus Corporation, 411 First Avenue South, Suite 200,
Seattle, WA 98104, Tel: (206) 622-5500, and Microsoft
Corporation, 16011 NE 36th Way, Box 97017, Redmond, WA
98073-9717, Tel: (206) 882-8080",
month = aug # " 8",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-nhfb,
}
@Article{Anedda:1988:CQI,
author = "C. Anedda and L. Felician",
title = "{$P$}-Compressed Quadtrees for Image Storing",
journal = j-COMP-J,
volume = "31",
number = "4",
pages = "353--357",
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.4.353",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
rawdata = "Anedda, C. and L. Felician (1988) ``P-Compressed
Quadtrees for Image Storing,'' {\it The Computer
Journal}, {\bf31}(4):353--357.",
}
@Article{Anedda:1988:PCQ,
author = "C. Anedda and L. Felician",
title = "{P}-Compressed Quadtrees for Image Storing",
journal = j-COMP-J,
volume = "31",
number = "4",
pages = "353--357",
month = aug,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.4.353",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/353.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/354.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/355.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/356.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/357.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ degli Studi di Udine, Udine, Italy",
affiliationaddress = "Univ degli Studi di Udine, Udine, Italy",
classcodes = "C6120 (File organisation); C6130B (Graphics
techniques)",
classification = "722; 723; 741",
corpsource = "Dipartimento di Matematica e Inf., Udine Univ.,
Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "automation; bit-map scanning; computer graphics; data
compression; data storage, analog; data structures;
database systems; encoded images; encoding; image
processing; image storing; image-file management; mass
storage; office; office automation; office automation
environment; p-compressed quadtrees; P-compression;
quadtree-; storage management; trees (mathematics)",
treatment = "P Practical",
}
@Article{Anonymous:1988:DCTb,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1983--September 1986}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "518--518",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902611",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:1988:DCTc,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1983--September 1986}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "519--519",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902684",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:1988:DCTd,
author = "Anonymous",
title = "Data compression: Techniques and applications.
{October 1986--September 1987}",
journal = j-COMPUT-SECUR,
volume = "7",
number = "5",
pages = "519--519",
month = oct,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888902696",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Arps:1988:MPV,
author = "Ronald B. Arps and Thomas K. Truong and David J. Lu
and Richard C. Pasco and Theodore David Friedman",
title = "A multi-purpose {VLSI} chip for adaptive data
compression of bilevel images",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "775--795 (or 775--794??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.326.0775",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "A VLSI chip for data compression has been implemented
based on a general-purpose adaptive binary arithmetic
coding (ABAC) architecture. The architecture permits
the reuse of adapter and arithmetic coder logic in a
universal way, which together with application
-specific model logic can create a variety of powerful
compression systems. The specific version of the
adapter\slash coder used is the `Q-Coder'. The hardware
implementation is in a single HCMOS chip, to maximize
speed and minimize cost. The primary purpose of the
chip is to provide superior data compression
performance for bilevel image data by using conditional
binary source models together with adaptive arithmetic
coding. The coding scheme implemented is called the
Adaptive Bilevel Image Compression (ABIC) algorithm. On
business documents, it outperforms such nonadaptive
algorithms as the CCITT Group 4 (T.6) Standard and
comes into its own when adapting to documents scanned
at different resolutions or which include significantly
different data such as digital halftones.",
acknowledgement = ack-nhfb,
affiliation = "IBM Res. Div., Almaden Res. Center",
affiliationaddress = "San Jose, CA, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); B6140C
(Optical information and image processing); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)C1250 (Pattern
recognition)",
classification = "713; 714; 721; 723; 741; 921; B6110 (Information
theory); B6120B (Codes); B6140C (Optical information
and image processing); C1250 (Pattern recognition);
C1260 (Information theory); C4220 (Automata theory);
C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Almaden Res. Center, San Jose, CA,
USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Adapter; adapter; Adaptive arithmetic coding; adaptive
arithmetic coding; Adaptive binary arithmetic coding;
adaptive binary arithmetic coding; Adaptive Binary
Arithmetic Coding (ABAC); Adaptive data compression;
Adaptive Data Compression; adaptive data compression;
Arithmetic coder logic; arithmetic coder logic;
Arithmetic Coder Logic; Bilevel Images; bilevel images;
Bilevel images; binary source; Binary source models;
Control Systems, Adaptive; Design; digital arithmetic;
encoding; finite automata; hardware coding; Hardware
coding; HCMOS chip; Image Processing; information;
Information Theory--Data Compression; Integrated
Circuits, VLSI; models; picture processing;
probability; Q-Coder; Q-coder; theory; VLSI; VLSI chip;
VLSI Chip",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Picture processing; Probability;
VLSI",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
@Article{Barnsley:1988:BWC,
author = "Michael F. Barnsley and Alan D. Sloan",
title = "A Better Way to Compress Images",
journal = j-BYTE,
volume = "13",
number = "??",
pages = "215--222",
month = jan,
year = "1988",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "/usr/local/src/bib/bibliography/Graphics/imager/imager.88.bib;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/byte1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "BYTE Magazine",
rawdata = "Barnsley, M. F., and Sloan, A. D. (1988) ``A Better
Way to Compress Images,'' {\it Byte Magazine}, pp.
215--222, January.",
xxpages = "215--223",
}
@Book{Barnsley:1988:FE,
author = "Michael Barnsley",
title = "Fractals Everywhere",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xii + 394",
year = "1988",
ISBN = "0-12-079062-9",
ISBN-13 = "978-0-12-079062-3",
LCCN = "QA614.86 .B37 1988",
MRclass = "*58-01, 00A06, 11K55, 37B99, 37C70, 37D45, 37G15,
28A80, 54H20",
bibdate = "Tue Dec 14 22:40:15 1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
ZMnumber = "0691.58001",
abstract = "This book is based on a course called 'Fractal
Geometry' which has been taught in the School of
Mathematics at Georgia Institute of Technology for two
years. \booktitle{Fractals Everywhere} teaches the
tools, methods, and theory of deterministic geometry.
It is useful for describing specific objects and
structures. Models are represented by succinct
formulas.' Once the formula is known, the model can be
reproduced. we do not consider statistical geometry.
The latter aims at discovering general statistical laws
which govern families of similar-looking structures,
such as all cumulus clouds, all maple leaves, or all
mountains. In deterministic geometry, structures are
defined, communicated, and analysed, with the aid of
elementary transformations such as affine
transformations, scalings, rotations, and congruences.
A fractal set generally contains infinitely many points
whose organization is so complicated that it is not
possible to describe the set by specifying directly
where each point in it lies. Instead, the set may be
define by `the relations between the pieces.' It is
rather like describing the solar system by quoting the
law of gravitation and stating the initial conditions.
Everything follows from that. It appears always to be
better to describe in terms of relationships.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Barnsley, M. F. (1988) {\it Fractals Everywhere}, New
York, Academic Press.",
tableofcontents = "Introduction: Applications for Fractal Functions /
205 \\
Fractal Interpolation Functions / 208 \\
The Fractal Dimension of Fractal Interpolation
Functions / 223 \\
Hidden Variable Fractal Interpolation / 229 \\
Space-Filling Curves / 238 \\
Julia Sets / 246 \\
The Escape Time Algorithm for Computing Pictures of IFS
Attractors and Julia Sets / 246 \\
Iterated Function Systems Whose Attractors Are Julia
Sets / 266 \\
The Application of Julia Set Theory to Newton's Method
/ 276 \\
A Rich Source for Fractals: Invariant Sets of
Continuous Open Mappings / 287 \\
Parameter Spaces and Mandelbrot Sets / 294 \\
The Idea of a Parameter Space: A Map of Fractals / 294
\\
Mandelbrot Sets for Pairs of Transformations / 299 \\
The Mandelbrot Set for Julia Sets / 309 \\
How to Make Maps of Families of Fractals Using Escape
Times / 317 \\
Measures on Fractals / 330 \\
Introduction to Invariant Measures on Fractals / 330
\\
Fields and Sigma-Fields / 337 \\
Measures / 341 \\
Integration / 344 \\
The Compact Metric Space (P (X), d) / 349 \\
A Contraction Mapping on (P (X)) / 350 \\
Elton's Theorem / 364 \\
Application to Computer Graphics / 370 \\
Recurrent Iterated Function Systems / 379 \\
Fractal Systems / 379 \\
Recurrent Iterated Function Systems / 383 \\
Collage Theorem for Recurrent Iterated Function Systems
/ 392 \\
Fractal Systems with Vectors of Measures as Their
Attractors / 403 \\
References / 409 \\
References / 412 \\
Selected Answers / 416 \\
Index / 523 \\
Credits for Figures and Color Plates / 533",
xxtableofcontents = "Metric Spaces \\
Equivalent Spaces \\
Classification of Subsets \\
and the Space of Fractals \\
Spaces \\
Metric Spaces \\
Cauchy Sequences, Limit Points, Closed Sets, Perfect
Sets, and Complete Metric Spaces \\
Compact Sets, Bounded Sets, Open Sets, Interiors, and
Boundaries \\
Connected Sets, Disconnected Sets, and
Pathwise-Connected Sets \\
The Metric Space (H (X), h): The Place Where Fractals
Live \\
The Completeness of the Space of Fractals \\
Additional Theorems about Metric Spaces \\
Transformations on Metric Spaces \\
Contraction Mappings and the Construction of Fractals
\\
Transformations on the Real Line \\
Affine Transformations in the Euclidean Plane \\
Mobius Transformations on the Riemann Sphere \\
Analytic Transformations \\
How to Change Coordinates \\
The Contraction Mapping Theorem \\
Contraction Mappings on the Space of Fractals \\
Two Algorithms for Computing Fractals from Iterated
Function Systems \\
Condensation Sets \\
How to Make Fractal Models with the Help of the Collage
Theorem \\
Blowing in the Wind: The Continuous Dependence of
Fractals on Parameters \\
Chaotic Dynamics on Fractals \\
The Addresses of Points on Fractals \\
Continuous Transformations from Code Space to Fractals
\\
Introduction to Dynamical Systems \\
Dynamics on Fractals: Or How to Compute Orbits by
Looking at Pictures \\
Equivalent Dynamical Systems \\
The Shadow of Deterministic Dynamics \\
The Meaningfulness of Inaccurately Computed Orbits is
Established by Means of a Shadowing Theorem \\
Chaotic Dynamics on Fractals \\
Fractal Dimension",
}
@InProceedings{Bassiouni:1988:SDC,
author = "M. A. Bassiouni and N. Ranganathan and A. Mukherjee",
title = "A scheme for data compression in supercomputers",
crossref = "IEEE:1988:PSN",
volume = "1",
pages = "272--278",
year = "1988",
bibdate = "Thu Apr 16 07:55:03 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C1260 (Information theory); C5440 (Multiprocessor
systems and techniques)",
corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando,
FL, USA",
keywords = "communication bandwidth; communication controllers;
data compression; encoding; enhanced arithmetic coding
scheme; parallel processing; supercomputers; VLSI
designs",
sponsororg = "IEEE; ACM",
treatment = "P Practical",
}
@Article{Bhasker:1988:CMM,
author = "J. Bhasker and T. Samad",
title = "Compacting {MIMOLA} microcode",
journal = j-SIGMICRO,
volume = "19",
number = "1--2",
pages = "40--44",
month = jun,
year = "1988",
DOI = "https://doi.org/10.1145/62197.62206",
bibdate = "Fri Apr 16 10:27:39 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmicro.bib",
URL = "https://dl.acm.org/doi/10.1145/62197.62206",
abstract = "We address the problem of reducing the word length of
microprograms. Two techniques are described: overlaying
of fields and encoding of the microprogram. Formal
analysis are presented of different encoding methods,
assuming a VLSI implementation. A \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMICRO Newsletter",
journal-URL = "https://dl.acm.org/loi/sigmicro",
}
@Article{Daubechies:1988:OBC,
author = "Ingrid Daubechies",
title = "Orthonormal Bases of Compactly Supported Wavelets",
journal = j-COMM-PURE-APPL-MATH,
volume = "41",
number = "7",
pages = "909--996",
month = oct,
year = "1988",
CODEN = "CPAMAT, CPMAMV",
DOI = "https://doi.org/10.1002/cpa.3160410705",
ISSN = "0010-3640 (print), 1097-0312 (electronic)",
ISSN-L = "0010-3640",
MRclass = "42C40 65T60; 42C15 (92A25)",
MRnumber = "951745",
MRreviewer = "Hans G. Feichtinger",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/kbmath.bib",
note = "Reprinted in \cite{Daubechies:2006:OBC}.",
ZMnumber = "0644.42026",
acknowledgement = ack-ds # "\slash " # ack-nhfb,
fjournal = "Communications on Pure and Applied Mathematics (New
York)",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0312",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
rawdata = "Daubechies, Ingrid (1988) ``Orthonormal Bases of
Compactly Supported Wavelets,'' {\it Communications on
Pure and Applied Mathematics}, {\bf41}:909--996.",
unique-id = "ISI:A1988Q390700004",
}
@InProceedings{Desoky:1988:CID,
author = "Ahmed Desoky and Carol O'Connor and Thomas Klein",
title = "Compression of Image Data Using Arithmetic Coding",
crossref = "Wegman:1988:CSS",
pages = "812--814",
year = "1988",
bibdate = "Wed Nov 12 17:00:33 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Disque:1988:SCT,
author = "Tom Disque",
title = "Simple Compression Technique Works With Text and
Graphics",
journal = j-CUJ,
volume = "6",
number = "8",
pages = "23--??",
month = aug,
year = "1988",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@Article{Duvanenko:1988:ICC,
author = "Victor J. Duvanenko",
title = "Image compression via compilation",
journal = j-DDJ,
volume = "13",
number = "11",
pages = "42--47, 82--90",
month = nov,
year = "1988",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Tue Sep 10 09:30:19 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Silicon Eng. Inc., Santa Cruz, CA, USA",
classification = "C5130 (Microprocessor chips); C6130B (Graphics
techniques); C6150C (Compilers, interpreters and other
processors)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bandwidth; C program; Embedded graphics primitives;
Graphics coprocessor; Graphics intensive jobs; Graphics
memory; Image compilation; Image compression; Image
reconstruction; Intel 82786",
thesaurus = "C listings; Computer graphic equipment; Computer
graphics; Data compression; Firmware; Microprocessor
chips; Program compilers",
}
@Book{Feder:1988:F,
author = "Jens Feder",
title = "Fractals",
publisher = pub-PLENUM,
address = pub-PLENUM:adr,
pages = "??",
year = "1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Feder, Jens (1988) {\it Fractals}, New York, Plenum
Press.",
}
@InProceedings{Goel:1988:DCA,
author = "B. Goel and S. Kwatra",
title = "A Data Compression Algorithm for Color Images Based on
Run-Length Coding and Fractal Geometry",
crossref = "IEEE:1988:DTS",
volume = "3",
pages = "1253--1256",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@InProceedings{Goel:1988:IIC,
author = "B. Goel and S. Kwatra",
title = "A Data Compression Algorithm for Color Images Based on
Run-Length Coding and Fractal Geometry",
crossref = "IEEE:1988:DTS",
volume = "3",
pages = "1253--1256",
year = "1988",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Hurst:1988:IDC,
author = "G. J. B. Hurst and M. Dupuis",
title = "Integral data compression for {FPS} 64-bit processors:
Improved {I/O} and reduced storage",
journal = j-J-COMPUT-CHEM,
volume = "9",
number = "2",
pages = "148--157",
month = mar,
year = "1988",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.540090207",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:04 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem1980.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "7 Sep 2004",
}
@Book{IBM:1988:IJR,
author = "IBM",
title = "{IBM} Journal of Research and Development",
volume = "32(6)",
publisher = pub-IBM,
address = pub-IBM:adr,
pages = "??",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Special issue on encoding.",
acknowledgement = ack-ds,
rawdata = "IBM (1988) {\it IBM Journal of Research and
Development}, \#6 (the entire issue).",
}
@Article{Jakobsson:1988:ROP,
author = "Matti Jakobsson",
title = "Research: One-pass text compression with a subword
dictionary",
journal = j-J-AM-SOC-INF-SCI,
volume = "39",
number = "4",
pages = "262--269",
month = jul,
year = "1988",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(198807)39:4<262::AID-ASI5>3.0.CO%3B2-H",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:33 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "25 May 2007",
}
@Article{Jones:1988:AST,
author = "Douglas W. Jones",
title = "Application of Splay Trees to Data Compression",
journal = j-CACM,
volume = "31",
number = "8",
pages = "996--1007",
month = aug,
year = "1988",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63030.63036",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 06 08:06:29 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63036.html",
acknowledgement = ack-nhfb,
annote = "One of the simplest and fastest adaptive data
compression algorithms based on a prefix code. With
algorithms in pseudocode.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; performance; theory",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.4}:
Data, CODING AND INFORMATION THEORY, Data compaction
and compression. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS, Linked representations.",
}
@Article{Jurgen:1988:TSE,
author = "R. K. Jurgen",
title = "Technology '88: the specialities [electrical
engineering]",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "1",
pages = "70--70",
month = jan,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.4492",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Control engineering education; Data compression; data
compression chips; Electrical engineering; electrical
engineering; Electromagnetic compatibility;
electromagnetic compatibility education;
Electromagnetic modeling; EMP radiation effects; error
control; Error correction; neural learning network
model; Optical device fabrication; Optical pulses;
optical-fiber telecommunications systems; Pulse
compression methods; pulse encoding",
}
@Article{Lesk:1988:GII,
author = "Michael Lesk",
title = "{GRAB} --- Inverted Indexes with Low Storage
Overhead",
journal = j-COMP-SYS,
volume = "1",
number = "3",
pages = "207--220",
month = "Summer",
year = "1988",
CODEN = "CMSYE2",
ISSN = "0895-6340",
bibdate = "Fri Sep 13 09:01:18 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6150J (Operating systems); C7250L
(Non-bibliographic systems)",
fjournal = "Computing Systems",
keywords = "B-trees; Bit vector; Bytes; Fixed length codeword
compression scheme; GRAB; Hash codes; Inverted indexes;
Pointers; Preindexing pass; Searching command; Sparse
vectors; Storage overhead; Whole words",
thesaurus = "DEC computers; Information retrieval; Information
retrieval systems; Operating systems [computers];
Unix",
}
@Article{Luther:1988:YTC,
author = "A. C. Luther",
title = "You are there \ldots{} and in control (digital
interactive video)",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "9",
pages = "45--50",
month = sep,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.7167",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Application software; CD recording; Computer displays;
Control systems; data compression; Digital control;
digital interactive video; hardware; image data
compression; interactive systems; Mathematical model;
Microcomputers; Personal communication networks;
personal computers; software; sound data compression;
television equipment; TV; Video compression; video
signals",
}
@Article{Luther:1988:YTL,
author = "A. C. Luther",
title = "You are there \ldots{} and in control (digital
interactive video)",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "9",
pages = "45--50",
month = sep,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.7167",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1980.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Application software; CD recording; Computer displays;
Control systems; data compression; Digital control;
digital interactive video; hardware; image data
compression; interactive systems; Mathematical model;
Microcomputers; Personal communication networks;
personal computers; software; sound data compression;
television equipment; TV; Video compression; video
signals",
}
@Article{Pennebaker:1988:OBP,
author = "William B. Pennebaker and Joan L. Mitchell and Glen G.
{Langdon, Jr.} and Ronald B. Arps",
title = "An Overview of the Basic Principles of the {$Q$}-coder
Adaptive Binary Arithmetic Coder",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "717--726 (or 206--211??)",
month = nov,
year = "1988",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.326.0717",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "The Q-Coder is a new form of adaptive binary
arithmetic coding. The binary arithmetic coding part of
the technique is derived from the basic concepts
introduced by Rissanen, Pasco, and Langdon, but extends
the coding conventions to resolve a conflict between
optimal software and hardware implementations. In
addition, a robust form of probability estimation is
used in which the probability estimate is derived
solely from the interval renormalizations that are part
of the arithmetic coding process. A brief tutorial of
arithmetic coding concepts is presented, followed by a
discussion of the compatible optimal hardware and
software coding structures and the estimation of symbol
probabilities from interval renormalization.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "IBM Res. Div., Thomas J. Watson Res. Center",
affiliationaddress = "Yorktown Heights, NY, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)",
classification = "704; 722; 723; 921; 922; B6110 (Information theory);
B6120B (Codes); C1260 (Information theory); C4220
(Automata theory); C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
Heights, NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Binary Arithmetic Coder; Codes, Symbolic; Coding
conventions; coding conventions; Compatible Optimal
Hardware; Computer Hardware; Computer Metatheory;
Computer Software; digital arithmetic; encoding; finite
automata; hardware coding; Hardware coding;
information; interval; Interval Renormalization;
Interval renormalizations; Mathematical Techniques;
Performance; probability; probability estimation;
Probability estimation; Probability--Estimation;
Q-Coder; Q-coder adaptive binary arithmetic coder;
renormalizations; Software coding; Software Coding;
software coding; superconducting devices; Symbol
Probabilities; Symbol probabilities; symbol
probabilities; theory",
rawdata = "Pennebaker, William B., Joan L. Mitchell, et al.
(1988b) ``An Overview of the Basic Principles of the
Q-coder Adaptive Binary Arithmetic Coder,'' {\it IBM
Journal of Research and Development},
{\bf32}(6):737--752.",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Probability",
treatment = "T Theoretical or Mathematical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
@Article{Pennebaker:1988:PEC,
author = "William B. Pennebaker and Joan L. Mitchell",
title = "Probability Estimation for the {$Q$}-coder",
journal = j-IBM-JRD,
volume = "32",
number = "6",
pages = "737--752",
month = nov,
year = "1988",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
abstract = "The Q-Coder is an important new development in binary
arithmetic coding. It combines a simple but efficient
arithmetic approximation for the multiply operation, a
new formalism which yields optimally efficient hardware
and software implementations, and a new technique for
estimating symbol probabilities which matches the
performance of any method known. This paper describes
the probability-estimation technique. The probability
changes are estimated solely from renormalizations in
the coding process and require no additional counters.
The estimation process can be implemented as a
finite-state machine, and is simple enough to allow
precise theoretical modeling of single-context coding.
Approximate models have been developed for a more
complex multi-rate version of the estimator and for
mixed-context coding. Experimental studies verifying
the modeling and showing the performance achieved for a
variety of image-coding models are presented.",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "IBM Res. Div., Thomas J. Watson Res. Center",
affiliationaddress = "Yorktown Heights, NY, USA",
classcodes = "B6120B (Codes); B6110 (Information theory); C5230
(Digital arithmetic methods); C1260 (Information
theory); C4220 (Automata theory)",
classification = "721; 723; 921; 922; B6110 (Information theory);
B6120B (Codes); C1260 (Information theory); C4220
(Automata theory); C5230 (Digital arithmetic methods)",
corpsource = "IBM Res. Div., Thomas J. Watson Res. Centre, Yorktown
Heights, NY, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
journalabr = "IBM J Res Dev",
keywords = "Automata Theory; Binary Arithmetic Coding; Binary
arithmetic coding; binary arithmetic coding; Codes,
Symbolic; context coding; digital arithmetic; encoding;
estimation technique; finite automata; finite-state;
Finite-state machine; Hardware coding; hardware coding;
Image-coding models; image-coding models;
implementations; information; machine; mixed-;
Mixed-Context Coding; Mixed-context coding; multi-rate
version; Multi-rate version; multiply; Multiply
operation; operation; Optimally efficient hardware;
optimally efficient hardware; Performance; probability;
Probability Changes; probability-;
Probability--Estimation; Probability-estimation
technique; Q-coder; Q-Coder; Renormalizations;
renormalizations; Single-context coding; single-context
coding; Single-Context Coding; software; Software
implementations; Symbol probabilities; symbol
probabilities; Symbol Probabilities; theory",
rawdata = "Pennebaker, William B., and Joan L. Mitchell (1988a)
``Probability Estimation for the Q-coder,'' {\it IBM
Journal of Research and Development},
{\bf32}(6):717--726.",
thesaurus = "Digital arithmetic; Encoding; Finite automata;
Information theory; Probability",
treatment = "T Theoretical or Mathematical",
}
@PhdThesis{Perkins:1988:DCS,
author = "Michael G. Perkins",
title = "Data compression of stereopairs",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "187",
year = "1988",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303695164",
acknowledgement = ack-nhfb,
advisor = "Peter M. Banks",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "8815037",
subject = "Electrical engineering",
}
@Book{Press:1988:NRC,
author = "W. H. Press and B. P. Flannery and others",
title = "Numerical Recipes in {C}: The Art of Scientific
Computing",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xxii + 735",
year = "1988",
ISBN = "0-521-35465-X, 0-521-35466-8 (diskette)",
ISBN-13 = "978-0-521-35465-3, 978-0-521-35466-0 (diskette)",
LCCN = "QA76.73.C15 N865 1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.nr.com/",
acknowledgement = ack-ds,
keywords = "C (computer program language)",
rawdata = "Press, W. H., B. P. Flannery, et al. (1988) {\it
Numerical Recipes in C: The Art of Scientific
Computing}, Cambridge, UK, Cambridge University Press.
(Also available at URL |http://www.nr.com/|.)",
}
@Article{Ramabadran:1988:TCC,
author = "Tenkasi V. Ramabadran and Sunil S. Gaitonde",
title = "A Tutorial on {CRC} Computations",
journal = j-IEEE-MICRO,
volume = "8",
number = "4",
pages = "62--75",
month = jul # "\slash " # aug,
year = "1988",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.7773",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
Science Citation Index database (1980--2000)",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6120B (Codes); C6130 (Data handling techniques)",
classification = "723; 921",
corpsource = "Iowa State Univ., Ames, IA, USA",
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "algorithms; assembly language listings; automatic
repeat request (ARQ); C listings; codes; codes,
symbolic; computer systems programming --- Table
Lookup; computer systems, digital --- Fault Tolerant
Capability; computers, microcomputer; CRC computations;
CRS; cyclic redundancy codes; error control strategies;
Error Correction; error correction; mathematical
techniques --- Polynomials; on-the-fly; on-the-fly
algorithm; reduced table lookup; redundancy; software;
table lookup; wordwise; wordwise algorithms",
rawdata = "Ramabadran, Tenkasi V., and Sunil S. Gaitonde (1988)
``A Tutorial on CRC Computations,'' {\it IEEE Micro},
pp. 62--75, August.",
treatment = "P Practical; T Theoretical or Mathematical",
}
@PhdThesis{Ranganathan:1988:HAD,
author = "N. Ranganathan",
title = "Hardware algorithms for data compression",
type = "{Ph.D.} thesis",
school = "University of Central Florida",
address = "Orlando, FL, USA",
pages = "181",
year = "1988",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303705163",
acknowledgement = ack-nhfb,
advisor = "Amar Mukherjee and Mostafa Bassiouni",
classification = "0984: Computer science",
dissertation-thesis-number = "8827949",
subject = "Computer science",
}
@Article{Reddy:1988:DCT,
author = "S. M. Reddy and K. K. Saluja and M. G. Karpovsky",
title = "A data compression technique for built-in self-test",
journal = j-IEEE-TRANS-COMPUT,
volume = "37",
number = "9",
pages = "1151--1156",
month = sep,
year = "1988",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.2271",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jul 9 08:33:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=2271",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Reddy:1988:RMT,
author = "B. R. K. Reddy and A. L. Pai",
title = "{Reed--Muller} Transform Image Coding",
journal = j-CVGIP,
volume = "42",
number = "1",
pages = "48--61",
month = apr,
year = "1988",
CODEN = "CVGPDB",
ISSN = "0734-189X",
ISSN-L = "0734-189X",
bibdate = "Thu Feb 6 18:44:11 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Arizona State Univ, Tempe, AZ, USA",
classification = "723; 921",
fjournal = "Computer Vision, Graphics, and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/0734189X",
journalabr = "Comput Vision Graphics Image Process",
keywords = "Image Coding; image data bandwidth compression; image
data compression; image processing; information theory
--- Data Compression; mathematical transformations;
real time image processing; reconstructed images;
reed-muller transform",
}
@PhdThesis{Rubinstein:1988:SCC,
author = "Roy Steven Rubinstein",
title = "Structural complexity classes of sparse sets:
Intractability, data compression and printability",
type = "{Ph.D.} thesis",
school = "Northeastern University",
address = "Boston, MA, USA",
pages = "79",
year = "1988",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303720650",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "8904853",
subject = "Computer science",
}
@Book{Sacco:1988:ITS,
author = "William Sacco and others",
title = "Information Theory, Saving Bits",
publisher = "Janson Publications",
address = "Providence, RI, USA",
pages = "??",
year = "1988",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Sacco, William, et al. (1988) {\it Information Theory,
Saving Bits}, Providence, RI, Janson Publications.",
}
@Article{Sieminski:1988:FDH,
author = "Andrzej Sieminski",
title = "Fast Decoding of the {Huffman} Codes",
journal = j-INFO-PROC-LETT,
volume = "26",
number = "5",
pages = "237--241",
day = "11",
month = jan,
year = "1988",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(88)90146-9",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliationaddress = "Technical Univ of Wroclaw, Wroclaw, Pol",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation); C6130 (Data handling techniques)",
corpsource = "Dept. of Inf. Syst., Tech. Univ. of Wroclaw, Poland",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
journalabr = "Inf Process Lett",
keywords = "algorithms; codes, symbolic; computer programming ---
Algorithms; data compression; data handling; database
systems; Decoding; decoding; decoding algorithm; file
organisation; file processing; Huffman algorithm;
Huffman codes; information theory --- Data Compression;
minimum redundancy codes; redundancy; theory",
pubcountry = "Netherlands A03",
rawdata = "Sieminski, A. (1988) ``Fast Decoding of the Huffman
Codes,'' {\it Information Processing Letters},
{\bf26}(5):237--241.",
subject = "E.4 Data, CODING AND INFORMATION THEORY, Data
compaction and compression",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Book{Storer:1988:DCM,
author = "James A. (James Andrew) Storer",
title = "Data Compression: Methods and Theory",
publisher = pub-CSP,
address = pub-CSP:adr,
pages = "x + 413",
year = "1988",
ISBN = "0-88175-161-8",
ISBN-13 = "978-0-88175-161-1",
LCCN = "QA76.9.D33 S76 1988",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Principles of computer science series.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Storer, James A. (1988) {\it Data Compression: Methods
and Theory}, Rockville, MD, Computer Science Press.",
subject = "Data compression (Computer science)",
}
@Article{Tung:1988:FAO,
author = "C.-H. Tung and J. P. Robinson",
title = "A fast algorithm for optimum syndrome space
compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "37",
number = "2",
pages = "228--232",
month = feb,
year = "1988",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.2153",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Sat Jul 9 08:33:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=2153",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wang:1988:AAO,
author = "Muzhong Wang",
title = "Almost Asymptotically Optimal Flag Encoding of the
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "34",
number = "2",
pages = "324--326",
month = mar,
year = "1988",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.2643",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Wang, Muzhong (1988) ``Almost Asymptotically Optimal
Flag Encoding of the Integers,'' {\it IEEE Transactions
on Information Theory}, {\bf34}(2):324--326, March.",
}
@Article{Witten:1988:PAA,
author = "Ian H. Witten and John G. Cleary",
title = "On the privacy afforded by adaptive text compression",
journal = j-COMPUT-SECUR,
volume = "7",
number = "4",
pages = "397--408",
month = aug,
year = "1988",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:37 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/0167404888905809",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Zalta:1988:AP,
author = "Edward N. Zalta",
title = "Are Algorithms Patentable?",
journal = j-NAMS,
volume = "35",
number = "6",
pages = "796--799",
year = "1988",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
rawdata = "Zalta, Edward N. (1988) ``Are Algorithms Patentable?''
{\it Notices of the American Mathematical Society},
{\bf35}(6):796--799.",
}
@Article{Zorpette:1988:FJA,
author = "Glenn Zorpette",
title = "Fractals: Not Just Another Pretty Picture",
journal = j-IEEE-SPECTRUM,
volume = "25",
number = "10",
pages = "29--31",
month = oct,
year = "1988",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.8587",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Mon Jan 20 06:41:24 2020",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "1024 pixels; 700 pixels; Airplanes; computer graphics;
data compression; fractals; Fractals; fractals;
Graphics; Image coding; image compression; Image
converters; Layout; Mathematics; Pixel; Satellites;
Shape",
}
@Article{Abrahamson:1989:ADS,
author = "David M. Abrahamson",
title = "An Adaptive Dependency Source Model for Data
Compression",
journal = j-CACM,
volume = "32",
number = "1",
pages = "77--83",
month = jan,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63238.63243",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
MRclass = "68P25",
MRnumber = "993 620",
bibdate = "Sat Apr 06 08:06:30 1996",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63243.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; performance",
review = "ACM CR 8910-0732",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.1.1}: Information
Systems, MODELS AND PRINCIPLES, Systems and Information
Theory, Information theory.",
}
@Article{Bell:1989:MTC,
author = "Timothy Bell and Ian H. Witten and John G. Cleary",
title = "Modeling for Text Compression",
journal = j-COMP-SURV,
volume = "21",
number = "4",
pages = "557--591",
month = dec,
year = "1989",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/76894.76896",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 09:38:50 MDT 2008",
bibsource = "Compendex database;
http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/76896.html",
abstract = "The best schemes for text compression use large models
to help them predict which characters will come next.
The actual next characters are coded with respect to
the prediction, resulting in compression of
information. Models are best formed adaptively, based
on the text seen so far. This paper surveys successful
strategies for adaptive modeling that are suitable for
use in practical text compression systems. The
strategies fall into three main classes: finite-context
modeling, in which the last few characters are used to
condition the probability distribution for the next
one; finite-state modeling, in which the distribution
is conditioned by the current state (and which subsumes
finite-context modeling as an important special case);
and dictionary modeling, in which strings of characters
are replaced by pointers into an evolving dictionary. A
comparison of different methods on the same sample
texts is included, along with an analysis of future
research directions.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Canterbury",
affiliationaddress = "Christchurch, NZ",
classification = "723",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "algorithms; Arithmetic Coding; Encoding;
experimentation; measurement, Codes, Symbolic; Text
Compression",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.1.1}: Information
Systems, MODELS AND PRINCIPLES, Systems and Information
Theory, Information theory.",
}
@Article{Bell:1989:NDD,
author = "T. Bell and A. Moffat",
title = "A note on the {DMC} data compression scheme",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "16--20",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.16",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P25",
MRnumber = "984 923",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/16.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/16.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/17.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/18.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/19.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/20.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Canterbury Univ.",
affiliationaddress = "Christchurch, NZ",
classcodes = "B6140 (Signal processing and detection); B6110
(Information theory); C6130 (Data handling techniques);
C4220 (Automata theory)",
classification = "723; 922; B6110 (Information theory); B6140 (Signal
processing and detection); C4220 (Automata theory);
C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Canterbury Univ., Christchurch,
New Zealand",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "automata; Automata Theory--Finite Automata;
compression; Compression performance; Data Compression;
data compression; Directly preceding symbols; directly
preceding symbols; DMC data compression scheme;
dynamic; Dynamic Markov compression; Dynamic Markov
Compression Scheme; finite automata; finite context;
Finite context automata; Finite state automata; finite
state automata; Information Theory; Markov compression;
Markov processes; order Markov models; performance;
Probability--Random Processes; Text compression; text
compression; Text Compression, DMC data compression
scheme; variable-; Variable-order Markov models;
variable-order Markov models",
thesaurus = "Data compression; Finite automata; Markov processes",
treatment = "P Practical",
}
@Article{Bianchi:1989:DCH,
author = "Mark J. Bianchi and Jeffery J. Kato and David J. {Van
Maren}",
title = "Data compression in a half-inch reel-to-reel tape
drive",
journal = j-HEWLETT-PACKARD-J,
volume = "40",
number = "3",
pages = "26--31",
month = jun,
year = "1989",
CODEN = "HPJOAX",
ISSN = "0018-1153",
bibdate = "Tue Mar 25 14:12:15 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "HP 7980 tape drives are industry-standard, half-inch,
reel-to-reel, streaming tape drives that operate at 125
inches per second, have automatic tape loading, and can
be horizontally rack-mounted for better floor space
utilization. They are available in a variety of
configurations and support three industry-standard tape
formats: 800 NRZI, 1600 PE, and 6250 GCR. The HP 7980XC
Tape Drive is a new member of this family. Its special
contribution is its use of a sophisticated real-time
data compression scheme that provides extended
performance to the 6250 GCR format. The implementation
of data compression in the HP 7980XC involves two
different but complementary components. The authors
address the design and implementation of data
compression in the HP 7980XC.",
acknowledgement = ack-nhfb,
affiliationaddress = "USA",
classcodes = "C5320C (Storage on moving magnetic media)",
classification = "713; 714; 721; 722; C5320C (Storage on moving
magnetic media)",
fjournal = "Hewlett-Packard Journal: technical information from
the laboratories of Hewlett-Packard Company",
journalabr = "Hewlett Packard J",
keywords = "6250 GCR format; CMOS VLSI Chip; compression; Data
compression; data compression; Data Storage, Magnetic;
HP 7980 tape drives; HP 7980XC; HP 7980XC Tape Drive;
Information Theory--Data Compression; Integrated
Circuits, VLSI; magnetic tape; magnetic tape equipment;
real-time data; Real-time data compression;
Reel-to-Reel Tape Drive; storage; Tape",
thesaurus = "Data compression; Magnetic tape equipment; Magnetic
tape storage",
treatment = "P Practical; R Product Review",
}
@Article{Capocelli:1989:CAR,
author = "Renato Capocelli",
title = "Comments and Additions to `Robust Transmission of
Unbounded Strings Using {Fibonacci} Representations'",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "35",
number = "1",
pages = "191--193",
month = jan,
year = "1989",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.42193",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capocelli, Renato (1989) ``Comments and Additions to
`Robust Transmission of Unbounded Strings Using
Fibonacci Representations','' {\it IEEE Transactions on
Information Theory}, {\bf35}(1):191--193, January.",
}
@PhdThesis{Chakreyavanich:1989:RGD,
author = "Udomsak Chakreyavanich",
title = "Regular Grid {DEM} Data Compression By Using
Zero-Crossing: the Automatic Breakline Detection
Method",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "149",
year = "1989",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303812819",
acknowledgement = ack-nhfb,
advisor = "Anton F. Schenk",
classification = "0370: Earth",
dissertation-thesis-number = "9105809",
subject = "Earth",
}
@Article{Fiala:1989:DCF,
author = "E. R. Fiala and D. H. Greene",
title = "Data Compression with Finite {Windows}",
journal = j-CACM,
volume = "32",
number = "4",
pages = "490--505",
month = apr,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/63334.63341",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63341.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; experimentation; theory",
rawdata = "Fiala, E. R., and D. H. Greene (1989), ``Data
Compression with Finite Windows,'' {\it Communications
of the ACM}, {\bf32}(4):490--505.",
review = "ACM CR 8910-0733",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES. {\bf F.2.2}: Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Computations on
discrete structures. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Pattern matching.",
}
@Article{Fowell:1989:FPF,
author = "Richard A. Fowell and David D. McNeil",
title = "Faster Plots by Fan Data-Compression",
journal = j-IEEE-CGA,
volume = "9",
number = "2",
pages = "58--66",
month = mar,
year = "1989",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.19052",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database; Graphics/siggraph/89.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-nhfb,
annote = "Correction on figures 2 to 5 in IEEE CGA v.9 n.3
p.84",
classification = "722; 723; 731",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Bode Plots; Computer Aided Engineering; Computer
Graphics; Computer Peripheral Equipment; Control
Systems --- Bode Diagrams; Fan Data Compression Method;
faster plots; Information Theory --- Data Compression;
Plot Compression; Plotters",
}
@PhdThesis{Ishihara:1989:UHT,
author = "Fumiko Ishihara",
title = "The use of Hadamard Transform as a data compression
technique in the development of a three-dimensional
fluorescence spectral library for qualitative
analysis",
type = "{Ph.D.} thesis",
school = "Virginia Polytechnic Institute and State University",
address = "Blacksburg, VA, USA",
pages = "154",
year = "1989",
ISBN = "0-612-06836-6",
ISBN-13 = "978-0-612-06836-0",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303819442",
acknowledgement = ack-nhfb,
advisor = "Raymond E. Dessy",
classification = "0486: Analytical chemistry",
dissertation-thesis-number = "8917989",
subject = "Analytical chemistry",
}
@Misc{ITU-T:1989:CRG,
author = "{ITU-T}",
title = "{CCITT} Recommendation {G.711}: Pulse Code Modulation
({PCM}) of Voice Frequencies",
pages = "??",
year = "1989",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-T (1989) CCITT Recommendation G.711: ``Pulse Code
Modulation (PCM) of Voice Frequencies.''",
}
@MastersThesis{Johnson:1989:BDC,
author = "Michael Paul Johnson",
title = "Beyond {DES}: Data Compression and the {MPJ}
Encryption Algorithm",
type = "{M.S.} thesis",
school = "University of Colorado at Colorado Springs",
address = "Colorado Springs, CO, USA",
pages = "135",
year = "1989",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303808583",
acknowledgement = ack-nhfb,
advisor = "Mark A. Wickert",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1337668",
subject = "Electrical engineering",
}
@MastersThesis{Klein:1989:ACM,
author = "Thomas Joseph Klein",
title = "Arithmetic Coding and the Move-To-Front method: a
study of two data compression schemes",
type = "{M.S.} thesis",
school = "University of Louisville",
address = "Louisville, KY, USA",
pages = "167",
year = "1989",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303725202",
acknowledgement = ack-nhfb,
advisor = "Ahmed H. Desoky",
classification = "0984: Computer science",
dissertation-thesis-number = "1337737",
subject = "Computer science",
}
@Article{Klein:1989:STR,
author = "Shmuel T. Klein and Abraham Bookstein and Scott
Deerwester",
title = "Storing Text Retrieval Systems on {CD-ROM}.
Compression and Encryption Considerations",
journal = j-TOIS,
volume = "7",
number = "3",
pages = "230--245",
month = jul,
year = "1989",
CODEN = "ATISET",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://liinwww.ira.uka.de/bibliography/Database/Graefe.html;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
note = "Special Issue on Research and Development in
Information Retrieval.",
URL = "http://www.acm.org:80",
abstract = "The emergence of the CD-ROM as a storage medium for
full-text databases raises the question of the maximum
size database that can be contained by this medium. As
an example, the problem of storing the Tr{\'e}sor de la
Langue Fran{\c{c}}aise on a CD-ROM is examined.
Pertinent approaches to compression of the various
files are reviewed, and the compression of the text is
related to the problem of data encryption:
Specifically, it is shown that, under simple models of
text generation, Huffman encoding produces a bit-string
indistinguishable from a representation of coin
flips.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Chicago",
affiliationaddress = "Chicago, IL, USA",
classification = "723; 741; 903",
conference = "SIGIR Conference on Research and Development in
Information Retrieval",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Algorithms; Arts and humanities; Bit-maps; cd-rom;
CD-ROM; Coding and information theory; Computer
applications; Cryptography; Data; Data Encryption; Data
encryption; Data Encryption; Data Storage; Data
Storage, Optical; Full-Text Storage; Full-text storage;
Huffman Coding; Huffman coding; Inf. storage and
retrieval; Information Retrieval Systems --- Database
Systems; Information storage; Information Theory ---
Data Compression; Optical; Security; Storage Devices;
Text Retrieval Systems",
meetingaddress = "Cambridge, MA, USA",
meetingdate = "Jun 1989",
meetingdate2 = "06/89",
wwwtitle = "String Text Retrieval Systems on {CD-ROM}: Compression
and Encryption Considerations",
}
@TechReport{Kordes:1989:UMC,
author = "F. L. G. Kordes and J. J. Schuurman",
title = "The use of {MEBAS} in creating a simulation
environment for compression and encryption",
type = "Report",
number = "NLR TP 89130 U",
institution = "National Lucht-en Ruimtevaartlaboratorium",
address = "Amsterdam, The Netherlands",
pages = "69",
year = "1989",
bibdate = "Mon Oct 19 08:47:56 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
annote = "Cover title.",
keywords = "Algorithms --- Testing; Computer simulation ---
Testing; Data compression (Computer science)",
}
@InProceedings{Loeffler:1989:PFD,
author = "C. Loeffler and A. Ligtenberg and G. Moschytz",
booktitle = "Proceedings of the International Conference on
Acoustics, Speech, and Signal Processing (ICASSP '89)",
title = "Practical Fast {$1$-D DCT} Algorithms with $ 11$
Multiplications",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "988--991",
year = "1989",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Loeffler, C.,~A. Ligtenberg, and G. Moschytz (1989)
``Practical Fast 1-D DCT Algorithms with 11
Multiplications,'' {\it Proceedings of the
International Conference on Acoustics, Speech, and
Signal Processing (ICASSP '89)}, pp. 988--991.",
}
@Article{Makinen:1989:ITA,
author = "E. M{\"a}kinen",
title = "On implementing two adaptive data-compression
schemes",
journal = j-COMP-J,
volume = "32",
number = "3",
pages = "238--240",
month = jun,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.3.238",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/32/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/32/3/238.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/238.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/239.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/240.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Tampere Univ., Finland",
classcodes = "C6130 (Data handling techniques); C1260 (Information
theory)",
classification = "C1260 (Information theory); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compression methods; data compression; efficiency;
Efficiency; encoding; errors; Errors; interval coding;
Interval coding; locally adaptive data; Locally
adaptive data compression methods; transpose coding;
Transpose coding",
thesaurus = "Data compression; Encoding; Errors",
treatment = "P Practical",
}
@Article{Mallat:1989:TMS,
author = "Stephane Mallat",
title = "A Theory for Multiresolution Signal Decomposition: The
Wavelet Representation",
journal = j-IEEE-TRANS-PATT-ANAL-MACH-INTEL,
volume = "11",
number = "7",
pages = "674--693",
month = jul,
year = "1989",
CODEN = "ITPIDJ",
DOI = "https://doi.org/10.1109/34.192463",
ISSN = "0162-8828",
ISSN-L = "0162-8828",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=34",
rawdata = "Mallat, Stephane (1989) ``A Theory for Multiresolution
Signal Decomposition: The Wavelet Representation,''
{\it IEEE Transactions on Pattern Analysis and Machine
Intelligence}, {\bf11}(7):674--693, July.",
}
@Article{Nelson:1989:LDC,
author = "Mark R. Nelson",
title = "{LZW} data compression",
journal = j-DDJ,
volume = "14",
number = "10",
pages = "29, 32, 34, 36, 86--87",
month = oct,
year = "1989",
CODEN = "DDJOEB",
ISSN = "0888-3076",
bibdate = "Tue Sep 10 09:26:18 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Greenleaf Software Inc., Dallas, TX, USA",
classification = "C5260 (Digital signal processing); C6110 (Systems
analysis and programming); C6130D (Document processing
techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "12-Bit codes; All-purpose data compression technique;
C; Character strings; Decompression; Implementation;
Lempel--Ziv--Welch; LZW algorithm; LZW data
compression; New string; Portability; Program runs;
Single codes; Standard character set",
thesaurus = "C listings; Character sets; Computerised signal
processing; Data compression; Programming; Word
processing",
}
@Misc{Perkins:1989:RPP,
author = "D. Perkins",
title = "{RFC 1134}: Point-to-Point Protocol: a proposal for
multi-protocol transmission of datagrams over
Point-to-Point links",
day = "1",
month = nov,
year = "1989",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1171 \cite{Perkins:1990:RPPa}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1134.txt;
ftp://ftp.internic.net/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1134.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt",
acknowledgement = ack-nhfb,
format = "TXT=87352 bytes",
obsoletedby = "Obsoleted by RFC1171 \cite{Perkins:1990:RPPa}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@Article{Samples:1989:MNL,
author = "A. D. Samples",
title = "{Mache}: no-loss trace compaction",
journal = j-SIGMETRICS,
volume = "17",
number = "1",
pages = "89--97",
month = may,
year = "1989",
CODEN = "????",
DOI = "https://doi.org/10.1145/75372.75382",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 11:08:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Execution traces can be significantly compressed using
their referencing locality. A simple observation leads
to a technique capable of compressing execution traces
by an order of magnitude; instruction-only traces are
compressed by two orders of magnitude. This technique
is unlike previously reported trace compression
techniques in that it compresses without loss of
information and, therefore, does not affect
trace-driven simulation time or accuracy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@PhdThesis{Sandman:1989:EPA,
author = "Aubrey Max Sandman",
title = "Errors --- a Positive Approach (Polynomial Data
Compression)",
type = "{Ph.D.} thesis",
school = "The City University",
address = "London, UK",
pages = "187",
year = "1989",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303820371",
acknowledgement = ack-nhfb,
classification = "0790: Systems design",
dissertation-thesis-number = "DX92220",
subject = "Systems design",
}
@PhdThesis{Thede:1989:HID,
author = "Leslie D. Thede",
title = "A Hybrid Image Data Compression Scheme Using
Quaternary Decomposition and Vector Quantization of
{DCT} Coefficients",
type = "{Ph.D.} thesis",
school = "The University of Toledo",
address = "Toledo, OH, USA",
pages = "244",
year = "1989",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303826006",
acknowledgement = ack-nhfb,
advisor = "S. C. Kwatra",
classification = "0544: Electrical engineering; 0790: Systems design;
0984: Computer science",
dissertation-thesis-number = "9015896",
subject = "Electrical engineering; Systems design; Computer
science",
}
@Article{Tinker:1989:DPI,
author = "Michael Tinker",
title = "{DVI} parallel image compression",
journal = j-CACM,
volume = "32",
number = "7",
pages = "844--851",
month = jul,
year = "1989",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/65445.65451",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/65451.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; image compression",
review = "ACM CR 8912-0908",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding). {\bf I.4.1}:
Computing Methodologies, IMAGE PROCESSING,
Digitization. {\bf C.1.2}: Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors), Parallel
processors.",
}
@PhdThesis{Todd:1989:IDC,
author = "Martin Peter Todd",
title = "Image Data Compression Based on a Multiresolution
Signal Model (Data Compression)",
type = "{Ph.D.} thesis",
school = "University of Warwick",
address = "Warwick, UK",
pages = "204",
year = "1989",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303789294",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "D-90766",
subject = "Computer science",
}
@Article{VanMaren:1989:MTC,
author = "David J. {Van Maren} and Mark J. Bianchi and Jeffery
J. Kato",
title = "Maximizing tape capacity by super-blocking",
journal = j-HEWLETT-PACKARD-J,
volume = "40",
number = "3",
pages = "32--34",
month = jun,
year = "1989",
CODEN = "HPJOAX",
ISSN = "0018-1153",
bibdate = "Tue Mar 25 14:12:15 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Interrecord gaps on the tape limit the capacity
improvement attainable with data compression in the HP
7980XC Tape Drive. Super-blocking eliminates most of
these gaps.",
abstract-2 = "Super-blocking is a proprietary Hewlett--Packard
method for maximizing half-inch tape data capacity.
This capacity improvement is achieved by the removal of
some of the interrecord gaps ordinarily placed between
host data records. It is performed in real time by the
firmware residing in the cache buffer of the HP 7980XC
tape drive. The authors describe how super-blocking
works.",
acknowledgement = ack-nhfb,
affiliationaddress = "USA",
classcodes = "C5320C (Storage on moving magnetic media)",
classification = "721; 722; C5320C (Storage on moving magnetic
media)",
fjournal = "Hewlett-Packard Journal: technical information from
the laboratories of Hewlett-Packard Company",
journalabr = "Hewlett Packard J",
keywords = "Data Storage, Magnetic; Firmware; firmware; half-inch;
Half-inch tape data capacity; Hewlett--Packard; HP
7980XC; HP 7980XC tape drive; Information Theory--Data
Compression; Interrecord Gaps; Interrecord gaps;
interrecord gaps; Magnetic Tape; magnetic tape storage;
Super-Blocking; Super-blocking; super-blocking; Tape;
Tape capacity; tape capacity; tape data capacity; Tape
Drive; tape drive",
thesaurus = "Magnetic tape storage",
treatment = "P Practical",
}
@Article{Vitter:1989:ADH,
author = "Jeffrey Scott Vitter",
title = "{Algorithm 673}: Dynamic {Huffman} Coding",
journal = j-TOMS,
volume = "15",
number = "2",
pages = "158--167",
month = jun,
year = "1989",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/63522.214390",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Sun Sep 04 22:47:58 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
note = "See remark \cite{Novoselsky:2016:RAD}.",
URL = "http://www.acm.org/pubs/citations/journals/toms/1989-15-2/p158-vitter/",
abstract = "We present a Pascal implementation of the one-pass
algorithm for constructing dynamic Huffman codes that
is described and analyzed in a companion paper. The
program runs in real time; that is, the processing time
for each letter of the message is proportional to the
length of its codeword. The number of bits used to
encode a message of $t$ letters is less than $t$ bits
more than that used by the well-known two-pass
algorithm. This is best possible for any one-pass
Huffman scheme. In practice, it uses fewer bits than
all other Huffman schemes. The algorithm has
applications in file compression and network
transmission.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
keywords = "algorithms; design; performance; theory",
subject = "{\bf C.2.0}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf E.1}: Data, DATA STRUCTURES,
Trees. {\bf E.4}: Data, CODING AND INFORMATION THEORY,
Data compaction and compression. {\bf E.4}: Data,
CODING AND INFORMATION THEORY, Nonsecret encoding
schemes. {\bf F.2.2}: Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
{\bf H.1.1}: Information Systems, MODELS AND
PRINCIPLES, Systems and Information Theory, Value of
information.",
}
@Article{Willems:1989:UDC,
author = "F. M. J. Willems",
title = "Universal Data Compression and Repetition Times",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-35",
number = "1",
pages = "54--58",
month = jan,
year = "1989",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.42176",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Willems, F. M. J. (1989) ``Universal Data Compression
and Repetition Times,'' {\it IEEE Transactions on
Information Theory}, {\bf IT-35}(1):54--58, January.",
}
@Article{Zurek:1989:TCC,
author = "Wojciech Zurek",
title = "Thermodynamic Cost of Computation, Algorithmic
Complexity, and the Information Metric",
journal = j-NATURE,
volume = "341",
number = "6238",
pages = "119--124",
day = "14",
month = sep,
year = "1989",
CODEN = "NATUAS",
DOI = "https://doi.org/10.1038/341119a0",
ISSN = "0028-0836 (print), 1476-4687 (electronic)",
ISSN-L = "0028-0836",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Nature",
journal-URL = "http://www.nature.com/nature/archive/",
rawdata = "Zurek, Wojciech (1989) ``Thermodynamic Cost of
Computation, Algorithmic Complexity, and the
Information Metric,''{\it Nature},
{\bf341}(6238):119--124, September 14.",
}
@InProceedings{Antonini:1990:ICU,
author = "Marc Antonini and Michel Barlaud and Pierre Mathieu
and Ingrid Daubechies",
booktitle = "International Conference on Acoustics, Speech, and
Signal Processing",
title = "Image coding using vector quantization in the wavelet
transform domain",
volume = "4",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "2297--2300",
month = apr,
year = "1990",
DOI = "https://doi.org/10.1109/icassp.1990.116036",
ISSN = "1520-6149 (print), 2379-190X (electronic)",
ISSN-L = "1520-6149",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
keywords = "data compression; encoding; Frequency domain analysis;
frequency domains; frequency-domain analysis; Humans;
image coding; Image coding; image compression;
multiresolution codebook; Noise shaping; noise-shaping
bit-allocation; picture processing; Pixel; progressive
transmission scheme; Psychology; psychovisual features;
pyramidal algorithm architecture; Rate-distortion;
scalar quantization; Shannon's rate-distortion theory;
vector quantization; Vector quantization; visual
perception; Wavelet coefficients; wavelet transform
domain; Wavelet transforms",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{Bailey:1990:PDC,
author = "R. L. Bailey and R. Mukkamala",
title = "Pipelining Data Compression Algorithms",
journal = j-COMP-J,
volume = "33",
number = "4",
pages = "308--313",
month = aug,
year = "1990",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/33.4.308",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:29 MST 2012",
bibsource = "Distributed/CCR.bib;
http://comjnl.oxfordjournals.org/content/33/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/33/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/308.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/309.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/310.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/311.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/312.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/313.tif",
acknowledgement = ack-nhfb,
affiliation = "UNISYS Defense Syst., Virginia Beach Oper., VA, USA",
classcodes = "B6140 (Signal processing and detection); C1260
(Information theory)",
classification = "B6140 (Signal processing and detection); C1260
(Information theory)",
corpsource = "UNISYS Defense Syst., Virginia Beach Oper., VA, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compression rates; Compression rates; data
compression; performance; Performance, Data
Compression; pipelining data compression algorithms;
Pipelining data compression algorithms",
thesaurus = "Data compression",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "R. L. Bailey and R. Mukkalama",
}
@Article{Baran:1990:PSG,
author = "N. Baran",
title = "Putting the Squeeze on Graphics: Compression
technologies for full-color graphics and full-motion
video",
journal = j-BYTE,
volume = "15",
number = "13",
pages = "289--290, 292--294",
month = dec,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C6130B (Graphics techniques)",
fjournal = "BYTE Magazine",
keywords = "Dedicated processors; Image compression;
Image-compression processors; Standards; System
boards",
thesaurus = "Computer graphic equipment; Computer graphics;
Computerised picture processing",
}
@MastersThesis{Barsimantov:1990:DC,
author = "Elie Oscar Barsimantov",
title = "Data compression",
type = "Thesis {(M.S.)}",
school = "University of Colorado",
address = "Boulder, CO, USA",
pages = "132 leaves",
year = "1990",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication)",
}
@Book{Bell:1990:TC,
author = "Timothy C. Bell and John G. Cleary and Ian H. Witten",
title = "Text Compression",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Bell, Timothy C., John J. Cleary, and Ian Hugh Witten
(1990) {\it Text Compression}, Prentice-Hall, Englewood
Cliffs, N.J.",
rawdata-2 = "Bell, Timothy C., John G. Cleary, and Ian H. Witten
(1990) {\it Text Compression}, Englewood Cliffs,
Prentice Hall.",
}
@Article{Berger:1990:OEB,
author = "T. Berger and R. Yeung",
title = "Optimum `1'-Ended Binary Prefix Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "36",
number = "6",
pages = "1435--1441",
month = nov,
year = "1990",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.59940",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Berger, T. and R. Yeung (1990) ``Optimum `1'-Ended
Binary Prefix Codes,'' {\it IEEE Transactions on
Information Theory}, {\bf36}(6):1435--1441, November.",
}
@Article{Bookstein:1990:CIT,
author = "Abraham Bookstein and Shmuel T. Klein",
title = "Compression, Information Theory, and Grammars: a
Unified Approach",
journal = j-TOIS,
volume = "8",
number = "1",
pages = "27--49",
month = jan,
year = "1990",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/78915.78917",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://liinwww.ira.uka.de/bibliography/Database/Graefe.html;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80",
abstract = "We propose the notion of a formal grammar as a
flexible model of text generation that encompasses most
of the models offered before as well as, in principle,
extending the possibility of compression to a much more
general class of languages. Assuming a general model of
text generation, a derivation is given of the well
known Shannon entropy formula, making possible a theory
of information based upon text representation rather
than on communication. The ideas are shown to apply to
a number of commonly used text models. Finally, we
focus on a Markov model of text generation, suggest an
information theoretic measure of similarity between two
probability distributions, and develop a clustering
algorithm based on this measure. This algorithm allows
us to cluster Markov states and thereby base our
compression algorithm on a smaller number of
probability distributions than would otherwise have
been required. A number of theoretical consequences of
this approach to compression are explored, and a
detailed example is given.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Chicago",
affiliationaddress = "Chicago, IL, USA",
classification = "721; 723; 922",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Algorithms; Artificial intelligence; Automata
Theory--Grammars; Codes; Coding and information theory;
Computer Programming--Algorithms; Data; Data compaction
and compression; Data Compression; Huffman coding;
Huffman Coding; Information storage; Information
storage and retrieval; Information theory; Information
Theory; Language Generation; Markov model of language
generation; Markov Models; Models and principles;
Natural language processing; Probability--Random
Processes; Symbolic--Encoding; Systems and information
theory; Theory",
}
@TechReport{Coifman:1990:SPC,
author = "Ronald R. Coifman and Yves Meyer and Stephen R. Quake
and Mladen Victor Wickerhauser",
title = "Signal Processing and Compression with Wavelet
Packets",
type = "Preprint",
institution = "Yale University",
address = "New Haven",
month = apr,
year = "1990",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/cmqw.tex",
}
@TechReport{Cushing:1990:DCA,
author = "John Aikin Cushing",
title = "Data compression algorithms for {English} text based
on word frequency",
volume = "109",
type = "Working paper",
institution = "Institute of Economic Research, Kobe University of
Commerce",
address = "Kobe, Japan",
pages = "57",
year = "1990",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Working paper",
acknowledgement = ack-nhfb,
}
@InProceedings{Feig:1990:DCT,
author = "Ephraim N. Feig and Elliot Linzer",
booktitle = "{Proceedings Electronic Imaging '90 East, Boston, MA,
USA}",
title = "Discrete Cosine Transform Algorithms for Image Data
Compression",
publisher = "????",
address = "????",
pages = "84--87",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Feig, E., and E. Linzer (1990) ``Discrete Cosine
Transform Algorithms for Image Data Compression,'' in
{\it Proceedings Electronic Imaging '90 East}, pp.
84--87, Boston, MA.",
rawdata-2 = "Feig, Ephraim N., and Elliot Linzer (1990) ``Discrete
Cosine Transform Algorithms for Image Data
Compression,'' {\it Proceedings Electronic Imaging '90
East}, pages 84--87, Boston, MA.",
}
@Article{Fraenkel:1990:BHC,
author = "Aviezri S. Fraenkel and Shmuel T. Klein",
title = "Bidirectional {Huffman} Coding",
journal = j-COMP-J,
volume = "33",
number = "4",
pages = "296--307",
month = aug,
year = "1990",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/33.4.296",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "94A29",
MRnumber = "92a:94005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Distributed/CCR.bib;
http://comjnl.oxfordjournals.org/content/33/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/33/4/296.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/296.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/297.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/298.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/299.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/300.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/301.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/302.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/303.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/304.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/305.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/306.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_04/tiff/307.tif",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci, Rehovot, Israel",
classcodes = "B6120B (Codes); C1260 (Information theory)",
classification = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci, Rehovot, Israel",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Affix property; affix property; bidirectional Huffman
coding; Data Compression, Bidirectional Huffman coding;
Decoding; decoding; encoding; Necessary conditions;
necessary conditions; Prefix; prefix; Suffix; suffix;
Worst case complexity; worst case complexity",
rawdata = "Fraenkel, Aviezri S. and Shmuel T. Klein (1990)
``Bidirectional Huffman Coding,'' {\it The Computer
Journal}, {\bf33}:296--307.",
reviewer = "Alexander M. Barg",
thesaurus = "Decoding; Encoding",
treatment = "P Practical; T Theoretical or Mathematical",
}
@InProceedings{Hawley:1990:POAa,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
crossref = "USENIX:1990:CSSa",
volume = "3",
number = "2",
pages = "289--330",
month = "Spring",
year = "1990",
bibdate = "Fri Oct 18 07:24:24 MDT 1996",
bibsource = "ftp://ftp.uu.net/library/bibliography;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "MIT Media Laboratory",
}
@Article{Hawley:1990:POAb,
author = "Michael Hawley",
title = "The Personal Orchestra, or Audio Data Compression by
10,000:1",
journal = j-COMP-SYS,
volume = "3",
number = "2",
pages = "289--329",
month = "Spring",
year = "1990",
CODEN = "CMSYE2",
ISSN = "0895-6340",
bibdate = "Fri Sep 13 08:53:14 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Media Lab., MIT, Cambridge, MA, USA",
classification = "B6450F (Sound synthesisers); C7820 (Humanities)",
fjournal = "Computing Systems",
keywords = "Analytical programs; Audio data compression;
Bosendorfer Imperial concert grand piano; Complex
scores; Computer disk; Music system; Musical research;
Personal orchestra; Synthesizers; Synthetic orchestra;
Totentanz; Western classical music; Workstation",
thesaurus = "Computer aided analysis; Electronic music; Music;
Personal computing",
}
@Article{Hirschberg:1990:EDP,
author = "Daniel S. Hirschberg and Debra A. Lelewer",
title = "Efficient Decoding of Prefix Codes",
journal = j-CACM,
volume = "33",
number = "4",
pages = "449--459",
month = apr,
year = "1990",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/77556.77566",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
note = "This is the first of four key papers behind the {\tt
bzip2} compression tools. The others are
\cite{Burrows:1994:BSL,Wheeler:1997:UBM,Sedgewick:1997:FAS}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/77566.html",
abstract = "A special case of the data compression problem is
presented, in which a powerful encoder transmits a
coded file to a decoder that has severely constrained
memory. A data structure that achieves minimum storage
is presented, and alternative methods that sacrifice a
small amount of storage to attain faster decoding are
described.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; bzip2; performance",
rawdata = "Hirschberg, D., and D. Lelewer (1990) ``Efficient
Decoding of Prefix Codes,'' {\it Communications of the
ACM}, {\bf33}(4):449--459.",
remark = "This is the first of four key papers behind the {\tt
bzip2} compression tools. The others are listed in the
{\tt bzip2} manual.",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1}: Data, DATA
STRUCTURES, Tables. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS. {\bf H.1.1}: Information Systems,
MODELS AND PRINCIPLES, Systems and Information Theory,
Information theory.",
}
@Misc{ITU-T:1990:RGK,
author = "{ITU-T}",
title = "Recommendation {G.726} (12/90): 40, 32, 24, 16 kbit/s
{Adaptive Differential Pulse Code Modulation (ADPCM)}",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-T (1990), Recommendation G.726 (12/90), {\it40,
32, 24, 16 kbit/s Adaptive Differential Pulse Code
Modulation (ADPCM)}.",
}
@Article{Jagadish:1990:CTM,
author = "H. V. Jagadish",
title = "A Compression Technique to Materialize Transitive
Closure",
journal = j-TODS,
volume = "15",
number = "4",
pages = "558--598",
month = dec,
year = "1990",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/99935.99944",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "1 093 244",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p558-jagadish/p558-jagadish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p558-jagadish/;
http://www.acm.org/pubs/toc/Abstracts/tods/99944.html",
abstract = "An important feature of database support for expert
systems is the ability of the database to answer
queries regarding the existence of a path from one node
to another in the directed graph underlying some
database relation. Given just the database relation,
answering such a query is time-consuming, but given the
transitive closure of the database relation a table
look-up suffices. We present an indexing scheme that
permits the storage of the pre-computed transitive
closure of a database relation in a compressed form.
The existence of a specified tuple in the closure can
be determined from this compressed store by a single
look-up followed by an index comparison. We show how to
add nodes and arcs to the compressed closure
incrementally. We also suggest how this compression
technique can be used to reduce the effort required to
compute the transitive closure.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab., Murray Hill, NJ, USA",
annote = "an indexing scheme that permits the storage of the
pre-computed transitive closure",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "performance; recursive query processing TODS,
algorithms",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.1}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Applications
and Expert Systems. {\bf I.2.8}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search.",
}
@Article{Karpovsky:1990:ORC,
author = "M. G. Karpovsky and P. Nagvajara",
title = "Optimal robust compression of test responses",
journal = j-IEEE-TRANS-COMPUT,
volume = "39",
number = "1",
pages = "138--141",
month = jan,
year = "1990",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.46290",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 7 14:19:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=46290",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kyle:1990:EIC,
author = "Jim Kyle",
title = "{ECOMP} Image Compression",
journal = j-COMP-LANG-MAG,
volume = "7",
number = "12",
pages = "78--??",
month = dec,
year = "1990",
CODEN = "COMLEF",
ISSN = "0749-2839",
bibdate = "Tue Jan 23 08:04:25 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Language Magazine",
}
@TechReport{Lamb:1990:CRT,
author = "D. A. Lamb and D. T. Barnard",
key = "Lamb \& Barnard",
title = "Compact Representation of Text Files",
institution = "Queen's University",
address = "Kingston, Ontario",
pages = "1--7",
month = mar,
year = "1990",
bibdate = "Tue Jun 12 15:38:29 1990",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
Misc/programming.env.bib",
abstract = "We describe a simple method of representing text files
as sequences of one-byte or two-byte codes; each code
represents a word, a control code, or a punctuation
mark. For our sample of English prose, this method
obtains compression similar to that of Lempel--Ziv (as
embodied in the UNIX compress utility). The
representation is suited for modern
what-you-see-is-what-you-get text formatting programs,
since it permits them to do some operations (such as
determining the width of a word in a particular font)
once per distinct word rather than at each occurrence
of a word.",
owner = "robyn",
}
@InProceedings{Mahoney:1990:GB,
author = "Michael S. Mahoney",
editor = "Charles Coulston Gillispie",
booktitle = "Dictionary of Scientific Biography",
title = "{Goldbach}'s Biography",
publisher = "Scribner's",
address = "New York, NY, USA",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "14 volumes, 1970--1990",
acknowledgement = ack-ds,
rawdata = "Mahoney, Michael S. (1990) ``Goldbach's Biography'' in
Charles Coulston Gillispie {\it Dictionary of
Scientific Biography}, New York, NY, Scribner's, 14
vols. 1970--1990.",
}
@Article{Marking:1990:DGI,
author = "Michael P. Marking",
title = "Decoding Group 3 Images",
journal = j-CUJ,
volume = "8",
number = "6",
pages = "45--54",
month = jun,
year = "1990",
ISSN = "0898-9788",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "C Users Journal",
rawdata = "Marking, Michael P. (1990) ``Decoding Group~3
Images,'' {\it The C Users Journal}, pp. 45--54,
June.",
}
@Article{Miastkowski:1990:MFG,
author = "S. Miastkowski",
title = "A `more filling' generation of tape backup",
journal = j-BYTE,
volume = "15",
number = "13",
pages = "235--237",
month = dec,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5310 (Storage system design); C5320C (Storage on
moving magnetic media)",
fjournal = "BYTE Magazine",
keywords = "250 MB; 300 MB; Colorado Memory Systems; Core
International; Coretape Light; Data compression; Jumbo
250; Tape backup",
numericalindex = "Memory size 2.6E+08 Byte; Memory size 3.1E+08 Byte",
thesaurus = "Magnetic tape storage; Storage units",
}
@Article{Moffat:1990:IPD,
author = "Alistair Moffat",
title = "Implementing the {PPM} Data Compression Scheme",
journal = j-IEEE-TRANS-COMM,
volume = "COM-38",
number = "11",
pages = "1917--1921",
month = nov,
year = "1990",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/26.61469",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
keywords = "prediction by partial matching (PPM) data compression
algorithm",
rawdata-1 = "Moffat, Alistair (1990) ``Implementing the PPM Data
Compression Scheme,'' {\it IEEE Transactions on
Communications}, {\bf COM-38}(11):1917--1921,
November.",
rawdata-2 = "Moffat, Alistair (1990) ``Implementing the PPM Data
Compression Scheme,'' {\it IEEE Transactions on
Communications} COM-38(11):1917--1921, November.",
}
@Article{Ornstein:1990:UAS,
author = "Donald S. Ornstein and Paul C. Shields",
title = "Universal Almost Sure Data Compression",
journal = j-ANN-PROBAB,
volume = "18",
number = "2",
pages = "441--452",
month = apr,
year = "1990",
CODEN = "APBYAE",
DOI = "https://doi.org/10.1214/aop/1176990840",
ISSN = "0091-1798 (print), 2168-894X (electronic)",
ISSN-L = "0091-1798",
bibdate = "Sun Apr 20 10:44:17 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/annprobab1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://projecteuclid.org/euclid.aop/1176990840",
acknowledgement = ack-nhfb,
fjournal = "Annals of Probability",
journal-URL = "http://projecteuclid.org/all/euclid.aop",
}
@Misc{Perkins:1990:RPPa,
author = "D. Perkins",
title = "{RFC 1171}: Point-to-Point Protocol for the
transmission of multi-protocol datagrams over
Point-to-Point links",
day = "1",
month = jul,
year = "1990",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.
Obsoletes RFC1134 \cite{Perkins:1989:RPP}. Status:
DRAFT STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1134.txt;
ftp://ftp.internic.net/rfc/rfc1171.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1134.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt",
acknowledgement = ack-nhfb,
format = "TXT=92321 bytes",
obsoletedby = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.",
obsoletes = "Obsoletes RFC1134 \cite{Perkins:1989:RPP}.",
online = "yes",
status = "DRAFT STANDARD",
}
@Misc{Perkins:1990:RPPb,
author = "D. Perkins and R. Hobby",
title = "{RFC 1172}: Point-to-Point Protocol ({PPP}) initial
configuration options",
day = "1",
month = jul,
year = "1990",
bibdate = "Fri Oct 17 17:20:11 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1172.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1172.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt",
acknowledgement = ack-nhfb,
format = "TXT=76132 bytes",
obsoletedby = "Obsoleted by RFC1331 \cite{Simpson:1992:RPP}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@Book{Prusinkiewicz:1990:ABP,
author = "P. Prusinkiewicz and A. Lindenmayer",
title = "The Algorithmic Beauty of Plants",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
}
@Article{Pylak:1990:EML,
author = "Pawe{\l} Pylak",
title = "Efficient Modification of {LZSS} Compression
Algorithm",
journal = "Annales UMCS Informatica, section AI",
pages = "61--72",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.annales.umcs.lublin.pl/AI/2003/07.pdf",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
remark = "Lublin, Poland",
}
@Book{Rao:1990:DCT,
author = "K. R. Rao and P. Yip",
title = "Discrete Cosine Transform---Algorithms, Advantages,
Applications",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rao, K. R., and P. Yip (1990) {\it Discrete Cosine
Transform---Algorithms, Advantages, Applications},
London, Academic Press.",
}
@Article{Regan:1990:LRS,
author = "Shawn M. Regan",
title = "{LZW} revisited (speeding up data compression)",
journal = j-DDJ,
volume = "15",
number = "6",
pages = "126--127, 167",
month = jun,
year = "1990",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:26:18 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Shawn enhances this popular data compression
algorithm.",
acknowledgement = ack-nhfb,
affiliation = "MicroBilt Inc., Atlanta, GA, USA",
classification = "C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "9-Bit codes; Code size; Compression program;
Compression ratio; Execution speed; Expansion programs;
LZW data compression algorithm; String table; Table
clearing",
thesaurus = "C listings; Data compression",
}
@Misc{Rokicki:1990:GV,
author = "Tomas Rokicki",
title = "{GFtoPK}, v. 2.3",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://tug.org/texlive/devsrc/Build/source/texk/web2c/gftopk.web",
acknowledgement = ack-ds,
rawdata = "Rokicki, Tomas (1990) ``GFtoPK, v. 2.3,'' available
at\hfil\break
|http://tug.org/texlive/devsrc/Build/source/texk/web2c/gftopk.web|.",
}
@Book{Samet:1990:ASD,
author = "Hanan Samet",
title = "Applications of Spatial Data Structures: Computer
Graphics, Image Processing, and {GIS}",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Samet, Hanan (1990a) {\it Applications of Spatial Data
Structures: Computer Graphics, Image Processing, and
GIS}, Reading, MA, Addison-Wesley.",
}
@Book{Samet:1990:DAS,
author = "Hanan Samet",
title = "The Design and Analysis of Spatial Data Structures",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Samet, Hanan (1990b) {\it The Design and Analysis of
Spatial Data Structures}, Reading, MA,
Addison-Wesley.",
}
@Article{Searfoss:1990:BBD,
author = "Glenn Searfoss",
title = "Bounding Box Data Compression",
journal = j-DDJ,
volume = "15",
number = "4",
pages = "56--64, 108",
month = apr,
year = "1990",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:12:37 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "The ``bounding box'' method of data compression is
fast and efficient for bit-mapped data. Glenn describes
this technique and compares it to the better-known
RLE.",
acknowledgement = ack-nhfb,
affiliation = "Data Transforms Inc., Denver, CO, USA",
classification = "C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bit-mapped data; Bounding box method; C program
listings; Data compression; RLE; Run length bit
encoding",
thesaurus = "C listings; Data compression",
}
@Article{Shepard:1990:DCM,
author = "Ron Shepard",
title = "A data compression method applicable to first-order
convergent iterative procedures",
journal = j-J-COMPUT-CHEM,
volume = "11",
number = "1",
pages = "45--57",
month = jan,
year = "1990",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.540110105",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:09 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "7 Sep 2004",
}
@InProceedings{Sierpinski:1990:NCQ,
author = "W. Sierpi{\'n}ski",
editor = "John Woods",
booktitle = "Subband Coding",
title = "Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire
Plaine,'' {{\it Bull. Acad. Sci. Cracovie}}, {{\bf
Serie A}}:462--478. {Simoncelli, Eero P., and Edward.
H. Adelson (1990) ``Subband Transforms''}",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "143--192",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprint of \cite{Sierpinski:1912:CQR}.",
acknowledgement = ack-ds,
rawdata = "Sierpi\'nski, W. (1912) ``Sur Une Nouvelle Courbe Qui
Remplit Toute Une Aire Plaine,'' {\it Bull. Acad. Sci.
Cracovie}, {\bf Serie~A}:462--478. Simoncelli, Eero P.,
and Edward. H. Adelson (1990) ``Subband Transforms,''
{\it Subband Coding}, John Woods, ed., Boston, MA,
Kluwer Academic Press, pp. 143--192.",
}
@InProceedings{Simoncelli:1990:ST,
author = "Eero P. Simoncelli and Edward. H. Adelson",
editor = "John Woods",
booktitle = "Subband Coding",
title = "Subband Transforms",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "143--192",
year = "1990",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Simoncelli, Eero P., and Edward. H. Adelson (1990)
``Subband Transforms,'' in Woods, John, editor, {\it
Subband Coding}, Boston, Kluwer Academic Press,
143--192.",
}
@MastersThesis{Tong:1990:DCS,
author = "Tak Yen Tong",
title = "Diversity and coding in spread spectrum systems",
school = "University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "1",
year = "1990",
ISBN = "0-315-57908-0",
ISBN-13 = "978-0-315-57908-8",
LCCN = "????",
bibdate = "Tue Jan 29 10:44:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303906263",
acknowledgement = ack-nhfb,
classification = "0537: Engineering",
dissertation-thesis-number = "ML57908",
subject = "Engineering",
}
@Article{Vaughan-Nichols:1990:GYBb,
author = "S. J. Vaughan-Nichols",
title = "Getting Your Byte's Worth: Hardware-based data
compression gives you more bang for your {QIC}, {DAT},
and hard disk buck",
journal = j-BYTE,
volume = "15",
number = "12",
pages = "331--332, 334--336",
month = nov,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 18:39:30 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Bendix Field Eng. Corp., Seabrook, MD, USA",
classification = "B1265B (Logic circuits); B3120B (Magnetic recording
); B6120B (Codes); C5120 (Logic and switching
circuits); C5320C (Storage on moving magnetic media);
C6130 (Data handling techniques)",
fjournal = "BYTE Magazine",
keywords = "DAT; Data compression chips; Digital audio tape; Hard
discs; QIC; Quarter inch tape; Tape drive controllers",
thesaurus = "Application specific integrated circuits; Data
compression; Digital audio tape; Magnetic tape
storage",
}
@Article{Vaughan-Nichols:1990:SSW,
author = "S. J. Vaughan-Nichols",
title = "Saving Space: Whatever size hard disk you have, it's
probably nearly full. Data compression can help",
journal = j-BYTE,
volume = "15",
number = "3",
pages = "237--238, 240, 242--243",
month = mar,
year = "1990",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Thu Sep 12 17:47:21 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5320C (Storage on moving magnetic media); C6120
(File organisation)",
fjournal = "BYTE Magazine",
keywords = "Data compression; Floppy disks; Hard disk; Storage
space",
thesaurus = "Data compression; Hard discs; Storage management",
}
@PhdThesis{Weiss:1990:SRI,
author = "Peter Weiss",
title = "Size reduction of inverted files using data
compression and data structure reorganization",
type = "{D.Sc.} thesis",
school = "The George Washington University",
address = "Washington, DC, USA",
pages = "174",
year = "1990",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303869016",
acknowledgement = ack-nhfb,
advisor = "Arnold C. Meltzer",
classification = "0984: Computer science",
dissertation-thesis-number = "9113770",
subject = "Computer science",
}
@TechReport{Wickerhauser:1990:PCB,
author = "Mladen Victor Wickerhauser",
title = "Picture Compression by Best-Basis Sub-Band Coding",
type = "Preprint",
institution = "Yale University",
year = "1990",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/pic.tar",
}
@PhdThesis{Zhang:1990:JID,
author = "Manyun Zhang",
title = "The {JPEG} and Image Data Compression Algorithms",
school = "????",
address = "????",
pages = "??",
year = "1990",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Zhang, Manyun (1990) {\it The JPEG and Image Data
Compression Algorithms} (dissertation).",
remark = "Not in Proquest Dissertations \& Theses (PQDT)
database.",
}
@InProceedings{Anderson:1991:VHS,
author = "R. Anderson and J. Bowers and W.-C. Fang and D.
Johnson and J.-J. Lee and R. Nixon",
title = "A very high speed noiseless data compression chip for
space imaging applications",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213299",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213299",
acknowledgement = ack-nhfb,
}
@Article{Ang:1991:VCM,
author = "P. H. Ang and P. A. Ruetz and D. Auld",
title = "Video compression makes big gains",
journal = j-IEEE-SPECTRUM,
volume = "28",
number = "10",
pages = "16--19",
month = oct,
year = "1991",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.90209",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 16:15:28 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bandwidth; broadcasting; CCITT; CCITT Recommendation
H.261; communication; computing; data compression;
Digital audio broadcasting; digital integrated
circuits; digital storage media; Digital video
broadcasting; digital video standards; full-motion
compression; HDTV; High definition video; Humans; IC
chips; Image coding; Image storage; Joint Photographic
Experts Group; monolithic integrated circuits; Moving
Pictures Experts Group; picture processing; Signal
resolution; standards; teleconferencing; Video
compression; video compression; video equipment; video
signals; video teleconferencing",
}
@Article{Anonymous:1991:DDC,
author = "Anonymous",
title = "The {DDJ} Data Compression Contest",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "52--??",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:15:28 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Here's your chance to prove that your favorite
compression technique is better than that of your
fellow programmers.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Apiki:1991:LDC,
author = "Steve Apiki",
title = "Lossless Data Compression: An explanation of two
compression algorithms",
journal = j-BYTE,
volume = "16",
number = "3",
pages = "309--312, 314, 386--387",
month = mar,
year = "1991",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
fjournal = "BYTE Magazine",
keywords = "Compression algorithms; Data compression; Huffman
coding; Lossless compression; LZW coding",
thesaurus = "Data compression; Encoding",
}
@InProceedings{Bassiouni:1991:EIC,
author = "M. Bassiouni and A. Mukherjee and N. Tzannes",
title = "Experiments on improving the compression of special
data types",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213328",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213328",
acknowledgement = ack-nhfb,
}
@InProceedings{Basu:1991:TCU,
author = "D. Basu",
title = "Text compression using several {Huffman} trees",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213309",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213309",
acknowledgement = ack-nhfb,
}
@InProceedings{Blitstein:1991:DIM,
author = "R. Blitstein",
title = "A design to increase media-independent data integrity
and availability through the use of robotic media
management systems",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213332",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213332",
acknowledgement = ack-nhfb,
}
@InProceedings{Bodlaender:1991:CAM,
author = "H. Bodlaender and T. Gonzalez and T. Kloks",
title = "Complexity aspects of map compression",
crossref = "Storer:1991:DDC",
pages = "287--296",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213352",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213352",
acknowledgement = ack-nhfb,
}
@InProceedings{Bookstein:1991:FCB,
author = "A. Bookstein and S. T. Klein",
title = "Flexible compression for bitmap sets",
crossref = "Storer:1991:DDC",
pages = "402--410",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213340",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213340",
acknowledgement = ack-nhfb,
}
@Article{Boyd:1991:ESD,
author = "Colin Boyd",
title = "Enhancing Secrecy by Data Compression: Theoretical and
Practical Aspects",
journal = j-LECT-NOTES-COMP-SCI,
volume = "547",
pages = "266--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Feb 4 12:02:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470266.htm;
http://link.springer-ny.com/link/service/series/0558/papers/0547/05470266.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bridges:1991:DIC,
author = "John Bridges",
title = "Differential image compression",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "38, 40--42, 44, 46, 48, 51",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:11:02 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "DFF keeps track of the differences between images
rather than the images themselves.",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information and image processing);
C5260B (Computer vision and picture processing); C6130
(Data handling techniques); C7820 (Humanities)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Animated sequences; DFF algorithm; Differential image
compression; Display memory; Frame differences;
Real-time decoding; Space savings performance",
thesaurus = "Cinematography; Computer animation; Computerised
picture processing; Data compression",
}
@Article{Cate:1991:CCCa,
author = "Vincent Cate and Thomas Gross",
title = "Combining the concepts of compression and caching for
a two-level filesystem",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/106974.106993",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}
@Article{Cate:1991:CCCb,
author = "Vincent Cate and Thomas Gross",
title = "Combining the concepts of compression and caching for
a two-level filesystem",
journal = j-COMP-ARCH-NEWS,
volume = "19",
number = "2",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/106975.106993",
ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@PhdThesis{Cespedes:1991:ACM,
author = "Ernesto Raul Cespedes",
title = "Adaptive compression of multisensor image data",
type = "{Ph.D.} thesis",
school = "Mississippi State University",
address = "Mississippi State, MS 39762, USA",
pages = "204",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303923204",
acknowledgement = ack-nhfb,
advisor = "John K. Owens",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9218185",
subject = "Electrical engineering",
}
@Article{Chang:1991:DCU,
author = "Daniel K. Chang",
title = "Data Compression Using Hierarchical Dictionaries",
journal = j-J-SYST-SOFTW,
volume = "15",
number = "3",
pages = "233--238",
month = jul,
year = "1991",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/0164-1212(91)90039-9",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Sep 8 09:22:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Chang:1991:ECC,
author = "M. Chang and G. G. {Langdon, Jr.}",
title = "Effect of coefficient coding on {JPEG} baseline image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213331",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213331",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:1991:EDC,
author = "D. K. Chang",
title = "Exact data compression using hierarchical
dictionaries",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213330",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213330",
acknowledgement = ack-nhfb,
}
@Article{Chang:1991:LOP,
author = "Chin-Chen Chang and Tzong-Chen Wu",
title = "A Letter-oriented Perfect Hashing Scheme Based upon
{Sparse} Table Compression",
journal = j-SPE,
volume = "21",
number = "1",
pages = "35--49",
month = jan,
year = "1991",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380210104",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Chang:1991:UDCa,
author = "S.-Y. Chang and J. J. Metzner",
title = "Universal data compression algorithms by using full
tree models",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213303",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213303",
acknowledgement = ack-nhfb,
}
@PhdThesis{Chang:1991:UDCb,
author = "Soo-Young Chang",
title = "Universal data compression by using tree models",
type = "{Ph.D.} thesis",
school = "The Pennsylvania State University",
address = "University Park, PA, USA",
pages = "166",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303950372",
acknowledgement = ack-nhfb,
advisor = "John J. Metzner",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9127305",
subject = "Electrical engineering",
}
@InProceedings{Chau:1991:SCB,
author = "W. K. Chau and S. K. M. Wong and X. D. Yang and S. J.
Wan",
title = "On the selection of color basis for image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213320",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213320",
acknowledgement = ack-nhfb,
}
@PhdThesis{Chen:1991:EDC,
author = "Ji Chen",
title = "The effect of data compression on image quality in
high-resolution digital chest radiography",
type = "{Ph.D.} thesis",
school = "University of Michigan",
address = "Ann Arbot, MI, USA",
pages = "216",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303978189",
acknowledgement = ack-nhfb,
advisor = "Janice M. Jenkins and Michael J. Flynn",
classification = "0541: Biomedical research; 0544: Electrical
engineering; 0574: Radiology",
dissertation-thesis-number = "9135566",
subject = "Electrical engineering; Radiology; Biomedical
research",
}
@InProceedings{Chen:1991:IHI,
author = "K. Chen and T. V. Ramabadran",
title = "An improved hierarchical interpolation ({HINT}) method
for the reversible compression of grayscale images",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213325",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213325",
acknowledgement = ack-nhfb,
}
@InProceedings{Chevion:1991:HEM,
author = "D. Chevion and E. D. Karnin and E. Walach",
title = "High efficiency, multiplication free approximation of
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "43--52",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213372",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213372",
acknowledgement = ack-nhfb,
}
@InProceedings{Chou:1991:UMP,
author = "W.-K. Chou and D. Y. Y. Yun",
title = "A uniform model for parallel {Fast Fourier Transform
(FFT)} and {Fast Discrete Cosine Transform (FDCT)}",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213304",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213304",
acknowledgement = ack-nhfb,
}
@InProceedings{Cosman:1991:CVQ,
author = "P. C. Cosman and R. M. Gray and E. A. Riskin",
title = "Combining vector quantization and histogram
equalization",
crossref = "Storer:1991:DDC",
pages = "113--118",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213378",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213378",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1991:UFG,
author = "K. {Culik II} and S. Dube",
title = "Using fractal geometry for image compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213302",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213302",
acknowledgement = ack-nhfb,
}
@InProceedings{Desoky:1991:PAV,
author = "A. Desoky and Y. You",
title = "Performance analysis of a vector quantization
algorithm of image data",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213318",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213318",
acknowledgement = ack-nhfb,
}
@InProceedings{DeVore:1991:DCU,
author = "R. A. DeVore and B. Jawerth and B. J. Lucier",
title = "Data compression using wavelets: error, smoothness and
quantization",
crossref = "Storer:1991:DDC",
pages = "186--195",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213386",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213386",
acknowledgement = ack-nhfb,
}
@InProceedings{Dozier:1991:OED,
author = "J. Dozier",
title = "Overview of the {EOS} Data and Information System",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213295",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213295",
acknowledgement = ack-nhfb,
}
@Book{ECMA-151,
author = "{ECMA}",
title = "{ECMA-151}: Data Compression for Information
Interchange --- Adaptive Coding with Embedded
Dictionary --- {DCLZ} Algorithm",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "1991",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-151.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-151",
}
@Book{ECMA-159,
author = "{ECMA}",
title = "{ECMA-159}: Data Compression for Information
Interchange --- Binary Arithmetic Coding Algorithm",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = dec,
year = "1991",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-159.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-159",
}
@InProceedings{Elliott:1991:CTD,
author = "J. A. Elliott and P. M. Grant and G. G. Sexton",
title = "Concurrent techniques for developing motion video
compression algorithms",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213335",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213335",
acknowledgement = ack-nhfb,
}
@InProceedings{Fang:1991:NNB,
author = "W. C. Fang and B. J. Sheu and O. T.-C. Chen",
title = "A neural network based {VLSI} vector quantizer for
real-time image compression",
crossref = "Storer:1991:DDC",
pages = "342--351",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213346",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213346",
acknowledgement = ack-nhfb,
}
@InProceedings{Fischer:1991:ECT,
author = "T. R. Fischer and M. Wang",
title = "Entropy-constrained trellis coded quantization",
crossref = "Storer:1991:DDC",
pages = "103--112",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213377",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213377",
acknowledgement = ack-nhfb,
}
@Article{Fox:1991:OPM,
author = "Edward A. Fox and Qi Fan Chen and Amjad M. Daoud and
Lenwood S. Heath",
title = "Order Preserving Minimal Perfect Hash Functions and
Information Retrieval",
journal = j-TOIS,
volume = "9",
number = "3",
pages = "281--308",
month = jul,
year = "1991",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/125187.125200",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
note = "Special Issue on Research and Development in
Information Retrieval.",
URL = "http://www.acm.org:80",
abstract = "Rapid access to information is essential for a wide
variety of retrieval systems and applications. Hashing
has long been used when the fastest possible direct
search is desired, but is generally not appropriate
when sequential or range searches are also required.
This paper describes a hashing method, developed for
collections that are relatively static, that supports
both direct and sequential access. The algorithms
described give hash functions that are optimal in terms
of time and hash table space utilization, and that
preserve any a priori ordering desired. Furthermore,
the resulting order-preserving minimal perfect hash
functions (OPMPHFs) can be found using time and space
that are linear in the number of keys involved; this is
close to optimal.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "Access methods; Algorithms; Content analysis and
indexing; Data; Data storage representations; Database
management; Dictionary structure; Experimentation; File
organization; Hash table representations; Indexing;
Indexing methods; Information storage; Information
storage and retrieval; Inverted file structures;
Minimal perfect hashing; Perfect hashing; Physical
design; Random graph; TOOIS TOIS Data",
rawdata = "Fox, E. A., et al. (1991) ``Order Preserving Minimal
Perfect Hash Functions and Information Retrieval,''
{\it ACM Transactions on Information Systems},
{\bf9}(2):281--308.",
}
@InProceedings{Freeman:1991:ACD,
author = "G. H. Freeman",
title = "Asymptotic Convergence of Dual-Tree Entropy Codes",
crossref = "Storer:1991:DDC",
pages = "208--217",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213360",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213360",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Freeman, G. H. (1991) ``Asymptotic Convergence of
Dual-Tree Entropy Codes,'' {\it Proceedings of the Data
Compression Conference (DCC '91)}, pp. 208--217.",
}
@InProceedings{Frost:1991:DPR,
author = "R. L. Frost and C. F. Barnes and F. Xu",
title = "Design and performance of residual quantizers",
crossref = "Storer:1991:DDC",
pages = "129--138",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213380",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213380",
acknowledgement = ack-nhfb,
}
@PhdThesis{Gadallah:1991:DCT,
author = "M. E. Gadallah",
title = "Data Compression Techniques for Isolated and Connected
Word Recognition (Speech Signals, Template Matching)",
type = "{Ph.D.} thesis",
school = "Cranfield University",
address = "Cranfield, Bedfordshire MK43 0AL, UK",
pages = "301",
year = "1991",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303965529",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0800: Artificial
intelligence; 0984: Computer science",
dissertation-thesis-number = "DX94719",
subject = "Computer science; Electrical engineering; Artificial
intelligence",
}
@InProceedings{Gerencser:1991:APS,
author = "L. Gerencser",
title = "Asymptotics of predictive stochastic complexity",
crossref = "Storer:1991:DDC",
pages = "228--238",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213358",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213358",
acknowledgement = ack-nhfb,
}
@InProceedings{Gertner:1991:GSM,
author = "I. Gertner and Y. Y. Zeevi",
title = "Generalized scanning and multiresolution image
compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213327",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213327",
acknowledgement = ack-nhfb,
}
@PhdThesis{Goodman:1991:TPI,
author = "Stephen Darrow Goodman",
title = "Temporal pattern identification in a self-organizing
neural network with an application to data
compression",
type = "{Ph.D.} thesis",
school = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "209",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303954063",
acknowledgement = ack-nhfb,
advisor = "Martin A. Brooke",
classification = "0544: Electrical engineering; 0800: Artificial
intelligence",
dissertation-thesis-number = "9206076",
subject = "Electrical engineering; Artificial intelligence",
}
@InProceedings{Gray:1991:IC,
author = "R. M. Gray",
title = "Image compression",
crossref = "Storer:1991:DDC",
pages = "474--475",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213293",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213293",
acknowledgement = ack-nhfb,
}
@Book{Held:1991:DCT,
author = "Gilbert Held and Thomas (Thomas R.) Marshall",
title = "Data compression: techniques and applications:
hardware and software considerations",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Third",
pages = "xi + 301",
year = "1991",
ISBN = "0-471-92941-7",
ISBN-13 = "978-0-471-92941-3",
LCCN = "QA76.9.D33 H44 1991",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
}
@InProceedings{Horspool:1991:IL,
author = "N. R. Horspool",
editor = "James A. Storer",
booktitle = "Proceedings of the 1991 Data Compression Conference",
title = "Improving {LZW}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "332--341",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Horspool, N. R. (1991) ``Improving LZW,'' {\it
Proceedings of the 1991 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp~.332--341.",
}
@InProceedings{Horspool:1991:ILD,
author = "R. N. Horspool",
title = "Improving {LZW} [data compression algorithm]",
crossref = "Storer:1991:DDC",
pages = "332--341",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213347",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213347",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1991:AAC,
author = "P. G. Howard and J. S. Vitter",
title = "Analysis of arithmetic coding for data compression",
crossref = "Storer:1991:DDC",
pages = "3--12",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213368",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213368",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1991:NML,
author = "P. G. Howard and J. S. Vitter",
title = "New methods for lossless image compression using
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "257--266",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213355",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213355",
acknowledgement = ack-nhfb,
}
@PhdThesis{Huang:1991:MPI,
author = "Shih-Chi Huang",
title = "Multilayer perceptrons for image data compression and
speech recognition",
type = "{Ph.D.} thesis",
school = "University of Notre Dame",
address = "Notre Dame, IN, USA",
pages = "200",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303940741",
acknowledgement = ack-nhfb,
advisor = "Yih-Fang Huang",
classification = "0544: Electrical engineering; 0800: Artificial
intelligence; 0984: Computer science",
dissertation-thesis-number = "9210348",
subject = "Electrical engineering; Computer science; Artificial
intelligence",
}
@InProceedings{Indjic:1991:RPS,
author = "D. Indjic",
title = "Reduction in power system load data training sets size
using fractal approximation theory",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213315",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213315",
acknowledgement = ack-nhfb,
}
@InProceedings{Israelsen:1991:VIV,
author = "P. Israelsen",
title = "{VLSI} implementation of a vector quantization
processor",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213298",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213298",
acknowledgement = ack-nhfb,
}
@TechReport{ITU:1991:BAQ,
author = "{ITU/TG10}",
title = "Basic Audio Quality Requirements for Digital Audio
Bit-Rate Reduction Systems for Broadcast Emission and
Primary Distribution",
type = "{ITU-R} document",
number = "TG-10-2/3-E",
institution = "ITU",
address = "????",
pages = "??",
month = oct,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU/TG10 (1991) ITU-R document TG-10-2/3-E ``Basic
Audio Quality Requirements for Digital Audio Bit-Rate
Reduction Systems for Broadcast Emission and Primary
Distribution,'' 28 October.",
}
@InProceedings{Ivie:1991:TIC,
author = "E. L. Ivie and J. J. Ekstrom",
title = "Techniques for index compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213310",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213310",
acknowledgement = ack-nhfb,
}
@InProceedings{Jones:1991:PED,
author = "D. W. Jones",
title = "Practical evaluation of a data compression algorithm",
crossref = "Storer:1991:DDC",
pages = "372--381",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213343",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213343",
acknowledgement = ack-nhfb,
}
@Article{Jurgen:1991:CDH,
author = "R. K. Jurgen",
title = "The challenges of digital {HDTV}",
journal = j-IEEE-SPECTRUM,
volume = "28",
number = "4",
pages = "28--30",
month = apr,
year = "1991",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.76298",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Wed Jan 15 16:15:28 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Algorithm design and analysis; compression coding;
data compression; Degradation; digital communication
systems; digital HDTV; Digital systems; digital
transmission; encoding; FCC; HDTV; high definition
television; high-definition television; Instruments;
Motion compensation; motion compensation algorithms;
picture processing; System testing; television
broadcasting; terrestrial broadcast environment;
Transmitters; TV broadcasting",
}
@PhdThesis{Keshet:1991:NAT,
author = "Yehoshua Keshet",
title = "A new approach towards seismic data compression and
automated classification of seismic attributes, with
application to {East Africa} rift lakes data",
type = "{Ph.D.} thesis",
school = "Duke University",
address = "Durham, NC 27708, USA",
pages = "185",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303948606",
acknowledgement = ack-nhfb,
advisor = "Richard A. Strelitz",
classification = "0373: Geophysics; 0463: Statistics; 0984: Computer
science",
dissertation-thesis-number = "9127513",
subject = "Geophysics; Computer science; Statistics",
}
@InProceedings{Ko:1991:DDC,
author = "C. Ko and W. Chung",
title = "{$2$-D} discrete cosine transform array processor
using non-planar connections",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213305",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213305",
acknowledgement = ack-nhfb,
}
@InProceedings{Koch:1991:DCV,
author = "E. Koch and M. Sommer",
title = "Data compression in view of data sealing",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213334",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213334",
acknowledgement = ack-nhfb,
}
@Article{Kratzer:1991:NAD,
author = "K. P. Kratzer",
title = "A Neural Approach to Data Compression and
Classification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "541",
pages = "250--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Lagana:1991:ECD,
author = "M. R. Lagana and G. Turrini and G. Zanchi",
title = "Experiments on the compression of dictionary entries",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213329",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213329",
acknowledgement = ack-nhfb,
}
@InProceedings{Langdon:1991:PQC,
author = "G. G. {Langdon, Jr.}",
title = "Probabilistic and {Q}-Coder algorithms for binary
source adaptation",
crossref = "Storer:1991:DDC",
pages = "13--22",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213369",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213369",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:1991:DIC,
author = "H. Lee and Y. Kim and A. H. Rowberg and E. A. Riskin",
title = "{$3$-D} image compression for {X}-ray {CT} images
using displacement estimation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213308",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213308",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:1991:PDC,
author = "E. T. Lee",
title = "Pictorial data compression using array grammars",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213317",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213317",
acknowledgement = ack-nhfb,
}
@Article{LeGall:1991:MVC,
author = "Didier {Le Gall}",
title = "{MPEG}: a video compression standard for multimedia
applications",
journal = j-CACM,
volume = "34",
number = "4",
pages = "46--58",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103090",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1991.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/103090.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; packet video; standardization",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding), Approximate methods.
{\bf K.1}: Computing Milieux, THE COMPUTER INDUSTRY,
Standards. {\bf C.2.0}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, General, Data
communications. {\bf H.5.1}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, Multimedia
Information Systems.",
}
@PhdThesis{Lelewer:1991:DCM,
author = "Debra Ann Lelewer",
title = "Data compression on machines with limited memory",
type = "{Ph.D.} thesis",
school = "University of California, Irvine",
address = "Irvine, CA, USA",
pages = "99",
year = "1991",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303921041",
acknowledgement = ack-nhfb,
advisor = "Daniel S. Hirschberg",
classification = "0984: Computer science",
dissertation-thesis-number = "9120543",
subject = "Computer science",
}
@Article{Lelewer:1991:HCD,
author = "Debra A. Lelewer and Cheng Ng",
title = "An honors course in data compression",
journal = j-SIGCSE,
volume = "23",
number = "1",
pages = "146--150",
month = mar,
year = "1991",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/107005.107031",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 18:57:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Lelewer:1991:SCM,
author = "D. A. Lelewer and D. S. Hirschberg",
title = "Streamlining context models for data compression",
crossref = "Storer:1991:DDC",
pages = "313--322",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213349",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213349",
acknowledgement = ack-nhfb,
}
@InProceedings{Leung:1991:ICE,
author = "Wai-Hong Leung and S. S. Skiena",
title = "Inducing codes from examples",
crossref = "Storer:1991:DDC",
pages = "267--276",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213354",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213354",
acknowledgement = ack-nhfb,
}
@InProceedings{Lewis:1991:KVC,
author = "A. S. Lewis and G. Knowles",
title = "A {64 Kb/s} video codec using the {$2$-D} wavelet
transform",
crossref = "Storer:1991:DDC",
pages = "196--201",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213362",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213362",
acknowledgement = ack-nhfb,
}
@InProceedings{Liang:1991:RDP,
author = "K. M. Liang and S. E. Budge and R. W. Harris",
title = "Rate distortion performance of {VQ} and {PVQ}
compression algorithms",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213316",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213316",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1991:COT,
author = "J. Lin and J. A. Storer and M. Cohn",
title = "On the complexity of optimal tree pruning for source
coding",
crossref = "Storer:1991:DDC",
pages = "63--72",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213363",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213363",
acknowledgement = ack-nhfb,
}
@InProceedings{Lindsay:1991:RBV,
author = "R. A. Lindsay and D. E. Abercrombie",
title = "Restricted boundary vector quantization",
crossref = "Storer:1991:DDC",
pages = "159--165",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213383",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213383",
acknowledgement = ack-nhfb,
}
@Article{Liou:1991:OPK,
author = "Ming Liou",
title = "Overview of the p$ \times $ 64 kbits/s Video Coding
Standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "59--63",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103091",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
rawdata = "Liou, Ming (1991) ``Overview of the p$\times$64
kbits/s Video Coding Standard,'' {\it Communications of
the ACM}, {\bf34}(4):59--63, April.",
}
@PhdThesis{Liu:1991:IUD,
author = "Chuang-Chun Liu",
title = "Identification and universal data compression of
hidden {Markov} processes",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "76",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303967206",
acknowledgement = ack-nhfb,
advisor = "Prakash Narayan",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9133119",
subject = "Electrical engineering",
}
@InProceedings{Liu:1991:OFA,
author = "Y. Liu and H. Ma",
title = "$ \omega $-orbit finite automata for data
compression",
crossref = "Storer:1991:DDC",
pages = "166--175",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213384",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213384",
acknowledgement = ack-nhfb,
}
@Article{Liu:1991:RDC,
author = "Chengwen Liu and Clement Yu",
title = "Research: Data compression using word encoding with
{Huffman} code",
journal = j-J-AM-SOC-INF-SCI,
volume = "42",
number = "9",
pages = "685--698",
month = oct,
year = "1991",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(199110)42:9<685::AID-ASI7>3.0.CO%3B2-1",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:47 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "7 Jan 1999",
}
@InProceedings{Lu:1991:ASM,
author = "Cheng-Chang Lu and Ngee-Boo Choong",
title = "Adaptive source modeling using conditioning tree with
maximum entropy reduction criterions",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213338",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213338",
acknowledgement = ack-nhfb,
}
@InProceedings{Malak:1991:IDL,
author = "M. Malak and J. Baker",
title = "An image database for low bandwidth communication
links",
crossref = "Storer:1991:DDC",
pages = "53--62",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213373",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213373",
acknowledgement = ack-nhfb,
}
@InProceedings{Markas:1991:ICM,
author = "T. Markas and J. Reif",
title = "Image compression methods with distortion controlled
capabilities",
crossref = "Storer:1991:DDC",
pages = "93--102",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213376",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213376",
acknowledgement = ack-nhfb,
}
@InProceedings{Masui:1991:KDC,
author = "T. Masui",
title = "Keyword dictionary compression using efficient trie
implementation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213323",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213323",
acknowledgement = ack-nhfb,
}
@InProceedings{Memon:1991:PTL,
author = "N. D. Memon and S. S. Magliveras and K. Sayood",
title = "Prediction trees and lossless image compression",
crossref = "Storer:1991:DDC",
pages = "83--92",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213375",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213375",
acknowledgement = ack-nhfb,
}
@InProceedings{Mermelstein:1991:TAS,
author = "P. Mermelstein",
title = "Trends in audio and speech compression for storage and
real-time communication",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213306",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213306",
acknowledgement = ack-nhfb,
}
@InProceedings{Millett:1991:ICM,
author = "R. P. Millett and E. L. Ivie",
title = "Index compression method with compressed mode
{Boolean} operators",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213324",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213324",
acknowledgement = ack-nhfb,
}
@InProceedings{Minami:1991:OAR,
author = "S. Minami and A. Zakhor",
title = "An optimization approach for removing blocking effects
in transform coding",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213319",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213319",
acknowledgement = ack-nhfb,
}
@MastersThesis{Mishra:1991:AID,
author = "Sanjay Mishra",
title = "An algorithm for image data compression based on
vector quantization",
type = "{M.S.} thesis",
school = "Texas A\&I University",
address = "Kingsville, TX, USA",
pages = "128",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303967682",
acknowledgement = ack-nhfb,
advisor = "Iqbal Omar",
classification = "0984: Computer science",
dissertation-thesis-number = "1343720",
subject = "Computer science",
}
@InProceedings{Moffat:1991:TLC,
author = "Alistair Moffat",
title = "Two-Level Context Based Compression of Binary Images",
crossref = "Storer:1991:DDC",
pages = "382--391",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213342",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213342",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Moffat, Alistair (1991) ``Two-Level Context Based
Compression of Binary Images,'' in {\it Proceedings of
the 1991 Data Compression Conference}, J. Storer, ed.,
Los Alamitos, CA, IEEE Computer Society Press, pp.
382--391.",
}
@InProceedings{Mukherjee:1991:MDE,
author = "A. Mukherjee and H. Bheda and M. A. Bassiouni and T.
Acharya",
title = "Multibit decoding\slash encoding of binary codes using
memory based architectures",
crossref = "Storer:1991:DDC",
pages = "352--361",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213345",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213345",
acknowledgement = ack-nhfb,
}
@Article{Mund:1991:ZLC,
author = "Sibylle Mund",
title = "{Ziv--Lempel} Complexity for Periodic Sequences and
its Cryptographic Application",
journal = j-LECT-NOTES-COMP-SCI,
volume = "547",
pages = "114--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Feb 4 12:02:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t0547.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs1991.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/0547/05470114.htm;
http://link.springer-ny.com/link/service/series/0558/papers/0547/05470114.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Nakamura:1991:DCB,
author = "Hirofumi Nakamura and Sadayuki Murashima",
booktitle = "{Proceedings of the 14th Symposium on Information
Theory and its Applications (SITA '91), December
11--14, 1991, Ibusuki, Japan}",
title = "The Data Compression Based on Concatenation of
Frequentative Code Neighbor",
publisher = "????",
address = "????",
pages = "701--704",
day = "11",
month = dec,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "In Japanese.",
acknowledgement = ack-ds,
rawdata = "Nakamura, Hirofumi and Sadayuki Murashima (1991) ``The
Data Compression Based on Concatenation of
Frequentative Code Neighbor,'' {\it Proceedings of the
14th Symposium on Information Theory and its
Applications (SITA '91)}, (Ibusuki, Japan), pp.
701--704, December 11--14 (in Japanese).",
}
@PhdThesis{Namphol:1991:NNB,
author = "Aran Namphol",
title = "Neural network based data compression",
type = "{Ph.D.} thesis",
school = "The Catholic University of America",
address = "Washington, DC, USA",
pages = "276",
year = "1991",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303929431",
acknowledgement = ack-nhfb,
advisor = "Mohammed Arozullah",
classification = "0317: Neurology; 0544: Electrical engineering",
dissertation-thesis-number = "9123107",
subject = "Electrical engineering; Neurology",
}
@Article{Nelson:1991:DDC,
author = "Mark R. Nelson",
title = "{DDJ} Data Compression Contest Results",
journal = j-DDJ,
volume = "16",
number = "11",
pages = "62--??",
month = nov,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Nguyen:1991:CSP,
author = "H. Nguyen and J. W. Mark",
title = "Concentric-shell partition vector quantization with
application to image coding",
crossref = "Storer:1991:DDC",
pages = "119--128",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213379",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213379",
acknowledgement = ack-nhfb,
}
@InProceedings{Nickels:1991:SDA,
author = "K. Nickels and C. Thacker",
title = "Satellite data archives algorithm",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213314",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213314",
acknowledgement = ack-nhfb,
}
@InProceedings{Omodeo:1991:IJA,
author = "A. Omodeo and M. Pugassi and N. Scarabottolo",
title = "Implementing {JPEG} algorithm on {INMOS} transputer
equipped machines",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213326",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213326",
acknowledgement = ack-nhfb,
}
@InCollection{Paeth:1991:IFC,
author = "Alan W. Paeth",
editor = "James Arvo",
booktitle = "Graphics Gems II",
title = "Image File Compression Made Easy",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Paeth, Alan W. (1991) ``Image File Compression Made
Easy,'' {\it Graphics Gems II}, James Arvo, editor, San
Diego, CA, Academic Press.",
}
@InProceedings{Pentland:1991:PAF,
author = "A. Pentland and B. Horowitz",
title = "A practical approach to fractal-based image
compression",
crossref = "Storer:1991:DDC",
pages = "176--185",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213385",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213385",
acknowledgement = ack-nhfb,
}
@Article{Perl:1991:CLA,
author = "Yehoshua Perl and Ashish Mehta",
title = "Cascading {LZW} Algorithm with {Huffman} Coding: a
Variable to Variable Length Compression Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "507",
pages = "170--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Perl:1991:CLC,
author = "Y. Perl and V. Maram and N. Kadakuntla",
title = "The cascading of the {LZW} compression algorithm with
arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "277--286",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213353",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213353",
acknowledgement = ack-nhfb,
}
@Article{Phillips:1991:IPPa,
author = "Dwayne Phillips",
title = "Image Processing --- Part 1: Reading the {Tag Image
File Format}",
journal = j-CUJ,
volume = "9",
number = "3",
pages = "92--??",
month = mar,
year = "1991",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
keywords = "{Tag Image File Format} (TIFF)",
}
@InProceedings{Polit:1991:NTD,
author = "P. P. Polit and N. M. Nasrabadi",
title = "A new transform domain vector quantization technique
for image data compression in an asynchronous transfer
mode network",
crossref = "Storer:1991:DDC",
pages = "149--158",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213382",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213382",
acknowledgement = ack-nhfb,
}
@InProceedings{Promhouse:1991:SDC,
author = "G. Promhouse and M. Bennett",
title = "Semantic data compression",
crossref = "Storer:1991:DDC",
pages = "323--331",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213348",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213348",
acknowledgement = ack-nhfb,
}
@InCollection{Prusinkiewicz:1991:SSF,
author = "P. Prusinkiewicz and A. Lindenmayer and F. D.
Fracchia",
editor = "H.-O. Peitgen and others",
booktitle = "Fractals in the Fundamental and Applied Sciences",
title = "Synthesis of Space-Filling Curves on the Square Grid",
publisher = pub-ELSEVIER-SCIENCE,
address = pub-ELSEVIER-SCIENCE:adr,
pages = "341--366",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Prusinkiewicz, P., and A. Lindenmayer (1990) {\it The
Algorithmic Beauty of Plants}, New York,
Springer-Verlag. Prusinkiewicz, P., A. Lindenmayer, and
F. D. Fracchia (1991) ``Synthesis of Space-Filling
Curves on the Square Grid,'' {\it Fractals in the
Fundamental and Applied Sciences}, Peitgen, H.-O., et
al. (eds.), Amsterdam, Elsevier Science Publishers, pp.
341--366. Pylak, Pawe\l\ (2003) ``Efficient
Modification of LZSS Compression Algorithm,'' {\it
Annales UMCS Informatica}, section AI, pp. 61--72,
Lublin, Poland. Also available online at
|www.annales.umcs.lublin.pl/AI/2003/07.pdf|.",
}
@Book{Rabbani:1991:DIC,
author = "Majid Rabbani and Paul W. Jones",
title = "Digital Image Compression Techniques",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rabbani, Majid, and Paul W. Jones (1991) {\it Digital
Image Compression Techniques}, Bellingham, WA, Spie
Optical Engineering Press.",
}
@InProceedings{Ramabadran:1991:SRA,
author = "T. V. Ramabadran",
title = "Some results on adaptive statistics estimation for the
reversible compression of sequences",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213312",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213312",
acknowledgement = ack-nhfb,
}
@InProceedings{Ranganathan:1991:SAL,
author = "N. Ranganathan and S. Henriques",
title = "A systolic architecture for {LZ} based decompression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213311",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213311",
acknowledgement = ack-nhfb,
}
@Article{Ranganathan:1991:VAD,
author = "N. Ranganathan and Amar Mukherjee and M. Bassiouni",
title = "{VLSI} algorithms for data compression",
journal = j-COMPUT-SYST-SCI-ENG,
volume = "6",
number = "4",
pages = "238--253",
month = oct,
year = "1991",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Thu Feb 4 13:21:32 MST 1999",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
OCLC Contents1st database",
acknowledgement = ack-nhfb,
affiliation = "Univ of South Florida",
affiliationaddress = "Tampa, USA",
classification = "713; 723",
fjournal = "Computer Systems Science and Engineering",
journalabr = "Comput Syst Sci Eng",
keywords = "Codes, Symbolic --- Encoding; Computer Programming ---
Algorithms; Hardware Algorithms; Huffman Compression;
Information Theory; Integrated Circuits, VLSI; VLSI
Algorithms",
}
@TechReport{Rice:1991:SPU,
author = "Robert F. Rice",
title = "Some Practical Universal Noiseless Coding Techniques
--- {Part III}. {Module PSI14.K}",
type = "JPL Publication",
number = "91-3",
institution = "Jet Propulsion Laboratory",
address = "Pasadena, CA, USA",
pages = "??",
month = nov,
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Rice, R. F. (1991) ``Some Practical Universal
Noiseless Coding Techniques---Part III. Module
PSI14.K,'' Jet Propulsion Laboratory, JPL Publication
91-3, Pasadena, CA, November.",
rawdata-2 = "Rice, Robert F. (1991) ``Some Practical Universal
Noiseless Coding Techniques---Part III. Module
PSI14.K,'' Jet Propulsion Laboratory, JPL Publication
91-3, Pasadena, CA, November.",
}
@Article{Robinson:1991:APF,
author = "J. P. Robinson",
title = "Aliasing probabilities for feedback signature
compression of test data",
journal = j-IEEE-TRANS-COMPUT,
volume = "40",
number = "7",
pages = "867--873",
month = jul,
year = "1991",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.83625",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 7 12:52:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=83625",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Robinson:1991:CNI,
author = "J. A. Robinson",
title = "Compression of natural images using thread-like visual
primitives",
crossref = "Storer:1991:DDC",
pages = "307--312",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213350",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213350",
acknowledgement = ack-nhfb,
}
@InProceedings{Salari:1991:CSI,
author = "E. Salari and W. A. {Whyte, Jr.}",
title = "Compression of stereoscopic image data",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213336",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213336",
acknowledgement = ack-nhfb,
}
@InProceedings{Salomonson:1991:MRI,
author = "V. V. Salomonson",
title = "The {Moderate Resolution Imaging Spectrometer}. An
{EOS} facility instrument candidate for application of
data compression methods",
crossref = "Storer:1991:DDC",
pages = "468--471",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213296",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213296",
acknowledgement = ack-nhfb,
}
@InProceedings{Santis:1991:OAC,
author = "A. {De Santis} and G. Persiano",
title = "An optimal algorithm for the construction of optimal
prefix codes with given fringe",
crossref = "Storer:1991:DDC",
pages = "297--306",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213351",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213351",
acknowledgement = ack-nhfb,
}
@PhdThesis{Shalaby:1991:DHT,
author = "Hossam M. H. Shalaby",
title = "Distributed hypothesis testing with data compression",
type = "{Ph.D.} thesis",
school = "University of Maryland",
address = "College Park, MD, USA",
pages = "136",
year = "1991",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304016569",
acknowledgement = ack-nhfb,
advisor = "Adrian Papamarcou",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9133160",
subject = "Electrical engineering",
}
@InProceedings{Sheinwald:1991:CTW,
author = "D. Sheinwald and A. Lempel and J. Ziv",
title = "On compression with two-way head machines",
crossref = "Storer:1991:DDC",
pages = "218--227",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213359",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213359",
acknowledgement = ack-nhfb,
}
@Article{Sriram:1991:VPC,
author = "Kotikalapudi Sriram and R. Scott McKinney and Mostafa
Hashem Sherif",
title = "Voice Packetization and Compression in Broadband {ATM}
Networks",
journal = j-IEEE-J-SEL-AREAS-COMMUN,
volume = "9",
number = "3",
pages = "294--304",
month = apr,
year = "1991",
CODEN = "ISACEM",
DOI = "https://doi.org/10.1109/49.76627",
ISSN = "0733-8716 (print), 1558-0008 (electronic)",
ISSN-L = "0733-8716",
bibdate = "Tue Mar 14 19:23:09 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "IEEE Log Number 9042034.",
abstract = "The purpose of this paper is to examine some methods
of supporting voice in broadband ISDN's (B-ISDN)
asynchronous transfer mode (ATM), including voice
compression. Techniques for voice compression with
variable-length packet format at DS1 transmission rate
[e.g., wideband packet technology (WPT)] have been
successfully implemented utilizing embedded ADPCM
coding, digital speech interpolation (DSI), and
block-dropping schemes. For supporting voice in B-ISDN,
we consider voice compression techniques similar to
those use in WPT but with different packetization and
congestion control methods designed for the
fixed-length ATM protocol. Possible approaches for
packetization and implementation of variable bit-rate
voice coding schemes are described. We consider using
ADPCM and DSI for voice coding and compression, and
cell discarding (CD) for congestion control. The
advantages of voice compression and cell discarding in
ATM networks are demonstrated in terms of transmission
bandwidth savings and resiliency of the network during
congestion.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Journal on Selected Areas in Communications",
keywords = "voice compression ATM ADPCM (adaptive pulse code
modulation) wideband packet technology (WPT) G727 G764
Packet Voice Protocol (PVP) digital speech
interpolation (DSI) cell discarding (CD) cell
prioritization queueing delay congestion control echo
cancellation clock synchronization coding, voice
packetization performance modeling performance analysis
queueing model queue, M/D/1/k",
}
@InProceedings{Stearns:1991:WDC,
author = "S. D. Stearns",
title = "Waveform data compression with exact recovery",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213297",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213297",
acknowledgement = ack-nhfb,
}
@Article{Storer:1991:PAH,
author = "James A. Storer and John H. Reif",
title = "A parallel architecture for high-speed data
compression",
journal = j-J-PAR-DIST-COMP,
volume = "13",
number = "2",
pages = "222--227",
month = oct,
year = "1991",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/0743-7315(91)90091-m",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Apr 12 19:06:31 MDT 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
acknowledgement = ack-nhfb,
affiliation = "Brandeis Univ",
affiliationaddress = "Waltham, MA, USA",
classification = "713; 716; 717; 718; 722; 723; B1265F
(Microprocessors and microcomputers); B2570
(Semiconductor integrated circuits); B6120B (Codes);
B6140 (Signal processing and detection); B6220
(Stations and subscriber equipment); C5130
(Microprocessor chips); C5220 (Computer architecture);
C5440 (Multiprocessor systems and techniques); C6130
(Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
journalabr = "J Parallel Distrib Comput",
keywords = "40 MHz; application specific integrated circuits;
architectures; associative memory; codecs; complete
encoding-decoding pipe; compression; Computer
Architecture; Computer Systems, Digital--Parallel
Processing; custom VLSI chip; Custom VLSI chips; data;
Data Compression; Data Transmission; digital signal
processing chips; high-; high-speed data
communications; High-speed data compression;
Information Theory; Integrated Circuits, VLSI;
massively parallel architecture; parallel; Parallel
architecture; parallel architecture; serial learning
strategy; speed data compression; systolic arrays;
systolic pipe; textual substitution; VLSI",
treatment = "P Practical",
}
@InProceedings{Szpankowski:1991:TBS,
author = "W. Szpankowski",
title = "A typical behavior of some data compression schemes",
crossref = "Storer:1991:DDC",
pages = "247--256",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213356",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213356",
acknowledgement = ack-nhfb,
}
@InProceedings{Tai:1991:DCE,
author = "W. Tai and J. Dozier",
title = "Data compression in end-to-end information systems for
{NASA} space science missions",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213294",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213294",
acknowledgement = ack-nhfb,
}
@InProceedings{Teuhola:1991:PAC,
author = "J. Teuhola and T. Raita",
title = "Piecewise arithmetic coding",
crossref = "Storer:1991:DDC",
pages = "33--42",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213371",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213371",
acknowledgement = ack-nhfb,
}
@Article{Thomas:1991:EKD,
author = "Kas Thomas",
title = "Entropy: the key to data compression",
journal = j-DDJ,
volume = "16",
number = "2",
pages = "32, 34, 110",
month = feb,
year = "1991",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 09:11:02 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Understanding entropy is key to understanding data
compression.",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); B6120B (Codes); B6140
(Signal processing and detection); C1260 (Information
theory); C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bits per symbol; Data compression; Data stream;
Entropy; Huffman encoding; Information theory; Message
encoding; Redundancy removal; Uncertainty",
thesaurus = "C listings; Data compression; Encoding; Entropy;
Information theory",
}
@InProceedings{Thomborson:1991:VOZ,
author = "C. Thomborson",
title = "{V.42bis} and other {Ziv--Lempel} variants",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213301",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213301",
acknowledgement = ack-nhfb,
}
@InProceedings{Tilton:1991:CEA,
author = "J. C. Tilton and D. Han and M. Manohar",
title = "Compression experiments with {AVHRR} data",
crossref = "Storer:1991:DDC",
pages = "411--420",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213339",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213339",
acknowledgement = ack-nhfb,
}
@InProceedings{Tong:1991:TCM,
author = "K.-L. Tong and M. W. Marcellin",
title = "Transform coding of monochrome and color images using
trellis coded quantization",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213307",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213307",
acknowledgement = ack-nhfb,
}
@InProceedings{Tsai:1991:SPC,
author = "Y. T. Tsai",
title = "Signal processing and compression for image capturing
systems using a single-chip sensor",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213313",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213313",
acknowledgement = ack-nhfb,
}
@InProceedings{VanHouten:1991:ATS,
author = "K. {Van Houten} and P. W. Oman",
title = "An algorithm for tree structure compression",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213337",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213337",
acknowledgement = ack-nhfb,
}
@InProceedings{Venbrux:1991:VHS,
author = "J. Venbrux and N. Liu",
title = "A very high speed lossless compression\slash
decompression chip set",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213300",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213300",
acknowledgement = ack-nhfb,
}
@InProceedings{Vitter:1991:OPD,
author = "J. S. Vitter and P. Krishnan",
title = "Optimal prefetching via data compression",
crossref = "IEEE:1991:PAS",
pages = "121--130",
year = "1991",
bibdate = "Thu Apr 5 06:13:50 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Wallace:1991:JSI,
author = "Gregory K. Wallace",
title = "The {JPEG} Still Image Compression Standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "30--44",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103089",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
rawdata = "Wallace, Gregory K. (1991) ``The JPEG Still Image
Compression Standard,'' {\it Communications of the
ACM}, {\bf34}(4):30--44, April.",
}
@Article{Wallace:1991:JSP,
author = "Gregory K. Wallace",
title = "The {JPEG} still picture compression standard",
journal = j-CACM,
volume = "34",
number = "4",
pages = "30--44",
month = apr,
year = "1991",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/103085.103089",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/103089.html",
acknowledgement = ack-nhfb,
annote = "Describes in simple terms the JPEG compression
algorithm. Useful in that it gives an introduction to
the DCT.",
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "design; jpeg compression; standardization",
subject = "{\bf I.4.2}: Computing Methodologies, IMAGE
PROCESSING, Compression (Coding). {\bf H.5.1}:
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems. {\bf
K.1}: Computing Milieux, THE COMPUTER INDUSTRY,
Standards. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation.",
}
@InProceedings{Weinberger:1991:OAP,
author = "M. J. Weinberger and J. Ziv and A. Lempel",
title = "On the optimal asymptotic performance of universal
ordering and discrimination of individual sequences",
crossref = "Storer:1991:DDC",
pages = "239--246",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213357",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213357",
acknowledgement = ack-nhfb,
}
@TechReport{Whyte:1991:DCF,
author = "Wayne A. Whyte and Khalid Sayood",
title = "Data compression for full motion video transmission",
type = "NASA technical memorandum",
number = "105239",
institution = pub-NASA,
address = pub-NASA:adr,
pages = "????",
year = "1991",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
note = "Shipping list number 92-0647-M.",
series = "NASA-TM",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Data transmission
systems",
}
@Book{Williams:1991:ADC,
author = "Ross N. Williams",
title = "Adaptive Data Compression",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "1991",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Williams, Ross N. (1991a) {\it Adaptive Data
Compression}, Boston, MA, Kluwer Academic Publishers.",
}
@InProceedings{Williams:1991:EFZ,
author = "Ross N. Williams",
title = "An Extremely Fast {Ziv--Lempel} Data Compression
Algorithm",
crossref = "Storer:1991:DDC",
pages = "362--371",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213344",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213344",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Williams, Ross N. (1991b) ``An Extremely Fast
Ziv-Lempel Data Compression Algorithm,'' in {\it
Proceedings of the 1991 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp. 362--371.",
}
@InProceedings{Witten:1991:MCF,
author = "I. H. Witten and T. C. Bell and C. G. Nevill",
title = "Models for compression in full-text retrieval
systems",
crossref = "Storer:1991:DDC",
pages = "23--32",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213370",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213370",
acknowledgement = ack-nhfb,
}
@Article{Witten:1991:ZFP,
author = "Ian {H.} Witten and Timothy C. Bell",
title = "The Zero-Frequency Problem: Estimating the
Probabilities of Novel Events in Adaptive Text
Compression",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-37",
number = "4",
pages = "1085--1094",
year = "1991",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.87000",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Witten, Ian H.{} and Timothy C. Bell (1991) ``The
Zero-Frequency Problem: Estimating the Probabilities of
Novel Events in Adaptive Text Compression,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-37}(4):1085--1094.",
}
@InProceedings{Wong:1991:MCV,
author = "C. W. Wong",
title = "Motion-compensated video image compression using
luminance and chrominance components for motion
estimation",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213321",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213321",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1991:BTS,
author = "X. Wu and K. Zhang",
title = "A better tree-structured vector quantizer",
crossref = "Storer:1991:DDC",
pages = "392--401",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213341",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213341",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1991:ICA,
author = "X. Wu and C. Yao",
title = "Image coding by adaptive tree-structured
segmentation",
crossref = "Storer:1991:DDC",
pages = "73--82",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213374",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213374",
acknowledgement = ack-nhfb,
}
@InProceedings{Wyner:1991:FDB,
author = "A. D. Wyner and J. Ziv",
title = "Fixed data base version of the {Lempel--Ziv} data
compression algorithm",
crossref = "Storer:1991:DDC",
pages = "202--207",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213361",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213361",
acknowledgement = ack-nhfb,
}
@Article{Yamamoto:1991:NAO,
author = "Hirosuke Yamamoto and Hiroshi Ochi",
title = "A New Asymptotically Optimal Code for the Positive
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "37",
number = "5",
pages = "1420--1429",
month = sep,
year = "1991",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.133261",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Yamamoto, Hirosuke and Hiroshi Ochi (1991) ``A New
Asymptotically Optimal Code for the Positive
Integers,'' {\it IEEE Transactions on Information
Theory}, {\bf37}(5):1420--1429, September.",
}
@Article{Yokoo:1991:IDH,
author = "Hidetoshi Yokoo",
title = "An Improvement of Dynamic {Huffman} Coding with a
Simple Repetition Finder",
journal = j-IEEE-TRANS-COMM,
volume = "39",
number = "1",
pages = "8--10",
month = jan,
year = "1991",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/26.68268",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Yokoo, Hidetoshi (1991) ``An Improvement of Dynamic
Huffman Coding with a Simple Repetition Finder,'' {\it
IEEE Transactions on Communications}, {\bf39}(1):8--10,
January.",
}
@InProceedings{Yovanof:1991:LCT,
author = "G. S. Yovanof and J. R. Sullivan",
title = "Lossless coding techniques for color graphical
images",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213322",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213322",
acknowledgement = ack-nhfb,
}
@InProceedings{Zipstein:1991:DCF,
author = "M. Zipstein",
title = "Data compression with factor automata",
crossref = "Storer:1991:DDC",
pages = "??--??",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213333",
bibdate = "Tue Feb 5 14:06:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213333",
acknowledgement = ack-nhfb,
}
@InProceedings{Zue:1991:IIV,
author = "K. Zue and J. M. Crissey",
title = "An iteratively interpolative vector quantization
algorithm for image data compression",
crossref = "Storer:1991:DDC",
pages = "139--148",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213381",
bibdate = "Tue Feb 5 14:06:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213381",
acknowledgement = ack-nhfb,
}
@InProceedings{Agostino:1992:PAO,
author = "S. {De Agostino} and J. A. Storer",
title = "Parallel algorithms for optimal compression using
dictionaries with the prefix property",
crossref = "Storer:1992:DCC",
pages = "52--61",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227476",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227476",
acknowledgement = ack-nhfb,
}
@Book{Akansu:1992:MSD,
author = "Ali Akansu and R. Haddad",
title = "Multiresolution Signal Decomposition",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Akansu, Ali, and R. Haddad (1992) {\it Multiresolution
Signal Decomposition}, San Diego, CA, Academic Press.",
}
@InProceedings{Ali:1992:UFT,
author = "M. Ali and C. Papadopoulos and T. Clarkson",
title = "The use of fractal theory in a video compression
system",
crossref = "Storer:1992:DCC",
pages = "259--268",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227455",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227455",
acknowledgement = ack-nhfb,
}
@InProceedings{Amir:1992:ETD,
author = "A. Amir and C. Benson",
title = "Efficient two-dimensional compressed matching",
crossref = "Storer:1992:DCC",
pages = "279--288",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227453",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227453",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1992:CCG,
author = "Anonymous",
title = "Can Compression Get You Out of a Squeeze?",
journal = j-DATAMATION,
volume = "38",
number = "20",
pages = "65--??",
day = "01",
month = oct,
year = "1992",
CODEN = "DTMNAT",
ISSN = "0011-6963",
bibdate = "Sat Jan 27 07:35:21 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Data compression doesn't just trim communications
costs; it also can boost efficiency of inter-LAN and
dial-in applications.",
acknowledgement = ack-nhfb,
fjournal = "Datamation",
}
@Article{Anonymous:1992:DYDb,
author = "Anonymous",
title = "Double Your Drives With Data Compression",
journal = j-DATAMATION,
volume = "38",
number = "24",
pages = "49--??",
day = "01",
month = dec,
year = "1992",
CODEN = "DTMNAT",
ISSN = "0011-6963",
bibdate = "Sat Jan 27 07:35:21 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Trying to cram too much data onto relatively small
hard drives? Try these software compression products
before turning to hardware upgrades.",
acknowledgement = ack-nhfb,
fjournal = "Datamation",
}
@Article{Anonymous:1992:FDC,
author = "Anonymous",
title = "{On-the-Fly} Disk Compression: Diet Disk compression
utility, automated {Apple} Menus, and organizing
{Usenet} news",
journal = j-BYTE,
volume = "17",
number = "6",
pages = "357--??",
month = jun,
year = "1992",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@Article{Antonini:1992:ICU,
author = "Marc Antonini and Michel Barlaud and Pierre Mathieu
and Ingrid Daubechies",
title = "Image coding using wavelet transform",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "1",
number = "2",
pages = "205--220",
month = apr,
year = "1992",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.136597",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/abstract/document/136597/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
keywords = "biorthogonal subclasses; Bit rate; data compression;
encoding; Frequency domain analysis; Humans; image
coding; Image coding; image compression;
multiresolution codebook; Noise shaping; noise shaping
bit allocation; picture processing; Pixel; progressive
transmission; Psychology; psychovisual features;
pyramidal algorithm architecture; Rate distortion
theory; Shannon's rate distortion theory; vector
quantisation; wavelet coefficients; Wavelet
coefficients; wavelet transform; Wavelet transforms",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
unique-id = "ISI:000202960500007",
}
@Book{Bass:1992:EP,
author = "Thomas A. Bass",
title = "Eudaemonic Pie",
publisher = pub-PENGUIN,
address = pub-PENGUIN:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bass, Thomas A. (1992) {\it Eudaemonic Pie}, New York,
Penguin Books.",
}
@Article{Bergen:1992:DSF,
author = "Helen A. Bergen and James M. Hogan",
title = "Data security in a fixed-model arithmetic coding
compression algorithm",
journal = j-COMPUT-SECUR,
volume = "11",
number = "5",
pages = "445--461",
month = sep,
year = "1992",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/016740489290011F",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Bookstein:1992:MBC,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "Model based concordance compression",
crossref = "Storer:1992:DCC",
pages = "82--91",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227473",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227473",
acknowledgement = ack-nhfb,
}
@InProceedings{Buhmann:1992:COV,
author = "J. Buhmann and H. Kuhnel",
title = "Complexity optimized vector quantization: a neural
network approach",
crossref = "Storer:1992:DCC",
pages = "12--21",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227480",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227480",
acknowledgement = ack-nhfb,
}
@Article{Bunton:1992:PDM,
author = "Suzanne Bunton and Gaetano Borriello",
title = "Practical dictionary management for hardware data
compression",
journal = j-CACM,
volume = "35",
number = "1",
pages = "95--104",
month = jan,
year = "1992",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/129617.129622",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu May 30 09:41:10 MDT 1996",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/129622.html",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; design; performance; theory",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf B.6.1}: Hardware,
LOGIC DESIGN, Design Styles, Memory control and access.
{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and
Design Styles, Algorithms implemented in hardware. {\bf
E.1}: Data, DATA STRUCTURES, Trees.",
}
@TechReport{Burrows:1992:LDC,
author = "Michael Burrows and others",
title = "On-line Data Compression in a Log-Structured File
System",
institution = "Digital Systems Research Center",
address = "Palo Alto, CA, USA",
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Burrows, Michael, et al. (1992) {\it On-line Data
Compression in a Log-Structured File System}, Digital,
Systems Research Center, Palo Alto, CA.",
}
@Article{Capocelli:1992:CSS,
author = "R. Capocelli and A. {De Santis}",
title = "On The Construction of Statistically Synchronizable
Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "407--414",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119696",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capocelli, R. and A. De Santis (1992) ``On The
Construction of Statistically Synchronizable Codes,''
{\it IEEE Transactions on Information Theory},
{\bf38}(2):407--414, March.",
}
@InProceedings{Carpentieri:1992:SMP,
author = "B. Carpentieri and J. A. Storer",
title = "A split-merge parallel block-matching algorithm for
video displacement estimation",
crossref = "Storer:1992:DCC",
pages = "239--248",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227457",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227457",
acknowledgement = ack-nhfb,
}
@Article{Chang:1992:CDC,
author = "Kuang-Yao Chang and Gregory T. Yang",
title = "{CCIGS}: a Data Compression System for {Chinese} Fonts
and Binary Images Using Classification Techniques",
journal = j-SPE,
volume = "22",
number = "12",
pages = "1027--1047",
month = dec,
year = "1992",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380221202",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Chen:1992:AHS,
author = "O. T.-C. Chen and Z. Zhang and B. J. Sheu",
title = "An adaptive high-speed lossy data compression",
crossref = "Storer:1992:DCC",
pages = "349--358",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227446",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227446",
acknowledgement = ack-nhfb,
}
@Misc{Chu:1992:LDC,
author = "K. C. Chu",
title = "Lossless Data Compression Circuit and Method",
howpublished = "U.S. Patent No. 5,150,430",
month = sep,
year = "1992",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Cody:1992:FWT,
author = "Mac A. Cody",
title = "The fast wavelet transform",
journal = j-DDJ,
volume = "17",
number = "4",
pages = "16--18, 20, 24, 26, 28, 100--101",
month = apr,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Sunair Electron. Inc., Fort Lauderdale, FL, USA",
classification = "C1130 (Integral transforms); C4190 (Other numerical
methods); C5140 (Firmware); C5260B (Computer vision and
picture processing)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Aware Inc; Fast wavelet transform; Fingerprint
analysis; Firmware; Fourier transform; Image
compression",
thesaurus = "C listings; Computerised pattern recognition; Data
compression; Firmware; Transforms",
}
@Article{DeVore:1992:ICT,
author = "R. DeVore and others",
title = "Image Compression Through Wavelet Transform Coding",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "719--746",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119733",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "DeVore, R., et al. (1992) ``Image Compression Through
Wavelet Transform Coding,'' {\it IEEE Transactions on
Information Theory}, {\bf38}(2):719--746, March.",
}
@Article{Dickman:1992:PCS,
author = "Chris Dickman",
title = "The {President} and {CEO} of {Storm Technology}
discusses file compression issues",
journal = j-ELECT-COMPOSITION-IMAGING,
volume = "6",
number = "??",
pages = "52--??",
month = mar,
year = "1992",
ISSN = "0838-9535",
bibdate = "Mon May 20 11:04:41 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Electronic Composition and Imaging",
}
@InProceedings{Dionysian:1992:VPR,
author = "R. Dionysian and M. D. Ercegovac",
title = "Variable precision representation for efficient {VQ}
codebook storage",
crossref = "Storer:1992:DCC",
pages = "319--328",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227449",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227449",
acknowledgement = ack-nhfb,
}
@InProceedings{Epstein:1992:MKW,
author = "B. R. Epstein and R. Hingorani and J. M. Shapiro and
M. Czigler",
title = "Multispectral {KLT}-wavelet data compression for
{Landsat} thematic mapper images",
crossref = "Storer:1992:DCC",
pages = "200--208",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227461",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227461",
acknowledgement = ack-nhfb,
}
@InProceedings{Gammerman:1992:EUM,
author = "A. Gammerman and A. Bellotti",
title = "Experiments using minimal-length encoding to solve
machine learning problems",
crossref = "Storer:1992:DCC",
pages = "359--367",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227445",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227445",
acknowledgement = ack-nhfb,
}
@Book{Gersho:1992:VQS,
author = "Allen Gersho and Robert M. Gray",
title = "Vector Quantization and Signal Compression",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Gersho, Allen, and Robert M. Gray (1992) {\it Vector
Quantization and Signal Compression}, Boston, MA,
Kluwer Academic Publishers.",
}
@Article{Gillman:1992:DHT,
author = "P. Gillman",
title = "Data handling and text compression",
journal = j-J-INFO-SCI-PRINCIPLES-PRACTICE,
volume = "18",
number = "2",
pages = "105--110",
month = "????",
year = "1992",
CODEN = "JISCDI",
DOI = "https://doi.org/10.1177/016555159201800204",
ISSN = "0165-5515 (print), 1741-6485 (electronic)",
ISSN-L = "0165-5515",
bibdate = "Wed Aug 31 00:52:53 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sgml.bib",
abstract = "Data compression has a function in text storage and
data handling, but not at the level of compressing data
files. The reason is that the decompression of such
files adds a time delay to the retrieval process, and
users can see this delay as a drawback of the system
concerned. Compression techniques can with benefit be
applied to index files. A more relevant data handling
problem is that posed by the need, in most systems, to
store two versions of imported text. The first is the
native version, as it might have come from a word
processor to text editor. The second is the ASCII
version which is what is actually imported. Inverted
file indexes form yet another version. The problem
arises out of the need for dynamic indexing and
re-indexing of revisable documents in very large
database applications such as are found in office
automation systems. Four mainstream text-management
packages are used to show how this problem is handled,
and how generic document architectures such as OCA/CDA
and SGML might help.",
acknowledgement = ack-nhfb,
affiliation = "Inf. Partnership, London, UK",
classification = "C6120 (File organisation); C6130 (Data handling
techniques); C7240 (Information analysis and indexing);
C7250 (Information storage and retrieval)",
fjournal = "Journal of Information Science, Principles and
Practice",
keywords = "ASCII version; Data compression; Data files; Data
handling; Dynamic indexing; Imported text; Inverted
file indexes; Native version; OCA/CDA; Re-indexing;
Revisable documents; SGML; Text compression; Text
storage; Text-management packages; Time delay; Very
large database applications",
pubcountry = "Netherlands",
thesaurus = "Data compression; Data handling; File organisation;
Indexing; Information storage",
}
@Article{Golin:1992:DIC,
author = "S. Golin",
title = "{DVI} Image Compression, Second Generation",
journal = j-PROC-SPIE,
volume = "1657",
pages = "106--113",
month = feb,
year = "1992",
CODEN = "PSISDG",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
rawdata = "Golin, S. (1992) ``DVI Image Compression, Second
Generation,'' {\it Proceedings SPIE Conference, Image
Processing Algorithms}, {\bf1657}:106--113, February.",
xxjournal = "Proceedings SPIE Conference, Image Processing
Algorithms",
}
@Book{Gonzalez:1992:DIP,
author = "Rafael C. Gonzalez and Richard E. Woods",
title = "Digital Image Processing",
publisher = pub-AW,
address = pub-AW:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Gonzalez, Rafael C., and Richard E. Woods (1992) {\it
Digital Image Processing}, Reading, MA,
Addison-Wesley.",
}
@InProceedings{Haddadin:1992:SVQ,
author = "O. S. Haddadin and V. J. Mathews and T. G. {Stockham,
Jr.}",
title = "Subband vector quantization of images using hexagonal
filter banks",
crossref = "Storer:1992:DCC",
pages = "2--11",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227481",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227481",
acknowledgement = ack-nhfb,
}
@InProceedings{Hopper:1992:CGS,
author = "T. Hopper and F. Preston",
title = "Compression of grey-scale fingerprint images",
crossref = "Storer:1992:DCC",
pages = "309--318",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227450",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227450",
acknowledgement = ack-nhfb,
}
@InProceedings{Horspool:1992:CWB,
author = "R. Nigel Horspool and Gordon V. Cormack",
title = "Constructing Word-Based Text Compression Algorithms",
crossref = "Storer:1992:DCC",
pages = "62--71",
month = apr,
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227475",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227475",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Horspool, N. R., and G. V. Cormack (1992)
``Constructing Word-Based Text Compression
Algorithms,'' {\it Proceedings of the 1992 Data
Compression Conference}, J. Storer, ed., Los Alamitos,
CA, IEEE Computer Society Press, PP. 62--71, April.",
xxauthor = "N. R. Horspool and G. V. Cormack",
}
@InProceedings{Howard:1992:EMH,
author = "Paul G. Howard and J. S. Vitter",
title = "Error Modeling for Hierarchical Lossless Image
Compression",
crossref = "Storer:1992:DCC",
pages = "269--278",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227454",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227454",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Howard, Paul G., and J. S. Vitter (1992b) ``Error
Modeling for Hierarchical Lossless Image Compression,''
{\it Proceedings of the 1992 Data Compression
Conference}, J. Storer, ed., Los Alamitos, CA, IEEE
Computer Society Press, pp. 269--278.",
}
@Article{Howard:1992:NML,
author = "Paul G. Howard and J. S. Vitter",
title = "New Methods for Lossless Image Compression Using
Arithmetic Coding",
journal = j-INFO-PROC-MAN,
volume = "28",
number = "6",
pages = "765--779",
year = "1992",
CODEN = "IPMADK",
DOI = "https://doi.org/10.1016/0306-4573(92)90067-a",
ISSN = "0306-4573 (print), 1873-5371 (electronic)",
ISSN-L = "0306-4573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Information Processing and Management",
rawdata = "Howard, Paul G., and J. S. Vitter (1992a) ``New
Methods for Lossless Image Compression Using Arithmetic
Coding,'' {\it Information Processing and Management},
{\bf28}(6):765--779.",
}
@InProceedings{Howard:1992:PIA,
author = "Paul G. Howard and J. S. Vitter",
editor = "James A. Storer",
booktitle = "Image and Text Compression",
title = "Practical Implementations of Arithmetic Coding",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "85--112",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.duke.edu/~jsv/Papers/catalog/node85.html",
acknowledgement = ack-ds,
rawdata = "Howard, Paul G., and J. S. Vitter (1992c) ``Practical
Implementations of Arithmetic Coding,'' in {\it Image
and Text Compression}, J. A. Storer, ed., Norwell, MA,
Kluwer Academic Publishers, PP. 85--112. Also available
from URL\hfil\break
|http://www.cs.duke.edu/~jsv/Papers/catalog/node85.html|.",
}
@InProceedings{Howard:1992:PLI,
author = "P. G. Howard and J. S. Vitter",
title = "Parallel lossless image compression using {Huffman}
and arithmetic coding",
crossref = "Storer:1992:DCC",
pages = "299--308",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227451",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227451",
acknowledgement = ack-nhfb,
}
@InProceedings{Jacobson:1992:RAH,
author = "G. Jacobson",
title = "Random access in {Huffman}-coded files",
crossref = "Storer:1992:DCC",
pages = "368--377",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227444",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227444",
acknowledgement = ack-nhfb,
}
@Article{Jurgen:1992:TCE,
author = "R. K. Jurgen",
title = "Technology 1992 --- Consumer electronics",
journal = j-IEEE-SPECTRUM,
volume = "29",
number = "1",
pages = "52--54",
month = jan,
year = "1992",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.109606",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "AD 1991; cable television; Cable TV; consumer
electronics; Consumer electronics; data compression;
digital audio radio; digital audio tape; digital
compact disc systems; Electronic equipment testing;
FCC; Hardware; HDTV; HDTV transmission systems; high
definition television; IEL; Instruments; mini disc
systems; System testing; TV broadcasting; TV cable
systems; US; video and audio discs",
}
@InProceedings{Khansari:1992:CIC,
author = "M. R. K. Khansari and I. Widjaja and A. Leon-Garcia",
title = "Convolutional interpolative coding algorithms",
crossref = "Storer:1992:DCC",
pages = "209--218",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227460",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227460",
acknowledgement = ack-nhfb,
}
@Article{Konstantinides:1992:MAI,
author = "Konstantinos Konstantinides and Vasudev Bhaskaran",
title = "Monolithic Architectures for Image Processing and
Compression",
journal = j-IEEE-CGA,
volume = "12",
number = "6",
pages = "75--86",
month = nov,
year = "1992",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.163627",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
abstract = "To meet the demands of image- intensive applications
like desktop publishing, medical imaging, and
multimedia, researchers are refining programmable ICs
for image processing.",
acknowledgement = ack-nhfb,
classification = "714.2; 722.4; 723.5; 741.3",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Computer architecture; Computer vision; Image
compression; Monolithic integrated circuits;
Programmable integrated circuits",
}
@Article{Kruger:1992:BTC,
author = "Anton Kruger",
title = "Block truncation compression",
journal = j-DDJ,
volume = "17",
number = "4",
pages = "48, 50, 53--55, 104, 106",
month = apr,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C5260B (Computer vision and picture processing);
C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Block size; Block truncation compression; Disk space;
Image degradation; Local image statistics; Lossy data
compression algorithms; Monochrome image files",
thesaurus = "C listings; Computerised picture processing; Data
compression",
}
@InProceedings{Langdon:1992:JML,
author = "G. Langdon and A. Gulati and E. Seiler",
title = "On the {JPEG} model for lossless image compression",
crossref = "Storer:1992:DCC",
pages = "172--180",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227464",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227464",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1992:IST,
author = "J. Lin and J. A. Storer",
title = "Improving search for tree-structured vector
quantization",
crossref = "Storer:1992:DCC",
pages = "339--348",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227447",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227447",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1992:NOV,
author = "Jyh-Han Lin and J. S. Vitter",
title = "Nearly optimal vector quantization via linear
programming",
crossref = "Storer:1992:DCC",
pages = "22--31",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227479",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227479",
acknowledgement = ack-nhfb,
}
@PhdThesis{Lu:1992:DCS,
author = "Wei-Wei Lu",
title = "Data compression for space applications",
type = "{D.Phil.} thesis",
school = "University of Sussex",
address = "Brighton, UK",
pages = "158",
year = "1992",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304001463",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "C332496",
subject = "Computer science",
}
@InProceedings{Madisetti:1992:RTI,
author = "A. Madisetti and R. Jain and R. L. Baker",
title = "Real time implementation of pruned tree search vector
quantization",
crossref = "Storer:1992:DCC",
pages = "152--161",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227466",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227466",
acknowledgement = ack-nhfb,
}
@InProceedings{Manohar:1992:PVQ,
author = "M. Manohar and J. C. Tilton",
title = "Progressive vector quantization of multispectral image
data using a massively parallel {SIMD} machine",
crossref = "Storer:1992:DCC",
pages = "181--190",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227463",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227463",
acknowledgement = ack-nhfb,
}
@Book{McConnell:1992:FDF,
author = "Kenneth R. McConnell",
title = "{FAX}: Digital Facsimile Technology and Applications",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "??",
year = "1992",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.mathworks.com/",
acknowledgement = ack-ds,
rawdata-1 = "Matlab (1999) |http://www.mathworks.com/|. McConnell,
Kenneth R. (1992) {\it FAX: Digital Facsimile
Technology and Applications}, Norwood, MA, Artech
House.",
rawdata-2 = "McConnell, Kenneth R. (1992) {\it FAX: Digital
Facsimile Technology and Applications}, Norwood, MA,
Artech House.",
}
@InProceedings{McMillan:1992:FMR,
author = "L. McMillan and L. Westover",
title = "A forward-mapping realization of the inverse discrete
cosine transform",
crossref = "Storer:1992:DCC",
pages = "219--228",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227459",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227459",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1992:CCF,
author = "A. Moffat and J. Zobel",
title = "Coding for compression in full-text retrieval
systems",
crossref = "Storer:1992:DCC",
pages = "72--81",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227474",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227474",
acknowledgement = ack-nhfb,
}
@Book{Nelson:1992:DCB,
author = "Mark Nelson",
title = "The data compression book: featuring fast, efficient
data compression techniques in {C}",
publisher = pub-MT,
address = pub-MT:adr,
pages = "527",
year = "1992",
ISBN = "1-55851-214-4, 1-55851-216-0 (Book disk set)",
ISBN-13 = "978-1-55851-214-6, 978-1-55851-216-0 (Book disk set)",
LCCN = "QA76.9.D33 N46 1992",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
acknowledgement = ack-nhfb,
remark = "System requirements: ``The code in this book has been
written to compile and run using several compilers and
environments. These include Microsoft C/C++, Borland
C++, Zortech C++, and interactive UNIX Sytem v3.2. The
disk contains all of the source code.''",
subject = "Data compression (Computer science)",
xxyear = "1991",
}
@Book{Pennebaker:1992:JSI,
author = "William B. Pennebaker and Joan L. Mitchell",
title = "{JPEG} Still Image Data Compression Standard",
publisher = pub-VAN-NOSTRAND-REINHOLD,
address = pub-VAN-NOSTRAND-REINHOLD:adr,
pages = "xviii + 638",
year = "1992",
ISBN = "0-442-01272-1",
ISBN-13 = "978-0-442-01272-4",
LCCN = "TA1632 .P45 1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Algorithms; Data compression (Telecommunication) ---
Standards; Image compression --- Standards; Image
processing --- Digital techniques --- Standards",
libnote = "Not in my library.",
rawdata = "Pennebaker, William B., and Joan L. Mitchell (1992)
{\it JPEG Still Image Data Compression Standard}, New
York, Van Nostrand Reinhold.",
shorttableofcontents = "Foreword \\
Acknowledgments \\
Trademarks \\
Introduction \\
Image Concepts and Vocabulary \\
Aspects of the Human Visual Systems \\
The Discrete Cosine Transform (DCT) \\
Image Compression Systems \\
JPEG Modes of Operation \\
JPEG Syntax and Data Organization \\
Entropy Coding Concepts \\
JPEG Binary Arithmetic Coding \\
JPEG Coding Models \\
JPEG Huffman Entropy Coding \\
Arithmetic Coding Statistical \\
More on Arithmetic Coding \\
Probability Estimation \\
Compression Performance \\
JPEG Enhancements \\
JPEG Applications and Vendors \\
Overview of CCITT, ISO, and IEC \\
History of JPEG \\
Other Image Compression Standards \\
Possible Future JPEG Directions \\
Appendix A \\
Appendix B \\
References \\
Index",
tableofcontents = "Foreword / xiii \\
Acknowledgments / xv \\
Trademarks / xvii \\
1: Introduction / 1 \\
1.1 Examples of JPEG image compression / 4 \\
1.2 Organization of the book / 4 \\
1.3 An architecture for image compression / 6 \\
1.4 JPEG baseline and extended systems / 6 \\
1.5 An evolving standard / 7 \\
1.6 An international collaboration / 7 \\
2: Image Concepts and Vocabulary / 9 \\
2.1 Digital images / 10 \\
2.2 Sampling / 10 \\
2.3 Two-dimensional arrays of samples / 12 \\
2.4 Digital image data types / 13 \\
2.5 Large amounts of data / 21 \\
3: Aspects of the Human Visual System / 23 \\
3.1 Luminance sampling / 23 \\
3.2 Sampie precision / 25 \\
3.3 Chrominance sampling / 25 \\
3.4 Linearity / 25 \\
4: The Discrete Cosine Transform (DCT) / 29 \\
4.1 Basic DCT concepts / 29 \\
4.2 Mathematical definition of the FDCT and IDCT / 39
\\
4.3 Fast DCTs / 41 \\
5: Image Compression Systems / 65 \\
5.1 Basic structure of image compression systems / 65
\\
5.2 Image compression models / 67 \\
5.3 JPEG entropy encoder and entropy decoder structures
/ 73 \\
5.4 Transcoding / 77 \\
5.5 JPEG lossless and lossy compression / 78 \\
5.6 Sequential and progressive coding / 79 \\
5.7 Hierarchical coding / 79 \\
5.8 Compression measures / 79 \\
6: JPEG Modes of Operation / 81 \\
6.1 Sequential DCT-based mode of operation / 81 \\
6.2 Progressive DCT-based mode of operation / 86 \\
6.3 Sequential lossless mode of operation / 92 \\
6.4 Hierarchical mode of operation / 93 \\
7: JPEG Syntax and Data Organization / 97 \\
7.1 Control procedures and compressed data structure /
97 \\
7.2 Interchange and abbreviated compressed data formats
/ 99 \\
7.3 Image data ordering / 99 \\
7.4 Marker definitions / 105 \\
7.5 Frame header / 110 \\
7.6 Scan header / 113 \\
7.7 Limit on the number of data units in an MCU / 116
\\
7.8 Marker segments for tables and parameters / 117 \\
7.9 Hierarchical progression marker segments / 120 \\
7.10 Examples of JPEG data streams / 122 \\
7.11 Backus--Naur Form / 127 \\
7.12 JPEG BNF / 130 \\
8: Entropy Coding Concepts / 135 \\
8.1 Entropy and Information / 135 \\
8.2 An example to illustrate entropy coding / 137 \\
8.3 Variable-length code words / 137 \\
8.4 Statistical modeling / 143 \\
8.5 Adaptive coding / 147 \\
9: JPEG Binary Arithmetic Coding / 149 \\
9.1 The QM-encoder / 151 \\
9.2 The QM-decoder / 162 \\
9.3 More about the QM-coder / 166 \\
10: JPEG Coding Models / 169 \\
10.1 JPEG sequential DCT-based coding models / 170 \\
10.2 Models for progressive DCT-based coding / 173 \\
10.3 Coding model for lossless coding / 182 \\
10.4 Models for hierarchical coding / 185 \\
11: JPEG Huffman Entropy Coding / 189 \\
11.1 Statistical models for the Huffman DCT-based
sequential mode / 190 \\
11.2 Statistical models for progressive DCT-based
coding / 194 \\
11.3 Statistical models for lossless coding and
hierarchical mode spatial corrections / 198 \\
11.4 Generation of Huffman tables / 198 \\
12: Arithmetic Coding Statistical Models / 203 \\
12.1 Overview of JPEG binary arithmetic-coding
procedures / 203 \\
12.2 Decision trees and notation / 204 \\
12.3 Statistical models for the DCT-based sequential
mode with arithmetic coding / 206 \\
12.4 Statistical models for progressive DCT-based
coding / 214 \\
12.5 Statistical models for lossless coding and
hierarchical-rnode spatial corrections / 216 \\
12.6 Arithmetic coding conditioning tables / 218 \\
13: More on Arithmetic Coding / 219 \\
13.1 Optimal procedures for hardware and software / 220
\\
13.2 Fast software encoder implementations / 225 \\
13.3 Fast software decoder implementations / 228 \\
13.4 Conditional exchange / 229 \\
13.5 QM-coder versus Q-coder / 229 \\
13.6 Resynchronization of decoders / 230 \\
13.7 Speedup mode / 231 \\
14: Probability Estimation / 233 \\
14.1 Bayesian estimation / 234 \\
14.2 Renormalization-driven estimation / 235 \\
14.3 Markov-chain modelling of the probability
estimation / 236 \\
14.4 Approximate model / 238 \\
14.5 Single-and mixed-context models / 240 \\
14.6 Single-context model / 241 \\
14.7 Mixed-context model / 243 \\
14.8 Application of the estimation models to the
QM-coder / 244 \\
14.9 Initial learning / 247 \\
14.10 Robustness of estimators versus refinement of
models / 249 \\
14.11 Other estimation tables / 249 \\
15: Compression Performance / 253 \\
15.1 Results for baseline sequential DCT / 254 \\
15.2 Results for sequential DCT with arithmetic coding
/ 255 \\
15.3 Results for sequential DCT with restart capability
/ 255 \\
15.4 Results for progressive DCT with arithmetic coding
/ 256 \\
15.5 Results for lossless mode with arithmetic coding /
257 \\
15.6 Summary of Results / 258 \\
16: JPEG Enhancements / 261 \\
16.1 Removing blocking artifacts with AC prediction /
261 \\
16.2 Low bitrate VQ enhanced decoding / 264 \\
16.3 An approximate form of adaptive quantization / 264
\\
16.4 Display-adjusted decoding / 266 \\
17: JPEG Applications and Vendors / 267 \\
17.1 Adobe Systems Incorporated / 269 \\
17.2 AT\&T Microelectronics / 270 \\
17.3 AutoGraph International ApS / 271 \\
17.4 AutoView / 272 \\
17.5 Bulletin board systems / 272 \\
17.6 California Department of Motor Vehicles / 273 \\
17.7 C-Cube Microsystems, Inc. / 273 \\
17.8 Data Link / 275 \\
17.9 Discovery Technologies, Inc. / 275 \\
17.10 DSP / 276 \\
17.11 Eastman Kodak Company / 276 \\
17.12 Handmade Software / 277 \\
17.13 IBM / 278 \\
17.14 Identix / 279 \\
17.15 IIT / 279 \\
17.16 Independent JPEG Group / 280 \\
17.17 ITR / 281 \\
17.18 Lewis Siwell, Inc. / 281 \\
17.19 LSI Logic / 282 \\
17.20 Moore Data Management Services / 283 \\
17.21 NBS Imaging / 283 \\
17.22 NTT Electronics Technology Ltd. / 284 \\
17.23 OPTIBASE / 284 \\
17.24 Optivision, Inc. / 284 \\
17.25 Philips Kommunikations Industrie / 285 \\
17.26 PRISM / 286 \\
17.27 Storm Technology / 286 \\
17.28 Telephoto Communications / 287 \\
17.29 Tribune Publishing Co. / 288 \\
17.30 VideoTelecom / 288 \\
17.31 Ximage / 289 \\
17.32 Xing / 289 \\
17.33 Zoran Corporation / 290 \\
17.34 3M / 291 \\
17.35 File formats / 292 \\
18: Overview of CCITT, ISO, and IEC / 295 \\
18.1 ISO / 296 \\
18.2 CCITT / 297 \\
18.3 IEC / 298 \\
18.4 Joint coordination / 299 \\
19: History of JPEG / 301 \\
19.1 Formation of JPEG / 301 \\
19.2 Original JPEG Goals / 302 \\
19.3 Selecting an approach / 302 \\
19.4 Functional requirements / 303 \\
19.5 Refining the ADCT technique / 306 \\
19.6 Technical specifications / 307 \\
19.7 ISO 10918 Part I / 309 \\
19.8 JPEG Part I DIS ballot results / 311 \\
19.9 CCITT Recommendation T.81 / 311 \\
19.10 ISO 10918 Part 20 / 311 \\
19.11 JPEG Goals Achieved / 313 \\
20: Other Image Compression Standards / 317 \\
20.1 CCITTG3 and G40 / 317 \\
20.2 H.2610 / 318 \\
20.3 JBIG / 318 \\
20.4 MPEG / 325 \\
21: Possible Future JPEG Directions / 331 \\
21.1 Adaptive quantization / 331 \\
21.2 Improvements to lossless coding / 332 \\
21.3 Other possible addenda / 333 \\
21.4 Backwards compatibility / 333 \\
Appendix A. ISO DIS 10918-1 Requirements and Guidelines
/ 335 \\
Appendix B. Draft ISO DIS 10918-2 Compliance Testing /
545 \\
References / 627 \\
Index / 632",
}
@Article{Phillips:1992:DCU,
author = "Dwayne Phillips",
title = "Data Compression Using {Huffman} Coding",
journal = j-CUJ,
volume = "10",
number = "2",
pages = "55--??",
month = feb,
year = "1992",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@Article{Phillips:1992:LDC,
author = "Dwayne Phillips",
title = "{LZW} Data Compression",
journal = "{Circuit Cellar INK} --- The Computer Applications
Journal",
volume = "27",
pages = "36--48",
month = jun # "\slash " # jul,
year = "1992",
CODEN = "CCIEBN",
ISSN = "0896-8985",
ISSN-L = "0896-8985",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Phillips, Dwayne (1992) ``LZW Data Compression,'' {\it
The Computer Application Journal}, Circuit Cellar Inc.,
{\bf27}:36--48, June/July.",
xxjournal = "The Computer Application Journal",
}
@MastersThesis{Ramlaoui:1992:DCR,
author = "Hussam Ibrahim Ramlaoui",
title = "Data compression review and implementation",
type = "{M.S.} thesis",
school = "California State University, Long Beach",
address = "Long Beach, CA, USA",
pages = "72",
year = "1992",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304033789",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "1349677",
subject = "Electrical engineering",
}
@Article{Ratcliff:1992:AC,
author = "John W. Ratcliff",
title = "Audio compression",
journal = j-DDJ,
volume = "17",
number = "7",
pages = "32, 37--39, 96, 98--100",
month = jul,
year = "1992",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 10 10:06:23 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "B6130 (Speech analysis and processing techniques);
B6140 (Signal processing and detection); B6450 (Audio
equipment and systems); C5260 (Digital signal
processing); C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "ACOMP; Audio compression algorithm; Digitized sound;
Fidelity; Human voice; Music",
thesaurus = "Assembly language listings; Audio signals;
Computerised signal processing; Data compression;
Speech analysis and processing",
}
@InProceedings{Reed:1992:PBC,
author = "T. R. Reed and V. R. Algazi and G. E. Ford and I.
Hussain",
title = "Perceptually based coding of monochrome and color
still images",
crossref = "Storer:1992:DCC",
pages = "142--151",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227467",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227467",
acknowledgement = ack-nhfb,
}
@InProceedings{Reif:1992:OTI,
author = "J. H. Reif and A. Yoshida",
title = "Optical techniques for image compression",
crossref = "Storer:1992:DCC",
pages = "32--40",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227478",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227478",
acknowledgement = ack-nhfb,
}
@InProceedings{Rollins:1992:PHW,
author = "M. Rollins and F. Carden",
title = "Possible harmonic-wavelet hybrids in image
compression",
crossref = "Storer:1992:DCC",
pages = "191--199",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227462",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227462",
acknowledgement = ack-nhfb,
}
@Article{Ross:1992:SDC,
author = "Ed Ross",
title = "A Simple Data-Compression Technique",
journal = j-CUJ,
volume = "10",
number = "10",
pages = "113--??",
month = oct,
year = "1992",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@InProceedings{Savari:1992:ACM,
author = "S. A. Savari and R. G. Gallager",
title = "Arithmetic coding for memoryless cost channels",
crossref = "Storer:1992:DCC",
pages = "92--101",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227472",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227472",
acknowledgement = ack-nhfb,
}
@PhdThesis{Sayano:1992:ACC,
author = "Masahiro Sayano",
title = "Analyses of coding and compression strategies for data
storage and transmission",
type = "{Ph.D.} thesis",
school = "California Institute of Technology",
address = "Pasadena, CA, USA",
pages = "121",
year = "1992",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303987736",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9232221",
subject = "Electrical engineering; Computer science",
}
@Article{Sayood:1992:DLI,
author = "Khalid Sayood and K. Anderson",
title = "A Differential Lossless Image Compression Scheme",
journal = j-IEEE-TRANS-SIG-PROC,
volume = "40",
number = "1",
pages = "236--241",
month = jan,
year = "1992",
CODEN = "ITPRED",
DOI = "https://doi.org/10.1109/78.157204",
ISSN = "1053-587X (print), 1941-0476 (electronic)",
ISSN-L = "1053-587X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Signal Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78",
rawdata = "Sayood, Khalid and K. Anderson (1992) ``A Differential
Lossless Image Compression Scheme,'' {\it IEEE
Transactions on Signal Processing},
{\bf40}(1):236--241, January.",
}
@InProceedings{Sheinwald:1992:BAC,
author = "D. Sheinwald",
title = "On binary alphabetical codes",
crossref = "Storer:1992:DCC",
pages = "112--121",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227470",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227470",
acknowledgement = ack-nhfb,
}
@Misc{Simpson:1992:RPP,
author = "W. Simpson",
title = "{RFC 1331}: The Point-to-Point Protocol ({PPP}) for
the Transmission of Multi-protocol Datagrams over
Point-to-Point Links",
month = may,
year = "1992",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1548 \cite{Simpson:1993:RPP}.
Obsoletes RFC1171, RFC1172
\cite{Perkins:1990:RPPa,Perkins:1990:RPPb}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1171.txt;
ftp://ftp.internic.net/rfc/rfc1172.txt;
ftp://ftp.internic.net/rfc/rfc1331.txt;
ftp://ftp.internic.net/rfc/rfc1548.txt;
https://www.math.utah.edu/pub/rfc/rfc1171.txt;
https://www.math.utah.edu/pub/rfc/rfc1172.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1548.txt",
acknowledgement = ack-nhfb,
format = "TXT=129892 bytes",
obsoletedby = "Obsoleted by RFC1548 \cite{Simpson:1993:RPP}.",
obsoletes = "Obsoletes RFC1171, RFC1172
\cite{Perkins:1990:RPPa,Perkins:1990:RPPb}.",
online = "yes",
status = "PROPOSED STANDARD",
}
@InProceedings{Sproull:1992:CCG,
author = "R. F. Sproull and I. E. Sutherland",
title = "A comparison of codebook generation techniques for
vector quantization",
crossref = "Storer:1992:DCC",
pages = "122--131",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227469",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227469",
acknowledgement = ack-nhfb,
}
@InProceedings{Stauffer:1992:TCS,
author = "L. M. Stauffer and D. S. Hirschberg",
title = "Transpose coding on the systolic array",
crossref = "Storer:1992:DCC",
pages = "162--171",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227465",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227465",
acknowledgement = ack-nhfb,
}
@Article{Thomborson:1992:VSD,
author = "Clark Thomborson",
title = "The {V.42bis} Standard for Data-Compressing Modems",
journal = j-IEEE-MICRO,
volume = "12",
number = "5",
pages = "41--53",
month = sep # "\slash " # oct,
year = "1992",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.166712",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib; Science
Citation Index database (1980--2000)",
abstract = "Examining practical, algorithmic, and marketing
aspects of this standard uncovers no serious flaws in
its specification",
acknowledgement = ack-ds # " and " # ack-nhfb,
classcodes = "B6220W (Other stations); B6140 (Signal processing and
detection); C5630 (Networking equipment); C6130 (Data
handling techniques)",
corpsource = "Minnesota Univ., Duluth, MN, USA",
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "Berkeley Unix Compress; CCITT V.42bis standard; data
compression; data-compressing; Lempel--Ziv--Welch
algorithm; modems; standards; text compression;
utility",
rawdata = "Thomborson, Clark, (1992) ``The V.42bis Standard for
Data-Compressing Modems,'' {\it IEEE Micro}, pp.
41--53, October.",
treatment = "P Practical; X Experimental",
}
@Article{Tjalkens:1992:UVF,
author = "T. Tjalkens and Frans M. Willems",
title = "A Universal Variable-to-Fixed Length Source Code Based
on {Lawrence}'s Algorithm",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "38",
number = "2",
pages = "247--253",
month = mar,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119684",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Tjalkens, T. and Frans M. Willems (1992) ``A Universal
Variable-to-Fixed Length Source Code Based on
Lawrence's Algorithm,'' {\it IEEE Transactions on
Information Theory}, {\bf38}(2):247--253, March.",
}
@InProceedings{Wang:1992:VRL,
author = "Y. Wang and J.-M. Wu",
title = "Vector run-length coding of bi-level images",
crossref = "Storer:1992:DCC",
pages = "289--298",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227452",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227452",
acknowledgement = ack-nhfb,
}
@Article{Wegener:1992:RDC,
author = "Al Wegener",
title = "Review of {{\em Data Compression}, 3rd edn. (Held, G;
1991)}",
journal = j-COMPUTER,
volume = "25",
number = "8",
pages = "110--111",
month = aug,
year = "1992",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Mar 17 10:11:23 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Weinberger:1992:CDG,
author = "M. J. Weinberger and A. Lempel and J. Ziv",
title = "On the coding delay of a general coder",
crossref = "Storer:1992:DCC",
pages = "102--111",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227471",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227471",
acknowledgement = ack-nhfb,
}
@Article{Wickerhauser:1992:HRS,
author = "Mladen Victor Wickerhauser",
title = "High-Resolution Still Picture Compression",
journal = "Digital Signal Processing: a Review Journal",
volume = "2",
number = "4",
pages = "204--226",
month = oct,
year = "1992",
DOI = "https://doi.org/10.1016/1051-2004(92)90010-v",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/dsp.ps.Z",
}
@InProceedings{Witten:1992:TIC,
author = "Ian H. Witten and T. C. Bell and M.-E. E. Harrison and
M. L. James and A. Moffat",
title = "Textual Image Compression",
crossref = "Storer:1992:DCC",
pages = "42--51",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227477",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227477",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Witten, Ian H., T. C. Bell, M. E. Harrison, M. L.
James, and A. Moffat (1992) ``Textual Image
Compression,'' {\it Proceedings of the 1992 Data
Compression Conference}, J. Storer, ed., Los Alamitos,
CA, IEEE Computer Society Press, pp. 42--51.",
}
@Article{Wong:1992:CCT,
author = "P. W. Wong and J. Koplowitz",
title = "Chain Codes and Their Linear Reconstruction Filters",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-38",
number = "2",
pages = "268--280",
month = may,
year = "1992",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.119686",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Wong, P. W., and J. Koplowitz (1992) ``Chain Codes and
Their Linear Reconstruction Filters,'' {\it IEEE
Transactions on Information Theory}, {\bf
IT-38}(2):268--280, May.",
}
@InProceedings{Wu:1992:LIC,
author = "X. Wu and Yonggang Fang",
title = "Lossless interframe compression of medical images",
crossref = "Storer:1992:DCC",
pages = "249--258",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227456",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227456",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1992:VQD,
author = "Xiaolin Wu",
title = "Vector quantizer design by constrained global
optimization",
crossref = "Storer:1992:DCC",
pages = "132--141",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227468",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227468",
acknowledgement = ack-nhfb,
}
@Article{Yu:1992:DCH,
author = "Bin Yu and T. P. Speed",
title = "Data compression and histograms",
journal = j-PROBAB-THEORY-RELAT-FIELDS,
volume = "92",
number = "2",
pages = "195--229",
month = "????",
year = "1992",
CODEN = "PTRFEU",
DOI = "https://doi.org/10.1007/BF01194921",
ISSN = "0178-8051 (print), 1432-2064 (electronic)",
ISSN-L = "0178-8051",
bibdate = "Sun Apr 27 11:18:29 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/probab-theory-relat-fields.bib",
URL = "http://link.springer.com/article/10.1007/BF01194921",
acknowledgement = ack-nhfb,
fjournal = "Probability Theory and Related Fields",
journal-URL = "http://link.springer.com/journal/440",
}
@InProceedings{Zamir:1992:UCB,
author = "R. Zamir and M. Feder",
title = "Universal coding of band-limited sources by sampling
and dithered quantization",
crossref = "Storer:1992:DCC",
pages = "329--338",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227448",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227448",
acknowledgement = ack-nhfb,
}
@PhdThesis{Zandi:1992:ANB,
author = "Ahmad Zandi",
title = "Adaption to nonstationary binary sources for data
compression",
type = "{Ph.D.} thesis",
school = "University of California, Santa Cruz",
address = "Santa Cruz, CA, USA",
pages = "65",
year = "1992",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/303987140",
acknowledgement = ack-nhfb,
advisor = "Glen G. {Langdon, Jr.}",
classification = "0984: Computer science",
dissertation-thesis-number = "9224688",
subject = "Computer science",
}
@InProceedings{Zhu:1992:IRH,
author = "Q.-F. Zhu and Y. Wang and L. Shaw",
title = "Image reconstruction for hybrid video coding systems",
crossref = "Storer:1992:DCC",
pages = "229--238",
year = "1992",
DOI = "https://doi.org/10.1109/DCC.1992.227458",
bibdate = "Tue Feb 5 14:06:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=227458",
acknowledgement = ack-nhfb,
}
@Article{Zipstein:1992:DCF,
author = "M. Zipstein",
title = "Data compression with factor automata",
journal = j-THEOR-COMP-SCI,
volume = "92",
number = "1",
pages = "213--221",
day = "06",
month = jan,
year = "1992",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(92)90144-5",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C1260 (Information theory); C4220
(Automata theory)",
conflocation = "Paris, France; July 1990",
conftitle = "Combinatorial Pattern Matching School",
corpsource = "CERIL, Evry, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "automata theory; data compression; data compression
algorithm; encoding; entropy; factor automata; text",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@PhdThesis{Abbas:1993:ANN,
author = "Hazem M. Abbas",
title = "Artificial neural networks models for image data
compression",
type = "{Ph.D.} thesis",
school = "Queen's University at Kingston",
address = "Kingston, ON, Canada",
pages = "162",
year = "1993",
ISBN = "0-315-80743-1",
ISBN-13 = "978-0-315-80743-3",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304058068",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NN80743",
subject = "Electrical engineering",
}
@InProceedings{Abrahams:1993:CMC,
author = "J. Abrahams",
title = "Codes with monotonic codeword lengths",
crossref = "Storer:1993:DDC",
pages = "52--59",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253145",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253145",
acknowledgement = ack-nhfb,
}
@InProceedings{Andrews:1993:MRV,
author = "B. D. Andrews and M. Effros and P. A. Chou and R. M.
Gray",
title = "A mean-removed variation of weighted universal vector
quantization for image coding",
crossref = "Storer:1993:DDC",
pages = "302--309",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253119",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253119",
acknowledgement = ack-nhfb,
}
@InProceedings{Arya:1993:AFV,
author = "S. Arya and D. M. Mount",
title = "Algorithms for fast vector quantization",
crossref = "Storer:1993:DDC",
pages = "381--390",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253111",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253111",
acknowledgement = ack-nhfb,
}
@InProceedings{Barnes:1993:CVR,
author = "C. F. Barnes and E. J. Holder",
title = "Classified variable rate residual vector quantization
applied to image subband coding",
crossref = "Storer:1993:DDC",
pages = "272--281",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253122",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253122",
acknowledgement = ack-nhfb,
}
@PhdThesis{Becker:1993:IVC,
author = "Jeffrey Chaim Becker",
title = "Increasing {VLSI} Chip Address and Data {I/O} Pin
Bandwidth Through Compression",
type = "{Ph.D.} thesis",
school = "University of California, Davis",
address = "Davis, CA, USA",
pages = "104",
year = "1993",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304049364",
acknowledgement = ack-nhfb,
advisor = "Dai Jie Cheng",
classification = "0984: Computer science",
dissertation-thesis-number = "9415893",
subject = "Computer science",
}
@Article{Bell:1993:LMS,
author = "Timothy C. Bell and David Kulp",
title = "Longest-match String Searching for {Ziv--Lempel}
Compression",
journal = j-SPE,
volume = "23",
number = "7",
pages = "757--771",
month = jul,
year = "1993",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380230705",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Bell:1993:RDC,
author = "Timothy C. Bell and Alistair Moffat and Craig G.
Nevill-Manning and Ian H. Witten and Justin Zobel",
title = "Research: Data compression in full-text retrieval
systems",
journal = j-J-AM-SOC-INF-SCI,
volume = "44",
number = "9",
pages = "508--531",
month = oct,
year = "1993",
CODEN = "AISJB6",
DOI = "https://doi.org/10.1002/(SICI)1097-4571(199310)44:9<508::AID-ASI2>3.0.CO%3B2-A",
ISSN = "0002-8231 (print), 1097-4571 (electronic)",
ISSN-L = "0002-8231",
bibdate = "Fri Sep 11 09:03:57 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasis.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643",
onlinedate = "4 Jan 1999",
}
@Misc{Benedetto:1993:NMA,
author = "J. Benedetto and A. Teolis",
title = "Nonlinear Method and Apparatus for Coding and Decoding
Acoustic Signals with Data Compression and Noise
Suppression Using Cochlear Filters, Wavelet Analysis,
and Irregular Sampling Reconstruction",
howpublished = "U.S. Patent pending",
year = "1993",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Bergen:1993:CPA,
author = "Helen A. Bergen and James M. Hogan",
title = "A chosen plaintext attack on an adaptive arithmetic
coding compression algorithm",
journal = j-COMPUT-SECUR,
volume = "12",
number = "2",
pages = "157--167",
month = mar,
year = "1993",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:44:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/016740489390099Q",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Bhaskaran:1993:OPL,
author = "V. Bhaskaran and B. K. Natarajan and K.
Konstantinides",
title = "Optimal piecewise-linear compression of images",
crossref = "Storer:1993:DDC",
pages = "168--177",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253133",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253133",
acknowledgement = ack-nhfb,
}
@Article{Blinn:1993:WDD,
author = "J. F. Blinn",
title = "{What}'s the Deal with the {DCT}",
journal = j-IEEE-CGA,
volume = "13",
number = "4",
pages = "78--83",
month = jul,
year = "1993",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.219457",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
rawdata = "Blinn, J. F. (1993) ``What's the Deal with the DCT,''
{\it IEEE Computer Graphics and Applications} pp.
78--83, July.",
remark = "The discrete cosine transform is the basis of most
image compression techniques today. Why is it better
than the discrete Fourier transform?",
}
@InProceedings{Bookstein:1993:CRF,
author = "A. Bookstein and S. T. Klein and T. Raita and I. K.
Ravichandra Rao and M. D. Patil",
title = "Can random fluctuation be exploited in data
compression?",
crossref = "Storer:1993:DDC",
pages = "70--78",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253143",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253143",
acknowledgement = ack-nhfb,
}
@InProceedings{Bookstein:1993:HCDa,
author = "Abraham Bookstein and S. T. Klein",
title = "Is {Huffman} Coding Dead?",
crossref = "Korfhage:1993:PSA",
volume = "50",
number = "4",
pages = "80--87",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in
\cite{Bookstein:1993:HCDb,Bookstein:1993:HCDc}.",
acknowledgement = ack-ds,
rawdata = "Bookstein, Abraham and S. T. Klein (1993) ``Is Huffman
Coding Dead?'' {\it Proceedings of the 16th Annual
International ACM SIGIR Conference on Research and
Development in Information Retrieval}, pp. 80--87. Also
published {\it Computing}, {\bf50}(4):279--296, 1993,
and {\it Proceedings of the Data Compression
Conference, 1993}, Snowbird, UT. p. 464.",
}
@InProceedings{Bookstein:1993:HCDb,
author = "Abraham Bookstein and S. T. Klein",
title = "Is {Huffman} Coding Dead?",
crossref = "Storer:1993:DDC",
pages = "464--??",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Also published in
\cite{Bookstein:1993:HCDa,Bookstein:1993:HCDc}.",
acknowledgement = ack-ds,
rawdata = "Bookstein, Abraham and S. T. Klein (1993) ``Is Huffman
Coding Dead?'' {\it Proceedings of the 16th Annual
International ACM SIGIR Conference on Research and
Development in Information Retrieval}, pp. 80--87. Also
published {\it Computing}, {\bf50}(4):279--296, 1993,
and {\it Proceedings of the Data Compression
Conference, 1993}, Snowbird, UT. p. 464.",
}
@Article{Bookstein:1993:HCDc,
author = "A. Bookstein and S. T. Klein",
title = "Is {Huffman} coding dead",
journal = j-COMPUTING,
volume = "50",
number = "4",
pages = "279--296",
month = dec,
year = "1993",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/bf02243872",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
MRclass = "94A29",
MRnumber = "1 235 463",
bibdate = "Mon Oct 11 20:38:38 MDT 1999",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database",
note = "Also published in
\cite{Bookstein:1993:HCDa,Bookstein:1993:HCDb}.",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@InProceedings{Bradley:1993:FWS,
author = "Jonathan N. Bradley and Christopher M. Brislawn and
Tom Hopper",
booktitle = "{Proceedings of Visual Information Processing II,
Orlando, FL}",
title = "The {FBI} Wavelet/Scalar Quantization Standard for
Grayscale Fingerprint Image Compression",
volume = "1961",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "293--304",
month = apr,
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bradley, Jonathan N., Christopher M. Brislawn, and Tom
Hopper (1993) ``The FBI Wavelet/Scalar Quantization
Standard for Grayscale Fingerprint Image Compression,''
{\it Proceedings of Visual Information Processing II},
Orlando, FL, SPIE vol.{} 1961, pp. 293--304, April.",
}
@InProceedings{Bradley:1993:WTV,
author = "J. N. Bradley and C. M. Brislawn",
title = "Wavelet transform-vector quantization compression of
supercomputer ocean models",
crossref = "Storer:1993:DDC",
pages = "224--233",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253127",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253127",
acknowledgement = ack-nhfb,
}
@InProceedings{Chan:1993:JCD,
author = "W.-Y. Chan and A. Gersho and S.-W. Soong",
title = "Joint codebook design for summation product-code
vector quantizers",
crossref = "Storer:1993:DDC",
pages = "42--51",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253146",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253146",
acknowledgement = ack-nhfb,
}
@Article{Chang:1993:NLA,
author = "Henry Ker-Chang Chang and Shing Hong Chen",
title = "A new locally adaptive data compression scheme using
multilist structure",
journal = j-COMP-J,
volume = "36",
number = "6",
pages = "570--578",
month = dec,
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.6.570",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/6.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/6/570.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_06/Vol36_06.body.html#AbstractChang",
acknowledgement = ack-nhfb,
affiliation = "Graduate Sch. of Resources Manage., Nat. Defense
Manage. Coll., Taipei, Taiwan",
author-1-adr = "Graduate School of Resources Management, National
Defense Management College, PO Box 90046-17, Chung-Ho,
Taipei, Taiwan, ROC",
author-2-adr = "Graduate School of Resources Management, National
Defense Management College, PO Box 90046-17, Chung-Ho,
Taipei, Taiwan, ROC",
classcodes = "B6140 (Signal processing and detection)",
classification = "B6140 (Signal processing and detection)",
corpsource = "Graduate Sch. of Resources Manage., Nat. Defense
Manage. Coll., Taipei, Taiwan",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "data compression; encoding; G1; G1 prefix code;
Locally adaptive data compression scheme; locally
adaptive data compression scheme; multilist; Multilist
structure; prefix code; Prefix coding methods; prefix
coding methods; structure; Transmitted code word;
transmitted code word",
thesaurus = "Data compression; Encoding",
treatment = "T Theoretical or Mathematical",
}
@Article{Chang:1993:RCO,
author = "Chin-Chen Chang and Huey-Cheue Kowng and Tzong-Chen
Wu",
title = "A refinement of a compression-oriented addressing
scheme",
journal = j-BIT,
volume = "33",
number = "4",
pages = "529--535",
month = dec,
year = "1993",
CODEN = "BITTEL, NBITAB",
DOI = "https://doi.org/10.1007/BF01990533",
ISSN = "0006-3835 (print), 1572-9125 (electronic)",
ISSN-L = "0006-3835",
bibdate = "Wed Jan 4 18:52:23 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=33&issue=4;
https://www.math.utah.edu/pub/tex/bib/bit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://www.mai.liu.se/BIT/contents/bit33.html;
http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=33&issue=4&spage=529",
abstract = "Chang and Wu have proposed a letter-oriented perfect
hashing scheme based on sparse matrix compression. We
present a method which is a refinement of the Chang-Wu
scheme. By experimental evaluation, we show that the
hashing of our refinement has more efficient storage
utilization than Chang-Wu's method. Our refinement is
valuable in practical implementations of hashing for
large sets of keys.",
acknowledgement = ack-nhfb,
fjournal = "BIT (Nordisk tidskrift for informationsbehandling)",
journal-URL = "http://link.springer.com/journal/10543",
keywords = "perfect hashing; row displacement method; sparse
matrix compression",
}
@PhdThesis{Chang:1993:SPM,
author = "Daniel Kuo-Yee Chang",
title = "String pattern matching and lossless data
compression",
type = "{Ph.D.} thesis",
school = "City University of New York",
address = "New York, NY, USA",
pages = "110",
year = "1993",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://search.proquest.com/docview/304028781",
acknowledgement = ack-nhfb,
advisor = "Charles Giardina",
classification = "0984: Computer science",
dissertation-thesis-number = "9325077",
subject = "Computer science",
}
@InCollection{Coifman:1993:SPC,
author = "Ronald R. Coifman and Yves Meyer and Stephen R. Quake
and Mladen Victor Wickerhauser",
title = "Signal Processing and Compression with Wavelet
Packets",
crossref = "Meyer:1993:PWA",
pages = "77--93",
year = "1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/cmqw.tex",
}
@Article{Cole:1993:MTF,
author = "B. Cole",
title = "Multimedia-the technology framework",
journal = j-IEEE-SPECTRUM,
volume = "30",
number = "3",
pages = "32--39",
month = mar,
year = "1993",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.211957",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Apple Macintosh; Application software; applications;
bandwidth; Bandwidth; Computer aided manufacturing;
Computer vision; data compression; delivery bottleneck;
Distributed computing; DOS/Windows; Graphics; hardware;
IBM Ultimedia/OS-2; Image converters; interoperability;
LAN; local area networks; microcomputer applications;
multimedia; Multimedia systems; multimedia systems;
Pervasive computing; Philips/Microware; Read only
memory; software; Unix",
}
@InProceedings{Connor:1993:CTR,
author = "J. T. Connor and L. E. Atlas",
title = "Coding theory and regularization",
crossref = "Storer:1993:DDC",
pages = "158--167",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253134",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253134",
acknowledgement = ack-nhfb,
}
@InProceedings{Constantinescu:1993:LAV,
author = "C. Constantinescu and J. A. Storer",
title = "On-line adaptive vector quantization with variable
size codebook entries",
crossref = "Storer:1993:DDC",
pages = "32--41",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253147",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253147",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1993:ECW,
author = "K. {Culik II} and S. Dube and P. Rajcani",
title = "Efficient compression of wavelet coefficients for
smooth and fractal-like data",
crossref = "Storer:1993:DDC",
pages = "234--243",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253126",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253126",
acknowledgement = ack-nhfb,
}
@Article{Culik:1993:ICUa,
author = "Karel {Culik II} and Jarkko Kari",
title = "Image Compression Using Weighted Finite Automata",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "17",
number = "3",
pages = "305--313",
month = may # "--" # jun,
year = "1993",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/0097-8493(93)90079-o",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database; Graphics/siggraph/93.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "Univ of South Carolina",
affiliationaddress = "Columbia, SC, USA",
classification = "721.1; 723.5",
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
journalabr = "Comput Graphics (Pergamon)",
keywords = "Algorithms; Automatic encoding algorithm; Finite
automata; Fractals; Grey-tone images; Image coding;
Image compression; Weighted finite automata",
rawdata = "Culik, Karel II, and J. Kari (1993) ``Image
Compression Using Weighted Finite Automata,'' {\it
Computer and Graphics}, {\bf17}(3):305--313.",
}
@Article{Culik:1993:ICUb,
author = "Karel {Culik II} and Jarkko Kari",
title = "Image compression using weighted finite automata",
journal = j-LECT-NOTES-COMP-SCI,
volume = "711",
pages = "392--??",
year = "1993",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1016/0097-8493(93)90079-o",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:49:00 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Curewitz:1993:PPD,
author = "Kenneth M. Curewitz and P. Krishnan and Jeffrey Scott
Vitter",
title = "Practical prefetching via data compression",
journal = j-SIGMOD,
volume = "22",
number = "2",
pages = "257--266",
month = jun,
year = "1993",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/170036.170077",
ISBN = "0-89791-592-5",
ISBN-13 = "978-0-89791-592-2",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jan 12 08:45:44 MST 2004",
bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "An important issue that affects response time
performance in current OODB and hypertext systems is
the I/O involved in moving objects from slow memory to
cache. A promising way to tackle this problem is to use
prefetching, in which we predict the user's next page
requests and get those pages into cache in the
background. Current databases perform limited
prefetching using techniques derived from older virtual
memory systems. A novel idea of using data compression
techniques for prefetching was recently advocated in
[KrV, ViK], in which prefetchers based on the
Lempel--Ziv data compressor (the UNIX compress command)
were shown theoretically to be optimal in the limit. In
this paper we analyze the practical aspects of using
data compression techniques for prefetching. We adapt
three well-known data compressors to get three simple,
deterministic, and universal prefetchers. We simulate
our prefetchers on sequences of page accesses derived
from the OO1 and OO7 benchmarks and from CAD
applications, and demonstrate significant reductions in
fault-rate. We examine the important issues of cache
replacement, size of the data structure used by the
prefetcher, and problems arising from bursts of `fast'
page requests (that leave virtually no time between
adjacent requests for prefetching and book keeping). We
conclude that prediction for prefetching based on data
compression techniques holds great promise.",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp",
affiliationaddress = "Maynard, MA, USA",
classification = "722.1; 722.4; 723.1; 723.2; 723.3; 723.5; C6120
(File organisation); C6130 (Data handling techniques);
C6160J (Object-oriented databases)",
conference = "Proceedings of the 1993 ACM SIGMOD International
Conference on Management of Data",
conferenceyear = "1993",
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
keywords = "Algorithms; Benchmarks; Cache replacement; Cache
replacement, Object-oriented databases; CAD; Computer
aided design; Computer simulation; Data compression;
Data compressor; Data storage equipment; Data
structure; Data structures; Database systems; Fault
rate; Hypertext; Memory system; OODB; Page accesses;
Performance; Prefetching; Response time (computer
systems); Response time performance; Virtual storage",
meetingaddress = "Washington, DC, USA",
meetingdate = "May 26--28 1993",
meetingdate2 = "05/26--28/93",
publisherinfo = "Fort Collins Computer Center",
sponsor = "ACM, SIGMOD; Minerals, Metals \& Materials Society",
thesaurus = "Buffer storage; Data compression; Data structures;
Object-oriented databases",
xxcrossref = "Anonymous:1993:SAS",
}
@Article{Daehlen:1993:IPI,
author = "Morten D{\ae}hlen and Michael Floater",
title = "Iterative polynomial interpolation and data
compression",
journal = j-NUMER-ALGORITHMS,
volume = "5",
number = "1--4",
pages = "165--177",
month = nov,
year = "1993",
CODEN = "NUALEG",
DOI = "https://doi.org/10.1007/bf02215679",
ISSN = "1017-1398 (print), 1572-9265 (electronic)",
ISSN-L = "1017-1398",
MRclass = "65D05 (41A05 94A29)",
MRnumber = "1 258 592",
bibdate = "Wed Feb 07 07:58:52 2001",
bibsource = "http://www.math.psu.edu/dna/contents/na.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/numeralgorithms.bib",
note = "Algorithms for approximation, {III} (Oxford, 1992)",
ZMnumber = "788.65010",
acknowledgement = ack-nhfb,
fjournal = "Numerical Algorithms",
journal-URL = "http://link.springer.com/journal/11075",
}
@Article{Dahmen:1993:WAM,
author = "W. Dahmen and S. Pr{\"o}ssdorf and R. Schneider",
title = "Wavelet approximation methods for pseudodifferential
equations. {II}. {Matrix} compression and fast
solution",
journal = j-ADV-COMPUT-MATH,
volume = "1",
number = "3",
pages = "259--335",
month = oct,
year = "1993",
CODEN = "ACMHEX",
DOI = "https://doi.org/10.1007/BF02072014",
ISSN = "1019-7168 (print), 1572-9044 (electronic)",
ISSN-L = "1019-7168",
MRclass = "65N30 (35S99 41A63 42C15 47G30 65J10)",
MRnumber = "1242378",
MRreviewer = "Rong Qing Jia",
bibdate = "Sat Feb 3 18:21:39 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/advcomputmath.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/BF02072014",
acknowledgement = ack-nhfb,
fjournal = "Advances in Computational Mathematics",
journal-URL = "http://link.springer.com/journal/10444",
}
@Article{Davison:1993:VTC,
author = "Andrew Davison",
title = "Vague text compression",
journal = j-SIGACT,
volume = "24",
number = "1",
pages = "68--74",
month = "Winter",
year = "1993",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/152992.153009",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 09:45:52 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "A new approach to the `lossy' compression of text is
described, based on the computational benefits of
reading handwritten text, as opposed to text set in a
more formal typographical style. Specifically, a new
class of fonts, called vague fonts, are proposed which
encode the vagueness of handwriting. Text written using
a vague font can be compressed to a much greater degree
than the same text represented in a conventional
font.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Delfino:1993:PMI,
author = "Erik Delfino",
title = "{PC} Monitor --- The {Internet} Toolkit: File
Compression and Archive Utilities",
journal = j-ONLINE,
volume = "17",
number = "6",
pages = "90--??",
day = "1",
month = nov,
year = "1993",
CODEN = "ONLIDN",
ISSN = "0146-5422",
bibdate = "Tue Jun 18 10:55:20 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/internet.bib;
UnCover library database",
acknowledgement = ack-nhfb,
fjournal = "Online",
}
@Article{Dion:1993:CPC,
author = "Pierre J. Dion",
title = "Cross-Platform Compression",
journal = j-DDJ,
volume = "18",
number = "12",
pages = "32, 34, 36--37",
month = dec,
year = "1993",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:15:45 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "Data compression is one means of achieving efficient
data transfer. However, efficiency across disparate
computer systems can be limited by the lack of
cross-platform tools. Pierre presents an implementation
of LZH compression for MS-DOS, Unix, and MVS.",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques); C6130
(Data handling techniques); C6150J (Operating
systems)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Cross-platform data compression; Efficient data
transfer; Lempel--Ziv--Huffman compression; LZH
compression; MS-DOS; MVS; UNIX",
thesaurus = "C listings; Data compression; Microcomputer
applications; Operating systems [computers]; Software
portability",
xxnumber = "13",
}
@InProceedings{Douglis:1993:CCU,
author = "Fred Douglis",
title = "The Compression Cache: Using On-line Compression to
Extend Physical Memory",
crossref = "USENIX:1993:PWU",
pages = "519--529",
month = "Winter",
year = "1993",
bibdate = "Tue Oct 22 08:21:46 2002",
bibsource = "ftp://ftp.uu.net/library/bibliography;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.usenix.org/",
URL = "http://www.usenix.org/publications/library/proceedings/sd93/",
acknowledgement = ack-nhfb,
affiliation = "Matsushita Information Technology Laboratory",
}
@Article{Engbert:1993:FHC,
author = "Ludger Engbert",
title = "On-The-Fly {Huffman} Coding",
journal = j-CUJ,
volume = "11",
number = "12",
pages = "29--??",
month = dec,
year = "1993",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@TechReport{FBI:1993:WGF,
author = "{Federal Bureau of Investigation}",
title = "{WSQ} Grayscale Fingerprint Image Compression
Specification, ver. 2.0",
type = "Document",
number = "IAFIS-IC-0110v2",
institution = "Criminal Justice Information Services",
address = "Washington, DC, USA (??)",
pages = "??",
month = feb,
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Federal Bureau of Investigation (1993) {\it WSQ
Grayscale Fingerprint Image Compression Specification,
ver. 2.0}, Document \#IAFIS-IC-0110v2, Criminal Justice
Information Services, February.",
}
@InProceedings{Fenwick:1993:ZLE,
author = "P. M. Fenwick",
title = "{Ziv--Lempel} encoding with multi-bit flags",
crossref = "Storer:1993:DDC",
pages = "138--147",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253136",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253136",
acknowledgement = ack-nhfb,
}
@InProceedings{Feygin:1993:MEV,
author = "G. Feygin and P. G. Gulak and P. Chow",
title = "Minimizing error and {VLSI} complexity in the
multiplication free approximation of arithmetic
coding",
crossref = "Storer:1993:DDC",
pages = "118--127",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253138",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253138",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1993:RVB,
author = "J. E. Fowler and S. C. Ahalt",
title = "Robust, variable bit-rate coding using entropy-biased
codebooks",
crossref = "Storer:1993:DDC",
pages = "361--370",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253113",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253113",
acknowledgement = ack-nhfb,
}
@Article{Franti:1993:TSM,
author = "Pasi Fr{\"a}nti and Olli Nevalainen",
title = "A two-stage modelling method for compressing binary
images by arithmetic coding",
journal = j-COMP-J,
volume = "36",
number = "7",
pages = "615--622",
month = "????",
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.7.615",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_07/Vol36_07.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/7/615.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_07/Vol36_07.body.html#AbstractFranti",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Turku Univ., Finland",
author-1-adr = "Department of Computer Science, University of Turku
Lemminkaisenkatu 14 A, SF-20520 Turku, Finland",
author-2-adr = "Department of Computer Science, University of Turku
Lemminkaisenkatu 14 A, SF-20520 Turku, Finland",
classcodes = "B6140C (Optical information and image processing);
C5260B (Computer vision and picture processing); B6120B
(Codes); C6130 (Data handling techniques)",
classification = "B6120B (Codes); B6140C (Optical information and
image processing); C5260B (Computer vision and picture
processing); C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic coding; Arithmetic coding; binary image
compression; Binary image compression; compression;
compression ratio; Compression ratio; data; data
compression; Data compression; image coding; QM-coder;
two-stage modelling method; Two-stage modelling
method",
thesaurus = "Data compression; Image coding",
treatment = "T Theoretical or Mathematical",
}
@InProceedings{Freeman:1993:DCV,
author = "G. H. Freeman",
title = "Divergence and the Construction of
Variable-to-Variable-Length Lossless Codes by
Source-Word Extensions",
crossref = "Storer:1993:DDC",
pages = "79--88",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253142",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253142",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Freeman, G. H. (1993) ``Divergence and the
Construction of Variable-to-Variable-Length Lossless
Codes by Source-Word Extensions,'' {\it Proceedings of
the Data Compression Conference (DCC '93)}, pp.
79--88.",
}
@Article{Fulscher:1993:ERI,
author = "Markus P. F{\"u}lscher and Per-Olof Widmark",
title = "An electron repulsion integral compression algorithm",
journal = j-J-COMPUT-CHEM,
volume = "14",
number = "1",
pages = "8--12",
month = jan,
year = "1993",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.540140104",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:20 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "7 Sep 2004",
}
@InProceedings{Grumbach:1993:CDS,
author = "S. Grumbach and F. Tahi",
title = "Compression of {DNA} sequences",
crossref = "Storer:1993:DDC",
pages = "340--350",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253115",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253115",
acknowledgement = ack-nhfb,
}
@Article{Guenter:1993:MCC,
author = "Brian K. Guenter and Hee Cheol Yun and Russell M.
Mersereau",
title = "Motion Compensated Compression of Computer Animation
Frames",
journal = j-COMP-GRAPHICS,
volume = "27",
number = "{Annual Conference Series}",
pages = "297--304",
year = "1993",
CODEN = "CGRADI, CPGPBZ",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Mon Oct 4 18:51:01 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org:80/pubs/citations/proceedings/graph/166117/p297-guenter/",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "ACM; algorithms; computer graphics; performance;
SIGGRAPH",
subject = "{\bf I.3.7} Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Animation. {\bf I.4.2} Computing Methodologies, IMAGE
PROCESSING AND COMPUTER VISION, Compression (Coding),
Exact coding**. {\bf I.3.5} Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and
systems.",
}
@Article{Hammerstrom:1993:NNW,
author = "D. Hammerstrom",
title = "Neural networks at work",
journal = j-IEEE-SPECTRUM,
volume = "30",
number = "6",
pages = "26--32",
month = jun,
year = "1993",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.214579",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Application software; Biological neural networks;
Biology computing; character recognition; Character
recognition; character recognition; Data compression;
Economic indicators; financial data processing;
financial forecasting; function approximation; function
estimation; Hardware; neural nets; Neural networks;
neural networks; OCR; Optical character recognition
software; Pattern recognition; process computer
control; process control",
}
@PhdThesis{Howard:1993:DAE,
author = "Paul Glor Howard",
title = "The design and analysis of efficient lossless data
compression systems",
type = "{Ph.D.} thesis",
school = "Brown University",
address = "Providence, RI, USA",
pages = "135",
year = "1993",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304072223",
acknowledgement = ack-nhfb,
advisor = "Jeffrey Scott Vitter",
classification = "0984: Computer science",
dissertation-thesis-number = "9406956",
subject = "Computer science",
}
@InProceedings{Howard:1993:DAF,
author = "P. G. Howard and J. S. Vitter",
title = "Design and analysis of fast text compression based on
quasi-arithmetic coding",
crossref = "Storer:1993:DDC",
pages = "98--107",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253140",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253140",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1993:FEL,
author = "Paul G. Howard and J. S. Vitter",
title = "Fast and Efficient Lossless Image Compression",
crossref = "Storer:1993:DDC",
pages = "351--360",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253114",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253114",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Howard, Paul G., and J. S. Vitter, (1993) ``Fast and
Efficient Lossless Image Compression,'' in {\it
Proceedings of the 1993 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp. 351--360.",
}
@InProceedings{Hung:1993:ACO,
author = "A. C. Hung and H.-Y. Meng",
title = "Adaptive channel optimization of vector quantized
data",
crossref = "Storer:1993:DDC",
pages = "282--291",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253121",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253121",
acknowledgement = ack-nhfb,
}
@Misc{ISO:1993:ITC,
author = "{ISO/IEC}",
title = "{International Standard IS 11172-3}: Information
Technology---Coding of Moving Pictures and Associated
Audio for Digital Storage Media at up to about 1.5
Mbits/s---Part 3: Audio.",
pages = "??",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ISO/IEC (1993) International Standard IS 11172-3
``Information Technology---Coding of Moving Pictures
and Associated Audio for Digital Storage Media at up to
about 1.5 Mbits/s---Part 3: Audio.''",
}
@Article{Joshi:1993:ISC,
author = "R. L. Joshi and V. J. Crump and T. R. Fischer",
title = "Image Subband Coding Using Arithmetic and Trellis
Coded Quantization",
journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH,
volume = "5",
number = "6",
pages = "515--523",
month = dec,
year = "1993",
CODEN = "ITCTEM",
DOI = "https://doi.org/10.1109/76.475894",
ISSN = "1051-8215 (print), 1558-2205 (electronic)",
ISSN-L = "1051-8215",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Circuits and Systems for Video
Technology",
rawdata = "Joshi, R. L., V. J. Crump, and T. R. Fischer (1993)
``Image Subband Coding Using Arithmetic and Trellis
Coded Quantization,'' {\it IEEE Transactions on
Circuits and Systems Video Technology},
{\bf5}(6):515--523, December.",
}
@Article{Kasperovich:1993:FDC,
author = "L. V. Kasperovich and V. F. Babkin",
title = "Fast Discrete Cosine Transform Approximation for
{JPEG} Image Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "719",
pages = "98--??",
year = "1993",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:49:00 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kossentini:1993:LBR,
author = "F. Kossentini and W. C. Chung and M. J. T. Smith",
title = "Low bit rate coding of {Earth} science images",
crossref = "Storer:1993:DDC",
pages = "371--380",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253112",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253112",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1993:DPT,
author = "J. Lin and J. A. Storer",
title = "Design and performance of tree-structured vector
quantizers",
crossref = "Storer:1993:DDC",
pages = "292--301",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253120",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253120",
acknowledgement = ack-nhfb,
}
@InProceedings{Linder:1993:URC,
author = "T. Linder and G. Lugosi and K. Zeger",
title = "Universality and rates of convergence in lossy source
coding",
crossref = "Storer:1993:DDC",
pages = "89--97",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253141",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253141",
acknowledgement = ack-nhfb,
}
@Article{Manber:1993:SAN,
author = "Udi Manber and Gene Myers",
title = "Suffix Arrays: a New Method for On-Line String
Searches",
journal = j-SIAM-J-COMPUT,
volume = "22",
number = "5",
pages = "935--948",
month = oct,
year = "1993",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/0222058",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
MRclass = "68P10 (68Q25)",
MRnumber = "94e:68045",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/22/5;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
rawdata = "Manber, U., and E. W. Myers (1993) ``Suffix Arrays: A
New Method for On-Line String Searches,'' {\it SIAM
Journal on Computing}, {\bf22}(5):935--948, October.",
xxauthor = "U. Manber and E. W. Myers",
}
@PhdThesis{Markas:1993:DCA,
author = "Tassos Markas",
title = "Data compression: Algorithms and architectures",
type = "{Ph.D.} thesis",
school = "Duke University",
address = "Durham, NC 27708, USA",
pages = "170",
year = "1993",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304040162",
acknowledgement = ack-nhfb,
advisor = "John H. Reif",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9405986",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Markas:1993:MIC,
author = "T. Markas and J. Reif",
title = "Multispectral image compression algorithms",
crossref = "Storer:1993:DDC",
pages = "391--400",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253110",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253110",
acknowledgement = ack-nhfb,
}
@Article{McGeoch:1993:DC,
author = "Catherine C. McGeoch",
title = "Data compression",
journal = j-AMER-MATH-MONTHLY,
volume = "100",
number = "5",
pages = "493--497",
month = may,
year = "1993",
CODEN = "AMMYAE",
DOI = "https://doi.org/10.2307/2324310",
ISSN = "0002-9890 (print), 1930-0972 (electronic)",
ISSN-L = "0002-9890",
MRclass = "94A29 (94-01)",
MRnumber = "1 215 540",
bibdate = "Wed Dec 3 17:17:33 MST 1997",
bibsource = "http://www.jstor.org/journals/00029890.htm;
https://www.math.utah.edu/pub/tex/bib/amermathmonthly1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "American Mathematical Monthly",
journal-URL = "https://www.jstor.org/journals/00029890.htm",
}
@InProceedings{Miller:1993:ISS,
author = "D. Miller and K. Rose",
title = "An improved sequential search multistage vector
quantizer",
crossref = "Storer:1993:DDC",
pages = "12--21",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253149",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253149",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1993:EEC,
author = "A. Moffat and N. Sharman and I. H. Witten and T. C.
Bell",
title = "An empirical evaluation of coding methods for
multi-symbol alphabets",
crossref = "Storer:1993:DDC",
pages = "108--117",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253139",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253139",
acknowledgement = ack-nhfb,
}
@InProceedings{Monro:1993:GFT,
author = "D. M. Monro",
title = "Generalized fractal transforms: complexity issues",
crossref = "Storer:1993:DDC",
pages = "254--261",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253124",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253124",
acknowledgement = ack-nhfb,
}
@InProceedings{Monro:1993:ODQ,
author = "D. M. Monro and B. G. Sherlock",
title = "Optimum {DCT} quantization",
crossref = "Storer:1993:DDC",
pages = "188--194",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253131",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253131",
acknowledgement = ack-nhfb,
}
@InProceedings{Natarajan:1993:FRN,
author = "B. K. Natarajan",
title = "Filtering random noise via data compression",
crossref = "Storer:1993:DDC",
pages = "60--69",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253144",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253144",
acknowledgement = ack-nhfb,
}
@Article{Neidecker-Lutz:1993:SMP,
author = "Burkhard K. Neidecker-Lutz and Robert Ulichney",
title = "Software Motion Pictures",
journal = j-DEC-TECH-J,
volume = "5",
number = "2",
pages = "19--27",
month = "Spring",
year = "1993",
CODEN = "DTJOEL",
ISSN = "0898-901X",
bibdate = "Thu Mar 20 18:15:43 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v5n2/Software_Motion_Pictures_01oct1993DTJA02P8.ps;
http://www.digital.com:80/info/DTJA02/DTJA02SC.TXT",
abstract = "Software motion pictures is a method of generating
digital video on general-purpose desktop computers
without using special decompression hardware. The
compression algorithm is designed for rapid
decompression in software and generates deterministic
data rates for use from CD-ROM and network connections.
The decompression part offers device independence and
integrates well with existing window systems and
application programming interfaces. Software motion
pictures features a portable, low-cost solution to
digital video playback.",
acknowledgement = ack-nhfb,
classcodes = "B6140C (Optical information and image processing);
C6180G (Graphical user interfaces); B6120B (Codes);
C6130B (Graphics techniques); C5260B (Computer vision
and picture processing)",
classification = "B6120B (Codes); B6140C (Optical information and
image processing); C5260B (Computer vision and picture
processing); C6130B (Graphics techniques); C6180G
(Graphical user interfaces)",
fjournal = "Digital Technical Journal",
keywords = "Application programming interfaces; application
programming interfaces; CD-ROM; Compression algorithm;
compression algorithm; data compression; desktop
computers; deterministic data; Deterministic data
rates; digital video; Digital video; general-purpose;
General-purpose desktop computers; graphical user
interfaces; image coding; image processing; network
connections; Network connections; rates; software
motion pictures; Software motion pictures; window
systems; Window systems",
thesaurus = "Data compression; Graphical user interfaces; Image
coding; Image processing",
treatment = "P Practical",
}
@InProceedings{Oehler:1993:CIC,
author = "K. L. Oehler and R. M. Gray",
title = "Combining image classification and image compression
using vector quantization",
crossref = "Storer:1993:DDC",
pages = "2--11",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253150",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253150",
acknowledgement = ack-nhfb,
}
@Article{Pan:1993:DAC,
author = "Davis Yen Pan",
title = "Digital Audio Compression",
journal = j-DEC-TECH-J,
volume = "5",
number = "2",
pages = "28--33 (or 28--40??)",
month = "Spring",
year = "1993",
CODEN = "DTJOEL",
ISSN = "0898-901X",
bibdate = "Thu Mar 20 18:15:43 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v5n2/Digital_Audio_Compression_01oct1993DTJA03P8.ps;
http://www.digital.com:80/info/DTJA03/DTJA03SC.TXT",
abstract = "Compared to most digital data types, with the
exception of digital video, the data rates associated
with uncompressed digital audio are substantial.
Digital audio compression enables more efficient
storage and transmission of audio data. The many forms
of audio compression techniques offer a range of
encoder and decoder complexity, compressed audio
quality, and differing amounts of data compression. The
$ \mu $-law transformation and ADPCM coder are simple
approaches with low-complexity, low-compression, and
medium audio quality algorithms. The MPEG\slash audio
standard is a high-complexity, high-compression, and
high audio-quality algorithm. These techniques apply to
general audio signals and are not specifically tuned
for speech signals.",
acknowledgement = ack-nhfb,
classcodes = "B6120 (Modulation methods); B6140 (Signal processing
and detection)",
classification = "B6120 (Modulation methods); B6140 (Signal processing
and detection)",
fjournal = "Digital Technical Journal",
keywords = "ADPCM coder; audio signals; Compressed audio quality;
compressed audio quality; data compression; Data
compression; data compression; Data rates; data rates;
Decoder; decoder; Digital audio compression; digital
audio compression; encoder; Encoder; MPEG/audio
standard; mu -law; Mu-law transformation; pulse-code
modulation; standards; transformation",
thesaurus = "Audio signals; Data compression; Pulse-code
modulation; Standards",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Pournelle:1993:QOC,
author = "Jerry Pournelle",
title = "The {DOS} 6 Question: Our columnist finds {DOS} 6 is
the least expensive route to disk compression and
memory optimization",
journal = j-BYTE,
volume = "18",
number = "8",
pages = "209--??",
month = jul,
year = "1993",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@TechReport{Powell:1993:DCE,
author = "E. T. Powell",
title = "Data compression enhancements to the distributed
interactive simulation protocol for use by entity-level
simulations",
type = "Report",
number = "UCRL-ID-114812",
institution = "Lawrence Livermore National Laboratory, United States.
Department of Energy",
address = "Livermore, CA, USA",
pages = "18",
year = "1993",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
note = "DE94000957. W-7405-ENG-4.",
URL = "http://www.columbia.edu/cgi-bin/cul/resolve?clio9803512;
http://www.osti.gov/servlets/purl/10188557-PEbS9W/native/",
abstract = "A series of new Protocol Data Units (PDUs) that send
only limited entity-state information over a
distributed Interactive Simulation (DIS) network is
described. These PDUs are tailored specifically to
simulations that model numerous entities rather than
simulator modeling a single entity. The use of these
new PDUs could (under certain circumstances) realize
compression factors of 16, 32, or up to 1200 to one in
the amount of data that needs to be sent over a DIS
network.",
acknowledgement = ack-nhfb,
ajournal = "Data compression enhancements to the distributed
interactive simulation protocol for use by entity-level
simulations",
subject = "Algorithms; Data Processing; Computerized Simulation;
Computer Networks; Military Equipment; Simulators;
Military Strategy; Military Technology, Weaponry, And
National Defense",
}
@InProceedings{Printz:1993:MAC,
author = "H. Printz and P. Stubley",
title = "Multialphabet arithmetic coding at {16 MBytes\slash
sec}",
crossref = "Storer:1993:DDC",
pages = "128--137",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253137",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253137",
acknowledgement = ack-nhfb,
}
@InProceedings{Promhouse:1993:TCT,
author = "G. Promhouse",
title = "Tree compacting transformations",
crossref = "Storer:1993:DDC",
pages = "320--329",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253117",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253117",
acknowledgement = ack-nhfb,
}
@InProceedings{Raittinen:1993:FBI,
author = "H. Raittinen and K. Kaski",
title = "Fractal based image compression with affine
transformations",
crossref = "Storer:1993:DDC",
pages = "244--253",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253125",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253125",
acknowledgement = ack-nhfb,
}
@InProceedings{Rios:1993:HPA,
author = "A. Rios and M. R. Kabuka",
title = "A high performance adaptive image compression system
using a generative neural network: {DynAmic Neural
Network II (DANN II)}",
crossref = "Storer:1993:DDC",
pages = "204--213",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253129",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253129",
acknowledgement = ack-nhfb,
}
@Article{Roth:1993:DC,
author = "Mark A. Roth and Scott J. {Van Horn}",
title = "Database Compression",
journal = j-SIGMOD,
volume = "22",
number = "3",
pages = "31--39",
month = sep,
year = "1993",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/163090.163096",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jan 12 08:45:46 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Electr. and Comput. Eng., Air Force Inst. of
Technol., Wright Patterson AFB, OH, USA",
classification = "C6130 (Data handling techniques); C6160 (Database
management systems (DBMS))",
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
keywords = "Data storage; Data types; Database system; Performance
improvement; Reversible data compression",
thesaurus = "Data compression; Database management systems",
}
@InProceedings{Sadeh:1993:ASM,
author = "I. Sadeh",
title = "On approximate string matching",
crossref = "Storer:1993:DDC",
pages = "148--157",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253135",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253135",
acknowledgement = ack-nhfb,
}
@Article{Sampath:1993:CPS,
author = "Ashwin Sampath and Ahmad C. Ansari",
title = "Combined {Peano} Scan and {VQ} Approach to Image
Compression",
journal = j-IMAGE-VIDEO-PROCESS,
volume = "1903",
pages = "175--186",
year = "1993",
ISSN = "1088-0356",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Image and Video Processing",
rawdata = "Sampath, Ashwin, and Ahmad C. Ansari (1993) ``Combined
Peano Scan and VQ Approach to Image Compression,'' {\it
Image and Video Processing}, Bellingham, WA, SPIE vol.
1903, pp. 175--186.",
}
@InProceedings{Shapiro:1993:EHI,
author = "J. M. Shapiro",
title = "An embedded hierarchical image coder using zerotrees
of wavelet coefficients",
crossref = "Storer:1993:DDC",
pages = "214--223",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253128",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253128",
acknowledgement = ack-nhfb,
}
@Article{Shapiro:1993:EIC,
author = "J. Shapiro",
title = "Embedded Image Coding Using Zerotrees of Wavelet
Coefficients",
journal = j-IEEE-TRANS-SIG-PROC,
volume = "41",
number = "12",
pages = "3445--3462",
month = oct,
year = "1993",
CODEN = "ITPRED",
DOI = "https://doi.org/10.1109/78.258085",
ISSN = "1053-587X (print), 1941-0476 (electronic)",
ISSN-L = "1053-587X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Signal Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78",
rawdata = "Shapiro, J. (1993) ``Embedded Image Coding Using
Zerotrees of Wavelet Coefficients,'' {\it IEEE
Transactions on Signal Processing},
{\bf41}(12):3445--3462, October.",
}
@Misc{Simpson:1993:RPH,
author = "W. Simpson",
title = "{RFC 1549}: {PPP} in {HDLC} Framing",
month = dec,
year = "1993",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Obsoleted by RFC1662, STD0051
\cite{Simpson:1994:RPH,Simpson:1994:SPP}. Status: DRAFT
STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1549.txt;
ftp://ftp.internic.net/rfc/rfc1662.txt;
ftp://ftp.internic.net/rfc/std51.txt;
https://www.math.utah.edu/pub/rfc/rfc1549.txt;
https://www.math.utah.edu/pub/rfc/rfc1662.txt;
https://www.math.utah.edu/pub/rfc/std51.txt",
acknowledgement = ack-nhfb,
format = "TXT=36352 bytes",
obsoletedby = "Obsoleted by RFC1662, STD0051
\cite{Simpson:1994:RPH,Simpson:1994:SPP}.",
online = "yes",
status = "DRAFT STANDARD",
}
@Misc{Simpson:1993:RPP,
author = "W. Simpson",
title = "{RFC 1548}: The Point-to-Point Protocol ({PPP})",
month = dec,
year = "1993",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Obsoleted by RFC1661 \cite{Simpson:1994:RPP}.
Obsoletes RFC1331 \cite{Simpson:1992:RPP}. Updated by
RFC1570 \cite{Simpson:1994:RPL}. Status: DRAFT
STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1331.txt;
ftp://ftp.internic.net/rfc/rfc1548.txt;
ftp://ftp.internic.net/rfc/rfc1570.txt;
ftp://ftp.internic.net/rfc/rfc1661.txt;
https://www.math.utah.edu/pub/rfc/rfc1331.txt;
https://www.math.utah.edu/pub/rfc/rfc1548.txt;
https://www.math.utah.edu/pub/rfc/rfc1570.txt;
https://www.math.utah.edu/pub/rfc/rfc1661.txt",
acknowledgement = ack-nhfb,
format = "TXT=111638 bytes",
obsoletedby = "Obsoleted by Simpson:1994:RPP
\cite{Simpson:1994:RPP}.",
obsoletes = "Obsoletes RFC1331 \cite{Simpson:1992:RPP}.",
online = "yes",
status = "DRAFT STANDARD",
updatedby = "Updated by RFC1570 \cite{Simpson:1994:RPL}.",
}
@Article{Smith:1993:AMC,
author = "Brian C. Smith and Lawrence A. Rowe",
title = "Algorithms for manipulating compressed images",
journal = j-IEEE-CGA,
volume = "13",
number = "5",
pages = "34--42",
month = sep,
year = "1993",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.232097",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
abstract = "A new technique implements operations directly on
compressed JPEG data, yielding performance 50 to 100
times faster than algorithms that must decompress
images before application and compress the result.",
acknowledgement = ack-nhfb,
annote = "A new technique implements operations directly on
compressed JPEG data, yielding performance 50 to 100
times faster than algorithms that must decompress
images before application and compress the result.",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Spinellis:1993:IMAd,
author = "Diomidis Spinellis",
title = "Implementing Multimedia Applications: File Storage and
Compression Methods",
journal = j-WIN-MAGAZINE,
pages = "80--83",
month = jul,
year = "1993",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/spinellis-diomidis.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "In Greek.",
URL = "http://kerkis.math.aegean.gr/~dspin/pubs/trade/1993-Winmag/fastwin4/html/win4.html",
}
@Book{Swan:1993:IWF,
author = "Tom Swan",
title = "Inside {Windows} File Formats",
publisher = pub-SAMS,
address = pub-SAMS:adr,
pages = "??",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Swan, Tom (1993) {\it Inside Windows File Formats},
Indianapolis, IN, Sams Publications.",
}
@PhdThesis{Tan:1993:DCA,
author = "Roland K. D. Tan",
title = "Data Compression Algorithm Using Multi-Pulse Adaptive
Sub-Band Coding ({MASC})",
type = "{Ph.D.} thesis",
school = "University of Essex",
address = "Southend-on-Sea, Essex, UK",
pages = "????",
year = "1993",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304081512",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "C373085",
subject = "Electrical engineering",
}
@Article{Tawbi:1993:VCS,
author = "W. Tawbi and F. Horn and E. Horlait and J.-B.
St{\'e}fani",
title = "Video Compression Standards and Quality of Service",
journal = j-COMP-J,
volume = "36",
number = "1",
pages = "43--54",
month = feb,
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.1.43",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:36 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_01/Vol36_01.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/1/43.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_01/Vol36_01.body.html#AbstractTawbi",
acknowledgement = ack-nhfb,
affiliation = "Lab. MASI, Univ. Pierre et Marie Curie, Paris,
France",
author-1-adr = "Laboratoire MASI, UMPC, 4 place Jussieu, 75252 Paris
Cedex 05, France",
author-2-adr = "CNET PAA/TSA/TLR, 38, 40 Rue du G{\'e}n{\'e}ral
Leclerc 92131 Issy les Moulineaux, France",
author-3-adr = "Laboratoire MASI, UMPC, 4 place Jussieu, 75252 Paris
Cedex 05, France",
author-4-adr = "CNET PAA/TSA/TLR, 38, 40 Rue du G{\'e}n{\'e}ral
Leclerc 92131 Issy les Moulineaux, France",
classcodes = "B6140C (Optical information and image processing);
B6430 (Television equipment, systems and applications);
B6120B (Codes)",
classification = "B6120B (Codes); B6140C (Optical information and
image processing); B6430 (Television equipment, systems
and applications)",
corpsource = "Lab. MASI, Univ. Pierre et Marie Curie, Paris,
France",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "CCITT; Coding schemes; coding schemes; compression
standards; data compression; image coding; Quality of
service; quality of service; standards; video; Video
compression standards; Video representation media;
video representation media; video signals",
thesaurus = "Data compression; Image coding; Standards; Video
signals",
treatment = "P Practical",
}
@InProceedings{Tawel:1993:RTF,
author = "R. Tawel",
title = "Real-time focal-plane image compression",
crossref = "Storer:1993:DDC",
pages = "401--409",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253109",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253109",
acknowledgement = ack-nhfb,
}
@InProceedings{Taylor:1993:MEI,
author = "H. H. Taylor and D. Chin and A. W. Jessup",
title = "A {MPEG} encoder implementation on the {Princeton
Engine} video supercomputer",
crossref = "Storer:1993:DDC",
pages = "420--429",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253107",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253107",
acknowledgement = ack-nhfb,
}
@Article{Teuhola:1993:AFS,
author = "Jukka Teuhola and Timo Raita",
title = "Application of a Finite-State Model to Text
Compression",
journal = j-COMP-J,
volume = "36",
number = "7",
pages = "607--614",
month = "????",
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.7.607",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:38 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/7.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_07/Vol36_07.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/7/607.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_07/Vol36_07.body.html#AbstractTeuhola",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Turku Univ., Finland",
author-1-adr = "Department of Computer Science, University of Turku,
Lemminkaisenkatu 14 A, SF-20520 Turku, Finland",
author-2-adr = "Department of Computer Science, University of Turku,
Lemminkaisenkatu 14 A, SF-20520 Turku, Finland",
classcodes = "C6130D (Document processing techniques); C4220
(Automata theory); C7820 (Humanities); C6180N (Natural
language processing)",
classification = "C4220 (Automata theory); C6130D (Document processing
techniques); C6180N (Natural language processing);
C7820 (Humanities)",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arithmetic; Arithmetic coding; bit-oriented
finite-state model; Bit-oriented finite-state model;
coding; data compression; Dynamic Markov Compression;
escape transition mechanism; Escape transition
mechanism; finite automata; finite-state machine;
Finite-state machine; formal languages; Formal
languages; languages; natural; natural languages;
Natural languages; shortcut creation; Shortcut
creation; state cloning; State cloning; text
compression; Text compression",
thesaurus = "Data compression; Finite automata; Formal languages;
Natural languages",
treatment = "T Theoretical or Mathematical",
}
@Article{Tischer:1993:CBL,
author = "P. E. Tischer and R. T. Worley and A. J. Maeder and M.
Goodwin",
title = "Context-based Lossless Image Compression",
journal = j-COMP-J,
volume = "36",
number = "1",
pages = "68--77",
month = feb,
year = "1993",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/36.1.68",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:36 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/36/1.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_01/Vol36_01.index.html",
URL = "http://comjnl.oxfordjournals.org/content/36/1/68.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_36/Issue_01/Vol36_01.body.html#AbstractTischer",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
Australia",
author-1-adr = "Victorian Centre for Image Processing and Graphics,
Department of Computer Science, Monash University,
Clayton, 3168, Victoria, Australia",
author-2-adr = "Victorian Centre for Image Processing and Graphics,
Department of Computer Science, Monash University,
Clayton, 3168, Victoria, Australia",
author-3-adr = "Victorian Centre for Image Processing and Graphics,
Department of Computer Science, Monash University,
Clayton, 3168, Victoria, Australia",
author-4-adr = "Victorian Centre for Image Processing and Graphics,
Department of Computer Science, Monash University,
Clayton, 3168, Victoria, Australia",
classcodes = "B6140C (Optical information and image processing);
B6120B (Codes)",
classification = "B6120B (Codes); B6140C (Optical information and
image processing)",
corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
Australia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "2D method; arithmetic; Arithmetic encoder;
compression; data compression; encoder; exact lossless;
Exact lossless compression; Grey-scale images;
grey-scale images; image coding; Pixel values; pixel
values; Restricted contexts; restricted contexts;
Two-dimensional method; two-dimensional method",
thesaurus = "Data compression; Image coding",
treatment = "P Practical",
}
@PhdThesis{Tong:1993:DCA,
author = "Tak Yen Tong",
title = "Data compression with arithmetic coding and source
modeling",
type = "{Ph.D.} thesis",
school = "University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "161",
year = "1993",
ISBN = "0-315-81140-4",
ISBN-13 = "978-0-315-81140-9",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL; http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "2 microfiches.",
series = "Canadian theses = Th{\`e}ses canadiennes",
URL = "http://search.proquest.com/docview/304101874",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NN81140",
remark = "Not in Proquest Dissertations \& Theses (PQDT)
database.",
subject = "Electrical engineering",
}
@InProceedings{Tuttle:1993:LPA,
author = "G. T. Tuttle and S. Fallahi and A. A. Abidi",
title = "A low-power analog {CMOS} vector quantizer",
crossref = "Storer:1993:DDC",
pages = "410--419",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253108",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253108",
acknowledgement = ack-nhfb,
}
@Article{Udell:1993:FIE,
author = "Jon Udell",
title = "First Impressions: Easy Does It with {MS-DOS} 6.0:
{Microsoft} adds compression and memory management to
the venerable operating system",
journal = j-BYTE,
volume = "18",
number = "4",
pages = "44--??",
month = apr,
year = "1993",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@InProceedings{Villasenor:1993:FFC,
author = "J. D. Villasenor",
title = "Full-frame compression of tomographic images using the
discrete {Fourier} transform",
crossref = "Storer:1993:DDC",
pages = "195--203",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253130",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253130",
acknowledgement = ack-nhfb,
}
@InProceedings{Watson:1993:VOD,
author = "A. B. Watson",
title = "Visually optimal {DCT} quantization matrices for
individual images",
crossref = "Storer:1993:DDC",
pages = "178--187",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253132",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253132",
acknowledgement = ack-nhfb,
}
@Article{Weiss:1993:PDD,
author = "J. Weiss and D. Schremp",
title = "Putting data on a diet",
journal = j-IEEE-SPECTRUM,
volume = "30",
number = "8",
pages = "36--39",
month = aug,
year = "1993",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.223639",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Access protocols; applications; arithmetic coding;
bandwidth; Bandwidth; bandwidth compression;
Compression algorithms; compression ratios; Computer
industry; Computer networks; Costs; data compression;
Disk drives; encoding; Huffman codes; Image coding;
Internet; latency; Local area networks; lossless
compression; lossy compression; runlength encoding;
storage requirements; throughput; trie-based codes;
WAN",
}
@Misc{Williams:1993:PGC,
author = "Ross N. Williams",
title = "A Painless Guide to {CRC} Error Detection Algorithms",
pages = "??",
year = "1993",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ross.net/crc/download/crc_v3.txt",
acknowledgement = ack-ds,
rawdata = "Williams, Ross N. (1993), ``A Painless Guide to CRC
Error Detection Algorithms,'' available from
|http://ross.net/crc/download/crc_v3.txt|.",
}
@Article{Wong:1993:FWT,
author = "Kwo-Jyr Wong and C. C. Jay Kuo",
title = "A Full Wavelet Transform ({FWT}) Approach to Image
Compression",
journal = j-IMAGE-VIDEO-PROCESS,
volume = "1903",
pages = "153--164",
year = "1993",
CODEN = "",
ISSN = "1088-0356",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Image and Video Processing",
rawdata = "Wong, Kwo-Jyr, and C. C. Jay Kuo (1993) ``A Full
Wavelet Transform (FWT) Approach to Image
Compression,'' {\it Image and Video Processing},
Bellingham, WA, SPIE vol. 1903:153--164.",
}
@InProceedings{Wu:1993:GOB,
author = "X. Wu",
title = "Globally optimal bit allocation",
crossref = "Storer:1993:DDC",
pages = "22--31",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253148",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253148",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1993:SBP,
author = "X. Wu and Y. Fang",
title = "Segmentation-based progressive image coding",
crossref = "Storer:1993:DDC",
pages = "262--271",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253123",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253123",
acknowledgement = ack-nhfb,
}
@InProceedings{Yokoo:1993:AAT,
author = "H. Yokoo",
title = "Application of {AVL} trees to adaptive compression of
numerical data",
crossref = "Storer:1993:DDC",
pages = "310--319",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253118",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253118",
acknowledgement = ack-nhfb,
}
@InProceedings{Zandi:1993:SOP,
author = "A. Zandi and B. Iyer and G. Langdon",
title = "Sort order preserving data compression for extended
alphabets",
crossref = "Storer:1993:DDC",
pages = "330--339",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253116",
bibdate = "Tue Feb 5 14:06:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=253116",
acknowledgement = ack-nhfb,
}
@Article{Zeilberger:1993:TPT,
author = "D. Zeilberger",
title = "Theorems for a Price: Tomorrow's Semi-Rigorous
Mathematical Culture",
journal = j-NAMS,
volume = "40",
number = "8",
pages = "978--981",
month = "Fall",
year = "1993",
CODEN = "AMNOAN",
DOI = "https://doi.org/10.1007/bf03024696",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
rawdata = "Zeilberger, D. (1993) ``Theorems for a Price:
Tomorrow's Semi-Rigorous Mathematical Culture,'' {\it
Notices of the American Mathematical Society},
{\bf40}(8):978--981, October. Reprinted in {\it
Mathematical Intelligencer}, {\bf16}(4):11--14 (Fall
1994).",
}
@InProceedings{Abrahams:1994:HTC,
author = "J. Abrahams",
title = "{Huffman}-type codes for infinite source
distributions",
crossref = "Storer:1994:DDC",
pages = "83--89",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305915",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305915",
acknowledgement = ack-nhfb,
}
@PhdThesis{Acharya:1994:VAA,
author = "Tinku Acharya",
title = "{VLSI} Algorithms and Architectures for Data
Compression",
type = "{Ph.D.} thesis",
school = "University of Central Florida",
address = "Orlando, FL, USA",
pages = "145",
year = "1994",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304145977",
acknowledgement = ack-nhfb,
advisor = "Amar Mukherjee",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9501823",
subject = "Computer science; Electrical engineering",
}
@InCollection{Amir:1994:OTD,
author = "Amihood Amir and Gary Benson and Martin Farach",
booktitle = "Automata, languages and programming ({Jerusalem},
1994)",
title = "Optimal two-dimensional compressed matching",
volume = "820",
publisher = pub-SV,
address = pub-SV:adr,
pages = "215--226",
year = "1994",
DOI = "https://doi.org/10.1007/3-540-58201-0_70",
MRclass = "68U15 (68Q22)",
MRnumber = "1334113 (96e:68141)",
bibdate = "Mon May 26 18:16:34 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
series = "Lecture Notes in Comput. Sci.",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1994:DCM,
author = "Anonymous",
title = "Data Compression on the {Macintosh}",
journal = j-BYTE,
volume = "19",
number = "2",
pages = "62--??",
month = feb,
year = "1994",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@InProceedings{Azhar:1994:DCT,
author = "S. Azhar and G. J. Badros and A. Glodjo and M.-Y. Kao
and J. H. Reif",
title = "Data compression techniques for stock market
prediction",
crossref = "Storer:1994:DDC",
pages = "72--82",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305914",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305914",
acknowledgement = ack-nhfb,
}
@InProceedings{Barnes:1994:NMP,
author = "C. F. Barnes",
title = "A new multiple path search technique for residual
vector quantizers",
crossref = "Storer:1994:DDC",
pages = "42--51",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305911",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305911",
acknowledgement = ack-nhfb,
}
@Article{Bell:1994:RBG,
author = "Timothy C. Bell and Ian H. Witten",
title = "The Relationship between Greedy Parsing and Symbolwise
Text Compression",
journal = j-J-ACM,
volume = "41",
number = "4",
pages = "708--724",
month = jul,
year = "1994",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/179812.179892",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Thu Oct 20 23:22:32 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/179892.html",
abstract = "Text compression methods can be divided into two
classes: {\em symbolwise\/} and {\em parsing}.
Symbolwise methods assign codes to individual symbols,
while parsing methods assign codes to groups of
consecutive symbols (phrases). The set of phrases
available to a parsing method is referred to as a {\em
dictionary}. The vast majority of parsing methods in
the literature use {\em greedy\/} parsing (including
nearly all variations of the popular Ziv--Lempel
methods). When greedy parsing is used, the coder
processes a string from left to right, at each step
encoding as many symbols as possible with a phrase from
the dictionary. This parsing strategy is not optimal,
but an optimal method cannot guarantee a bounded coding
delay.\par
An important problem in compression research has been
to establish the relationship between symbolwise
methods and parsing methods. This paper extends prior
work that shows that there are symbolwise methods that
simulate a subset of greedy parsing methods. We provide
a more general algorithm that takes any {\em
nonadaptive\/} greedy parsing method and constructs a
symbolwise method that achieves exactly the same
compression. Combined with the existence of symbolwise
equivalents for two of the most significant {\em
adaptive\/} parsing methods, this result gives added
weight to the idea that research aimed at increasing
compression should concentrate on symbolwise methods,
while parsing methods should be chosen for speed or
temporary storage considerations.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "adaptive modelling; algorithms; context modeling;
theory; Ziv--Lempel compression",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf H.1.1}: Information
Systems, MODELS AND PRINCIPLES, Systems and Information
Theory, Information theory.",
}
@PhdThesis{Betzos:1994:AFC,
author = "George Anastasios Betzos",
title = "Algorithms for fast compression of quadtree and octree
data using content addressable memories",
type = "{Ph.D.} thesis",
school = "Syracuse University",
address = "Syracuse, NY, USA",
pages = "236",
year = "1994",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304139463",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "9522512",
subject = "Computer science",
}
@InProceedings{Bhaskaran:1994:CHS,
author = "R. Bhaskaran and S. C. Kwatra",
title = "Compression of {HDTV} signals for low bit-rate
transmission using motion compensated subband transform
coding and a self-organization neural network",
crossref = "Storer:1994:DDC",
pages = "195--204",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305927",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305927",
acknowledgement = ack-nhfb,
}
@InProceedings{Bist:1994:DSQ,
author = "A. Bist",
title = "Differential state quantization of high order
{Gauss--Markov} process",
crossref = "Storer:1994:DDC",
pages = "62--71",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305913",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305913",
acknowledgement = ack-nhfb,
}
@Article{Bocharova:1994:TCL,
author = "I. E. Bocharova and V. D. Kolesnik and V. {Yu
Krachkovsky} and B. D. Kudryashov",
title = "On Trellis Codes for Linear Predictive Speech
Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "829",
pages = "115--??",
year = "1994",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:52:14 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Bookstein:1994:MMC,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "{Markov} models for clusters in concordance
compression",
crossref = "Storer:1994:DDC",
pages = "116--125",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305919",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305919",
acknowledgement = ack-nhfb,
}
@Article{Brandenburg:1994:IMA,
author = "Karlheinz Brandenburg and Gerhard Stoll",
title = "{ISO-MPEG-1} Audio: a Generic Standard for Coding of
High-Quality Digital Audio",
journal = j-J-AUDIO-ENG-SOC,
volume = "42",
number = "10",
pages = "780--792",
month = oct,
year = "1994",
CODEN = "ADIOA3",
ISSN = "1549-4950",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of the Audio Engineering Society",
rawdata = "Brandenburg, Karlheinz, and Gerhard Stoll (1994)
``ISO-MPEG-1 Audio: A Generic Standard for Coding of
High-Quality Digital Audio,'' {\it Journal of the Audio
Engineering Society}, {\bf42}(10):780--792, October.",
}
@TechReport{Burrows:1994:BSL,
author = "Michael Burrows and D. J. Wheeler",
title = "A Block-Sorting Lossless Data Compression Algorithm",
type = "Report",
number = "124",
institution = "Digital Systems Research Center",
address = "Palo Alto, CA, USA",
pages = "??",
day = "10",
month = may,
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Burrows, Michael, and D. J. Wheeler (1994) {\it A
Block-Sorting Lossless Data Compression Algorithm},
Digital Systems Research Center Report 124, Palo Alto,
CA, May 10.",
}
@Article{Buyanovsky:1994:AC,
author = "George Buyanovsky",
title = "Associative Coding",
journal = "Monitor",
volume = "8",
pages = "10--19",
month = aug,
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Hard copies of the Russian source and English
translation are available from the authors of this
book. Send requests to the authors' email address found
in the Preface.",
acknowledgement = ack-ds,
language = "Russian",
rawdata = "Buyanovsky, George (1994) ``Associative Coding'' (in
Russian), {\it Monitor}, Moscow, \#8, 10--19, August.
(Hard copies of the Russian source and English
translation are available from the authors of this
book. Send requests to the authors' email address found
in the Preface.)",
}
@Article{Capocelli:1994:BPC,
author = "R. Capocelli and A. {De Santis}",
title = "Binary Prefix Codes Ending in a `$1$'",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "40",
number = "4",
pages = "1296--1302",
month = jul,
year = "1994",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.335933",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Capocelli, R. and A. De Santis (1994) ``Binary Prefix
Codes Ending in a `1','' {\it IEEE Transactions on
Information Theory}, {\bf40}(4):1296--1302, July.",
}
@Article{Chen:1994:CCI,
author = "Yung-Sheng S. Chen and Hung-Tien T. Yen and Wen-Hsing
H. Hsu",
title = "Compression of Color Image via the Technique of
Surface Fitting",
journal = j-CVGIP-GMIP,
volume = "56",
number = "3",
pages = "272--279",
month = may,
year = "1994",
CODEN = "CGMPE5",
DOI = "https://doi.org/10.1006/cgip.1994.1024",
ISSN = "1049-9652",
ISSN-L = "1049-9652",
bibdate = "Wed Mar 8 07:37:05 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=cgip;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.idealibrary.com/links/artid/cgip.1994.1024/production;
http://www.idealibrary.com/links/artid/cgip.1994.1024/production/pdf",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Electr. Eng., Yuan-Ze Inst. of Technol.,
Taoyuan, Taiwan",
classification = "B0290F (Interpolation and function approximation);
B6140C (Optical information and image processing);
C1250 (Pattern recognition); C4130 (Interpolation and
function approximation); C4260 (Computational
geometry); C5260B (Computer vision and picture
processing)",
fjournal = "Computer Vision, Graphics, and Image Processing.
Graphical Models and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/10499652",
keywords = "Activity regions; Adaptive component coding system;
Color image compression; Compression ratios;
Progressive approximation; RGB components; Separation
filter; Spatial domain; Surface fitting; YIQ
components",
thesaurus = "Data compression; Encoding; Image coding; Surface
fitting",
}
@Article{Chu:1994:ICC,
author = "Chyi-Hwa Chu and Ming-Guey Chern and Yuang-Cheh
Hsueh",
title = "Image compression by cardinality distribution",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "18",
number = "5",
pages = "715--722",
month = sep # "--" # oct,
year = "1994",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/0097-8493(94)90166-x",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Wed Feb 5 07:22:58 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Chiao Tung Univ",
affiliationaddress = "Hsinchu, Taiwan",
classification = "723.2; 921.6",
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
journalabr = "Comput Graphics (Pergamon)",
keywords = "Cardinality distribution; Computational methods;
Digital signal processing; Gray level systems; Image
compression; Image quantization; Image reconstruction;
Video signal processing",
}
@InCollection{Coifman:1994:SPC,
author = "Ronald R. Coifman and Yves Meyer and Stephen R. Quake
and Mladen Victor Wickerhauser",
title = "Signal Processing and Compression with Wavelet
Packets",
crossref = "Byrnes:1994:WTA",
pages = "363--379",
year = "1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://math.yale.edu/pub/wavelets/cmqw.tex",
}
@Article{Constantinescu:1994:ITS,
author = "C. Constantinescu and J. A. Storer",
title = "Improved Techniques for Single-Pass Adaptive Vector
Quantization",
journal = j-PROC-IEEE,
volume = "82",
number = "6",
pages = "933--939",
month = jun,
year = "1994",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.286197",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Constantinescu, C., and J. A. Storer (1994b)
``Improved Techniques for Single-Pass Adaptive Vector
Quantization,'' {\it Proceedings of the IEEE},
{\bf82}(6):933--939, June.",
}
@Article{Constantinescu:1994:OAV,
author = "C. Constantinescu and J. A. Storer",
title = "Online Adaptive Vector Quantization with Variable Size
Codebook Entries",
journal = j-INFO-PROC-MAN,
volume = "30",
number = "6",
pages = "745--758",
year = "1994",
CODEN = "IPMADK",
DOI = "https://doi.org/10.1016/0306-4573(94)90003-5",
ISSN = "0306-4573 (print), 1873-5371 (electronic)",
ISSN-L = "0306-4573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Information Processing and Management",
rawdata = "Constantinescu, C., and J. A. Storer (1994a) ``Online
Adaptive Vector Quantization with Variable Size
Codebook Entries,'' {\it Information Processing and
Management}, {\bf30}(6)745--758.",
}
@Article{Cressman:1994:ADC,
author = "David C. Cressman",
title = "Analysis of Data Compression in the {DLT2000} Tape
Drive",
journal = j-DEC-TECH-J,
volume = "6",
number = "2",
pages = "62--71",
month = "Spring",
year = "1994",
CODEN = "DTJOEL",
ISSN = "0898-901X",
bibdate = "Thu Mar 20 18:15:43 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v6n2/Analysis_of_Data_Compression_i_01oct1994DTJE05P8.ps;
http://www.digital.com:80/info/DTJE05/DTJE05SC.TXT",
abstract = "The DLT2000 magnetic tape drive is a state-of-the-art
storage product with a 1.25M-byte-per-second data
throughput rate and a 1.0G-byte capacity, without data
compression. To increase data capacity and throughput
rates, the DLT2000 implements a variant of the
Lempel--Ziv (LZ) data compression algorithm. An LZ
method was chosen over other methods, specifically over
the Improved Data Recording Capability (IDRC)
algorithm, after performance studies showed that the LZ
implementation has superior data throughput rates for
typical data, as well as superior capacity. This paper
outlines the two designs, presents the methodology and
the results of the performance testing, and analyzes
why the LZ implementation is faster, when the IDRC
hardware implementation had twice the bandwidth and was
expected to have faster throughput rates.",
acknowledgement = ack-nhfb,
classcodes = "C5320C (Storage on moving magnetic media)",
classification = "C5320C (Storage on moving magnetic media)",
fjournal = "Digital Technical Journal",
keywords = "art storage product; Bandwidth; bandwidth; capability
algorithm; Data capacity; data capacity; data
compression; Data compression; data recording; DLT2000
magnetic tape drive; hardware; Hardware implementation;
implementation; improved data recording; Improved data
recording capability algorithm; Lempel-; Lempel--Ziv
data compression algorithm; magnetic tape equipment;
magnetic tape storage; performance studies; Performance
studies; state-of-the-; State-of-the-art storage
product; throughput rates; Throughput rates; Ziv data
compression algorithm",
thesaurus = "Data compression; Data recording; Magnetic tape
equipment; Magnetic tape storage",
treatment = "P Practical",
}
@InProceedings{Culik:1994:IAW,
author = "Karel {Culik II} and Jarkko Kari",
editor = "Y. Fisher",
booktitle = "Fractal Image Encoding and Compression",
title = "Inference Algorithm for Weighted Finite Automata and
Image Compression",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Culik, Karel II, and Jarkko Kari (1994b) ``Inference
Algorithm for Weighted Finite Automata and Image
Compression,'' {\it Fractal Image Encoding and
Compression}, Y. Fisher, editor, New York, NY,
Springer-Verlag.",
}
@Article{Culik:1994:IDC,
author = "Karel {Culik II} and J. Kari",
title = "Image-Data Compression Using Edge-Optimizing Algorithm
for {WFA} Inference",
journal = j-INFO-PROC-MAN,
volume = "30",
number = "6",
pages = "829--838",
year = "1994",
CODEN = "IPMADK",
DOI = "https://doi.org/10.1016/0306-4573(94)90010-8",
ISSN = "0306-4573 (print), 1873-5371 (electronic)",
ISSN-L = "0306-4573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Information Processing and Management",
rawdata = "Culik, Karel II, and J. Kari (1994a) ``Image-Data
Compression Using Edge-Optimizing Algorithm for WFA
Inference,'' {\it Journal of Information Processing and
Management}, {\bf30}(6):829--838.",
xxjournal = "Journal of Information Processing and Management",
}
@InProceedings{Das:1994:VDV,
author = "A. Das and A. V. Rao and A. Gersho",
title = "Variable-dimension vector quantization of speech
spectra for low-rate vocoders",
crossref = "Storer:1994:DDC",
pages = "420--429",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305949",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305949",
acknowledgement = ack-nhfb,
}
@Article{DeAgostino:1994:PCP,
author = "Sergio {De Agostino}",
title = "{P}-complete problems in data compression",
journal = j-THEOR-COMP-SCI,
volume = "127",
number = "1",
pages = "181--186",
day = "09",
month = may,
year = "1994",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(94)90106-6",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Oct 31 12:30:22 2000",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&issue=1;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1990.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
note = "See erratum \cite{DeAgostino:2000:EPC}.",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=127&issue=1&aid=1568",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "computational complexity; data compression; P-complete
problems; parallel algorithms; parallel computational
complexity; textual substitution; Ziv--Lempel
algorithm",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{DeCanne:1994:ERC,
author = "B. {De Canne}",
title = "Error-recovery codes",
journal = j-DDJ,
volume = "19",
number = "15",
pages = "44, 46, 48, 50, 92--93",
month = dec,
year = "1994",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Sat Mar 07 07:50:16 1998",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Broadcast and Cable Div., Barco nv, Kortrijk,
Belgium",
classification = "B6120B (Codes)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "BCH; Bose-Chaudhuri-Hocquenghem; Codes; Data errors;
Error-control coding; Error-recovery codes;
Reed--Solomon; RS",
thesaurus = "BCH codes; Error correction codes; Error detection
codes; Reed--Solomon codes",
}
@Article{Degener:1994:DSC,
author = "Jutta Degener",
title = "Digital Speech Compression",
journal = j-DDJ,
volume = "19",
number = "15",
pages = "30, 32, 34, 88--89",
month = dec,
year = "1994",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Sep 04 09:01:48 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Commun. and Oper. Syst. Res. Group, Tech. Univ.
Berlin, Germany",
classification = "B6130 (Speech analysis and processing techniques);
B6150M (Protocols); B6250F (Mobile radio systems);
C5260S (Speech processing techniques); C5640
(Protocols)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "32-Bit; C; GSM 06.10; GSM 06.10 coder and decoder;
RPE-LTP algorithm; Speech compression",
thesaurus = "C listings; Cellular radio; Data compression;
Protocols; Speech analysis and processing",
}
@InProceedings{Effros:1994:VDW,
author = "M. Effros and P. A. Chou and R. M. Gray",
title = "Variable dimension weighted universal vector
quantization and noiseless coding",
crossref = "Storer:1994:DDC",
pages = "2--11",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305907",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305907",
acknowledgement = ack-nhfb,
}
@Article{Fagin:1994:RPF,
author = "B. Fagin and P. Chintrakulchai",
title = "A Reprogrammable Processor for Fractal Image
Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "849",
pages = "129--??",
year = "1994",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:52:14 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Feygin:1994:AAV,
author = "G. Feygin and P. G. Gulak and P. Chow",
title = "Architectural advances in the {VLSI} implementation of
arithmetic coding for binary image compression",
crossref = "Storer:1994:DDC",
pages = "254--263",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305933",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305933",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1994:DVQ,
author = "J. E. Fowler and S. C. Ahalt",
title = "Differential vector quantization of real-time video",
crossref = "Storer:1994:DDC",
pages = "205--214",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305928",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305928",
acknowledgement = ack-nhfb,
}
@Article{Franti:1994:CDI,
author = "Pasi Fr{\"a}nti and Olli Nevalainen and Timo
Kaukoranta",
title = "Compression of digital images by block truncation
coding: a survey",
journal = j-COMP-J,
volume = "37",
number = "4",
pages = "308--332",
month = "????",
year = "1994",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/37.4.308",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:40 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/37/4.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_37/Issue_04/Vol37_04.index.html",
URL = "http://comjnl.oxfordjournals.org/content/37/4/308.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_37/Issue_04/Vol37_04.body.html#AbstractFranti",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Turku Univ., Finland",
author-1-adr = "Department of Computer Science, University of Turku,
Lemminkaisenkatu 14A, FIN-20520 Turku, Finland",
author-2-adr = "Department of Computer Science, University of Turku,
Lemminkaisenkatu 14A, FIN-20520 Turku, Finland",
author-3-adr = "Department of Computer Science, University of Turku,
Lemminkaisenkatu 14A, FIN-20520 Turku, Finland",
classcodes = "B6140C (Optical information and image processing);
B6120B (Codes); C5260B (Computer vision and picture
processing)",
classification = "B6120B (Codes); B6140C (Optical information, image
and video signal processing); C5260B (Computer vision
and image processing techniques)",
corpsource = "Dept. of Comput. Sci., Turku Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm; bit plane coding; Bit plane coding; block
truncation coding; Block truncation coding; combined
BTC algorithm; Combined BTC algorithm; compression
efficiency; Compression efficiency; decoded image;
Decoded image; decoding; digital gray-level; Digital
gray-level images; digital image compression; Digital
image compression; fault tolerance; Fault tolerance;
fault tolerant computing; image; image coding; Image
quality; images; JPEG; JPEG algorithm; lossy; Lossy
moment preserving quantization method; moment
preserving quantization method; quality; quantisation;
quantization data coding; Quantization data coding;
tasks; Tasks; vector",
thesaurus = "Decoding; Fault tolerant computing; Image coding;
Vector quantisation",
treatment = "G General Review",
}
@Article{Gage:1994:NAD,
author = "Philip Gage",
title = "A New Algorithm for Data Compression",
journal = j-CUJ,
volume = "12",
number = "2",
pages = "23--28",
month = feb,
year = "1994",
ISSN = "0898-9788",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/cpp/184402829;
jsessionid=LGSEIODZNDHKIQSNDLRSKHSCJUNN2JVN?_requestid=927467",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "C/C++ Users Journal",
rawdata = "Gage, Philip (1994) ''A New Algorithm for Data
Compression,'' {\it C/C++ Users Journal},
{\bf12}(2)23--28, Feb 01. This is available online at
|http://www.ddj.com/cpp/|\hfil\break
|184402829;jsessionid=LGSEIODZNDHKIQSNDLRSKHSCJUNN2JVN?_requestid=927467|.",
}
@Misc{Ganssle:1994:DC,
author = "Jack G. Ganssle",
title = "Data Compression",
howpublished = "Web document",
year = "1994",
bibdate = "Wed Feb 06 10:11:05 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.avocetsystems.com/company/articles/magazine/acompres.htm",
acknowledgement = ack-nhfb,
}
@InProceedings{Ginesta:1994:VQC,
author = "X. Ginesta and S. P. Kim",
title = "Vector quantization of contextual information for
lossless image compression",
crossref = "Storer:1994:DDC",
pages = "390--399",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305947",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305947",
acknowledgement = ack-nhfb,
}
@InProceedings{Gove:1994:MHI,
author = "R. J. Gove",
title = "The {MVP}: a highly-integrated video compression
chip",
crossref = "Storer:1994:DDC",
pages = "215--224",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305929",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305929",
acknowledgement = ack-nhfb,
}
@InProceedings{Gutmann:1994:HAT,
author = "P. C. Gutmann and T. C. Bell",
title = "A hybrid approach to text compression",
crossref = "Storer:1994:DDC",
pages = "225--233",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305930",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305930",
acknowledgement = ack-nhfb,
}
@Article{Halfhill:1994:HSD,
author = "Tom Halfhill",
title = "How Safe Is Data Compression: On the fly data
compression can double your storage space --- but not
without some hassles and headaches",
journal = j-BYTE,
volume = "19",
number = "2",
pages = "56--??",
month = feb,
year = "1994",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@PhdThesis{Hamidi:1994:WTI,
author = "Seyed Mostafa Hamidi",
title = "Wavelet transform for image data compression",
type = "{Ph.D.} thesis",
school = "The University of Alabama in Huntsville",
address = "Huntsville, AL, USA",
pages = "150",
year = "1994",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304121118",
acknowledgement = ack-nhfb,
advisor = "Reza Adhami",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "9519086",
subject = "Electrical engineering",
}
@InProceedings{Havas:1994:GHH,
author = "G. Havas and B. S. Majewski and N. C. Wormald and Z.
J. Czech",
title = "Graphs, hypergraphs and hashing",
crossref = "vanLeeuwen:1994:GTC",
pages = "153--165",
month = jun,
year = "1994",
bibdate = "Mon Oct 26 08:32:32 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
rawdata = "Havas, G., et al. (1993) {\it Graphs, Hypergraphs and
Hashing}, {\it Proceedings of the International
Workshop on Graph-Theoretic Concepts in Computer
Science (WG'93)}, Berlin, Springer-Verlag.",
}
@InProceedings{Hirschberg:1994:PAD,
author = "D. S. Hirschberg and L. M. Stauffer",
title = "Parsing algorithms for dictionary compression on the
{PRAM}",
crossref = "Storer:1994:DDC",
pages = "136--145",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305921",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305921",
acknowledgement = ack-nhfb,
}
@InProceedings{Hoang:1994:EBM,
author = "D. T. Hoang and P. M. Long and J. S. Vitter",
title = "Explicit bit minimization for motion-compensated video
coding",
crossref = "Storer:1994:DDC",
pages = "175--184",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305925",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305925",
acknowledgement = ack-nhfb,
}
@Article{Howard:1994:DAF,
author = "Paul G. Howard and J. S. Vitter",
title = "Design and Analysis of Fast Text Compression Based on
Quasi-Arithmetic Coding",
journal = j-INFO-PROC-MAN,
volume = "30",
number = "6",
pages = "777--790",
year = "1994",
CODEN = "IPMADK",
DOI = "https://doi.org/10.1016/0306-4573(94)90006-x",
ISSN = "0306-4573 (print), 1873-5371 (electronic)",
ISSN-L = "0306-4573",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.duke.edu/~jsv/Papers/catalog/node91.html",
acknowledgement = ack-ds,
fjournal = "Information Processing and Management",
rawdata = "Howard, Paul G., and J. S. Vitter (1994b) ``Design and
Analysis of Fast text Compression Based on
Quasi-Arithmetic Coding,'' {\it Journal of Information
Processing and Management}, {\bf30}(6):777--790. Also
available from URL\hfil\break
|http://www.cs.duke.edu/~jsv/Papers/catalog/node91.html|.",
xxjournal = "Journal of Information Processing and Management",
}
@InProceedings{Howard:1994:FPL,
author = "Paul G. Howard and J. S. Vitter",
booktitle = "{Proceedings of the Image and Video Compression
Conference: IS\&T/SPIE 1994 Symposium on Electronic
Imaging: Science \& Technology, February 1994, San
Jose, CA}",
title = "Fast Progressive Lossless Image Compression",
volume = "2186",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "98--109",
month = feb,
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Howard, Paul G., and J. S. Vitter (1994a) ``Fast
Progressive Lossless Image Compression,'' Proceedings
of the Image and Video Compression Conference, {\it
IS\&T/SPIE 1994 Symposium on Electronic Imaging:
Science \& Technology}, 2186, San Jose, CA, pp.
98--109, February.",
xxaddress = "San Jose, CA, USA",
}
@InProceedings{Hung:1994:MRQ,
author = "A. C. Hung and T. H.-Y. Meng",
title = "Multidimensional rotations for quantization",
crossref = "Storer:1994:DDC",
pages = "32--41",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305910",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305910",
acknowledgement = ack-nhfb,
}
@InProceedings{Huynh:1994:MDF,
author = "L. Huynh",
title = "Multiplication and division free adaptive arithmetic
coding techniques for bi-level images",
crossref = "Storer:1994:DDC",
pages = "264--273",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305934",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305934",
acknowledgement = ack-nhfb,
}
@InProceedings{Inglis:1994:CBT,
author = "S. Inglis and I. H. Witten",
title = "Compression-based template matching",
crossref = "Storer:1994:DDC",
pages = "106--115",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305918",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305918",
acknowledgement = ack-nhfb,
}
@Misc{ITU-T:1994:ECP,
author = "{ITU-T}",
title = "{ITU-T Recommendation V.42, Revision 1}:
Error-correcting Procedures for {DCEs} Using
Asynchronous-to-Synchronous Conversion",
pages = "??",
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-T (1994) ITU-T Recommendation V.42, Revision 1
``Error-correcting Procedures for DCEs Using
Asynchronous-to-Synchronous Conversion.''",
}
@InProceedings{Iyer:1994:DCS,
author = "Balakrishna R. Iyer and David Wilhite",
title = "Data Compression Support in Databases",
crossref = "Bocca:1994:ICV",
pages = "695--704",
year = "1994",
bibdate = "Fri Jan 12 07:50:34 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb94.html",
URL = "http://www.vldb.org/dblp/db/conf/vldb/vldb94-695.html",
acknowledgement = ack-nhfb,
annote = "Also known as VLDB'94",
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/i/Iyer:Balakrishna_R=.html;
http://www.vldb.org/dblp/db/indices/a-tree/w/Wilhite:David.html",
keywords = "very large data bases; VLDB",
}
@InProceedings{Kiselyov:1994:SSM,
author = "O. Kiselyov and P. Fisher",
title = "Self-similarity of the multiresolutional image\slash
video decomposition: smart expansion as compression of
still and moving pictures",
crossref = "Storer:1994:DDC",
pages = "331--340",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305941",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305941",
acknowledgement = ack-nhfb,
}
@Article{Lamparter:1994:ECC,
author = "B. Lamparter and W. Effelsberg",
title = "{eXtended} Color Cell Compression --- a
Runtime-efficient Compression Scheme for Software
Video",
journal = j-LECT-NOTES-COMP-SCI,
volume = "868",
pages = "181--??",
year = "1994",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:52:14 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Linares:1994:EBT,
author = "I. Linares and R. M. Mersereau and M. J. T. Smith",
title = "Enhancement of block transform coded images using
residual spectra adaptive postfiltering",
crossref = "Storer:1994:DDC",
pages = "321--330",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305940",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305940",
acknowledgement = ack-nhfb,
}
@Article{Luczak:1994:LDC,
author = "T. Luczak and W. Szpankowski",
title = "A Lossy Data Compression Based on String Matching:
Preliminary Analysis and Suboptimal Algorithms",
journal = j-LECT-NOTES-COMP-SCI,
volume = "807",
pages = "102--112",
year = "1994",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Sep 15 10:01:31 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "combinatorial pattern matching; CPM",
}
@Article{Luse:1994:BFF,
author = "Marv Luse",
title = "The {BMP} File Format",
journal = j-DDJ,
volume = "19",
number = "10",
pages = "18--20, 22, 82, 84, 85",
month = sep,
year = "1994",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "When is a standard file format not a standard file
format? When it is the well-known BMP image format. As
Marv points out, the BMP format is actually a sheaf of
formats bundled under the same name. In this article,
he examines BMP's image format incarnations and
presents techniques for encapsulating them, using
C++.",
acknowledgement = ack-nhfb,
affiliation = "Autumn Hill Software",
classification = "723.1; 723.1.1; 723.2; 723.5; 902.2; C6110J
(Object-oriented programming); C6120 (File
organisation); C6130B (Graphics techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Bitmapped graphics; BMP file format; BMP image format;
C (programming language); C++ (programming language);
C++ encapsulation; Computer graphics; Computer
operating systems; Computer software; Data processing;
File format; File organization; Graphics file standard;
Modular implementation; OS/2 (operating system);
Software engineering; Standard file format; Standards;
Windows (operating system)",
thesaurus = "C listings; Computer graphics; Data encapsulation;
File organisation; Object-oriented programming",
}
@Article{Maa:1994:IEB,
author = "Chia-Yiu Y. Maa",
title = "Identifying the Existence of Bar Codes in Compressed
Images",
journal = j-CVGIP-GMIP,
volume = "56",
number = "4",
pages = "352--356",
month = jul,
year = "1994",
CODEN = "CGMPE5",
DOI = "https://doi.org/10.1006/cgip.1994.1032",
ISSN = "1049-9652",
ISSN-L = "1049-9652",
bibdate = "Wed Mar 8 07:37:06 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=cgip;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.idealibrary.com/links/artid/cgip.1994.1032/production;
http://www.idealibrary.com/links/artid/cgip.1994.1032/production/pdf",
acknowledgement = ack-nhfb,
affiliation = "Electron. Data Syst. Corp., Troy, MI, USA",
classification = "B6120B (Codes); B6140C (Optical information and
image processing); B6210H (Facsimile transmission);
C1250 (Pattern recognition); C1260 (Information
theory)",
fjournal = "Computer Vision, Graphics, and Image Processing.
Graphical Models and Image Processing",
journal-URL = "http://www.sciencedirect.com/science/journal/10499652",
keywords = "2-D coding; CCITT Group 4; Code 39 bar codes;
Compressed images; Decompression; Facsimile compression
standard",
thesaurus = "Bar codes; Data compression; Encoding; Facsimile;
Image coding",
}
@InProceedings{Merhav:1994:MRL,
author = "N. Merhav and M. Feder",
title = "The minimax redundancy is a lower bound for most
sources",
crossref = "Storer:1994:DDC",
pages = "52--61",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305912",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305912",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1994:SCD,
author = "A. Moffat and N. Sharman and J. Zobel",
title = "Static compression for dynamic texts",
crossref = "Storer:1994:DDC",
pages = "126--135",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305920",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305920",
acknowledgement = ack-nhfb,
}
@Book{Murray:1994:EGF,
author = "James D. Murray and William vanRyper",
title = "Encyclopedia of Graphics File Formats",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xxxii + 894",
month = jul,
year = "1994",
ISBN = "1-56592-058-9",
ISBN-13 = "978-1-56592-058-3",
LCCN = "T385 .M87 1994",
bibdate = "Mon Apr 18 14:50:41 MDT 2005",
bibsource = "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ora.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$59.95",
URL = "http://www.oreilly.com/catalog/9781565920583",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Murray, James D., and William vanRyper (1994) {\it
Encyclopedia of Graphics File Formats}, Sebastopol, CA,
O'Reilly and Assoc.",
review = "Sys Admin 3(6), 99-106 (1994).",
}
@InProceedings{Nakano:1994:HEU,
author = "Y. Nakano and H. Yahagi and Y. Okada and S. Yoshida",
title = "Highly efficient universal coding with classifying to
subdictionaries for text compression",
crossref = "Storer:1994:DDC",
pages = "234--243",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305931",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305931",
acknowledgement = ack-nhfb,
}
@InProceedings{Natarajan:1994:SBO,
author = "B. K. Natarajan",
title = "Sharper bounds on {Occam} filters and application to
digital video",
crossref = "Storer:1994:DDC",
pages = "440--449",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305951",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305951",
acknowledgement = ack-nhfb,
}
@InProceedings{Nevill-Manning:1994:CIH,
author = "C. G. Nevill-Manning and I. H. Witten and D. L.
Maulsby",
title = "Compression by induction of hierarchical grammars",
crossref = "Storer:1994:DDC",
pages = "244--253",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305932",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305932",
acknowledgement = ack-nhfb,
}
@InProceedings{Orchard:1994:IWB,
author = "M. T. Orchard and K. Ramchandran",
title = "An investigation of wavelet-based image coding using
an entropy-constrained quantization framework",
crossref = "Storer:1994:DDC",
pages = "341--350",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305942",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305942",
acknowledgement = ack-nhfb,
}
@MastersThesis{Patankar:1994:SHA,
author = "Rashmi Arun Patankar",
title = "Software and hardware approaches to data compression
of {IEEE} 64-bit floating point data",
type = "Thesis ({M.S.})",
school = "Iowa State University",
address = "Ames, IA, USA",
pages = "55",
year = "1994",
bibdate = "Sat Feb 24 15:01:45 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Perlmutter:1994:BRW,
author = "K. O. Perlmutter and R. M. Gray and K. L. Oehler and
R. A. Olshen",
title = "{Bayes} risk weighted tree-structured vector
quantization with posterior estimation",
crossref = "Storer:1994:DDC",
pages = "274--283",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305935",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305935",
acknowledgement = ack-nhfb,
}
@InProceedings{Ramchandran:1994:SCE,
author = "K. Ramchandran and M. Vetterli",
title = "Syntax-constrained encoder optimization using adaptive
quantization thresholding for {JPEG\slash MPEG}
coders",
crossref = "Storer:1994:DDC",
pages = "146--155",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305922",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305922",
acknowledgement = ack-nhfb,
}
@Article{Reimer:1994:DAC,
author = "Jay B. Reimer",
title = "{DSP} and Audio Compression",
journal = j-DDJ,
volume = "19",
type = "MM",
number = "??",
pages = "63--??",
month = "????",
year = "1994",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@TechReport{Robinson:1994:SLN,
author = "Tony Robinson",
title = "Simple Lossless and Near-Lossless Waveform
Compression",
type = "Technical Report",
number = "CUED/F-INFENG/TR.156",
institution = "Cambridge University",
address = "Cambridge, UK",
pages = "??",
month = dec,
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://citeseer.nj.nec.com/robinson94shorten.html;
http://citeseerx.ist.psu.edu/viewdoc/",
acknowledgement = ack-ds,
rawdata-1 = "Robinson, Tony (1994) ``Simple Lossless and
Near-Lossless Waveform Compression,'' Technical Report
CUED/F-INFENG/TR.156, Cambridge University, December.
Also at
|http://citeseerx.ist.psu.edu/viewdoc/|\hfil\break
|download?doi=10.1.1.53.7337&rep=rep1&type=ps|.",
rawdata-2 = "Robinson, Tony (1994) ``Simple Lossless and
Near-Lossless Waveform Compression,'' Technical Report
CUED/F-INFENG/TR.156, Cambridge University, December.
Available at
|http://citeseer.nj.nec.com/robinson94shorten.html|.",
}
@TechReport{Robinson:1994:SSL,
author = "Tony Robinson",
title = "{SHORTEN}: Simple lossless and near-lossless waveform
compression",
type = "Technical report",
number = "CUED/F-INFENG/TR.15",
institution = "Cambridge University Engineering Department",
address = "Trumpington Street, Cambridge, CB2 1PZ, UK",
month = dec,
year = "1994",
bibdate = "Sun Jan 27 08:39:38 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This report describes a program that performs
compression of waveform files such as audio data. A
simple predictive model of the waveform is used
followed by Huffman coding of the prediction residuals.
This is both fast and near optimal for many commonly
occurring waveform signals. This framework is then
extended to lossy coding under the conditions of
maximising the segmental signal to noise ratio on a per
frame basis and coding to a fixed acceptable signal to
noise ratio.",
acknowledgement = ack-nhfb,
lastaccess = "27 January 2013",
}
@InProceedings{Rose:1994:ECT,
author = "K. Rose and D. Miller and A. Gersho",
title = "Entropy-constrained tree-structured vector quantizer
design by the minimum cross entropy principle",
crossref = "Storer:1994:DDC",
pages = "12--21",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305908",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305908",
acknowledgement = ack-nhfb,
}
@Article{Ross:1994:ROD,
author = "John W. Ross",
title = "Record-Oriented Data Compression",
journal = j-CUJ,
volume = "12",
number = "4",
pages = "83--??",
month = apr,
year = "1994",
ISSN = "0898-9788",
bibdate = "Fri Aug 30 16:52:23 MDT 1996",
bibsource = "http://www.cuj.com/cbklist.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C Users Journal",
}
@InProceedings{Ruf:1994:HPF,
author = "M. J. Ruf",
title = "A high performance fixed rate compression scheme for
still image transmission",
crossref = "Storer:1994:DDC",
pages = "294--303",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305937",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305937",
acknowledgement = ack-nhfb,
}
@Book{Sabourin:1994:CCP,
author = "Conrad F. Sabourin",
title = "Computational character processing: character coding,
input, output, synthesis, ordering, conversion, text
compression, encryption, display hashing, literate
programming: bibliography",
publisher = "Infolingua",
address = "Montr{\'e}al, PQ, Canada",
pages = "vii + 579",
year = "1994",
ISBN = "2-921173-18-2",
ISBN-13 = "978-2-921173-18-6",
LCCN = "????",
bibdate = "Tue Mar 03 12:09:08 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/litprog.bib",
acknowledgement = ack-nhfb,
}
@Book{Sagan:1994:SFC,
author = "Hans Sagan",
title = "Space-Filling Curves",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "1994",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Sagan, Hans (1994) {\it Space-Filling Curves}, New
York, Springer-Verlag.",
}
@TechReport{Saupe:1994:BTC,
author = "Dietmar Saupe",
title = "Breaking the Time Complexity of Fractal Image
Compression",
number = "53",
institution = "Institut f{\"u}r Informatik, Universit{\"a}t
Freiburg",
address = "Freiburg, Germany",
year = "1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.informatik.uni-freiburg.de/papers/fractal/Saup94a.ps.Z",
}
@InProceedings{Saupe:1994:CRM,
author = "Dietmar Saupe and Raouf Hamzaoui",
editor = "J. M. Blackledge",
booktitle = "Proceedings of the IMA Conference on Image Processing;
Mathematical Methods and Applications",
title = "Complexity Reduction Methods for Fractal Image
Compression",
institution = "Institut f{\"u}r Informatik, Universit{\"a}t
Freiburg",
publisher = "????",
address = "????",
month = sep,
year = "1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.informatik.uni-freiburg.de/papers/fractal/SaHa95a.ps.gz",
}
@Article{Scheuermann:1994:CBI,
author = "P. Scheuermann and A. Yaagoub and M. Aris Ouksel",
title = "Compression of Binary Images on a Hypercube Machine",
journal = j-J-PAR-DIST-COMP,
volume = "23",
number = "1",
pages = "49--59",
month = oct,
year = "1994",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1006/jpdc.1994.1118",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Mar 9 09:18:55 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1118/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1994.1118/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information and
image processing); C1250 (Pattern recognition); C4240P
(Parallel programming and algorithm theory); C5220P
(Parallel architecture); C5260B (Computer vision and
picture processing)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern
Univ., Evanston, IL, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
keywords = "binary images compression; binary pixel array;
condensation procedure; data compression; decoding;
disjoint binary region; encoding; hypercube connected;
hypercube machine; hypercube networks; image coding;
machine; parallel algorithms; representation; S-tree
linear",
treatment = "A Application; P Practical",
}
@Article{Schieber:1994:RRT,
author = "Colleen D. Schieber and Eric E. Johnson",
title = "{RATCHET}: real-time address trace compression
hardware for extended traces",
journal = j-SIGMETRICS,
volume = "21",
number = "3--4",
pages = "22--32",
month = apr,
year = "1994",
CODEN = "????",
DOI = "https://doi.org/10.1145/181840.181842",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 11:16:35 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "The address traces used in computer architecture
research are commonly generated using software
techniques that introduce time dilations of an order of
magnitude or more. Such techniques may also omit
classes of memory references that are important for
accurate models of computer systems, such as
instruction prefetches, operating system references,
and interrupt activity. We describe a technique for
capturing all classes of references in real time.
RATCHET employs trace filtering hardware to reduce the
bandwidth and storage requirements that have previously
limited the usefulness of hardware-based tracing. In
evaluating this technique using the ten SPEC89
benchmark programs running on a Sun-3/60 workstation,
we found that a small filter cache achieves compression
ratios in the 10--30 range during the startup section
of the programs. Traces from the middle sections of the
C programs achieved compression ratios of 20--30, while
the FORTRAN codes produced ratios of 45--84. Traces
from a smaller ionospheric simulator program were
compressed by factors of 100.These filtered traces
typically represent 36 million contiguous references.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Sennhauser:1994:DIC,
author = "Rene Sennhauser and Krystyna W. Ohnesorge",
title = "Document image compression using document analysis and
block-class-specific data compression methods",
journal = "Proceedings of SPIE --- The International Society for
Optical Engineering",
volume = "2186",
pages = "146--155",
year = "1994",
CODEN = "PSISDG",
ISBN = "0-8194-1481-6",
ISBN-13 = "978-0-8194-1481-6",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TA1632 .I452 1994",
bibdate = "Mon May 11 18:35:10 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
abstract = "The huge amount of storage needed for document images
is a major hindrance to widespread use of document
image processing (DIP) systems. Although current DIP
systems store document images in a compressed form,
there is much room for improvement. In this paper, a
nearly-lossless document image compression method is
investigated which preserves the relevant information
of a document. The proposed approach is based on the
segmentation of a document image into different blocks
that are classified into one of several block classes
and compressed by a block-class-specific data
compression method. Whereas image and graphics blocks
are compressed using standard image compression
methods, text blocks are fed into a text and font
recognition module and converted into their textual
representation. Finally, text blocks are compressed by
encoding their textual representation and enough
formatting information to be able to render them as
faithfully as possible to the original document.
Preliminary results show that (1) the achievable
compression ratios compare favorably with standard
document image compression methods for all document
images tested and (2) the quality of the decompressed
image depends on the recognition accuracy of the text
recognition module.",
acknowledgement = ack-nhfb,
affiliation = "Univ. of Zurich, Zurich, Switz",
classification = "723.2",
conference = "Image and Video Compression",
conferenceyear = "1994",
journalabr = "Proc SPIE Int Soc Opt Eng",
keywords = "Block class specific data compression; Data
compression; Document image processing; Document
images; Font recognition; Image analysis; Image
compression; Image processing; Image quality; Nearly
lossless method; Text recognition",
meetingaddress = "San Jose, CA, USA",
meetingdate = "Feb 9--10 1994",
meetingdate2 = "02/09--10/94",
sponsor = "IS\&T --- Soc for Imaging Science and Technology,
Springfield, VA USA; SPIE --- Int Soc for Opt
Engineering, Bellingham, WA USA",
}
@MastersThesis{Shah:1994:EDC,
author = "Jaimin B. Shah",
title = "An evaluation of data compression algorithms using the
communication network simulation",
type = "{M.S.E.} thesis",
school = "The University of Alabama in Huntsville",
address = "Huntsville, AL, USA",
pages = "111",
year = "1994",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304135847",
acknowledgement = ack-nhfb,
advisor = "Mark Maier",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "1360556",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Shamoon:1994:RAL,
author = "T. Shamoon and C. Heegard",
title = "A rapidly adaptive lossless compression algorithm for
high fidelity audio coding",
crossref = "Storer:1994:DDC",
pages = "430--439",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305950",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305950",
acknowledgement = ack-nhfb,
}
@Article{Shlien:1994:GMA,
author = "Seymour Shlien",
title = "Guide to {MPEG-1} Audio Standard",
journal = j-IEEE-TRANS-BROADCAST,
volume = "40",
number = "4",
pages = "206--218",
month = dec,
year = "1994",
CODEN = "IETBAC",
DOI = "https://doi.org/10.1109/11.362938",
ISSN = "0018-9316 (print), 1557-9611 (electronic)",
ISSN-L = "0018-9316",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Broadcasting",
rawdata = "Shlien, Seymour (1994) ``Guide to MPEG-1 Audio
Standard,'' {\it IEEE Transactions on Broadcasting},
{\bf40}(4):206--218, December.",
}
@Misc{Simpson:1994:RPH,
author = "W. Simpson",
title = "{RFC 1662}: {PPP} in {HDLC}-like Framing",
month = jul,
year = "1994",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also STD0051 \cite{Simpson:1994:SPP}. Obsoletes
RFC1549 \cite{Simpson:1993:RPH}. Status: STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1549.txt;
ftp://ftp.internic.net/rfc/rfc1662.txt;
ftp://ftp.internic.net/rfc/std51.txt;
https://www.math.utah.edu/pub/rfc/rfc1549.txt;
https://www.math.utah.edu/pub/rfc/rfc1662.txt;
https://www.math.utah.edu/pub/rfc/std51.txt",
acknowledgement = ack-nhfb,
format = "TXT=48058 bytes",
obsoletes = "Obsoletes RFC1549 \cite{Simpson:1993:RPH}.",
online = "yes",
seealso = "See also STD0051 \cite{Simpson:1994:SPP}.",
status = "STANDARD",
}
@Misc{Simpson:1994:RPL,
author = "W. Simpson",
title = "{RFC 1570}: {PPP LCP} Extensions",
month = jan,
year = "1994",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Updates RFC1548 \cite{Simpson:1993:RPP}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1548.txt;
ftp://ftp.internic.net/rfc/rfc1570.txt;
https://www.math.utah.edu/pub/rfc/rfc1548.txt;
https://www.math.utah.edu/pub/rfc/rfc1570.txt",
acknowledgement = ack-nhfb,
format = "TXT=35719 bytes",
online = "yes",
status = "PROPOSED STANDARD",
updates = "Updates RFC1548 \cite{Simpson:1993:RPP}.",
}
@Misc{Simpson:1994:RPP,
author = "W. Simpson",
title = "{RFC 1661}: The Point-to-Point Protocol ({PPP})",
month = jul,
year = "1994",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "See also STD0051 \cite{Simpson:1994:SPP}. Obsoletes
RFC1548 \cite{Simpson:1993:RPP}. Updated by RFC2153
\cite{Simpson:1997:RPV}. Status: STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1548.txt;
ftp://ftp.internic.net/rfc/rfc1661.txt;
ftp://ftp.internic.net/rfc/rfc2153.txt;
ftp://ftp.internic.net/rfc/std51.txt;
https://www.math.utah.edu/pub/rfc/rfc1548.txt;
https://www.math.utah.edu/pub/rfc/rfc1661.txt;
https://www.math.utah.edu/pub/rfc/rfc2153.txt;
https://www.math.utah.edu/pub/rfc/std51.txt",
acknowledgement = ack-nhfb,
format = "TXT=103026 bytes",
obsoletes = "Obsoletes RFC1548 \cite{Simpson:1993:RPP}.",
online = "yes",
seealso = "See also STD0051 \cite{Simpson:1994:SPP}.",
status = "STANDARD",
updatedby = "Updated by RFC2153 \cite{Simpson:1997:RPV}.",
}
@Misc{Simpson:1994:SPP,
author = "W. Simpson",
title = "{STD 51}: The {Point-to-Point Protocol} ({PPP})",
month = jul,
year = "1994",
bibdate = "Tue May 07 07:08:30 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "See also RFC1661, RFC1662
\cite{Simpson:1994:RPP,Simpson:1994:RPH}. Obsoletes
RFC1549 \cite{Simpson:1993:RPH}.",
URL = "ftp://ftp.isi.edu/in-notes/rfc1549.txt;
ftp://ftp.isi.edu/in-notes/rfc1661.txt;
ftp://ftp.isi.edu/in-notes/rfc1662.txt;
ftp://ftp.isi.edu/in-notes/std/std51.txt;
https://www.math.utah.edu/pub/rfc/rfc1549.txt;
https://www.math.utah.edu/pub/rfc/rfc1661.txt;
https://www.math.utah.edu/pub/rfc/rfc1662.txt;
https://www.math.utah.edu/pub/rfc/std/std51.txt",
acknowledgement = ack-nhfb,
format = "TXT=151158 bytes",
obsoletes = "Obsoletes RFC1549 \cite{Simpson:1993:RPH}.",
online = "yes",
seealso = "See also RFC1661, RFC1662
\cite{Simpson:1994:RPP,Simpson:1994:RPH}.",
}
@InProceedings{Slyz:1994:NVB,
author = "M. J. Slyz and D. L. Neuhoff",
title = "A nonlinear {VQ}-based predictive lossless image
coder",
crossref = "Storer:1994:DDC",
pages = "304--310",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305938",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305938",
acknowledgement = ack-nhfb,
}
@InProceedings{Solomon:1994:VDB,
author = "J. A. Solomon and A. B. Watson and A. Ahumada",
title = "Visibility of {DCT} basis functions: effects of
contrast masking",
crossref = "Storer:1994:DDC",
pages = "361--370",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305944",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305944",
acknowledgement = ack-nhfb,
}
@PhdThesis{Stauffer:1994:PHS,
author = "Lynn Marie Stauffer",
title = "Parallel and high-speed data compression",
type = "{Ph.D.} thesis",
school = "University of California, Irvine",
address = "Irvine, CA, USA",
pages = "113",
year = "1994",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304084505",
acknowledgement = ack-nhfb,
advisor = "Daniel S. Hirschberg",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9500585",
subject = "Computer science; Electrical engineering",
}
@InProceedings{Stubley:1994:AVV,
author = "P. R. Stubley",
title = "Adaptive variable-to-variable length codes",
crossref = "Storer:1994:DDC",
pages = "98--105",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305917",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305917",
acknowledgement = ack-nhfb,
}
@InProceedings{Stubley:1994:ROF,
author = "P. R. Stubley",
title = "On the redundancy of optimum fixed-to-variable length
codes",
crossref = "Storer:1994:DDC",
pages = "90--97",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305916",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305916",
acknowledgement = ack-nhfb,
}
@InProceedings{Takamura:1994:LIC,
author = "S. Takamura and M. Takagi",
title = "Lossless image compression with lossy image using
adaptive prediction and arithmetic coding",
crossref = "Storer:1994:DDC",
pages = "166--174",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305924",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305924",
acknowledgement = ack-nhfb,
}
@InProceedings{Tate:1994:BOL,
author = "S. R. Tate",
title = "Band ordering in lossless compression of multispectral
images",
crossref = "Storer:1994:DDC",
pages = "311--320",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305939",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305939",
acknowledgement = ack-nhfb,
}
@PhdThesis{Than:1994:CID,
author = "Soe Than",
title = "Compression of input data in machine learning from
examples",
type = "{Ph.D.} thesis",
school = "University of Kansas",
address = "Lawrence, KS, USA",
pages = "101",
year = "1994",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304140404",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "9508681",
subject = "Computer science",
}
@InProceedings{VanderKam:1994:CJC,
author = "R. A. {Vander Kam} and P. W. Wong",
title = "Customized {JPEG} compression for grayscale printing",
crossref = "Storer:1994:DDC",
pages = "156--165",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305923",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305923",
acknowledgement = ack-nhfb,
}
@InProceedings{Villasenor:1994:FES,
author = "J. D. Villasenor and B. Belzer and J. Liao",
title = "Filter evaluation and selection in wavelet image
compression",
crossref = "Storer:1994:DDC",
pages = "351--360",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305943",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305943",
acknowledgement = ack-nhfb,
}
@Article{Wallach:1994:AMC,
author = "Dan S. Wallach and Sharma Kunapalli and Michael F.
Cohen",
title = "Accelerated {MPEG} Compression of Dynamic Polygonal
Scenes",
journal = j-COMP-GRAPHICS,
volume = "28",
number = "{Annual Conference Series}",
pages = "193--196",
month = jul,
year = "1994",
CODEN = "CGRADI, CPGPBZ",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Mon Oct 4 18:51:53 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org:80/pubs/citations/proceedings/graph/192161/p193-wallach/",
abstract = "This paper describes a methodology for using the
matrix-vector multiply and scan conversion hardware
present in many graphics workstations to rapidly
approximate the optical flow in a scene. The optical
flow is a 2-dimensional vector field describing the
on-screen motion of each pixel. An application of the
optical flow to MPEG compression is described which
results in improved compression with minimal
overhead.",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "ACM; computer graphics; measurement; performance;
SIGGRAPH; theory",
subject = "{\bf I.2.10} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding. {\bf
I.3.3} Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation. {\bf I.3.7} Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism. {\bf I.4.2} Computing
Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
Compression (Coding).",
}
@InProceedings{Wang:1994:OCV,
author = "X. Wang and S. M. Shende and K. Sayood",
title = "Online compression of video sequences using adaptive
{VQ} codebooks",
crossref = "Storer:1994:DDC",
pages = "185--194",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305926",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305926",
acknowledgement = ack-nhfb,
}
@Article{Watson:1994:ICU,
author = "Andrew B. Watson",
title = "Image Compression Using the Discrete Cosine
Transform",
journal = j-MATHEMATICA-J,
volume = "4",
number = "1",
pages = "81--88",
month = "Winter",
year = "1994",
CODEN = "????",
ISSN = "1047-5974 (print), 1097-1610 (electronic)",
ISSN-L = "1047-5974",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
http://www.mathematica-journal.com/issue/v4i1/",
URL = "http://www.mathematica-journal.com/issue/v4i1/article/81-88_Watson.mj.pdf;
http://www.mathematica-journal.com/issue/v4i1/article/index.html",
abstract = "The discrete cosine transform (DCT) is a technique for
converting a signal into elementary frequency
components. It is widely used in image compression.
Here we develop some simple functions to compute the
DCT and to compress images. These functions illustrate
the power of Mathematica in the prototyping of image
processing algorithms.",
acknowledgement = ack-ble # " and " # ack-ds # " and " # ack-nhfb,
fjournal = "Mathematica Journal",
rawdata = "Watson, Andrew (1994) ``Image Compression Using the
Discrete Cosine Transform,'' {\it Mathematica Journal},
{\bf4}(1):81--88.",
}
@InProceedings{Watson:1994:VDB,
author = "A. B. Watson and J. A. Solomon and A. J. {Ahumada,
Jr.}",
title = "Visibility of {DCT} basis functions: effects of
display resolution",
crossref = "Storer:1994:DDC",
pages = "371--379",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305945",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305945",
acknowledgement = ack-nhfb,
}
@InProceedings{Wesel:1994:BRW,
author = "R. D. Wesel and R. M. Gray",
title = "{Bayes} risk weighted {VQ} and learning {VQ}",
crossref = "Storer:1994:DDC",
pages = "400--409",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305948",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305948",
acknowledgement = ack-nhfb,
}
@InCollection{Wickerhauser:1994:CPC,
author = "Mladen Victor Wickerhauser",
title = "Comparison of Picture Compression Methods: Wavelet,
Wavelet Packet, and Local Cosine Transform Coding",
crossref = "Chui:1994:WTA",
year = "1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@InCollection{Wickerhauser:1994:ECW,
author = "Mladen Victor Wickerhauser and Marie Farge and Eric
Goirand and Eva Wesfreid and Echeyde Cubillo",
title = "Efficiency Comparison of Wavelet Packet and Adapted
Local Cosine Bases for Compression of a Two-dimensional
Turbulent Flow",
crossref = "Chui:1994:WTA",
year = "1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/taormina2.ps.Z",
}
@Book{Witten:1994:MGC,
author = "Ian H. Witten and Alistair Moffat and Timothy C.
Bell",
title = "Managing Gigabytes: Compressing and Indexing Documents
and Images",
publisher = pub-VAN-NOSTRAND-REINHOLD,
address = pub-VAN-NOSTRAND-REINHOLD:adr,
pages = "xiv + 429",
year = "1994",
ISBN = "0-442-01863-0",
ISBN-13 = "978-0-442-01863-4",
LCCN = "TA1637 .W58 1994",
bibdate = "Thu May 12 08:02:54 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
note = "The software for full-text indexing described in this
book, and errata for the book, are available for
anonymous ftp from \path=munnari.oz.au= in the
directory \path=/pub/mg=.",
price = "US\$54.95",
acknowledgement = ack-nhfb,
tableofcontents = "1: Overview \\
2: Text Compression \\
3: Indexing \\
4: Querying \\
5: Index Construction \\
6: Image Compression \\
7: Textual Images \\
8: Mixed Text and Images \\
9: Implementation \\
10: The Information Explosion \\
A: Guide to the mg System",
}
@Article{Witten:1994:SGM,
author = "Ian H. Witten and Timothy C. Bell and Alistair Moffat
and Craig G. Nevill-Manning and Tony C. Smith and
Harold Thimbleby",
title = "Semantic and generative models for lossy text
compression",
journal = j-COMP-J,
volume = "37",
number = "2",
pages = "83--87",
month = "????",
year = "1994",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/37.2.83",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:39 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/37/2.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_37/Issue_02/Vol37_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/37/2/83.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_37/Issue_02/Vol37_02.body.html#AbstractWitten",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Waikato Univ., Hamilton, New
Zealand",
author-1-adr = "Department of Computer Science, University of Waikato,
Hamilton, New Zealand",
author-2-adr = "Department of Computer Science, University of
Canterbury, Christchurch, New Zealand",
author-3-adr = "Department of Computer Science, University of
Melbourne, Melbourne, Australia",
author-4-adr = "Department of Computer Science, University of Waikato,
Hamilton, New Zealand",
author-5-adr = "Department of Computer Science, University of Calgary,
Calgary, Canada",
author-6-adr = "Department of Psychology, University of Stirling,
Stirling, UK",
classcodes = "B6140C (Optical information and image processing);
C6130D (Document processing techniques); C5260B
(Computer vision and picture processing)",
classification = "B6140C (Optical information and image processing);
C5260B (Computer vision and picture processing); C6130D
(Document processing techniques)",
corpsource = "Dept. of Comput. Sci., Waikato Univ., Hamilton, New
Zealand",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Compression factors; compression factors; data
compression; document image processing; Generative
models; generative models; Image coding; image coding;
Image compression; image compression; Lossy text
compression; lossy text compression; Semantic models;
semantic models; Subjective quality; subjective
quality",
thesaurus = "Data compression; Document image processing; Image
coding",
treatment = "P Practical",
}
@Article{Witten:1994:TIC,
author = "Ian H. Witten and T. C. Bell and H. Emberson and S.
Inglis and A. Moffat",
title = "Textual image compression: two-stage lossy/lossless
encoding of textual images",
journal = j-PROC-IEEE,
volume = "82",
number = "6",
pages = "878--888",
month = jun,
year = "1994",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.286192",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Witten, Ian H., T. C. Bell, H. Emberson, S. Inglis,
and A. Moffat, (1994) ``Textual image compression:
two-stage lossy/lossless encoding of textual images,''
{\it Proceedings of the IEEE}, {\bf82}(6):878--888,
June.",
}
@Article{Wood:1994:GDC,
author = "Christopher M. Wood",
title = "General data compression algorithm for space images
using fractal techniques",
journal = j-PROC-SPIE,
volume = "2198",
number = "??",
pages = "1336--1341",
month = "????",
year = "1994",
CODEN = "PSISDG",
ISSN = "????",
ISSN-L = "0277-786X",
LCCN = "TA1632.N478.1992y",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@Article{Woolley:1994:RDP,
author = "Stuart J. Woolley and Donald M. Monro",
title = "Rate-distortion performance of fractal transforms for
image compression",
journal = j-FRACTALS,
volume = "2",
number = "3 (or 6??)",
pages = "395--398",
month = "????",
year = "1994",
CODEN = "FRACEG",
DOI = "https://doi.org/10.1142/s0218348x9400051x",
ISSN = "0218-348X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://dmsun2.bath.ac.uk:8080/people/papers/montreal.ps.gz",
fjournal = "Fractals",
}
@InProceedings{Wu:1994:FBS,
author = "X. Wu and Y. G. Fang",
title = "Fast bintree-structured image coder for high
subjective quality",
crossref = "Storer:1994:DDC",
pages = "284--293",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305936",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305936",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1994:SDM,
author = "Xiaolin Wu and Kaizhong Zhang",
title = "A subjective distortion measure for vector
quantization",
crossref = "Storer:1994:DDC",
pages = "22--31",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305909",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305909",
acknowledgement = ack-nhfb,
}
@InProceedings{Zamir:1994:LQN,
author = "R. Zamir and M. Feder",
title = "On lattice quantization noise",
crossref = "Storer:1994:DDC",
pages = "380--389",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305946",
bibdate = "Tue Feb 5 14:06:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=305946",
acknowledgement = ack-nhfb,
}
@Article{Zeilberger:1994:TPT,
author = "D. Zeilberger",
title = "Theorems for a Price: Tomorrow's Semi-Rigorous
Mathematical Culture",
journal = j-MATH-INTEL,
volume = "16",
number = "4",
pages = "11--14",
month = "????",
year = "1994",
CODEN = "MAINDC",
DOI = "https://doi.org/10.1007/bf03024696",
ISSN = "0343-6993 (print), 1866-7414 (electronic)",
ISSN-L = "0343-6993",
bibdate = "Sun Jan 27 16:03:18 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Reprint of \cite{Zeilberger:1993:TPT}.",
acknowledgement = ack-nhfb,
fjournal = "The Mathematical Intelligencer",
}
@InProceedings{Abousleman:1995:CHI,
author = "G. P. Abousleman",
title = "Compression of hyperspectral imagery using hybrid
{DPCM\slash DCT} and entropy-constrained trellis coded
quantization",
crossref = "Storer:1995:DDC",
pages = "322--331",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515522",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515522",
acknowledgement = ack-nhfb,
}
@TechReport{Acharya:1995:ELC,
author = "Tinku Acharya and Joseph F. J{\'a}J{\'a}",
title = "Enhancing {LZW} Coding Using a Variable-Length Binary
Encoding",
type = "Technical Report",
number = "TR 1995-70",
institution = "Institute for Systems Research, University of
Maryland",
address = "College Park, MD, USA",
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Acharya, Tinku and Joseph F. J\'aJ\'a (1995)
``Enhancing LZW Coding Using a Variable-Length Binary
Encoding,'' Tech Report TR 1995-70, Institute for
Systems Research, University of Maryland.",
}
@InProceedings{Acharya:1995:TBB,
author = "T. Acharya and A. Mukherjee",
title = "A tree based binary encoding of text using {LZW}
algorithm",
crossref = "Storer:1995:DDC",
pages = "463--463",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515573",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515573",
acknowledgement = ack-nhfb,
}
@InProceedings{Aizu:1995:ISM,
author = "M. Aizu and O. Nakagawa and M. Takagi",
title = "An image segmentation method based on a color space
distribution model",
crossref = "Storer:1995:DDC",
pages = "439--439",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515549",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515549",
acknowledgement = ack-nhfb,
}
@InProceedings{Al-Araj:1995:RIV,
author = "A. G. Al-Araj and K. Sayood",
title = "Recursively indexed vector quantization of
non-stationary sources",
crossref = "Storer:1995:DDC",
pages = "450--450",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515560",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515560",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1995:WCM,
author = "Anonymous",
title = "Wavelets Challenge {MPEG}, Fractals --- Developers
claim {300-to-1} compression",
journal = j-BYTE,
volume = "20",
number = "12",
pages = "34--??",
month = dec,
year = "1995",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Mon Aug 19 08:30:25 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@InProceedings{Antoshenkov:1995:BAB,
author = "G. Antoshenkov",
title = "Byte-aligned bitmap compression",
crossref = "Storer:1995:DDC",
pages = "476--476",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515586",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515586",
acknowledgement = ack-nhfb,
}
@PhdThesis{Atteson:1995:FDO,
author = "Kevin Scott Atteson",
title = "A formalism for the design of optimal adaptive text
data compression rules",
type = "{Ph.D.} thesis",
school = "University of Pennsylvania",
address = "Philadelphia, PA, USA",
pages = "148",
year = "1995",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304212670",
acknowledgement = ack-nhfb,
advisor = "Max Mintz",
classification = "0463: Statistics; 0984: Computer science",
dissertation-thesis-number = "9543045",
subject = "Computer science; Statistics",
}
@Article{Bani-Eqbal:1995:ESF,
author = "Behnam Bani-Eqbal",
title = "Enhancing the speed of fractal image compression",
journal = j-OPTICAL-ENG,
volume = "34",
number = "6",
pages = "1705--1710",
month = jun,
year = "1995",
CODEN = "OPEGAR",
DOI = "https://doi.org/10.1117/12.203134",
ISSN = "0091-3286",
ISSN-L = "0091-3286",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://links.uwaterloo.ca/pub/Fractals/Papers/bani95.ps.gz",
fjournal = "Optical Engineering",
}
@Article{Bani-Eqbal:1995:SFI,
author = "Behnam Bani-Eqbal",
title = "Speeding up fractal image compression",
journal = j-PROC-SPIE,
volume = "2418",
number = "??",
address = "San Jose, California",
pages = "67--74",
month = feb,
year = "1995",
CODEN = "PSISDG",
DOI = "https://doi.org/10.1117/12.203134",
ISSN = "????",
ISSN-L = "0277-786X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@InProceedings{Barnes:1995:EWZ,
author = "C. F. Barnes and J. P. Watkins",
title = "Embedded wavelet zerotree coding with direct sum
quantization structures",
crossref = "Storer:1995:DDC",
pages = "252--261",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515515",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515515",
acknowledgement = ack-nhfb,
}
@InProceedings{Barrett:1995:LBD,
author = "C. W. Barrett and R. L. Frost",
title = "Lattice-based designs of direct sum codebooks for
vector quantization",
crossref = "Storer:1995:DDC",
pages = "436--436",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515546",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515546",
acknowledgement = ack-nhfb,
}
@Article{Basile:1995:UHS,
author = "C. Basile and A. P. Cavallerano and M. S. Deiss and R.
Keeler and J. S. Lim and W. C. Luplow and W. H. Paik
and E. Petajan and R. Rast and G. Reitmeier and T. R.
Smith and C. Todd",
title = "The {US HDTV} standard",
journal = j-IEEE-SPECTRUM,
volume = "32",
number = "4",
pages = "36--45",
month = apr,
year = "1995",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.375998",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "code standards; Communication standards; data
compression; digital audio broadcasting; digital data;
digital high-definition television; Digital modulation;
Digital relays; digital television; Dolby AC-3 digital
audio; FCC; Federal Communications Commission; HDTV;
HDTV system; high definition television; Image coding;
modulation; MPEG-2 video compression; multiple
transmission formats; National Information
Infrastructure; telecommunication standards; television
standards; Transform coding; transport protocol;
transport protocols; Transport protocols; TV; US HDTV
standard; vestigial sideband digital modulation; video
coding; Video compression",
}
@InProceedings{Bauer:1995:VCU,
author = "M. Bauer and K. Sayood",
title = "Video coding using $3$-dimensional {DCT} and dynamic
code selection",
crossref = "Storer:1995:DDC",
pages = "451--451",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515561",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515561",
acknowledgement = ack-nhfb,
}
@InProceedings{Belinskaya:1995:NOC,
author = "D. Belinskaya and S. DeAgostino and J. A. Storer",
title = "Near optimal compression with respect to a static
dictionary on a practical massively parallel
architecture",
crossref = "Storer:1995:DDC",
pages = "172--181",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515507",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515507",
acknowledgement = ack-nhfb,
}
@InProceedings{Bhattacharjee:1995:EDC,
author = "S. Bhattacharjee and J. Bhattacharya and P. P.
Chaudhuri",
title = "An efficient data compression hardware based on
cellular automata",
crossref = "Storer:1995:DDC",
pages = "472--472",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515582",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515582",
acknowledgement = ack-nhfb,
}
@InProceedings{Bist:1995:NPQ,
author = "A. Bist",
title = "Narrowband process quantization",
crossref = "Storer:1995:DDC",
pages = "459--459",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515569",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515569",
acknowledgement = ack-nhfb,
}
@InProceedings{Boden:1995:QDB,
author = "A. F. Boden",
title = "Quantization distortion in block transform-compressed
data",
crossref = "Storer:1995:DDC",
pages = "427--427",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515537",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515537",
acknowledgement = ack-nhfb,
}
@Article{Bodlaender:1995:CAT,
author = "Hans L. Bodlaender and Teofilo F. Gonzalez and Ton
Kloks",
title = "Complexity Aspects of Two-Dimensional Data
Compression",
journal = j-NORDIC-J-COMPUT,
volume = "2",
number = "4",
pages = "462--495",
month = "Winter",
year = "1995",
CODEN = "NJCOFR",
ISSN = "1236-6064",
MRclass = "68Q25 (68R10 94A29)",
MRnumber = "96k:68088",
bibdate = "Fri Nov 13 16:14:15 MST 1998",
bibsource = "http://www.cs.helsinki.fi/njc/njc2.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.helsinki.fi/njc/References/bodlaendergk1995:462.html",
acknowledgement = ack-nhfb,
fjournal = "Nordic Journal of Computing",
}
@Article{Bonneau:1995:UCO,
author = "Robert Bonneau",
title = "Using the centroid operator for faster multiresolution
image compression and pattern recognition",
journal = j-PROC-SPIE,
volume = "2569",
pages = "813--824",
year = "1995",
CODEN = "PSISDG",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@InProceedings{Bookstein:1995:MWO,
author = "A. Bookstein and S. T. Klein and T. Raita and P.
Lankinen and C. W. Sze",
title = "Modeling word occurrences for the compression of
concordances",
crossref = "Storer:1995:DDC",
pages = "462--462",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515572",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515572",
acknowledgement = ack-nhfb,
}
@Book{Born:1995:FFH,
author = "G{\"u}nter Born",
title = "The File Formats Handbook",
publisher = pub-ITCP,
address = pub-ITCP:adr,
pages = "xvii + 1274",
year = "1995",
ISBN = "1-85032-117-5, 1-85032-128-0",
ISBN-13 = "978-1-85032-117-0, 978-1-85032-128-6",
LCCN = "QA76.9.F5 B67 1995",
bibdate = "Mon May 11 11:43:52 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sgml.bib",
price = "US\$59.95",
acknowledgement = ack-nhfb,
annote = "{\em From the publisher\/}: Formats covered include:
Database and index files for DBASE and Foxpro;
Spreadsheet file formats for Lotus 1-2-3, Excel, DIF,
SIF, SYLK; Word processing file formats for WORD for
DOS, Wordperfect, Wordstar, AMI Pro, SGML, and the Rich
Text Format (RTF).",
tableofcontents = "Preface \\
ATM: An Introduction \\
Demands on Today's Data Communications Technologies \\
The Evolution of Data Transmission Technologies \\
Contemporary Bandwidth Requirements \\
Communication Technologies for High-Speed Networks \\
Broadband Communication Systems and High-Speed Networks
\\
Leased Lines \\
ISDN: The Integrated Services Digital Network \\
Frame Relay \\
xDSL: Digital Subscriber Lines \\
SONET/SDH: The Synchronous Digital Hierarchy \\
DQDB-Based MANs (Metropolitan Area Networks): CBDS/SMDS
\\
Fiber Channel \\
High-Speed LANs \\
B-ISDN and ATM \\
ATM: Technology for Converged, QoS-Based Networks \\
In Search of New Technologies \\
The Limitations of Ethernet Networks \\
The Limitations of Token Ring and FDDI Networks \\
ATM: Technology for Converged, QoS-Based Networks \\
The Limitations of ISDN \\
The Limitations of Packet over SONET/SDH \\
ATM: Foundation for Large-Scale Converged Networks \\
ATM in Local and Wide Area Networks \\
ATM: Technology and Standards \\
Asynchronous Transfer Mode \\
Communication Basics \\
Asynchronous Transfer Mode (ATM) \\
The Structure of ATM \\
The B-ISDN Reference Model \\
B-ISDN Networks: Configuration and Reference Points \\
ATM: The Physical Layer \\
Transmission Convergence \\
ATM Data Rates \\
ATM in PDH Networks \\
ATM in SDH and SONET Networks \\
ATM Transport Over SDH/SONET Networks \\
Cell-Based Physical Layer \\
Physical Layer Monitoring in ATM Networks: OAM Flows
F1-F3 \\
The ATM Protocol: The ATM Layer \\
The ATM Cell \\
The ATM Layer: User Plane Functions \\
The ATM Layer: Management Plane Functions \\
Metasignaling \\
The ATM Protocol: The ATM Adaptation Layer \\
ATM Adaptation Layer Type 1 (AAL-1) \\
ATM Adaptation Layer Type 2 (AAL-2) \\
ATM Adaptation Layer Type 3/4 (AAL-3/4) \\
ATM Adaptation Layer Type 5 (AAL-5) \\
The Signaling ATM Adaptation Layer \\
Frame-Based ATM \\
ATM over DXI Interfaces \\
Frame-Based User-to-Network Interface (FUN) \\
Frame-Based ATM over SONET/SDH Transport (FAST) \\
Frame-Based ATM Transport over Ethernet (FATE) \\
The ATM Protocol: UNI Signaling \\
The UNI Signaling Message Format \\
The Basic Signaling Processes \\
UNI Connection Setup: The Calling Station \\
Connection Setup at the Station Called \\
Connection Clear-Down \\
Connection Restart \\
Error Handling \\
Comparing ITU-T and ATM Forum UNI Signaling \\
The ATM Protocol: NNI Signaling (B-ISUP, PNNI, AINI)
\\
B-ISUP Signaling. The PNNI Protocol \\
ATM Interworking \\
ATM-LAN Interworking \\
ATM-Frame Relay Interworking \\
ATM-MAN Interworking \\
Loop Emulation Service \\
ATM Network Management \\
The ATM MIB Groups \\
ILMI and SNMP \\
The Link Management MIB Module \\
The Address Registration MIB Module \\
ATM Networks: Design and Planning \\
Designing and Planning ATM Networks \\
ATM End Systems \\
Planning ATM Workgroups \\
Design and Planning of ATM Backbones \\
Testing and Choosing Network Components \\
Application-Related Performance Parameters for ATM
Components \\
Security in ATM Networks \\
Risk Factor",
}
@InCollection{Boss:1995:ACI,
author = "R. D. Boss and E. W. Jacobs",
editor = "Yuval Fisher",
booktitle = "Fractal Image Compression: Theory and Application",
title = "Archetype Classification in an Iterated Transformation
Image Compression Algorithm",
chapter = "4",
publisher = pub-SV,
address = pub-SV:adr,
pages = "79--90",
year = "1995",
ISBN = "0-387-94211-4",
ISBN-13 = "978-0-387-94211-7",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@InProceedings{Bowen-Wright:1995:LCS,
author = "R. Bowen-Wright and K. Sayood",
title = "Lossless compression by simulated annealing",
crossref = "Storer:1995:DDC",
pages = "452--452",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515562",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515562",
acknowledgement = ack-nhfb,
}
@InProceedings{Bradley:1995:WSC,
author = "J. N. Bradley and C. M. Brislawn and D. J. Quinlan and
H. D. Zhang and V. Nuri",
title = "Wavelet subband coding of computer simulation output
using the {A++} array class library",
crossref = "Storer:1995:DDC",
pages = "454--454",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515564",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515564",
acknowledgement = ack-nhfb,
}
@InProceedings{Brown:1995:PRB,
author = "R. Brown and A. F. Boden",
title = "{{\em A posteriori\/}} restoration of block
transform-compressed data",
crossref = "Storer:1995:DDC",
pages = "426--426",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515536",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515536",
acknowledgement = ack-nhfb,
}
@Article{Bryan:1995:CSC,
author = "John Bryan",
title = "Compression Scorecard: Compression's more efficient
than ever if you pick the right code. {Our} scorecards
compare compression quality and speed of seven leading
choices",
journal = j-BYTE,
volume = "20",
number = "5",
pages = "107--??",
month = may,
year = "1995",
CODEN = "BYTEDJ",
ISSN = "0360-5280 (print), 1082-7838 (electronic)",
ISSN-L = "0360-5280",
bibdate = "Tue Jan 2 10:01:41 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "BYTE Magazine",
}
@InProceedings{Bunton:1995:SDD,
author = "S. Bunton",
title = "The structure of {DMC} [dynamic {Markov}
compression]",
crossref = "Storer:1995:DDC",
pages = "72--81",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515497",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515497",
acknowledgement = ack-nhfb,
}
@InProceedings{Buttigieg:1995:MPM,
author = "Victor Buttigieg and P. G. Farrell",
booktitle = "Codes and Cyphers: Cryptography and Coding {IV}",
title = "A {Maximum A-Posteriori (MAP)} Decoding Algorithm For
Variable-Length Error-Correcting Codes",
publisher = "Institute of Mathematics and Its Applications",
address = "Southend-on-sea, Essex, England",
pages = "103--119",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Buttigieg, Victor and P. G. Farrell (1995b) ``A
Maximum A-Posteriori (MAP) Decoding Algorithm For
Variable-Length Error-Correcting Codes,'' {\it Codes
and Cyphers: Cryptography and Coding IV}, Essex,
England, Institute of Mathematics and Its Applications,
pp. 103--119.",
}
@PhdThesis{Buttigieg:1995:VLE,
author = "Victor Buttigieg",
title = "Variable-Length Error-Correcting Codes",
type = "{Ph.D.} Thesis",
school = "University of Manchester",
address = "????",
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Buttigieg, Victor (1995a) {\it Variable-Length
Error-Correcting Codes}, PhD thesis, University of
Manchester.",
}
@InProceedings{Chaddha:1995:HVQ,
author = "Navin Chaddha and Mohan Vishwanath and P. A. Chou",
title = "Hierarchical vector quantization of perceptually
weighted block transforms",
crossref = "Storer:1995:DDC",
pages = "3--12",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515490",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515490",
acknowledgement = ack-nhfb,
}
@Article{Charlap:1995:BFFa,
author = "David Charlap",
title = "The {BMP} File Format. Part 1",
journal = j-DDJ,
volume = "20",
number = "3",
pages = "44, 46--48, 50",
month = mar,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "In the first installment of this two-part article,
David examines how the ``standard'' BMP file format has
been implemented differently on different platforms.",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6130B (Graphics
techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Bitmap file format; Bitmap images; BMP file format;
BMP files; Device-independent bitmap; DOS applications;
OS/2; OS/2 programs; Standard format; Unix; Windows
applications",
thesaurus = "Bit-mapped graphics; File organisation; Software
standards",
}
@Article{Charlap:1995:BFFb,
author = "David Charlap",
title = "The {BMP} File Format. Part 2",
journal = j-DDJ,
volume = "20",
number = "4",
pages = "34, 36--38, 40, 42, 92--93",
month = apr,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Visix Software",
classification = "722.2; 723.1; 723.2; C5260B (Computer vision and
image processing techniques); C6120 (File
organisation); C6130B (Graphics techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Bit interpretation; Bit reading; Bitmap file format;
Bitmap image storage; BMP file forma; Bytes; Codes
(SYMBOLS); Color image processing; Computer operating
systems; Data compression; Data structures; Decoding;
Encoding (symbols); File organization; Graphical user
interfaces; Huffman encoding; Image coding; NonWindows
environments; Pixel; Portable data structures; Run
length encoding; Software package Windows; Windows
applications",
pagecount = "6",
thesaurus = "Bit-mapped graphics; Data compression; Data
structures; Image coding; Image processing",
}
@InProceedings{Chen:1995:FPM,
author = "Shenfeng Chen and J. H. Reif",
title = "Fast pattern matching for entropy bounded text",
crossref = "Storer:1995:DDC",
pages = "282--291",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515518",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515518",
acknowledgement = ack-nhfb,
}
@InProceedings{Cheung:1995:EVL,
author = "Kar-Ming Cheung and A. Kiely",
title = "An efficient variable length coding scheme for an
{IID} source",
crossref = "Storer:1995:DDC",
pages = "182--191",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515508",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515508",
acknowledgement = ack-nhfb,
}
@InProceedings{Chi:1995:EHC,
author = "Chi-Hung Chi and Chi-Kwun Kan and Kwok-Shing Cheng and
Ling Wong",
title = "Extending {Huffman} coding for multilingual text
compression",
crossref = "Storer:1995:DDC",
pages = "437--437",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515547",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515547",
acknowledgement = ack-nhfb,
}
@InProceedings{Chung:1995:NAS,
author = "W. C. Chung and F. Kossentini and M. J. T. Smith",
title = "A new approach to scalable video coding",
crossref = "Storer:1995:DDC",
pages = "381--390",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515528",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515528",
acknowledgement = ack-nhfb,
}
@InProceedings{Cleary:1995:EZF,
author = "J. G. Cleary and W. J. Teahan",
title = "Experiments on the zero frequency problem",
crossref = "Storer:1995:DDC",
pages = "480--480",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515590",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515590",
acknowledgement = ack-nhfb,
}
@Article{Cleary:1995:IAC,
author = "John G. Cleary and Sean A. Irvine and Ingrid
Rinsma-Melchert",
title = "On the insecurity of arithmetic coding",
journal = j-COMPUT-SECUR,
volume = "14",
number = "2",
pages = "167--180",
month = "????",
year = "1995",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:04 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/016740489597050K",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Cleary:1995:ULC,
author = "John G. Cleary and W. J. Teahan and Ian H. Witten",
title = "Unbounded Length Contexts for {PPM}",
crossref = "Storer:1995:DDC",
pages = "52--61",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515495",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515495",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
rawdata = "Cleary, John G., W. J. Teahan, and Ian H. Witten
(1995) ``Unbounded Length Contexts for PPM,'' {\it Data
Compression Conference, 1995}, 52--61.",
}
@InProceedings{Cocurullo:1995:NAV,
author = "F. Cocurullo and F. Lavagetto",
title = "A new algorithm for vector quantization",
crossref = "Storer:1995:DDC",
pages = "456--456",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515566",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515566",
acknowledgement = ack-nhfb,
}
@InProceedings{Constantinescu:1995:ASP,
author = "C. Constantinescu and J. A. Storer",
title = "Application of single-pass adaptive {VQ} to bilevel
images",
crossref = "Storer:1995:DDC",
pages = "423--423",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515533",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515533",
acknowledgement = ack-nhfb,
}
@Article{Cook:1995:ISS,
author = "Gregory W. Cook and Edward J. Delp",
title = "An investigation of scalable {SIMD I/O} techniques
with application to parallel {JPEG} compression",
journal = j-J-PAR-DIST-COMP,
volume = "30",
number = "2",
pages = "111--128",
day = "1",
month = nov,
year = "1995",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1006/jpdc.1995.1132",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Thu Mar 9 09:18:58 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1132/production;
http://www.idealibrary.com/links/doi/10.1006/jpdc.1995.1132/production/pdf",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C5260B (Computer vision and image
processing techniques); C6110P (Parallel programming);
C6130M (Multimedia)",
corpsource = "Comput. Vision and Image Process. Lab., Purdue Univ.,
West Lafayette, IN, USA",
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
keywords = "data compression; image coding; image compression;
JPEG; MasPar MP-1; motion JPEG; multimedia computing;
multimedia systems; parallel algorithms; parallel
implementation; parallel JPEG compression; SIMD I/O
techniques; still-image compression; system; video",
treatment = "P Practical",
}
@InProceedings{Cosman:1995:TSV,
author = "P. C. Cosman and S. M. Perlmutter and K. O.
Perlmutter",
title = "Tree-structured vector quantization with significance
map for wavelet image coding",
crossref = "Storer:1995:DDC",
pages = "33--41",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515493",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515493",
acknowledgement = ack-nhfb,
}
@Article{Crocker:1995:PPN,
author = "Lee Daniel Crocker",
title = "{PNG}: The {Portable Network Graphic} Format",
journal = j-DDJ,
volume = "20",
number = "7",
pages = "36, 38, 40, 42, 44",
month = jul,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "PNG, originally designed as an alternative to GIF, is
a graphics file format that's simple, portable, and
available free-of-charge in source-code form for
reading and writing.",
acknowledgement = ack-ds # " and " # ack-nhfb,
classification = "722.3; 723.1; 723.2; 723.5; 741.1; 902.2; C6130B
(Graphics techniques); C6130E (Data interchange)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; Color computer graphics; Color image
processing; Color matching; Computer graphics; Computer
networks; Computer programming; Computer software;
Computer software portability; GIF; Graphics file
format; Graphics Interchange File; Graphics interchange
file; Huffman coding; Image coding; Image compression;
Interfaces (COMPUTER); PNG; Portable network graphic;
Portable Network Graphic format; Standards;
Transparency information",
pagecount = "5",
rawdata = "Crocker, Lee Daniel (1995) ``PNG: The Portable Network
Graphic Format,'' {\it Dr. Dobb's Journal of Software
Tools}, {\bf20}(7):36--44.",
thesaurus = "Computer graphics; Electronic data interchange;
Software portability; Software standards",
xxpages = "36--44",
}
@InProceedings{Crouse:1995:JOU,
author = "M. Crouse and Kannan Ramchandran",
title = "{JPEG} optimization using an entropy-constrained
quantization framework",
crossref = "Storer:1995:DDC",
pages = "342--351",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515524",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515524",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1995:FSM,
author = "Karel {Culik II} and Jarkko Kari",
title = "Finite State Methods for Compression and Manipulation
of Images",
crossref = "Storer:1995:DDC",
pages = "142--151",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515504",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515504",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Culik, Karel II, and Jarkko Kari (1995) ``Finite State
Methods for Compression and Manipulation of Images,''
{\it DCC '96, Data Compression Conference}, J. Storer,
editor, Los Alamitos, CA, IEEE Computer Society Press,
pp. 142--151.",
}
@Book{Dasarathy:1995:IDC,
editor = "Belur V. Dasarathy",
title = "Image Data Compression: Block Truncation Coding
({BTC}) Techniques",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "1995",
ISBN = "0-8186-6847-4 (paper)",
ISBN-13 = "978-0-8186-6847-0 (paper)",
LCCN = "TA1637 .I423 1995",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Dasarathy, Belur V. (ed.) (1995) {\it Image Data
Compression: Block Truncation Coding (BTC) Techniques},
Los Alamitos, CA, IEEE Computer Society Press.",
subject = "Image processing; Digital techniques; Image
compression; Data processing; Coding theory",
}
@InProceedings{Datcu:1995:CFP,
author = "M. Datcu and G. Schwarz and K. Schmidt and C. Reck",
title = "Correction of fixed pattern background and restoration
of {JPEG} compressed {CCD} images",
crossref = "Storer:1995:DDC",
pages = "424--424",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515534",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515534",
acknowledgement = ack-nhfb,
}
@InProceedings{Datcu:1995:HAJ,
author = "M. Datcu and G. Schwarz and K. Schmidt and C. Reck",
title = "Histogram analysis of {JPEG} compressed images as an
aid in image deblocking",
crossref = "Storer:1995:DDC",
pages = "425--425",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515535",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515535",
acknowledgement = ack-nhfb,
}
@Article{Davis:1995:ASQ,
author = "Geoffrey Davis",
title = "Adaptive Self-Quantization of Wavelet Subtrees: a
Wavelet-Based Theory of Fractal Image Compression",
journal = j-PROC-SPIE,
volume = "2569",
pages = "294--307",
month = jul,
year = "1995",
CODEN = "PSISDG",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.dartmouth.edu/~gdavis/papers/spie_sandiego.ps.g",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@InProceedings{Davis:1995:SQW,
author = "G. Davis",
title = "Self-quantized wavelet subtrees: a wavelet-based
theory for fractal image compression",
crossref = "Storer:1995:DDC",
pages = "232--241",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515513",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515513",
acknowledgement = ack-nhfb,
}
@InProceedings{Delport:1995:AMC,
author = "V. Delport",
title = "Alternative methods for codebook design in vector
quantization",
crossref = "Storer:1995:DDC",
pages = "485--485",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515595",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515595",
acknowledgement = ack-nhfb,
}
@InProceedings{Docef:1995:MFS,
author = "A. Docef and F. Kossentini and W. C. Chung and M. J.
T. Smith",
title = "Multiplication-free subband coding of color images",
crossref = "Storer:1995:DDC",
pages = "352--361",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515525",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515525",
acknowledgement = ack-nhfb,
}
@InProceedings{Du:1995:CCE,
author = "Junchen Du and S. P. Kim",
title = "Classified conditional entropy coding of {LSP}
parameters",
crossref = "Storer:1995:DDC",
pages = "435--435",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515545",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515545",
acknowledgement = ack-nhfb,
}
@Book{ECMA-222,
author = "{ECMA}",
title = "{ECMA-222}: Adaptive Lossless Data Compression
Algorithm",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "1995",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-222.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-222",
}
@InProceedings{Eskicioglu:1995:MDM,
author = "A. M. Eskicioglu",
title = "A multi-dimensional measure for image quality",
crossref = "Storer:1995:DDC",
pages = "469--469",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515579",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515579",
acknowledgement = ack-nhfb,
}
@InProceedings{Estes:1995:EEF,
author = "R. R. {Estes, Jr.} and V. R. Algazi",
title = "Efficient error free chain coding of binary
documents",
crossref = "Storer:1995:DDC",
pages = "122--131",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515502",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515502",
acknowledgement = ack-nhfb,
}
@InProceedings{Farach:1995:SML,
author = "Martin Farach and Mikkel Thorup",
title = "String matching in {Lempel--Ziv} compressed strings",
crossref = "ACM:1995:PTS",
pages = "703--712",
year = "1995",
bibdate = "Wed Feb 20 18:34:02 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/225058/p703-farach/p703-farach.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/225058/p703-farach/",
acknowledgement = ack-nhfb,
}
@Article{Feder:1995:CPG,
author = "T. Feder and R. Motwani",
title = "Clique Partitions, Graph Compression and Speeding-Up
Algorithms",
journal = j-J-COMP-SYS-SCI,
volume = "51",
number = "2",
pages = "261--272",
month = oct,
year = "1995",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1006/jcss.1995.1065",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:26:29 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000085710653",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@InProceedings{Feder:1995:UCA,
author = "M. Feder and N. Merhav",
title = "Universal coding for arbitrarily varying sources and
for hierarchies of model classes",
crossref = "Storer:1995:DDC",
pages = "82--91",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515498",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515498",
acknowledgement = ack-nhfb,
}
@InProceedings{Feig:1995:ICU,
author = "Ephraim Feig and Heidi Peterson and Viresh Ratnakar",
title = "Image Compression Using Spatial Prediction",
crossref = "IEEE:1995:IPIa",
volume = "4",
pages = "2339--2342",
month = may,
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Feig, Ephraim, Heidi Peterson, and Viresh Ratnakar
(1995) ``Image Compression Using Spatial Prediction,''
{\it International Conference on Acoustics, Speech, and
Signal Processing, ICASSP-95}, {\bf4}:2339--2342,
May.",
}
@Article{Fenwick:1995:DZL,
author = "P. Fenwick",
title = "Differential {Ziv--Lempel} Text Compression",
journal = j-J-UCS,
volume = "1",
number = "8",
pages = "591--602",
day = "28",
month = aug,
year = "1995",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed May 28 19:32:35 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/differential_ziv_lempel_text_compression",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@InProceedings{Fenwick:1995:VQW,
author = "P. M. Fenwick and S. A. Woolford",
title = "Vector quantisation for wavelet based image
compression",
crossref = "Storer:1995:DDC",
pages = "465--465",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515575",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515575",
acknowledgement = ack-nhfb,
}
@InProceedings{Ferens:1995:AWS,
author = "K. Ferens and W. Kinsner",
title = "Adaptive wavelet subband coding for music
compression",
crossref = "Storer:1995:DDC",
pages = "460--460",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515570",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515570",
acknowledgement = ack-nhfb,
}
@Book{Fisher:1995:FIC,
editor = "Yuval Fisher",
title = "Fractal Image Compression: Theory and Application",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "1995",
ISBN = "0-387-94211-4",
ISBN-13 = "978-0-387-94211-7",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Fisher, Yuval (ed.) (1995) {\it Fractal Image
Compression: Theory and Application}, New York,
Springer-Verlag.",
}
@InProceedings{Forchhammer:1995:CPH,
author = "S. Forchhammer and J. Rissanen",
title = "Coding with partially hidden {Markov} models",
crossref = "Storer:1995:DDC",
pages = "92--101",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515499",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515499",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1995:OLP,
author = "J. E. Fowler and R. Yagel",
title = "Optimal linear prediction for the lossless compression
of volume data",
crossref = "Storer:1995:DDC",
pages = "458--458",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515568",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515568",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1995:QBJ,
author = "B. Fowler and R. Arps and A. {El Gamal} and D. Yang",
title = "Quadtree based {JBIG} compression",
crossref = "Storer:1995:DDC",
pages = "102--111",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515500",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515500",
acknowledgement = ack-nhfb,
}
@InProceedings{Galvagno:1995:CGI,
author = "G. Galvagno and G. A. Mian and R. Rinaldo",
title = "Coding gain of intra\slash inter-frame subband
systems",
crossref = "Storer:1995:DDC",
pages = "449--449",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515559",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515559",
acknowledgement = ack-nhfb,
}
@InProceedings{Gao:1995:CLL,
author = "Zheng Gao and Feng Chen and B. Belzer and J.
Villasenor",
title = "A comparison of the {$Z$}, {$ E_8$} and {Leech}
lattices for image subband quantization",
crossref = "Storer:1995:DDC",
pages = "312--321",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515521",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515521",
acknowledgement = ack-nhfb,
}
@InProceedings{Ginesta:1995:DFF,
author = "X. Ginesta and S. P. Kim",
title = "A derailment-free finite-state vector quantizer with
optimized state codebooks",
crossref = "Storer:1995:DDC",
pages = "152--161",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515505",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515505",
acknowledgement = ack-nhfb,
}
@PhdThesis{Ginesta:1995:DHO,
author = "Xavier Ginesta",
title = "Design of high-order statistical models of an
information source and their application to data
compression",
type = "{Ph.D.} thesis",
school = "Polytechnic University",
address = "New York, NY, USA",
pages = "126",
year = "1995",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304209689",
acknowledgement = ack-nhfb,
advisor = "Seung P. Kim",
classification = "0463: Statistics; 0544: Electrical engineering;
0984: Computer science",
dissertation-thesis-number = "9529903",
subject = "Electrical engineering; Computer science; Statistics",
}
@InProceedings{Gisladottir:1995:ORM,
author = "J. V. Gisladottir and M. T. Orchard",
title = "Optimal representation of motion fields for video
compression",
crossref = "Storer:1995:DDC",
pages = "401--410",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515530",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515530",
acknowledgement = ack-nhfb,
}
@InProceedings{Goyal:1995:QOE,
author = "V. K. Goyal and M. Vetterli and N. T. Thao",
title = "Quantization of overcomplete expansions",
crossref = "Storer:1995:DDC",
pages = "13--22",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515491",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515491",
acknowledgement = ack-nhfb,
}
@InProceedings{Guha:1995:PIC,
author = "R. Guha and R. K. Pollock",
title = "Parallel image compression using vector quantization",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515599",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515599",
acknowledgement = ack-nhfb,
}
@TechReport{Hafner:1995:ACW,
author = "Ullrich Hafner",
title = "Asymmetric Coding in $ (m)$-{WFA} Image Compression",
type = "Report",
number = "132",
institution = "Department of Computer Science, University of
W{\"u}rzburg",
address = "W{\"u}rzburg, Germany",
pages = "??",
month = dec,
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Hafner, Ullrich (1995) ``Asymmetric Coding in
$(m)$-WFA Image Compression,'' Report 132, Department
of Computer Science, University of W{\"u}rzburg,
December.",
}
@Article{Hamalainen:1995:VRG,
author = "J. Hamalainen",
title = "Video recording goes digital",
journal = j-IEEE-SPECTRUM,
volume = "32",
number = "4",
pages = "76--79",
month = apr,
year = "1995",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.376006",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Broadcast technology; Computer aided manufacturing;
Costs; data compression; digital communication; Digital
magnetic recording; digital processes; Digital
recording; digital television; Digital video
broadcasting; disk storage; Games; HDTV; high
definition television; Standards development; video
coding; Video compression; video discs; video
recording; Video recording; video tape recorders",
}
@InProceedings{Hamzaoui:1995:CCS,
author = "Raouf Hamzaoui",
title = "Codebook clustering by self-organizing maps for
fractal image compression",
crossref = "Fisher:1995:NAF",
month = jul,
year = "1995",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.informatik.uni-freiburg.de/papers/fractal/Hamz95.ps.gz",
}
@PhdThesis{Hatton:1995:ODC,
author = "Edward Douglas Hatton",
title = "Optimized data compression in the absence of a priori
probabilities",
type = "{Ph.D.} thesis",
school = "University of Waterloo",
address = "Waterloo, ON, Canada",
pages = "141",
year = "1995",
ISBN = "0-315-99808-3",
ISBN-13 = "978-0-315-99808-7",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304299385",
acknowledgement = ack-nhfb,
advisor = "George H. Freeman",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "NN99808",
subject = "Electrical engineering",
}
@InProceedings{Hoang:1995:MDC,
author = "D. T. Hoang and P. M. Long and J. S. Vitter",
title = "Multiple-dictionary compression using partial
matching",
crossref = "Storer:1995:DDC",
pages = "272--281",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515517",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515517",
acknowledgement = ack-nhfb,
}
@Article{Hoces:1995:MRF,
author = "Carlos Hoces",
title = "Media reviews: Fractal compression theory: {{\em Image
Compression Using Fractals}, edited by Yuval Fisher
(Springer-Verlag, 1995, ISBN 0-387-94211-4, 324 pp.,
\$49.50)}",
journal = j-IEEE-MULTIMEDIA,
volume = "2",
number = "3",
pages = "76--76",
month = "Fall",
year = "1995",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/mmul.1995.410524",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 29 16:49:41 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Book{Holzmann:1995:EHD,
author = "Gerard J. Holzmann and Bj{\"o}rn Pehrson",
title = "The Early History of Data Networks",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://labit501.upct.es/ips/libros/TEHODN/ch-2-5.3.html",
acknowledgement = ack-ds,
rawdata = "Holzmann, Gerard J. and Bj{\"o}rn Pehrson (1995) {\it
The Early History of Data Networks}, Los Alamitos, CA,
IEEE Computer Society Press. This is available online
at\hfil\break
|http://labit501.upct.es/ips/libros/TEHODN/ch-2-5.3.html|.",
remark = "URL no longer accessible on 28 January 2013.",
}
@InProceedings{Horspool:1995:ENG,
author = "R. N. Horspool",
title = "The effect of non-greedy parsing in {Ziv--Lempel}
compression methods",
crossref = "Storer:1995:DDC",
pages = "302--311",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515520",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515520",
acknowledgement = ack-nhfb,
}
@Article{Hsu:1995:ASC,
author = "William H. Hsu and Amy E. Zwarico",
title = "Automatic synthesis of compression techniques for
heterogeneous files",
journal = j-SPE,
volume = "25",
number = "10",
pages = "1097--1116",
month = oct,
year = "1995",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.4380251003",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat May 31 13:36:16 MDT 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
abstract = "We present a compression technique for heterogeneous
files, those files which contain multiple types of data
such as text, images, binary, audio, or animation. The
system uses statistical methods to determine the best
algorithm to use in compressing each block of data in a
file (possibly a different algorithm for each block).
The file is then compressed by applying the appropriate
algorithm to each block. We obtain better savings than
possible by using a single algorithm for compressing
the file. The implementation of a working version of
this heterogeneous compressor is described, along with
examples of its value toward improving compression both
in theoretical and applied contexts. We compare our
results with those obtained using four commercially
available compression programs, PKZIP, Unix compress,
STuffIt, and Compact Pro, and show that our system
provides better space savings.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "723.1; 723.2; 723.5; 921.6; 922.2",
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
journalabr = "Software Pract Exper",
keywords = "Adaptive algorithms; Automatic synthesis; Computer
software; Data compression; File organization;
Heterogeneous files; Program synthesis; Redundancy;
Redundancy metrics; Software engineering; Statistical
methods",
}
@Book{ISO:1995:IIIl,
author = "{ISO}",
title = "{ISO\slash IEC 10918-2:1995: Information technology
--- Digital compression and coding of continuous-tone
still images: Compliance testing}",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "181",
year = "1995",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon May 01 05:30:09 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
price = "????",
URL = "http://www.iso.ch/cate/d20689.html",
acknowledgement = ack-nhfb,
keywords = "JPEG",
pricecode = "??",
}
@Article{Jacquet:1995:ABL,
author = "Philippe Jacquet and Wojciech Szpankowski",
title = "Asymptotic behavior of the {Lempel--Ziv} parsing
scheme and digital search trees",
journal = j-THEOR-COMP-SCI,
volume = "144",
number = "1--2",
pages = "161--197",
day = "26",
month = jun,
year = "1995",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(94)00298-w",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:10 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=144&issue=1-2&aid=1932",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B6120B (Codes);
C1160 (Combinatorial mathematics); C4240 (Programming
and algorithm theory); C6120 (File organisation); C6130
(Data handling techniques)C4210 (Formal logic)",
corpsource = "Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "analytical techniques; asymptotic behavior; data
compression; de-Poissonization; differential-functional
equations; digital search trees; grammars; Lempel--Ziv
parsing scheme; Markovian models; Mellin transform;
memoryless source; multiplicative
differential-functional equation; probabilistic
techniques; renewal equation; shortest substring; tree
searching; trees (mathematics); unequal probabilities;
uniform integrability; variable phrases",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
xxtitle = "Asymptotic behaviour of the {Lempil-Ziv} parsing
scheme in digital search trees",
}
@Article{Jayant:1995:ACT,
author = "Nikil S. Jayant and Edward Y. Chen",
title = "Audio compression: technology and applications",
journal = j-ATT-TECH-J,
volume = "74",
number = "2",
pages = "23--34",
year = "1995",
CODEN = "ATJOEM",
DOI = "https://doi.org/10.1002/j.1538-7305.1995.tb00398.x",
ISSN = "2376-676X (print), 8756-2324 (electronic)",
ISSN-L = "8756-2324",
bibdate = "Fri Nov 12 13:11:10 2010",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/bstj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Recent algorithms for perceptual audio coding have
provided the capability of compressing compact disk
(CD)-stereo audio material (at 1,406 kbits/s) into
rates approximating 128 kbits/s. This capability has
enabled the development of several new classes of
applications in audio transmission, broadcasting, and
storage. In exploring the opportunities provided by
these applications, rapid progress is occurring in
three related technologies: signal processing and
computing, for the creation of inexpensive audio
decoders; communication techniques, for reliable
transmission of compressed audio over radio channels;
and, advanced memory, to supplement or replace the
magnetic and optical media currently used to store
high-quality audio. Perceptual audio coding will also
enable the delivery of AM to FM-grade audio signals
over voice-band modems at rates of about 32 kbits/s.",
acknowledgement = ack-nhfb,
fjournal = "AT\&T Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
keywords = "algorithms; audio coding; audio recording; audio
signals; bandwidth; codecs; data compression; digital
audio broadcasting; modems; signal processing;
technology; voice/data communication systems",
subject = "audio compression; perceptual audio coding; CD stereo
audio; audio transmission; audio broadcasting; audio
storage; inexpensive audio decoders; radio channel
transmission; AM/FM-grade audio signals; voice-band
modems; 128 kbit/s; 32 kbit/s",
topic = "speech coding",
}
@InProceedings{Jiang:1995:ILD,
author = "Jianmin Jiang",
title = "Improving {LZFG} data compression algorithm",
crossref = "Storer:1995:DDC",
pages = "475--475",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515585",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515585",
acknowledgement = ack-nhfb,
}
@InProceedings{Jung:1995:RTV,
author = "Bongjin Jung and W. P. Burleson",
title = "Real-time {VLSI} compression for high-speed wireless
local area networks",
crossref = "Storer:1995:DDC",
pages = "431--431",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515541",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515541",
acknowledgement = ack-nhfb,
}
@InProceedings{Kam:1995:LCC,
author = "R. A. {Vander Kam} and R. M. Gray",
title = "Lossy compression of clustered-dot halftones using
sub-cell prediction",
crossref = "Storer:1995:DDC",
pages = "112--121",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515501",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515501",
acknowledgement = ack-nhfb,
}
@InProceedings{Kanai:1995:OCI,
author = "J. Kanai and S. Latifi and G. Rajarathinam and G. Nagy
and H. Bunke",
title = "Operations on compressed image data",
crossref = "Storer:1995:DDC",
pages = "432--432",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515542",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515542",
acknowledgement = ack-nhfb,
}
@InProceedings{Kawashima:1995:UCD,
author = "T. Kawashima and T. Igarashi and R. Hines and M.
Ogawa",
title = "A universal compressed data format for foreign file
systems",
crossref = "Storer:1995:DDC",
pages = "429--429",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515539",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515539",
acknowledgement = ack-nhfb,
}
@Book{Kay:1995:GFF,
author = "David C. Kay and John R. Levine",
title = "Graphics File Formats",
publisher = pub-WINDCREST,
address = pub-WINDCREST:adr,
edition = "Second",
pages = "xx + 476",
year = "1995",
ISBN = "0-07-034025-0",
ISBN-13 = "978-0-07-034025-1",
LCCN = "T385.K376 1995",
bibdate = "Sat Oct 10 12:44:04 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$29.95",
acknowledgement = ack-nhfb,
libnote = "Not yet in my library.",
}
@InProceedings{Kedem:1995:ASH,
author = "G. Kedem and T. Alexander",
title = "Application specific hardware compression of
ray-casting data",
crossref = "Storer:1995:DDC",
pages = "484--484",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515594",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515594",
acknowledgement = ack-nhfb,
}
@InProceedings{Kiely:1995:SCM,
author = "A. Kiely and F. Pollara",
title = "Subband coding methods for seismic data compression",
crossref = "Storer:1995:DDC",
pages = "447--447",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515557",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515557",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:1995:VBM,
author = "S. P. Kim and X. Ginesta",
title = "{VQ}-based model design algorithms for text
compression",
crossref = "Storer:1995:DDC",
pages = "434--434",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515544",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515544",
acknowledgement = ack-nhfb,
}
@InProceedings{Kinsner:1995:RSF,
author = "W. Kinsner and L. Wall",
title = "Reduced-search fractal block coding of images",
crossref = "Storer:1995:DDC",
pages = "461--461",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515571",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515571",
acknowledgement = ack-nhfb,
}
@InProceedings{Kiselyov:1995:MPL,
author = "O. Kiselyov and P. Fisher",
title = "Multiresolutional piecewise-linear image
decompositions: quantization error propagation and
design of ``stable'' compression schemes",
crossref = "Storer:1995:DDC",
pages = "470--470",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515580",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515580",
acknowledgement = ack-nhfb,
}
@Article{Kjelsoe:1995:MMF,
author = "M. Kjelsoe and S. Jones",
title = "Memory Management in Flash-Memory Disks with Data
Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "986",
pages = "399--??",
year = "1995",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat May 11 13:45:32 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Kleijn:1995:SCS,
author = "W. B. Kleijn and K. K. Paliwal",
title = "Speech Coding and Synthesis",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Kleijn, W. B., and K. K. Paliwal (1995) {\it Speech
Coding and Synthesis}, Elsevier, Amsterdam.",
}
@InProceedings{Kominek:1995:CFE,
author = "J. Kominek",
title = "Convergence of fractal encoded images",
crossref = "Storer:1995:DDC",
pages = "242--251",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515514",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515514",
acknowledgement = ack-nhfb,
}
@InProceedings{Kovacevic:1995:ABT,
author = "J. Kovacevic and R. J. Safranek and E. M. Yeh",
title = "Adaptive bidirectional time-recursive interpolation
for deinterlacing",
crossref = "Storer:1995:DDC",
pages = "446--446",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515556",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515556",
acknowledgement = ack-nhfb,
}
@Article{Kumaran:1995:DWB,
author = "Muthu Kumaran and Scott E. Umbaugh",
title = "A Dynamic Window-Based Runlength Coding Algorithm
Applied to Gray-Level Images",
journal = j-GRAPH-MODELS-IMAGE-PROC,
volume = "57",
number = "4",
pages = "267--282",
month = jul,
year = "1995",
CODEN = "GMIPF4",
DOI = "https://doi.org/10.1006/gmip.1995.1025",
ISSN = "1077-3169",
ISSN-L = "1077-3169",
bibdate = "Wed Mar 8 15:09:12 MST 2000",
bibsource = "Compendex database;
http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=gmip;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.idealibrary.com/links/artid/gmip.1995.1025/production;
http://www.idealibrary.com/links/artid/gmip.1995.1025/production/pdf",
acknowledgement = ack-nhfb,
affiliation = "Southern Illinois Univ at Edwardsville",
affiliationaddress = "Edwardsville, IL, USA",
classification = "723; 723.2; 921.6",
fjournal = "Graphical models and image processing: GMIP",
journal-URL = "http://www.sciencedirect.com/science/journal/10773169",
journalabr = "Graphical Models Image Process",
keywords = "Algorithms; Approximation theory; Codes (symbols);
Errors; Gray level images; Image coding; Image
compression; Image quantization; Lossless runlength
coding; Performance; Signal to noise ratio",
}
@InProceedings{Kwong:1995:SCA,
author = "S. Kwong and K. F. Man",
title = "A speech coding algorithm based on predictive coding",
crossref = "Storer:1995:DDC",
pages = "455--455",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515565",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515565",
acknowledgement = ack-nhfb,
}
@Article{Larmore:1995:CHT,
author = "Lawrence L. Larmore and Teresa M. Przytycka",
title = "Constructing {Huffman} Trees in Parallel",
journal = j-SIAM-J-COMPUT,
volume = "24",
number = "6",
pages = "1163--1169",
month = dec,
year = "1995",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539792233245",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
MRclass = "68P05 (68P20 68Q22)",
MRnumber = "96k:68035",
bibdate = "Mon Nov 29 11:02:48 MST 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/24/6;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/23324",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Larsen:1995:CSI,
author = "M. F. Larsen and R. L. Frost",
title = "Constraining the size of the instantaneous alphabet in
trellis quantizers",
crossref = "Storer:1995:DDC",
pages = "23--32",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515492",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515492",
acknowledgement = ack-nhfb,
}
@InProceedings{Lawler:1995:AEC,
author = "E. L. Lawler and S. Sarkissian",
title = "Adaptive error correcting codes based on cooperative
play of the game of ``twenty questions with a liar''",
crossref = "Storer:1995:DDC",
pages = "464--464",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515574",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515574",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:1995:PVQ,
author = "H. J. Lee and J. C. Liu and A. K. Chan and C. K.
Chui",
title = "A parallel vector quantization algorithm for {SIMD}
multiprocessor systems",
crossref = "Storer:1995:DDC",
pages = "479--479",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515589",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515589",
acknowledgement = ack-nhfb,
}
@Article{Levoy:1995:PAJ,
author = "Marc Levoy",
title = "Polygon-Assisted {JPEG} and {MPEG} Compression of
Synthetic Images",
journal = j-COMP-GRAPHICS,
volume = "29",
number = "{Annual Conference Series}",
pages = "21--28",
month = nov,
year = "1995",
CODEN = "CGRADI, CPGPBZ",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Mon Oct 4 18:52:53 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org:80/pubs/citations/proceedings/graph/218380/p21-levoy/",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "ACM; computer graphics; design; interactive
techniques; measurement; performance; SIGGRAPH;
theory",
subject = "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Compression (Coding), Approximate
methods. {\bf I.3.2} Computing Methodologies, COMPUTER
GRAPHICS, Graphics Systems, Distributed/network
graphics. {\bf C.3} Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Real-time and embedded systems.",
}
@Misc{Lewalle:1995:TCW,
author = "Jacques Lewalle",
title = "Tutorial on Continuous Wavelet Analysis of
Experimental Data",
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp.mame.syr.edu/pub/jlewalle/tutor.ps.Z;
http://www.ecs.syr.edu/faculty/lewalle/tutor/tutor.html",
acknowledgement = ack-ds,
rawdata-1 = "Lewalle, Jacques (1995) ``Tutorial on Continuous
Wavelet Analysis of Experimental Data'' available at
|http://www.ecs.syr.edu/faculty/lewalle/tutor/tutor.html|.",
rawdata-2 = "Lewalle, Jacques (1995) ``Tutorial on Continuous
Wavelet Analysis of Experimental Data,'' available
anonymously from
|ftp.mame.syr.edu/pub/jlewalle/tutor.ps.Z|.",
}
@Article{Liaw:1995:RGF,
author = "Wilson MacGyver Liaw",
title = "Reading {GIF} Files",
journal = j-DDJ,
volume = "20",
number = "2",
pages = "56, 58, 60, 103, 106--107",
month = feb,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Mon Sep 2 09:09:39 MDT 1996",
bibsource = "http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "C6130B (Graphics techniques); C6130E (Data
interchange)",
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "CompuServe; GIF87a; GIF89a; Graphics Interchange
Format; Graphics interchange standard; Internet; LZW
algorithm",
thesaurus = "Computer graphics; Electronic data interchange",
}
@InProceedings{Lin:1995:AIQ,
author = "Jianhua Lin",
title = "Adaptive image quantization based on learning
classifier systems",
crossref = "Storer:1995:DDC",
pages = "471--471",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515587",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515587",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1995:PAF,
author = "H. Lin and A. N. Venetsanopoulos",
booktitle = "Proceedings ICIP-95 (IEEE International Conference on
Image Processing)",
title = "A Pyramid Algorithm for Fast Fractal Image
Compression",
volume = "III",
publisher = "????",
address = "????",
pages = "596--599",
month = oct,
year = "1995",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
}
@Article{Lindley:1995:JLIa,
author = "Craig A. Lindley",
title = "{JPEG}-like Image Compression. Part 1",
journal = j-DDJ,
volume = "20",
number = "7",
pages = "50, 52, 54--58",
month = jul,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:16:51 1996",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "In this two-part article, Craig presents an
image-compression technique that uses the same
algorithm as JPEG. He then encapsulates the technique
in a set of C++ classes.",
acknowledgement = ack-nhfb,
classification = "723.1; 723.1.1; 723.2; 741.1; 902.2; 921.3; B6140C
(Optical information, image and video signal
processing); C5260B (Computer vision and image
processing techniques); C6110J (Object-oriented
programming)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; C (programming language); C++ classes;
CCITT; Codes (SYMBOLS); Color image processing;
Computer software; Decoding; Digital arithmetic;
Discrete cosine transforms; Entropy encoding; Gray
scale images; Huffman encoding; Image coding; Image
compression; Image quality; International standards
committee; Interoperability; ISO; Joint Photographers
Expert Group; JPEG; Mathematical transformations;
Quantization; Specifications; Standards; Subsampling",
pagecount = "7",
thesaurus = "Data compression; Image coding; ISO standards;
Object-oriented programming; Software standards",
}
@Article{Lindley:1995:JLIb,
author = "Craig A. Lindley",
title = "{JPEG-Like} Image Compression. Part 2",
journal = j-DDJ,
volume = "20",
number = "8",
pages = "62, 64--66, 102--105",
month = aug,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Sep 03 09:16:52 1996",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
abstract = "In this month's installment of his two-part article,
Craig describes how the image compression technique he
calls ``CAL'' differs from JPEG. He then presents the
C++ classes on which CAL is built.",
acknowledgement = ack-nhfb,
classification = "722.1; 723.1; 723.1.1; 723.2; 723.5; 902.2; B6120B
(Codes); B6140C (Optical information, image and video
signal processing); C5260B (Computer vision and image
processing techniques); C6110J (Object-oriented
programming); C6130 (Data handling techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; C (programming language); C++ class
library; CAL image-compression technique; Codes
(symbols); Color image processing; Computer graphics;
Computer software; Discrete cosine transform; Gray
scale image; Image coding; Image compression; Image
encapsulation; Image file format; JPEG-like image
compression; Mathematical transformations; Proprietary
file format; Specifications; Standards; Storage
allocation (COMPUTER); Subroutines",
pagecount = "4",
thesaurus = "C listings; Data compression; Image coding; Software
libraries",
}
@TechReport{Litow:1995:WFA,
author = "Bruce Litow and Olivier de Val",
title = "The Weighted Finite Automaton Inference Problem",
type = "Technical Report",
number = "95-1",
institution = "James Cook University",
address = "Brisbane, Queensland",
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Litow, Bruce, and Olivier de Val (1995) ``The Weighted
Finite Automaton Inference Problem,'' Technical Report
95-1, James Cook University, Queensland.",
}
@InProceedings{Little:1995:IEC,
author = "R. R. Little",
title = "An investigation of effective compression ratios for
the proposed synchronous data compression proto",
crossref = "Storer:1995:DDC",
pages = "490--490",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515597",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515597",
acknowledgement = ack-nhfb,
}
@InProceedings{Louchard:1995:GLZ,
author = "G. Louchard and W. Szpankowski",
title = "Generalized {Lempel--Ziv} parsing scheme and its
preliminary analysis of the average profile",
crossref = "Storer:1995:DDC",
pages = "262--271",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515516",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515516",
acknowledgement = ack-nhfb,
}
@InProceedings{Maier:1995:AES,
author = "M. W. Maier",
title = "Algorithm evaluation for the synchronous data
compression standards",
crossref = "Storer:1995:DDC",
pages = "444--444",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515554;
https://doi.org/10.1109/DCC.1995.515596",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515554;
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515596",
acknowledgement = ack-nhfb,
xxtitle = "Algorithm evaluation for synchronous data compression
standards",
}
@InProceedings{Majani:1995:MBJ,
author = "E. E. Majani and W. C. Dias",
title = "Making the Best of {JPEG} at Very High Compression
Ratios: Rectangular Pixel Averaging for {Mars
PathFinder}",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515600",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515600",
acknowledgement = ack-nhfb,
}
@InProceedings{Mehes:1995:PAI,
author = "A. Mehes and K. Zeger",
title = "On the performance of affine index assignments for
redundancy free source-channel coding",
crossref = "Storer:1995:DDC",
pages = "433--433",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515543",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515543",
acknowledgement = ack-nhfb,
}
@InProceedings{Memon:1995:ALI,
author = "N. D. Memon and K. Sayood",
title = "Asymmetric lossless image compression",
crossref = "Storer:1995:DDC",
pages = "457--457",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515567",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515567",
acknowledgement = ack-nhfb,
}
@PhdThesis{Miller:1995:MCD,
author = "Mark Christopher Miller",
title = "Multiscale compression of digital terrain data to meet
real-time rendering rate constraints",
type = "{Ph.D.} thesis",
school = "University of California, Davis",
address = "Davis, CA, USA",
pages = "216",
year = "1995",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304175054",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9533082",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Moellenhoff:1995:QMS,
author = "M. S. Moellenhoff and M. W. Maier",
title = "Queuing models of synchronous compressors",
crossref = "Storer:1995:DDC",
pages = "445--445",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515555",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515555",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1995:ACR,
author = "A. Moffat and R. Neal and I. H. Witten",
title = "Arithmetic coding revisited",
crossref = "Storer:1995:DDC",
pages = "202--211",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515510",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515510",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1995:SEC,
author = "A. Moffat and A. Turpin and J. Katajainen",
title = "Space-efficient construction of optimal prefix codes",
crossref = "Storer:1995:DDC",
pages = "192--201",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515509",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515509",
acknowledgement = ack-nhfb,
}
@InProceedings{Moghaddam:1995:ASM,
author = "B. Moghaddam and A. Pentland",
title = "An automatic system for model-based coding of faces",
crossref = "Storer:1995:DDC",
pages = "362--370",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515526",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515526",
acknowledgement = ack-nhfb,
}
@InProceedings{Mohammed:1995:QWC,
author = "A. Mohammed and K. Sayood",
title = "Quantization of wavelet coefficients for image
compression",
crossref = "Storer:1995:DDC",
pages = "483--483",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515593",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515593",
acknowledgement = ack-nhfb,
}
@InProceedings{Nagumo:1995:PAS,
author = "H. Nagumo and Mi Lu and K. Watson",
title = "Parallel algorithms for the static dictionary
compression",
crossref = "Storer:1995:DDC",
pages = "162--171",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515506",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515506",
acknowledgement = ack-nhfb,
}
@Article{Natarajan:1995:VST,
author = "K. Natarajan",
title = "Video servers take root",
journal = j-IEEE-SPECTRUM,
volume = "32",
number = "4",
pages = "66--69",
month = apr,
year = "1995",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.376004",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Asynchronous transfer mode; Bandwidth; Consumer
electronics; data compression; digital communication;
digital television; Economic forecasting; Games;
interactive network; interactive television;
interactive television systems; interactive video;
Motion pictures; Multimedia systems; Network servers;
processors; standards; telecommunication standards;
television equipment; TV; video coding; Video
compression; video compression; video equipment; video
server architectures; video servers",
}
@InProceedings{Neff:1995:MPV,
author = "R. Neff and A. Zakhor",
title = "Matching pursuit video coding at very low bit rates",
crossref = "Storer:1995:DDC",
pages = "411--420",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515531",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515531",
acknowledgement = ack-nhfb,
}
@InProceedings{Ng:1995:VQL,
author = "W. K. Ng and C. V. Ravishankar",
title = "Vector quantization for lossless textual data
compression",
crossref = "Storer:1995:DDC",
pages = "474--474",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515584",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515584",
acknowledgement = ack-nhfb,
}
@InProceedings{Ngai:1995:VAF,
author = "A. Ngai",
title = "{VLSI} Architecture of the {I}-Frame Encoder for the
{MPEG-2} Video Compression",
crossref = "IEEE:1995:HCV",
pages = "103--110",
year = "1995",
bibdate = "Sat Jan 6 19:21:12 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hot-chips.bib;
OCLC Proceedings database",
acknowledgement = ack-nhfb,
}
@InProceedings{Nogueiras:1995:HPB,
author = "A. de la Cruz Nogueiras and M. Gamez Lau and A.
Cerdeira Altuzarra and M. Estrada del Cueto and P.
Goga",
title = "A high performance block compression algorithm for
small systems-software and hardware implementations",
crossref = "Storer:1995:DDC",
pages = "422--422",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515532",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515532",
acknowledgement = ack-nhfb,
}
@InProceedings{Nosratinia:1995:NRO,
author = "A. Nosratinia and M. T. Orchard",
title = "New relationships in operator-based backward motion
compensation",
crossref = "Storer:1995:DDC",
pages = "391--400",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515529",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515529",
acknowledgement = ack-nhfb,
}
@InProceedings{Okada:1995:SOD,
author = "Y. Okada and N. Satoh and K. Murashita and S.
Yoshida",
title = "Self-organized dynamic {Huffman} coding without
frequency counts",
crossref = "Storer:1995:DDC",
pages = "473--473",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515583",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515583",
acknowledgement = ack-nhfb,
}
@Article{Pan:1995:TMA,
author = "Davis Yen Pan",
title = "A Tutorial on {MPEG}\slash Audio Compression",
journal = j-IEEE-MULTIMEDIA,
volume = "2",
number = "2",
pages = "60--74",
month = "Summer",
year = "1995",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.388209",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://dblp.uni-trier.de/db/journals/ieeemm/ieeemm2.html#Pan95;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "http://dlib.computer.org/mu/books/mu1995/pdf/u20060.pdf;
http://www.computer.org/multimedia/mu1995/u2060abs.htm",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE MultiMedia",
oldlabel = "Pan95",
rawdata = "Pan, Davis Yen (1995) ``A Tutorial on MPEG/Audio
Compression,'' {\it IEEE Multimedia}, {\bf2}:60--74,
Summer.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ieeemm/Pan95",
}
@InProceedings{Pawlikowski:1995:CDT,
author = "K. Pawlikowski and T. Bell and H. Emberson and P.
Ashton",
title = "Compression of data traffic in packet-based {LANs}",
crossref = "Storer:1995:DDC",
pages = "430--430",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515540",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515540",
acknowledgement = ack-nhfb,
}
@InProceedings{Prashant:1995:MPA,
author = "K. S. Prashant and V. J. Mathews",
title = "A massively parallel algorithm for vector
quantization",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515604",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515604",
acknowledgement = ack-nhfb,
}
@InProceedings{Prashant:1995:NMP,
author = "K. S. Prashant and V. J. Mathews and P. J. Hahn",
title = "A new model of perceptual threshold functions for
application in image compression systems",
crossref = "Storer:1995:DDC",
pages = "371--380",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515527",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515527",
acknowledgement = ack-nhfb,
}
@InProceedings{Raittinen:1995:FSC,
author = "H. Raittinen and K. Kaski",
title = "Fast subband coder for telephone quality audio",
crossref = "Storer:1995:DDC",
pages = "471--471",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515581",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515581",
acknowledgement = ack-nhfb,
}
@InProceedings{Ramakrishnan:1995:CSV,
author = "Sangeeta Ramakrishnan and K. Rose and A. Gersho",
title = "Constrained-storage vector quantization with a
universal codebook",
crossref = "Storer:1995:DDC",
pages = "42--51",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515494",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515494",
acknowledgement = ack-nhfb,
}
@Book{Ramstad:1995:SCI,
author = "T. A. Ramstad and et al",
title = "Subband Compression of Images: Principles and
Examples",
publisher = pub-ESP,
address = pub-ESP:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Ramstad, T. A., et al (1995) {\it Subband Compression
of Images: Principles and Examples}, Amsterdam,
Elsevier Science Publishers.",
}
@InProceedings{Ratnakar:1995:ROE,
author = "Viresh Ratnakar and M. Livny",
title = "{RD-OPT}: an efficient algorithm for optimizing {DCT}
quantization tables",
crossref = "Storer:1995:DDC",
pages = "332--341",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515523",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515523",
acknowledgement = ack-nhfb,
}
@InProceedings{Ristad:1995:CMM,
author = "E. S. Ristad and R. G. {Thomas III}",
title = "Context models in the {MDL} framework",
crossref = "Storer:1995:DDC",
pages = "62--71",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515496",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515496",
acknowledgement = ack-nhfb,
}
@Article{Rodriguez:1995:GFF,
author = "Karen Rodriguez",
title = "Graphics File Format Patent {Unisys} Seeks Royalties
from {GIF} Developers",
journal = j-INFOWORLD,
volume = "17",
number = "2",
pages = "3",
day = "9",
month = jan,
year = "1995",
CODEN = "INWODU",
ISSN = "0199-6649",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "InfoWorld",
rawdata = "Rodriguez, Karen (1995) ``Graphics File Format Patent
Unisys Seeks Royalties from GIF Developers,'' {\it
InfoWorld}, January 9, {\bf17}(2):3.",
}
@InProceedings{Ruf:1995:TAS,
author = "M. J. Ruf",
title = "Trade-off and applications of source-controlled
channel decoding to still images",
crossref = "Storer:1995:DDC",
pages = "443--443",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515553",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515553",
acknowledgement = ack-nhfb,
}
@InProceedings{Ruffer:1995:EIL,
author = "P. Ruffer and F. Rabe and F. Gliem",
title = "Enhancement of {IMP} lossy image data compression
using {LCT}",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515602",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515602",
acknowledgement = ack-nhfb,
}
@InProceedings{Saupe:1995:AFI,
author = "D. Saupe",
title = "Accelerating fractal image compression by
multi-dimensional nearest neighbor search",
crossref = "Storer:1995:DDC",
pages = "222--231",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515512",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515512",
acknowledgement = ack-nhfb,
}
@InProceedings{Scales:1995:LCU,
author = "A. Scales and W. Roark and F. Kossentini and M. J. T.
Smith",
title = "Lossless compression using conditional
entropy-constrained subband quantization",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515603",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515603",
acknowledgement = ack-nhfb,
}
@InProceedings{Schneider:1995:DSC,
author = "K. W. Schneider and W. S. Venters",
title = "The development of a standard for compression of
synchronous data in {DSU\slash CSU}'s",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515598",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515598",
acknowledgement = ack-nhfb,
}
@Book{Shenoi:1995:DSP,
author = "Kishan Shenoi",
title = "Digital Signal Processing in Telecommunications",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Shenoi, Kishan (1995) {\it Digital Signal Processing
in Telecommunications}, Upper Saddle River, NJ,
Prentice Hall.",
}
@Article{Sherlock:1995:AFD,
author = "Barry G. Sherlock and Donald M. Monro",
title = "{Algorithm 749}: Fast Discrete Cosine Transform",
journal = j-TOMS,
volume = "21",
number = "4",
pages = "372--378",
month = dec,
year = "1995",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/212066.212071",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Tue Nov 14 09:58:14 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fortran3.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "http://www.acm.org/pubs/citations/journals/toms/1995-21-4/p372-sherlock/",
acknowledgement = ack-rfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://portal.acm.org/toc.cfm?idx=J782",
keywords = "data compression; discrete cosine transform; fast
transform",
subject = "D.3.2 [Programming Languages]: Language
Classifications --- Fortran; E.4 [Data]: Coding and
Information Theory --- data compaction and compression;
F.2.1 [Analysis of Algorithms and Problem Complexity]:
Numerical Algorithms and Problems; G.4 [Mathematics of
Computing]: Mathematical Software; I.4.2 [Image
Processing]: Compression",
}
@PhdThesis{Southard:1995:VQN,
author = "David Alan Southard",
title = "Vector quantization and nearest neighbor clustering
with applications to image compression and data
visualization",
type = "{Sc.D.} thesis",
school = "University of Massachusetts Lowell",
address = "Lowell, MA, USA",
pages = "169",
year = "1995",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304200450",
acknowledgement = ack-nhfb,
advisor = "Georges G. Grinstein",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9612675",
subject = "Computer science; Electrical engineering",
}
@InProceedings{Sri-Krishna:1995:FBF,
author = "A. Sri-Krishna and Cheehung Chu and M. Bayoumi",
title = "{FFT} based fast architecture \& algorithm for
discrete wavelet transforms",
crossref = "Storer:1995:DDC",
pages = "441--441",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515550",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515550",
acknowledgement = ack-nhfb,
}
@InProceedings{Sri-Krishna:1995:PBF,
author = "A. Sri-Krishna and Cheehung Chu and M. Bayoumi",
title = "{FFT} based fast architecture \& algorithm for
discrete wavelet transforms",
crossref = "Storer:1995:DDC",
pages = "441--441",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515551",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515551",
acknowledgement = ack-nhfb,
}
@Article{Stollnitz:1995:WCGa,
author = "Eric J. Stollnitz and Tony D. DeRose and David H.
Salesin",
title = "Wavelets for Computer Graphics: a Primer, Part 1",
journal = j-IEEE-CGA,
volume = "15",
number = "3",
pages = "76--84",
month = may,
year = "1995",
CODEN = "ICGADZ",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Appl. Math., Washington Univ., Seattle, WA,
USA",
classification = "723.2; 723.5; 921; 921.3",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Algorithms; Computer graphics; Errors; Functions; Haar
basis; Image compression; Image reconstruction;
Interpolating B splines; Mathematical techniques;
Multiresolution analysis; Piecewise constant functions;
Wavelet transforms; Wavelets",
}
@InProceedings{Sum:1995:GRB,
author = "Kwok Wing Sum and R. D. Murch",
title = "Generalized region based transform coding for video
compression",
crossref = "Storer:1995:DDC",
pages = "478--478",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515588",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515588",
acknowledgement = ack-nhfb,
}
@InProceedings{Tai:1995:EMS,
author = "Shen-Chuan Tai",
title = "An extensive {Markov} system for {ECG} exact coding",
crossref = "Storer:1995:DDC",
pages = "467--467",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515577",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515577",
acknowledgement = ack-nhfb,
}
@Article{Takishima:1995:RVL,
author = "Y. Takishima and M. Wada and H. Murakami",
title = "Reversible Variable-Length Codes",
journal = j-IEEE-TRANS-COMM,
volume = "43",
number = "2,3,4",
pages = "158--162",
month = feb # "\slash " # mar # "\slash " # apr,
year = "1995",
CODEN = "IECMBT",
DOI = "https://doi.org/10.1109/26.380026",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Takishima, Y., M. Wada, and H. Murakami, (1995)
``Reversible Variable-Length Codes,'' {\it IEEE
Transactions on Communications},
{\bf43}(2,3,4):158--162, Feb./Mar./Apr.",
}
@InProceedings{Tamir:1995:VQC,
author = "D. E. Tamir and Chi-Yeon Park and Wook-Sung Yoo",
title = "Vector quantization and clustering: a pyramid
approach",
crossref = "Storer:1995:DDC",
pages = "482--482",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515592",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515592",
acknowledgement = ack-nhfb,
}
@InProceedings{Tarhio:1995:CCP,
author = "J. Tarhio",
title = "Context coding of parse trees",
crossref = "Storer:1995:DDC",
pages = "442--442",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515552",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515552",
acknowledgement = ack-nhfb,
}
@InProceedings{Teng:1995:IHL,
author = "Chia-Yuan Teng and D. L. Neuhoff",
title = "An improved hierarchical lossless text compression
algorithm",
crossref = "Storer:1995:DDC",
pages = "292--301",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515519",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515519",
acknowledgement = ack-nhfb,
}
@InProceedings{Turner:1995:LRC,
author = "M. J. Turner",
title = "Lossless region coding schemes",
crossref = "Storer:1995:DDC",
pages = "481--481",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515591",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515591",
acknowledgement = ack-nhfb,
}
@InProceedings{Uhl:1995:PCC,
author = "A. Uhl",
title = "Parallel Compact Coding of Satellite Images with
Wavelet Packets using {PVM}",
crossref = "Prasanna:1995:FIP",
pages = "382--387",
year = "1995",
bibdate = "Wed Apr 16 06:39:19 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information, image
and video signal processing); C4190 (Other numerical
methods); C5260B (Computer vision and image processing
techniques); C5440 (Multiprocessing systems); C6110P
(Parallel programming); C6130 (Data handling
techniques); C7460 (Aerospace engineering computing)",
corpsource = "Res. Inst. for Softwaretechnol., Salzburg Univ.,
Austria",
keywords = "aerospace computing; artificial satellites;
compression; data; image; image coding; image
compression methods; parallel; parallel approach;
parallel compact coding; parallel machines; parallel
programming environment; processing; programming; PVM;
quality; satellite data; satellite images; wavelet
packet decomposition; wavelet packet decompositions;
wavelet packets; wavelet transforms",
pubcountry = "India",
treatment = "P Practical",
}
@InProceedings{Vaisey:1995:BMS,
author = "J. Vaisey and M. Trumbo",
title = "Bitgroup modeling of signal data for image
compression",
crossref = "Storer:1995:DDC",
pages = "466--466",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515576",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515576",
acknowledgement = ack-nhfb,
}
@Book{Vetterli:1995:WSC,
author = "M. Vetterli and J. Kovacevic",
title = "Wavelets and Subband Coding",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1995",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Vetterli, M., and J. Kovacevic (1995) {\it Wavelets
and Subband Coding}, Englewood Cliffs, NJ, Prentice
Hall.",
}
@InProceedings{Villasenor:1995:WVC,
author = "J. Villasenor and R. Jain and B. Belzer and W. Boring
and C. Chien and C. Jones and J. Liao and S. Molloy and
S. Nazareth and B. Schoner and J. Short",
title = "Wireless video coding system demonstration",
crossref = "Storer:1995:DDC",
pages = "448--448",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515558",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515558",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:1995:WWC,
author = "J. Zhicheng Wang",
title = "Winning-weighted competitive learning for image
compression",
crossref = "Storer:1995:DDC",
pages = "438--438",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515548",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515548",
acknowledgement = ack-nhfb,
}
@Article{Willems:1995:CTW,
author = "F. M. J. Willems and Y. M. Shtarkov and Tj. J.
Tjalkens",
title = "The Context-Tree Weighting Method: Basic Properties",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "IT-41",
pages = "653--664",
month = may,
year = "1995",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.382012",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Willems, F. M. J., Y. M. Shtarkov, and Tj. J. Tjalkens
(1995) ``The Context-Tree Weighting Method: Basic
Properties,'' {\it IEEE Transactions on Information
Theory}, {\bf IT-41}:653--664, May.",
}
@InProceedings{Willis:1995:IDC,
author = "I. C. Willis and L. J. C. Woolliscroft and T. Averkamp
and D. A. Gurnett and R. A. Johnson and D. Kirchner and
W. S. Kurth and W. Robison",
title = "The Implementation of Data Compression in the {Cassini
RPWS Dedicated Compression Processor}",
crossref = "Storer:1995:DDC",
pages = "??--??",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515601",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515601",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1995:CSQ,
author = "Xiaolin Wu",
title = "Context Selection and Quantization for Lossless Image
Coding",
crossref = "Storer:1995:DDC",
pages = "453--453",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515563",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515563",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wu, Xiaolin (1995), ``Context Selection and
Quantization for Lossless Image Coding,'' in James A.
Storer and Martin Cohn (eds.), {\it DCC '95, Data
Compression Conference}, Los Alamitos, CA, IEEE
Computer Society Press, p. 453.",
}
@InProceedings{Wu:1995:NAO,
author = "Xiaolin Wu and Yonggang Fang",
title = "New algorithms for optimal binary vector quantizer
design",
crossref = "Storer:1995:DDC",
pages = "132--141",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515503",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515503",
acknowledgement = ack-nhfb,
}
@Article{York:1995:SCU,
author = "Kyle A. York",
title = "Sound Compression Using Quantized Deltas",
journal = j-DDJ,
volume = "20",
number = "6",
pages = "121--122",
month = jun,
year = "1995",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
UnCover database",
acknowledgement = ack-nhfb,
affiliation = "McGraw-Hill Sch Systems",
classification = "703.2; 722.3; 722.4; 723.1; 723.2; 723.5",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; Computer simulation; Data compression;
Digital filters; Digital to analog conversion; Linear
predictive coding; Quantized deltas; Real time systems;
Signal encoding; Sound compression; Voice/data
communication systems",
}
@InProceedings{Yu:1995:SWC,
author = "Tong Lai Yu",
title = "Sliding-window compression for {PC} software
distribution",
crossref = "Storer:1995:DDC",
pages = "468--468",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515578",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515578",
acknowledgement = ack-nhfb,
}
@InProceedings{Zampunieris:1995:EHL,
author = "D. Zampunieris and B. {Le Charlier}",
title = "Efficient handling of large sets of tuples with
sharing trees",
crossref = "Storer:1995:DDC",
pages = "428--428",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515538",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515538",
acknowledgement = ack-nhfb,
}
@InProceedings{Zandi:1995:CCR,
author = "A. Zandi and J. D. Allen and E. L. Schwartz and M.
Boliek",
title = "{CREW}: {Compression with Reversible Embedded
Wavelets}",
crossref = "Storer:1995:DDC",
pages = "212--221",
month = mar,
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515511",
bibdate = "Tue Feb 5 07:37:21 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=515511",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Zandi A., J. Allen, E. Schwartz, and M. Boliek,
(1995), ``CREW: Compression with Reversible Embedded
Wavelets,'' in James A. Storer and Martin Cohn (eds.)
{\it DCC '95: Data Compression Conference}, Los
Alamitos, CA, IEEE Computer Society Press, pp.
212--221, March.",
}
@InProceedings{Zhang:1995:PBLa,
author = "Q. Zhang and J. M. Danskin",
title = "A Pattern-Based Lossy Compression Scheme for
Document",
crossref = "Brown:1995:PSI",
pages = "221--234",
year = "1995",
bibdate = "Mon Apr 27 08:08:18 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
keywords = "document manipulation; electronic publishing; EP;
typography",
}
@Article{Zhang:1995:PBLb,
author = "Qin Zhang and John M. Danskin",
title = "A Pattern-Based Lossy Compression Scheme for Document
Images",
journal = j-EPODD,
volume = "8",
number = "2--3",
pages = "221--233",
month = jun # "\slash " # sep,
year = "1995",
CODEN = "EPODEU",
ISSN = "0894-3982",
bibdate = "Fri Jul 11 07:26:02 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Electronic Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion,
Dissemination, and Design",
}
@InProceedings{Acharya:1996:ELZ,
author = "T. Acharya and J. F. JaJa",
title = "Enhancing {Lempel--Ziv} codes using an on-line
variable length binary encoding",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488347",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488347",
acknowledgement = ack-nhfb,
}
@Article{Acharya:1996:LVL,
author = "Tinku Acharya and Joseph F. J{\'a}J{\'a}",
title = "An On-Line Variable Length Binary Encoding of Text",
journal = j-INFO-SCI,
volume = "94",
pages = "1--22",
year = "1996",
CODEN = "ISIJBC",
DOI = "https://doi.org/10.1016/0020-0255(96)00089-8",
ISSN = "0020-0255 (print), 1872-6291 (electronic)",
ISSN-L = "0020-0255",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Information Sciences",
rawdata = "Acharya, Tinku and Joseph F. J\'aJ\'a (1996) ``An
On-Line Variable Length Binary Encoding of Text,'' {\it
Information and Computer Science}, {\bf94}:1--22.",
xxjournal = "Information and Computer Science",
}
@InProceedings{Al-Shaykh:1996:LCN,
author = "O. K. Al-Shaykh and R. M. Mersereau",
title = "Lossy compression of noisy cardiac image sequences",
crossref = "Storer:1996:DDC",
pages = "43--52",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488309",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488309",
acknowledgement = ack-nhfb,
}
@Article{Albers:1996:ACA,
author = "S. Albers and M. Mitzenmacher",
title = "Average Case Analyses of List Update Algorithms, with
Applications to Data Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1099",
pages = "514--??",
year = "1996",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/pl00009217",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 21 09:47:26 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Arnavut:1996:LCU,
author = "Z. Arnavut",
title = "Lossless compression using inversions on multiset
permutations",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488348",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488348",
acknowledgement = ack-nhfb,
}
@Misc{AT-T:1996:U,
author = "{AT-T}",
title = "[unknown]",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.djvu.att.com/",
acknowledgement = ack-ds,
rawdata = "ATT (1996) |http://www.djvu.att.com/|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Atallah:1996:PMI,
author = "M. Atallah and Y. Genin and W. Szpankowski",
title = "Pattern matching image compression",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488349",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488349",
acknowledgement = ack-nhfb,
}
@Article{Bahl:1996:SOC,
author = "Paramvir Bahl and Paul S. Gauthier and Robert A.
Ulichney",
title = "Software-only Compression, Rendering, and Playback of
Digital Video",
journal = j-DEC-TECH-J,
volume = "7",
number = "4",
pages = "52--75",
month = mar,
year = "1996",
CODEN = "DTJOEL",
ISSN = "0898-901X",
bibdate = "Thu Mar 20 18:15:43 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v7n4/Softwareonly_Compression_Ren_20apr1996DTJK04P8.ps;
http://www.digital.com:80/info/DTJK04;
http://www.digital.com:80/info/DTJK04/DTJK04AH.HTM;
http://www.digital.com:80/info/DTJK04/DTJK04P8.PS;
http://www.digital.com:80/info/DTJK04/DTJK04PF.PDF;
http://www.digital.com:80/info/DTJK04/DTJK04SC.TXT",
abstract = "Software-only digital video involves the compression,
decompression, rendering, and display of digital video
on general-purpose computers without specialized
hardware. Today's faster processors are making
software-only video an attractive, low-cost alternative
to hardware solutions that rely on specialized
compression boards and graphics accelerators. This
paper describes the building blocks behind popular ISO,
ITU-T, and industry-standard compression schemes, along
with some novel algorithms for fast video rendering and
presentation. A platform-independent software
architecture that organizes the functionality of
compressors and renderers into a unifying software
inter face is presented. This architecture has been
successfully implemented on the Digital UNIX, the
OpenVMS, and Microsoft's Windows NT operating systems.
To maximize the performance of codecs and renderers,
issues pertaining to flow control, optimal use of
available resources, and optimizations at the
algorithmic, operating-system, and processor levels are
considered. The performance of these codecs on Alpha
systems is evaluated, and the ensuing results validate
the potential of software-only solutions. Finally, this
paper provides a brief description of some sample
applications built on top of the software architecture,
including an innovative video screen saver and a
software VCR capable of playing multiple, compressed
bit streams.",
acknowledgement = ack-nhfb,
classcodes = "B6140C (Optical information, image and video signal
processing); B6220M (Speech and video codecs); B6430H
(Video recording); C5260 (Digital signal processing);
C7410F (Communications computing)",
fjournal = "Digital Technical Journal",
keywords = "(computer graphics); Alpha systems; available
resources optimal use; codecs; computers; computing;
data compression; data decompression; Digital UNIX;
fast video; flow control; general-purpose;
industry-standard compression schemes; ISO; ITU-T;
low-cost alternative; Microsoft Windows; multiple
compressed bit streams; NT; OpenVMS; operating systems;
operating systems (computers); performance
maximization; platform-independent software
architecture; playback; rendering; software
engineering; software interface; software VCR;
software-only digital video; telecommunication;
unifying; video codecs; video presentation; video
screen saver; video signal processing",
treatment = "P Practical",
}
@InProceedings{Bani-Eqbal:1996:CTF,
author = "B. Bani-Eqbal",
title = "Combining tree and feature classification in fractal
encoding of images",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488350",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488350",
acknowledgement = ack-nhfb,
}
@InProceedings{Baxter:1996:LCE,
author = "J. Baxter and J. Shawe-Taylor",
title = "Learning to compress ergodic sources",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488351",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488351",
acknowledgement = ack-nhfb,
}
@Article{Bekesi:1996:FGA,
author = "J. B{\'e}k{\'e}si and G. Galambos and U. Pferschy and
G. J. W{\"o}ginger",
title = "The Fractional Greedy Algorithm for Data Compression",
journal = j-COMPUTING,
volume = "56",
number = "1",
pages = "29--46",
month = mar,
year = "1996",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/bf02238290",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
MRclass = "94A29 (94A15)",
MRnumber = "96m:94004",
bibdate = "Fri Oct 15 15:40:58 MDT 1999",
bibsource = "Compendex database;
http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.springer.at/springer.py?Page=40&Key=362&cat=3&id_journal=8;
MathSciNet database; OCLC Contents1st database",
URL = "http://www.springer.at/springer.py?Page=10&Key=362&cat=300607/tocs/springer.py?Page=47&Key=340&cat=3&id_abstract=284&id_volume=25&id_journal=8",
acknowledgement = ack-nhfb,
classification = "722.4; 723.2; 723.5; 921.6",
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
journalabr = "Comput Vienna New York",
keywords = "Algorithms; Code words; Data compression; Encoding
(symbols); Fractional greedy algorithms; Heuristic
encoding; Heuristic methods; Online systems; Optimal
encoding; Shorter code sequence; Shortest paths;
Textual substitution",
}
@Article{Bekesi:1996:WCA,
author = "J. Bekesi and G. Galambos and U. Pferschy and G. J.
Woeginger",
title = "Worst-Case Analysis for On-Line Data Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1120",
pages = "288--300",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Aug 25 16:23:54 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Belzer:1996:STC,
author = "B. Belzer and J. D. Villasenor",
title = "Symmetric trellis coded vector quantization",
crossref = "Storer:1996:DDC",
pages = "13--22",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488306",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488306",
acknowledgement = ack-nhfb,
}
@InProceedings{Benschop:1996:MPS,
author = "L. C. Benschop",
title = "{100 Mbit per second VLSI} implementation of sliding
window coding",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488352",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488352",
acknowledgement = ack-nhfb,
}
@InProceedings{Bernardini:1996:ATT,
author = "R. Bernardini and J. Kovacevic",
title = "Arbitrary tilings of the time-frequency plane using
local bases",
crossref = "Storer:1996:DDC",
pages = "369--378",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488342",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488342",
acknowledgement = ack-nhfb,
}
@Misc{Berners-Lee:1996:RHT,
author = "T. Berners-Lee and R. Fielding and H. Frystyk",
title = "{RFC 1945}: {Hypertext Transfer Protocol} ---
{HTTP/1.0}",
pages = "??",
month = may,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib;
https://www.math.utah.edu/pub/tex/bib/sgml.bib",
note = "Status: INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1945.txt;
http://www.faqs.org/rfcs/rfc1945.html;
https://www.math.utah.edu/pub/rfc/rfc1945.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=137582 bytes",
online = "yes",
rawdata = "RFC1945 (1996) {\it Hypertext Transfer
Protocol---HTTP/1.0}, available at URL\hfil\break
|http://www.faqs.org/rfcs/rfc1945.html|.",
status = "INFORMATIONAL",
}
@InProceedings{Bloom:1996:LND,
author = "Charles R. Bloom",
title = "{LZP}: a New Data Compression Algorithm",
crossref = "Storer:1996:DDC",
pages = "425--425",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488353",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488353",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Bloom, Charles R. (1996) ``LZP: A New Data Compression
Algorithm,'' {\it Proceedings of Data Compression
Conference}, J. Storer, editor, Los Alamitos, CA, IEEE
Computer Society Press, p. 425.",
}
@InProceedings{Bloom:1996:NTC,
author = "C. Bloom",
title = "New techniques in context modeling and arithmetic
encoding",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488354",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488354",
acknowledgement = ack-nhfb,
}
@InProceedings{Brislawn:1996:FCS,
author = "Christopher Brislawn and Jonathan Bradley and R.
Onyshczak and Tom Hopper",
booktitle = "{Proceedings SPIE, Denver, CO}",
title = "The {FBI} Compression Standard for Digitized
Fingerprint Images",
volume = "2847",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "344--355",
month = aug,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Brislawn, Christopher, Jonathan Bradley, R. Onyshczak,
and Tom Hopper (1996) ``The FBI Compression Standard
for Digitized Fingerprint Images,'' {\it Proceedings
SPIE}, Vol. 2847, Denver, CO, pp. 344--355, August.",
}
@InProceedings{Broder:1996:PBC,
author = "A. Broder and M. Mitzenmacher",
title = "Pattern-based compression of text images",
crossref = "Storer:1996:DDC",
pages = "300--309",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488335",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488335",
acknowledgement = ack-nhfb,
}
@Book{Bruce:1996:AWA,
author = "Andrew Bruce and Hong-Ye Gao",
title = "Applied wavelet analysis with {S-Plus}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxi + 338",
year = "1996",
ISBN = "0-387-94714-0 (softcover)",
ISBN-13 = "978-0-387-94714-3 (softcover)",
LCCN = "TK5102.9.B78 1996",
bibdate = "Tue Sep 22 08:25:09 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/Wavelets/brandon.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/s-plus.bib",
URL = "http://www.springer-ny.com/catalog/np/jul96np/DATA/0-387-94714-0.html",
abstract = "This book introduces applied wavelet analysis through
the S-PLUS software system. Using a visual data
analysis approach, wavelet concepts are explained in a
way that is intuitive and easy to understand. In
addition to wavelets, a whole range of related signal
processing techniques such as wavelet packets, local
cosine analysis, and matching pursuits are covered.
Applications of wavelet analysis are illustrated,
including nonparametric function estimation, digital
image compression, and time-frequency signal analysis.
The book and software is intended for a broad range of
data analysts, scientists, and engineers. While most
textbooks on wavelet analysis require advanced training
in mathematics, this book minimizes reliance on formal
mathematical methods. Readers should be familiar with
calculus and linear algebra at the undergraduate
level.",
acknowledgement = ack-nhfb,
keywords = "Computer-aided engineering.; S (Computer program
language); Signal processing -- Mathematics; Wavelets
(Mathematics) -- Data processing",
}
@InProceedings{Brunk:1996:FRS,
author = "H. Brunk and N. Farvardin",
title = "Fixed-rate successively refinable scalar quantizers",
crossref = "Storer:1996:DDC",
pages = "250--259",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488330",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488330",
acknowledgement = ack-nhfb,
}
@InProceedings{Chaddha:1996:CRH,
author = "N. Chaddha and P. A. Chou and R. M. Gray",
title = "Constrained and recursive hierarchical table-lookup
vector quantization",
crossref = "Storer:1996:DDC",
pages = "220--229",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488327",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488327",
acknowledgement = ack-nhfb,
}
@InProceedings{Chaddha:1996:JIC,
author = "N. Chaddha and K. Perlmutter and R. M. Gray",
title = "Joint image classification and compression using
hierarchical table-lookup vector quantization",
crossref = "Storer:1996:DDC",
pages = "23--32",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488307",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488307",
acknowledgement = ack-nhfb,
}
@InProceedings{Chaddha:1996:MBM,
author = "N. Chaddha",
title = "Model-based motion compensated compression for
synthetic animations",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488355",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488355",
acknowledgement = ack-nhfb,
}
@Article{Chang:1996:IZS,
author = "C. C. Chang and D. J. Buehrer and H. C. Kowng",
title = "An Improvement to {Ziegler}'s Sparse Matrix
Compression Algorithm",
journal = j-J-SYST-SOFTW,
volume = "35",
number = "1",
pages = "67--71",
month = oct,
year = "1996",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/0164-1212(95)00086-0",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Sep 9 05:51:44 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chen:1996:ABPa,
author = "I-Cheng K. Chen and John T. Coffey and Trevor N.
Mudge",
title = "Analysis of branch prediction via data compression",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "128--137",
month = dec,
year = "1996",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/248208.237171",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}
@Article{Chen:1996:ABPb,
author = "I-Cheng K. Chen and John T. Coffey and Trevor N.
Mudge",
title = "Analysis of Branch Prediction Via Data Compression",
journal = j-SIGPLAN,
volume = "31",
number = "9",
pages = "128--137",
month = sep,
year = "1996",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/248209.237171",
ISBN = "0-89791-767-7",
ISBN-13 = "978-0-89791-767-4",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sun Dec 14 09:17:23 MST 2003",
bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib",
note = "Co-published as SIGOPS Operating Systems Review {\bf
30}(5), December 1996, and as SIGARCH Computer
Architecture News, {\bf 24}(special issue), October
1996.",
URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p128-chen/",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "algorithms; design; performance; theory",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf E.4} Data, CODING AND
INFORMATION THEORY, Data compaction and compression.",
}
@InProceedings{Chen:1996:ELC,
author = "Shenfeng Chen and J. H. Reif",
title = "Efficient lossless compression of trees and graphs",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488356",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488356",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:1996:RQI,
author = "Qing Chen and T. R. Fischer",
title = "Robust quantization for image coding and noisy digital
transmission",
crossref = "Storer:1996:DDC",
pages = "3--12",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488305",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488305",
acknowledgement = ack-nhfb,
}
@Article{Cheng:1996:FHR,
author = "J.-M. Cheng and L. M. Duyanovich and D. J. Craft",
title = "A fast, highly reliable data compression chip and
algorithm for storage systems",
journal = j-IBM-JRD,
volume = "40",
number = "6",
pages = "603--613",
month = nov,
year = "1996",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.406.0603",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Mar 25 14:26:59 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.almaden.ibm.com/journal/rd40-6.html#two",
acknowledgement = ack-nhfb,
classcodes = "C5320C (Storage on moving magnetic media); C5320G
(Semiconductor storage)",
corpsource = "IBM Storage Syst. Div., San Jose, CA, USA",
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
keywords = "algorithm; data compression; data compression chip;
data flow analysis; data flows; graph; hardware
execution; IBM; IBM computers; IBMLZ1 compression;
magnetic disc storage; match-length distribution;
overhead; pattern matching; storage management chips;
storage systems; system-integration; vertex coloring",
treatment = "P Practical",
xxlibnote = "Issue missing from UofUtah Marriott Library",
}
@InProceedings{Chiu:1996:VCU,
author = "Yi-Jen Chiu and T. Berger",
title = "Video compression using fax techniques",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488357",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488357",
acknowledgement = ack-nhfb,
}
@InProceedings{Choi:1996:VQD,
author = "Sunghyun Choi and Wee-Keong Ng",
title = "Vector quantizer design using genetic algorithms",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488358",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488358",
acknowledgement = ack-nhfb,
}
@PhdThesis{Chow:1996:SRC,
author = "James G. Chow",
title = "Successive refinement and the compression of
multi-dimensional data",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "100",
year = "1996",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304303621",
acknowledgement = ack-nhfb,
advisor = "Jian Min Wang",
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "9629624",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Chu:1996:HBB,
author = "Chung-Tao Chu and D. Anastassiou and Shih-Fu Chang",
title = "Hybrid block-based\slash segment-based video
compression at very low bit rate",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488363",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488363",
acknowledgement = ack-nhfb,
}
@InProceedings{Cohn:1996:PSP,
author = "M. Cohn and R. Khazan",
title = "Parsing with suffix and prefix dictionaries",
crossref = "Storer:1996:DDC",
pages = "180--189",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488323",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488323",
acknowledgement = ack-nhfb,
}
@InProceedings{Cover:1996:UDC,
author = "T. M. Cover",
title = "Universal data compression and portfolio selection",
crossref = "IEEE:1996:ASF",
pages = "534--538",
year = "1996",
bibdate = "Thu Apr 5 06:13:52 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/focs1990.bib",
acknowledgement = ack-nhfb,
}
@MastersThesis{Craig:1996:CDC,
author = "Richard Craig",
title = "Considerations of data compression and symmetric
encryption techniques for a personal communications
service",
type = "Thesis ({M.S.})",
school = "University of Mississippi",
address = "Oxford, MS, USA",
pages = "various",
year = "1996",
bibdate = "Mon Oct 19 08:47:56 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Creusere:1996:RIC,
author = "C. D. Creusere",
title = "Robust image coding using the embedded zerotree
wavelet algorithm",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488364",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488364",
acknowledgement = ack-nhfb,
}
@Article{Crochemore:1996:PMT,
author = "Maxime Crochemore and Thierry Lecroq",
title = "Pattern-matching and text-compression algorithms",
journal = j-COMP-SURV,
volume = "28",
number = "1",
pages = "39--41",
month = mar,
year = "1996",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/234313.234331",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 09:50:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/citations/journals/surveys/1996-28-1/p39-crochemore/;
http://www.acm.org/pubs/toc/Abstracts/surveys/234331.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "algorithms; analysis of algorithms and problem
complexity; nonnumerical algorithms and problems;
pattern matching.; theory; {\bf f.2.2}: theory of
computation",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Pattern matching.",
}
@InProceedings{Culik:1996:FAB,
author = "Karel {Culik II} and V. Valenta",
title = "Finite Automata Based Compression of Bi-Level Images",
crossref = "Storer:1996:DDC",
pages = "280--289",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488333",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488333",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Culik, Karel II, and V. Valenta (1996) ``Finite
Automata Based Compression of Bi-Level Images,'' in
Storer, James A. (ed.), {\it DCC '96, Data Compression
Conference}, Los Alamitos, CA, IEEE Computer Society
Press, pp. 280--289.",
}
@Article{Davis:1996:IIM,
author = "Geoffrey Davis",
title = "Implicit image models in image fractal compression",
journal = j-PROC-SPIE,
volume = "2569",
number = "??",
pages = "88--97",
month = "????",
year = "1996",
CODEN = "PSISDG",
ISBN = "0-8194-2213-4",
ISBN-13 = "978-0-8194-2213-2",
ISSN = "????",
ISSN-L = "0277-786X",
LCCN = "TS510.S63 v.2825",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@Article{DeAgostino:1996:LVL,
author = "Sergio {De Agostino} and James A. Storer",
title = "On-line versus off-line computation in dynamic text
compression",
journal = j-INFO-PROC-LETT,
volume = "59",
number = "3",
pages = "169--174",
day = "12",
month = aug,
year = "1996",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(96)00068-3",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A29",
MRnumber = "1 409 968",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C4210 (Formal logic); C4210L (Formal
languages and computational linguistics); C4220
(Automata theory); C4240C (Computational complexity);
C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "coding; computational complexity; data compression;
dynamic text compression; encoded string; encoding;
finite automata; finite case; grammars; off line
computation; often called; on line computation; parse;
parsing; rewriting systems; textual substitution;
textual substitution method",
treatment = "T Theoretical or Mathematical",
}
@Misc{Deutsch:1996:RDC,
author = "L. P. Deutsch",
title = "{RFC 1951}: {DEFLATE} Compressed Data Format
Specification version 1.3",
pages = "??",
month = may,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Status: INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1951.txt;
http://www.ietf.org/rfc/rfc1951;
https://www.math.utah.edu/pub/rfc/rfc1951.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=36944, PS=57408 bytes",
online = "yes",
rawdata = "RFC1951 (1996) {\it DEFLATE Compressed Data Format
Specification version 1.3}, is\hfil\break
|http://www.ietf.org/rfc/rfc1951|.",
status = "INFORMATIONAL",
}
@Misc{Deutsch:1996:RGF,
author = "L. Peter Deutsch",
title = "{RFC 1952}: {GZIP} file format specification version
4.3",
month = may,
year = "1996",
bibdate = "Sat Jan 10 11:23:20 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Status: INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1952.txt;
http://www.gzip.org/zlib/rfc-gzip.html;
https://www.math.utah.edu/pub/rfc/rfc1952.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=25036, PS=43337 bytes",
online = "yes",
rawdata = "RFC1952 (1996) {\it GZIP File Format Specification
Version 4.3}. Available in PDF format at URL
|http://www.gzip.org/zlib/rfc-gzip.html|.",
status = "INFORMATIONAL",
}
@Misc{Deutsch:1996:RZC,
author = "L. P. Deutsch and J-L. Gailly",
title = "{RFC 1950}: {ZLIB} Compressed Data Format
Specification version 3.3",
pages = "??",
month = may,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Status: INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1950.txt;
http://www.ietf.org/rfc/rfc1950;
https://www.math.utah.edu/pub/rfc/rfc1950.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=20502, PS=37768 bytes",
online = "yes",
rawdata = "RFC1950 (1996) {\it ZLIB Compressed Data Format
Specification version 3.3}, is\hfil\break
|http://www.ietf.org/rfc/rfc1950|.",
status = "INFORMATIONAL",
}
@InProceedings{Dobson:1996:LCW,
author = "K. Dobson and J. Yang and N. Whitney and K. Smart and
P. Rigstad",
title = "A low complexity wavelet based audio compression
method",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488365",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488365",
acknowledgement = ack-nhfb,
}
@InProceedings{Ekstrand:1996:LCG,
author = "Nicklas Ekstrand",
title = "Lossless compression of grayscale images via context
tree weighting",
crossref = "Storer:1996:DDC",
pages = "132--139",
month = apr,
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488318",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488318",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Ekstrand, Nicklas (1996) ``Lossless Compression of
Gray Images via Context Tree Weighting,'' in Storer,
James A. (ed.), {\it DCC '96: Data Compression
Conference}, Los Alamitos, CA, IEEE Computer Society
Press, pp. 132--139, April.",
}
@Article{Ewing:1996:CJF,
author = "Gary J. Ewing and Christopher J. Woodruff",
title = "Comparison of {JPEG} and fractal-based image
compression on target acquisition by human observers",
journal = j-OPTICAL-ENG,
volume = "35",
number = "1",
pages = "284--288",
month = jan,
year = "1996",
CODEN = "OPEGAR",
DOI = "https://doi.org/10.1117/1.600932",
ISSN = "0091-3286",
ISSN-L = "0091-3286",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Optical Engineering",
}
@InProceedings{Fawcett:1996:CCN,
author = "R. Fawcett",
title = "Combination coding: a new entropy coding technique",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488366",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488366",
acknowledgement = ack-nhfb,
}
@TechReport{Fenwick:1996:PEC,
author = "Peter Fenwick",
title = "Punctured {Elias} Codes for Variable-Length Coding of
the Integers",
type = "Technical Report",
number = "137",
institution = "Department of Computer Science, The University of
Auckland",
address = "Auckland, NZ",
pages = "15",
month = dec,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.firstpr.com.au/audiocomp/lossless/TechRep137.pdf",
acknowledgement = ack-ds,
rawdata-1 = "Fenwick, Peter (1996a) ``Punctured Elias Codes for
variable-length coding of the integers,'' Technical
Report 137, Department of Computer Science, The
University of Auckland, December. This is also
available online at\hfil\break
|www.firstpr.com.au/audiocomp/lossless/TechRep137.pdf|.",
rawdata-2 = "Fenwick, Peter (1996a) ``Punctured Elias Codes for
Variable-Length Coding of the Integers,'' Technical
Report 137, Department of Computer Science, University
of Auckland, December. This is also available online.",
}
@TechReport{Fenwick:1996:SRT,
author = "P. Fenwick",
title = "Symbol Ranking Text Compression",
type = "Technical Report",
number = "132",
institution = "Department of Computer Science, University of
Auckland",
address = "Auckland, NZ",
pages = "??",
month = jun,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Fenwick, P. (1996) {\it Symbol Ranking Text
Compression}, Tech. Rep. 132, Dept. of Computer
Science, University of Auckland, New Zealand, June.",
rawdata-2 = "Fenwick, P. (1996b) {\it Symbol Ranking Text
Compression}, Tech. Rep. 132, Dept. of Computer
Science, University of Auckland, New Zealand, June.",
}
@Article{Fetik:1996:MXG,
author = "Richard Fetik",
title = "Multimedia {X}: Generating {GIFs} on the Fly",
journal = j-X-J,
volume = "5",
number = "5",
pages = "86--??",
month = may,
year = "1996",
CODEN = "XJOUEA",
ISSN = "1056-7003",
bibdate = "Thu Sep 05 09:14:34 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "The X Journal",
}
@InProceedings{Forkert:1996:EAW,
author = "R. D. Forkert",
title = "Elements of adaptive wavelet image compression",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488367",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488367",
acknowledgement = ack-nhfb,
}
@Article{Fraenkel:1996:RUC,
author = "Aviezri S. Fraenkel and Shmuel T. Klein",
title = "Robust Universal Complete Codes for Transmission and
Compression",
journal = j-DISCRETE-APPL-MATH,
volume = "64",
number = "1",
pages = "31--55",
month = jan,
year = "1996",
CODEN = "DAMADU",
DOI = "https://doi.org/10.1016/0166-218x(93)00116-h",
ISSN = "0166-218X (print), 1872-6771 (electronic)",
ISSN-L = "0166-218X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Discrete Applied Mathematics",
rawdata = "Fraenkel, Aviezri S. and Shmuel T. Klein (1996)
``Robust Universal Complete Codes for Transmission and
Compression,'' {\it Discrete Applied Mathematics},
{\bf64}(1):31--55, January.",
}
@InProceedings{Franaszek:1996:PCC,
author = "P. Franaszek and J. Robinson and J. Thomas",
title = "Parallel compression with cooperative dictionary
construction",
crossref = "Storer:1996:DDC",
pages = "200--209",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488325",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488325",
acknowledgement = ack-nhfb,
}
@InProceedings{Franceschini:1996:DCU,
author = "R. W. Franceschini and A. Mukherjee",
title = "Data compression using encrypted text",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488369",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488369",
acknowledgement = ack-nhfb,
}
@InProceedings{Franques:1996:EWB,
author = "V. T. Franques and V. K. Jain",
title = "Enhanced wavelet-based zerotree coding of images",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488368",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488368",
acknowledgement = ack-nhfb,
}
@InProceedings{Frey:1996:FEC,
author = "B. J. Frey and G. E. Hinton",
title = "Free energy coding",
crossref = "Storer:1996:DDC",
pages = "73--81",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488312",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488312",
acknowledgement = ack-nhfb,
}
@Article{Gasieniec:1996:EAL,
author = "L. Gasieniec and M. Karpinski and W. Plandowski and W.
Rytter",
title = "Efficient Algorithms for {Lempel--Ziv} Encoding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1097",
pages = "392--??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Aug 14 09:38:08 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gentile:1996:RTI,
author = "A. Gentile and H. Cat and F. Kossentini and F.
Sorbello and D. S. Wills",
title = "Real-time implementation of full-search vector
quantization on a low memory {SIMD} architecture",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488370",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488370",
acknowledgement = ack-nhfb,
}
@InProceedings{Ginesta:1996:LCF,
author = "X. Ginesta and S. Sambhwani",
title = "Low complexity finite-state scalar quantization of
image subbands",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488371",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488371",
acknowledgement = ack-nhfb,
}
@InProceedings{Gormish:1996:DSQ,
author = "M. J. Gormish and A. Zandi and E. L. Schwartz and A.
Keith and M. Boliek",
title = "Device selective quantization for reversible
wavelets",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488372",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488372",
acknowledgement = ack-nhfb,
}
@InProceedings{Guleryuz:1996:RDB,
author = "O. G. Guleryuz and M. T. Orchard",
title = "Rate-distortion based temporal filtering for video
compression",
crossref = "Storer:1996:DDC",
pages = "122--131",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488317",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488317",
acknowledgement = ack-nhfb,
}
@Article{Gunther:1996:DCS,
author = "U. G{\"u}nther",
title = "Data Compression and Serial Communication with
Generalized {T}-Codes",
journal = j-J-UCS,
volume = "2",
number = "11",
pages = "769--795",
day = "28",
month = nov,
year = "1996",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed May 28 19:32:35 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/data_compression_and_serial_communiction",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Misc{Haeberli:1996:GOC,
author = "Paul Haeberli",
title = "{Grafica Obscura}: Collected Computer Graphics Hacks",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sgi.com/grafica/huffman/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Grafica (1996)
|http://www.sgi.com/grafica/huffman/|.",
}
@InProceedings{Hafner:1996:RIC,
author = "U. Hafner",
title = "Refining image compression with weighted finite
automata",
crossref = "Storer:1996:DDC",
pages = "359--368",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488341",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488341",
acknowledgement = ack-nhfb,
}
@InProceedings{Hahn:1996:DLV,
author = "P. J. Hahn and V. J. Mathews",
title = "Distortion-limited vector quantization",
crossref = "Storer:1996:DDC",
pages = "340--348",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488339",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488339",
acknowledgement = ack-nhfb,
}
@Article{Haley:1996:IVR,
author = "Michael B. Haley and Edwin H. Blake",
title = "Incremental Volume Rendering Using Hierarchical
Compression",
journal = j-CGF,
volume = "15",
number = "3",
pages = "C45--C55",
month = sep,
year = "1996",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.1530045",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Tue Mar 17 15:44:38 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Cape Town",
affiliationaddress = "Rondebosch, S Afr",
classification = "716.1; 722.4; 723.1; 723.2; 723.5; 741; B6120B
(Codes); C1160 (Combinatorial mathematics); C5260B
(Computer vision and image processing techniques);
C6120 (File organisation); C6130B (Graphics
techniques); C6180 (User interfaces)",
conference = "Proceedings of the 1996 17th Annual Conference and
Exhibition of the European Association for Computer
Graphics, EUROGRAPHICS'96",
conflocation = "Poitiers, France; 26-30 Aug. 1996",
conftitle = "European Association for Computer Graphics 17th Annual
Conference and Exhibition. EUROGRAPHICS '96",
corpsource = "Dept. of Comput. Sci., Cape Town Univ., Rondebosch,
South Africa",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
journalabr = "Comput Graphics Forum",
keywords = "algorithm; Algorithms; average workstations;
Bandwidth; bandwidth network links; Computer hardware;
Computer networks; Computer simulation; Computer
workstations; Data compression; data compression; Data
compression; data compression; Data structures; data
structures; Feedback; Hierarchical compression;
hierarchical compression; hierarchical data structure;
high; image coding; Image communication systems; Image
compression; incremental classification; Incremental
volume rendering; incremental volume rendering;
Interactive computer graphics; memory footprint; memory
overhead; Memory overheads; microcomputer applications;
multiscale nature; Octree; octree; Octree; octree data
structure; octrees; original Shear-Warp Factorisation
algorithm; rapid user feedback; rendering; rendering
(computer graphics); Rendering algorithm; rendering
algorithm; Rendering algorithm; Shear Warp
factorisation; Shear-Warp algorithm; Storage allocation
(computer); user feedback; user interfaces; volume
data; volumetric data; Volumetric datasets; volumetric
datasets; workstation",
meetingaddress = "Poitiers, Fr",
meetingdate = "Aug 26--30 1996",
meetingdate2 = "08/26--30/96",
sponsor = "CNRS; ERCIM; BARCO; EDF; SUN; et al",
sponsororg = "CNRS; BARCO; Electr. France; et al",
treatment = "P Practical",
}
@Article{Hart:1996:FIC,
author = "John C. Hart",
title = "Fractal image compression and recurrent iterated
function systems",
journal = j-IEEE-CGA,
volume = "16",
number = "4",
pages = "25--33",
month = jul,
year = "1996",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/38.511849",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Jan 25 06:42:48 MST 1997",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-nhfb,
affiliation = "Washington State Univ., Pullman, WA, USA",
classification = "723.2; 723.5; 741; 921.3; 921.4; 921.6",
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
journalabr = "IEEE Comput Graphics Appl",
keywords = "Affine transformations; Algorithms; Chaos game;
Computational geometry; Computer graphics;
Decompression; Digraph topology; Edge detection;
Encoding process; Fractal geometry; Fractal image
compression; Fractals; Functions; Hutchinson operator;
Image coding; Image compression; Inverse problems;
Iterative methods; Mathematical transformations;
Recurrent iterated function systems; Recurrent modeling
theory; Set theory; Vectors",
}
@InProceedings{Hoang:1996:ECM,
author = "D. T. Hoang and P. M. Long and J. S. Vitter",
title = "Efficient cost measures for motion compensation at low
bit rates",
crossref = "Storer:1996:DDC",
pages = "102--111",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488315",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488315",
acknowledgement = ack-nhfb,
}
@Article{Hoces:1996:MRB,
author = "Carlos Hoces",
title = "Media Reviews: a Broad Guide to Data Compression:
{{\em Introduction to Data Compression} by Khalid
Sayood (Morgan Kaufmann Publishers, 1995, 600 pp.,
\$64.95, ISBN 1-55860-346-8)}",
journal = j-IEEE-MULTIMEDIA,
volume = "3",
number = "3",
pages = "91--92",
month = "Fall",
year = "1996",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/mmul.1996.556546",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 29 16:49:42 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "http://dlib.computer.org/mu/books/mu1996/pdf/u3090.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@InProceedings{Howard:1996:LLC,
author = "P. G. Howard",
title = "Lossless and lossy compression of text images by soft
pattern matching",
crossref = "Storer:1996:DDC",
pages = "210--219",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488326",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488326",
acknowledgement = ack-nhfb,
}
@Article{Howard:1996:PLI,
author = "Paul G. Howard and Jeffrey Scott Vitter",
title = "Parallel lossless image compression using {Huffman}
and arithmetic coding",
journal = j-INFO-PROC-LETT,
volume = "59",
number = "2",
pages = "65--73",
day = "22",
month = jul,
year = "1996",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(96)00090-7",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information, image
and video signal processing); C1250 (Pattern
recognition); C1260 (Information theory); C5260B
(Computer vision and image processing techniques);
C6110P (Parallel programming)",
corpsource = "Visual Commun. Res., AT and T Res., Holmdel, NJ, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "arithmetic coding; data compression; error modeling;
hierarchical MLP; Huffman codes; Huffman coding; image
coding; image compression; parallel; parallel
algorithms; parallelization; prediction",
treatment = "T Theoretical or Mathematical",
}
@InProceedings{Huber:1996:GLD,
author = "A. K. Huber and S. E. Budge",
title = "Global and local distortion inference during embedded
zerotree wavelet decompression",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488373",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488373",
acknowledgement = ack-nhfb,
}
@InProceedings{Inglis:1996:BLD,
author = "S. J. Inglis and I. H. Witten",
title = "Bi-level document image compression using layout
information",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488374",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488374",
acknowledgement = ack-nhfb,
}
@Article{Jackson:1996:PAD,
author = "David Jeff Jackson and Greg Scott Tinney",
title = "Performance analysis of distributed implementations of
a fractal image compression algorithm",
journal = j-CPE,
volume = "8",
number = "5",
pages = "357--386",
month = jun,
year = "1996",
CODEN = "CPEXEI",
DOI = "https://doi.org/10.1002/(sici)1096-9128(199606)8:5<357::aid-cpe228>3.0.co;2-6",
ISSN = "1040-3108",
ISSN-L = "1040-3108",
bibdate = "Tue Sep 7 06:06:25 MDT 1999",
bibsource = "http://www.interscience.wiley.com/jpages/1040-3108/;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/cpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=23284",
acknowledgement = ack-nhfb,
fjournal = "Concurrency, practice and experience",
}
@Article{Jackson:1996:PPF,
author = "David Jeff Jackson and Wagdy Mahmoud",
title = "Parallel pipelined fractal image compression using
quadtree recomposition",
journal = j-COMP-J,
volume = "39",
number = "1",
pages = "1--13",
month = "????",
year = "1996",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/39.1.1",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:46 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/39/1.toc;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_39/Issue_01/Vol39_01.index.html",
URL = "http://comjnl.oxfordjournals.org/content/39/1/1.full.pdf+html;
http://www.oup.co.uk/jnls/list/comjnl/hdb/Volume_39/Issue_01/390001.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/Volume_39/Issue_01/Vol39_01.body.html#AbstractJackson",
acknowledgement = ack-nhfb,
classcodes = "B6140C (Optical information, image and video signal
processing); B6120B (Codes); C5260B (Computer vision
and image processing techniques); C6110P (Parallel
programming); C6120 (File organisation)",
corpsource = "Dept. of Electr. Eng., Alabama Univ., Tuscaloosa, AL,
USA",
email-1 = "jjackson@tiger.carl.ua.edu",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "circular; circulating pipeline computation;
compression ratios; data compression; fractal coding;
fractals; image; image coding; iterative; linear
processor array; nCUBE-2; parallel algorithms; parallel
pipelined fractal image compression; parallel runtime
performance; pipeline processing; quadtree; quadtree
decomposition scheme; quadtree image sub-blocks;
quadtrees; recombination; recomposition; reconstructed
image fidelity; reconstruction; signal to noise ratios;
software performance evaluation; supercomputer",
treatment = "P Practical; X Experimental",
}
@InProceedings{Jafarkhani:1996:FRS,
author = "H. Jafarkhani and N. Farvardin",
title = "Fast reconstruction of subband decomposed signals for
progressive transmission",
crossref = "Storer:1996:DDC",
pages = "230--239",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488328",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488328",
acknowledgement = ack-nhfb,
}
@Article{Kaerkkaeinen:1996:LZI,
author = "J. Kaerkkaeinen and E. Sutinen",
title = "{Lempel--Ziv} Index for $q$-Grams",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1136",
pages = "378--??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Dec 21 09:47:26 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Kieffer:1996:LCB,
author = "J. Kieffer and E-H. Yang and G. Nelson and P. Cosman",
title = "Lossless compression via bisection trees",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ece.umn.edu/users/kieffer/index.html",
acknowledgement = ack-ds,
rawdata = "Kieffer, J., E-H. Yang, G. Nelson, and P. Cosman
(1996b) ``Lossless compression via bisection trees,''
at |http://www.ece.umn.edu/users/kieffer/index.html|.",
}
@Misc{Kieffer:1996:TQM,
author = "J. Kieffer and G. Nelson and E-H. Yang",
title = "Tutorial on the quadrisection method and related
methods for lossless data compression.",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ece.umn.edu/users/kieffer/index.html",
acknowledgement = ack-ds,
rawdata = "Kieffer, J., G. Nelson, and E-H. Yang (1996a)
``Tutorial on the quadrisection method and related
methods for lossless data compression.'' Available at
URL\hfil\break
|http://www.ece.umn.edu/users/kieffer/index.html|.",
}
@InProceedings{Kiselyov:1996:ICI,
author = "O. Kiselyov and P. Fisher",
title = "Image compression with iterated function systems,
finite automata and zerotrees: grand unification",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488375",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488375",
acknowledgement = ack-nhfb,
}
@Book{Koman:1996:GAS,
author = "Richard Koman",
title = "{GIF} Animation Studio: Animating Your {Web} Site",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xi + 159",
month = oct,
year = "1996",
ISBN = "1-56592-230-1",
ISBN-13 = "978-1-56592-230-3",
LCCN = "TK5105.888 .K65 1996",
bibdate = "Mon May 11 11:04:24 1998",
bibsource = "ftp://ftp.ora.com/pub/products/catalogs/book.catalog;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ora.bib",
price = "US\$39.95",
URL = "http://www.oreilly.com/catalog/9781565922303;
http://www.oreilly.com/catalog/gif",
acknowledgement = ack-nhfb,
}
@InProceedings{Kontoyiannis:1996:SEE,
author = "I. Kontoyiannis and Y. M. Suhov",
title = "Stationary entrophy estimation via string matching",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488376",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488376",
acknowledgement = ack-nhfb,
}
@InProceedings{Kossentini:1996:ACU,
author = "F. Kossentini and M. W. Macon and M. J. T. Smith",
title = "Audio coding using variable-depth multistage
quantizers",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488377",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488377",
acknowledgement = ack-nhfb,
}
@Article{Kuroda:1996:FBM,
author = "Hideo Kuroda and Dan C. Popescu and Hong Yan",
title = "Fast block matching method for image data compression
based on fractal models",
journal = j-PROC-SPIE,
volume = "2501",
number = "??",
pages = "1257--1266",
month = "????",
year = "1996",
CODEN = "PSISDG",
ISSN = "????",
ISSN-L = "0277-786X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@Article{Lam:1996:ESC,
author = "Wai-Man Lam and Sanjeev R. Kulkarni",
title = "Extended Synchronizing Codewords for Binary Prefix
Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "42",
number = "3",
pages = "984--987",
month = may,
year = "1996",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.490560",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Lam, Wai-Man and Sanjeev R. Kulkarni (1996) ``Extended
Synchronizing Codewords for Binary Prefix Codes,'' {\it
IEEE Transactions on Information Theory},
{\bf42}(3):984--987, May.",
}
@InProceedings{Langi:1996:CAO,
author = "A. Langi and W. Kinsner",
title = "Compression of aerial ortho images based on image
denoising",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488378",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488378",
acknowledgement = ack-nhfb,
}
@InProceedings{Larsson:1996:EAS,
author = "N. J. Larsson",
title = "Extended application of suffix trees to data
compression",
crossref = "Storer:1996:DDC",
pages = "190--199",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488324",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488324",
acknowledgement = ack-nhfb,
}
@InProceedings{Levine:1996:SVQ,
author = "E. Levine",
title = "Stochastic vector quantization, and stochastic {VQ}
with state feedback using neural networks",
crossref = "Storer:1996:DDC",
pages = "330--339",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488338",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488338",
acknowledgement = ack-nhfb,
}
@Article{Lin:1996:PLF,
author = "Huawu Lin and Anastasios N. Venetsanopoulos",
title = "Perceptually lossless fractal image compression",
journal = j-PROC-SPIE,
volume = "2727",
number = "??",
pages = "1394--1399",
month = "????",
year = "1996",
CODEN = "PSISDG",
ISSN = "????",
ISSN-L = "0277-786X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@InProceedings{Linder:1996:DVQ,
author = "T. Linder and G. Lugosi and K. Zeger",
title = "Designing vector quantizers in the presence of source
noise or channel noise",
crossref = "Storer:1996:DDC",
pages = "33--42",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488308",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488308",
acknowledgement = ack-nhfb,
}
@InProceedings{Ling:1996:CDT,
author = "Nam Ling and Jui-Rua Li",
title = "A codebook design technique for better image quality
in vector quantization",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488379",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488379",
acknowledgement = ack-nhfb,
}
@InProceedings{Ling:1996:HSM,
author = "Nam Ling and R. Advani",
title = "A high speed motion estimator using {$2$-D} log search
algorithm",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488380",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488380",
acknowledgement = ack-nhfb,
}
@Article{Loew:1996:APM,
author = "Murray H. Loew and Dunling Li and Raymond L.
Pickholtz",
title = "Adaptive {PIFS} model in fractal image compression",
journal = j-PROC-SPIE,
volume = "2707",
number = "??",
pages = "284--293",
month = "????",
year = "1996",
CODEN = "PSISDG",
ISSN = "????",
ISSN-L = "0277-786X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@InProceedings{Louchard:1996:ARR,
author = "G. Louchard and W. Szpankowski",
title = "Average redundancy rate of the {Lempel--Ziv} code",
crossref = "Storer:1996:DDC",
pages = "92--101",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488314",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488314",
acknowledgement = ack-nhfb,
}
@Article{Lucente:1996:CHB,
author = "M. Lucente",
title = "Computational holographic bandwidth compression",
journal = j-IBM-SYS-J,
volume = "35",
number = "3\&4",
pages = "349--366",
month = "",
year = "1996",
CODEN = "IBMSA7",
DOI = "https://doi.org/10.1147/sj.353.0349",
ISSN = "0018-8670",
bibdate = "Thu Jan 09 09:34:48 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmsysj.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Systems Journal",
}
@Article{Ma:1996:MRB,
author = "Kai-Kuang Ma",
title = "Media Reviews: Block Truncation Coding in Perspective:
{{\em Image Data Compression: Block Truncation Coding},
by Belur V. Dasarathy (IEEE Computer Society Press,
1995, 284 pp., \$50 list, \$40 members, ISBN
0-89186-6876-4)}",
journal = j-IEEE-MULTIMEDIA,
volume = "3",
number = "2",
pages = "83--84",
month = "Summer",
year = "1996",
CODEN = "IEMUE4",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 29 16:49:41 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "http://dlib.computer.org/mu/books/mu1996/pdf/u2083.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@InProceedings{Malvar:1996:LOV,
author = "H. S. Malvar and G. J. Sullivan and G. W. Wornell",
title = "Lapped orthogonal vector quantization",
crossref = "Storer:1996:DDC",
pages = "320--329",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488337",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488337",
acknowledgement = ack-nhfb,
}
@InProceedings{Martins:1996:BLI,
author = "B. Martins and S. Forchhammer",
title = "Bi-level image compression with tree coding",
crossref = "Storer:1996:DDC",
pages = "270--279",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488332",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488332",
acknowledgement = ack-nhfb,
}
@Article{Mathews:1996:EDC,
author = "G. Jason Mathews",
title = "Evaluating Data-Compression Algorithms",
journal = j-DDJ,
volume = "21",
number = "1",
pages = "50--53",
month = jan,
year = "1996",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Space Science Data Cent Interoperable Systems",
classification = "723.1; 723.2; 723.3; 723.5; C6120 (File
organisation); C6130 (Data handling techniques); C6160
(Database management systems (DBMS))",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; Archival systems; Codes (SYMBOLS); Common
data format; Common Data Format; Computer aided
software engineering; Computer software; Computer
software portability; Data access; Data compression;
Data compression algorithm; Data handling; Data
management systems; Data manipulation; Data reduction;
Data sets; Data storage; Data structures; Data types;
Database systems; Dimensionality; General-purpose
algorithm; High-performance speed requirements;
Multidimensional arrays; Multidimensional data sets;
NASA/Goddard Space Flight Center; Programming
interface; Scalar data items; Source code; Utility
programs; Vectors",
thesaurus = "Data compression; Data structures; Database management
systems; Software portability",
}
@Article{McGregor:1996:FFC,
author = "D. R. McGregor and R. J. Fryer and P. Cockshott and P.
Murray",
title = "Faster Fractal Compression",
journal = j-DDJ,
volume = "21",
number = "1",
pages = "34, 36, 38--40",
month = jan,
year = "1996",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Strathclyde Univ.",
affiliationaddress = "Glasgow, Scotl",
classification = "721.1; 722.1; 722.4; 723.2; 921.3; C1130 (Integral
transforms); C1180 (Optimisation techniques); C1250
(Pattern recognition); C4240C (Computational
complexity); C5260B (Computer vision and image
processing techniques); C6130 (Data handling
techniques)",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Algorithms; Associative storage; Computational
complexity; Compute cost; Data structures; Fast Fourier
transforms; Fast fractal transform; Fractal
compression; Fractal image compression; Fractals; High
compression ratios; Image compression; Image
reconstruction; Optimization techniques; Response time
(COMPUTER systems)",
pagecount = "5",
thesaurus = "Computational complexity; Data compression; Fractals;
Image reconstruction; Optimisation; Transforms",
}
@InProceedings{Moffat:1996:ECI,
author = "A. Moffat and L. Stuiver",
title = "Exploiting clustering in inverted file compression",
crossref = "Storer:1996:DDC",
pages = "82--91",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488313",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488313",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:1996:IMR,
author = "A. Moffat and A. Turpin",
title = "On the implementation of minimum-redundancy prefix
codes",
crossref = "Storer:1996:DDC",
pages = "170--179",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488322",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488322",
acknowledgement = ack-nhfb,
}
@Article{Moffat:1996:SII,
author = "Alistair Moffat and Justin Zobel",
title = "Self-Indexing Inverted Files for Fast Text Retrieval",
journal = j-TOIS,
volume = "14",
number = "4",
pages = "349--379",
month = oct,
year = "1996",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/237496.237497",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80/tois/abstracts/moffat.html",
abstract = "Query-processing costs on large text databases are
dominated by the need to retrieve and scan the inverted
list of each query term. Retrieval time for inverted
lists can be greatly reduced by the use of compression,
but this adds to the CPU time required. Here we show
that the CPU component of query response time for
conjunctive Boolean queries and for informal ranked
queries can be similarly reduced, at little cost in
terms of storage, by the inclusion of an internal index
in each compressed inverted list. This method has been
applied in a retrieval system for a collection of
nearly two million short documents. Our experimental
results show that the self-indexing strategy adds less
than 20\% to the size of the compressed inverted file,
which itself occupies less than 10\% of the indexed
text, yet can reduce processing time for Boolean
queries of 5-10 terms to under one fifth of the
previous cost. Similarly, ranked queries of 40-50 terms
can be evaluated in as little as 25\% of the previous
time, with little or no loss of retrieval
effectiveness.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Melbourne",
affiliationaddress = "Parkville, Aust",
classification = "716.1; 722.1; 723.2; 723.3; 903.1; 903.3",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Boolean queries; Data compression; Data storage
equipment; File organization; Full text retrieval;
Index compression; Indexing (of information);
Information retrieval; Information retrieval systems;
Inverted file; Query languages; Query processing; Self
indexing",
}
@Article{Mulcahy:1996:PSW,
author = "Colm Mulcahy",
title = "Plotting and Scheming with Wavelets",
journal = j-MATH-MAG,
volume = "69",
number = "5",
pages = "323--343",
month = dec,
year = "1996",
CODEN = "MAMGA8",
DOI = "https://doi.org/10.2307/2691277",
ISSN = "0025-570X",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.spelman.edu/~colm/csam.ps",
acknowledgement = ack-ds,
fjournal = "Mathematics Magazine",
journal-URL = "http://www.maa.org/pubs/mathmag.html",
rawdata-1 = "Mulcahy, Colm (1996) ``Plotting and Scheming with
Wavelets,'' {\it Mathematics Magazine},
{\bf69}(5):323--343, December. See also
|http://www.spelman.edu/~colm/csam.ps|.",
rawdata-2 = "Mulcahy, Colm (1996) ``Plotting and Scheming with
Wavelets,'' {\it Mathematics Magazine},
{\bf69}(5):323--343, December. Also available as
|http://www.spelman.edu/~colm/csam.ps|.",
}
@InProceedings{Murashita:1996:HSS,
author = "K. Murashita and N. Satoh and Y. Okada and S.
Yoshida",
title = "High-speed statistical compression using
self-organized rules and predetermined code tables",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488381",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488381",
acknowledgement = ack-nhfb,
}
@Article{Murray:1996:SSP,
author = "James D. Murray",
title = "{SPIFF}: Still picture interchange file format",
journal = j-DDJ,
volume = "21",
number = "7",
pages = "34, 36, 38, 40--41",
month = jul,
year = "1996",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jan 9 09:35:43 MST 1997",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
classification = "723.2; 723.3; 723.5; 902.2",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Bitmap data; Computer aided software engineering; Data
compression; Data structures; Database systems;
Decoding; Directory; Entry tags; File layout; File
organization; Image coding; Image compression; JPEG
file interchange format; Pixels; Specifications;
Standards; Still picture interchange file format",
pagecount = "5",
}
@Article{Nagumo:1996:LLF,
author = "Hideo Nagumo and Mi Lu and Karan Watson",
title = "On-line longest fragment first parsing algorithm",
journal = j-INFO-PROC-LETT,
volume = "59",
number = "2",
pages = "91--96",
day = "22",
month = jul,
year = "1996",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/0020-0190(96)00066-x",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C6130 (Data handling techniques)",
corpsource = "Dept. of Electr. Eng., Texas A and M Univ., College
Station, TX, USA",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "data compression; dictionary indexes; grammars; LFF
parsing; longest fragment first parsing; on-line
algorithm; static dictionary compression",
treatment = "T Theoretical or Mathematical",
}
@InProceedings{Nakamura:1996:DCC,
author = "Hirofumi Nakamura and Sadayuki Murashima",
booktitle = "{Proceedings of the IEEE International Symposium on
Information Theory and its Applications, Victoria, BC,
Canada}",
title = "Data Compression by Concatenations of Symbol Pairs",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "496--499",
month = sep,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Nakamura, Hirofumi and Sadayuki Murashima (1996)
``Data Compression by Concatenations of Symbol Pairs,''
{\it Proceedings of the IEEE International Symposium on
Information Theory and its Applications}, (Victoria,
BC, Canada), pp. 496--499, September.",
}
@InProceedings{Nash:1996:PVQ,
author = "C. L. Nash and R. A. Olshen and R. M. Gray",
title = "Predictive vector quantization with ridge regression",
crossref = "Storer:1996:DDC",
pages = "310--319",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488336",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488336",
acknowledgement = ack-nhfb,
}
@InProceedings{Nastea:1996:PIO,
author = "S. G. Nastea and T. El-Ghazawi and O. Frieder",
title = "Parallel input\slash output impact on sparse matrix
compression",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488382",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488382",
acknowledgement = ack-nhfb,
}
@Book{Nelson:1996:DCB,
author = "Mark Nelson and Jean-Loup Gailly",
title = "The data compression book",
publisher = pub-MT,
address = pub-MT:adr,
edition = "Second",
pages = "xiii + 557",
year = "1996",
ISBN = "1-55851-434-1",
ISBN-13 = "978-1-55851-434-8",
LCCN = "QA76.9.D33 N46 1996",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
tableofcontents = "1. Introduction to Data Compression \\
2. The Data-Compression Lexicon, with a History \\
3. The Dawn Age: Minimum Redundancy Coding \\
4. A Significant Improvement: Adaptive Huffman Coding
\\
5. Huffman One Better: Arithmetic Coding \\
6. Statistical Modeling \\
7. Dictionary-Based Compression \\
8. Sliding Window Compression \\
9. LZ78 Compression \\
10. Speech Compression \\
11. Lossy Graphics Compression \\
12. An Archiving Package \\
13. Fractal Image Compression \\
Appendix A. Statistics for Compression Programs \\
Appendix B. Test Programs",
}
@InProceedings{Nevill-Manning:1996:CSS,
author = "C. G. Nevill-Manning and I. H. Witten and D. R.
{Olsen, Jr.}",
title = "Compressing semi-structured text using hierarchical
phrase identifications",
crossref = "Storer:1996:DDC",
pages = "63--72",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488311",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488311",
acknowledgement = ack-nhfb,
}
@PhdThesis{Nevill-Manning:1996:ISS,
author = "C. G. Nevill-Manning",
title = "Inferring Sequential Structure",
type = "{Ph.D.} Thesis",
school = "Department of Computer Science, University of
Waikato",
address = "Waikato, NZ",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Nevill-Manning, C. G. (1996) ``Inferring Sequential
Structure,'' Ph.D. thesis, Department of Computer
Science, University of Waikato, New Zealand.",
}
@MastersThesis{Ng:1996:LCV,
author = "Kent Wai Ng",
title = "Lossless compression of voiceband data signals",
type = "Dissertation/Thesis",
school = "The University of Manitoba",
address = "Winnipeg, MB, Canada",
pages = "79",
year = "1996",
ISBN = "0-612-13401-6",
ISBN-13 = "978-0-612-13401-0",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304322906",
acknowledgement = ack-nhfb,
advisor = "H. C. Card",
classification = "0544: Electrical engineering",
subject = "Electrical engineering",
}
@InProceedings{Ohnesorge:1996:PMM,
author = "K. W. Ohnesorge and R. Sennhauser",
title = "Parameterized {Markov} models for efficient
compression of grayscale images",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488383",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488383",
acknowledgement = ack-nhfb,
}
@InProceedings{Ortega:1996:OBA,
author = "A. Ortega",
title = "Optimal bit allocation under multiple rate
constraints",
crossref = "Storer:1996:DDC",
pages = "349--358",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488340",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488340",
acknowledgement = ack-nhfb,
}
@InProceedings{Rahman:1996:WCR,
author = "Z.-u. Rahman",
title = "Wavelet coding for remote sensed data",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488384",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488384",
acknowledgement = ack-nhfb,
}
@Misc{Rand:1996:RPC,
author = "D. Rand",
title = "{RFC 1962}: The {PPP} Compression Control Protocol
({CCP})",
pages = "??",
month = jun,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Updated by RFC2153 \cite{Simpson:1997:RPV}. Status:
PROPOSED STANDARD.",
URL = "ftp://ftp.internic.net/rfc/rfc1962.txt;
ftp://ftp.internic.net/rfc/rfc2153.txt;
https://www.math.utah.edu/pub/rfc/rfc1962.txt;
https://www.math.utah.edu/pub/rfc/rfc2153.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=18005 bytes",
online = "yes",
rawdata = "RFC1962 (1996) {\it The PPP Compression Control
Protocol (CCP)}, available from many sources.",
status = "PROPOSED STANDARD",
updatedby = "Updated by RFC2153 \cite{Simpson:1997:RPV}.",
}
@Book{Rao:1996:TSI,
author = "K. R. Rao and J. J. Hwang",
title = "Techniques and Standards for Image, Video, and Audio
Coding",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rao, K. R., and J. J. Hwang (1996) {\it Techniques and
Standards for Image, Video, and Audio Coding}, Upper
Saddle River, NJ, Prentice Hall.",
}
@InProceedings{Ratnakar:1996:ERO,
author = "V. Ratnakar and M. Livny",
title = "Extending {RD-OPT} with global thresholding for {JPEG}
optimization",
crossref = "Storer:1996:DDC",
pages = "379--386",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488343",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488343",
acknowledgement = ack-nhfb,
}
@InProceedings{Rivals:1996:GCS,
author = "E. Rivals and J.-P. Delahaye and M. Dauchet and O.
Delgrange",
title = "A guaranteed compression scheme for repetitive {DNA}
sequences",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488385",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488385",
acknowledgement = ack-nhfb,
}
@Article{Roger:1996:LCA,
author = "R. E. Roger and M. C. Cavenor",
title = "Lossless Compression of {AVIRIS} Images",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "5",
number = "5",
pages = "713--719",
month = may,
year = "1996",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.495955",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Roger, R. E., and M. C. Cavenor (1996) ``Lossless
Compression of AVIRIS Images,'' {\it IEEE Transactions
on Image Processing}, {\bf5}(5):713--719, May.",
}
@Article{Sadeh:1996:ODC,
author = "I. Sadeh",
title = "Optimal data compression algorithm",
journal = j-COMPUT-MATH-APPL,
volume = "32",
number = "5",
pages = "57--72",
month = sep,
year = "1996",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/0898-1221(96)00135-6",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:48:32 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0898122196001356",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Sadeh:1996:UDC,
author = "Ilan Sadeh",
title = "Universal Data Compression Algorithm Based on
Approximate String Matching",
journal = j-PROBAB-ENGRG-INFORM-SCI,
volume = "10",
number = "4",
pages = "465--486",
month = oct,
year = "1996",
CODEN = "????",
DOI = "https://doi.org/10.1017/S0269964800004502",
ISSN = "0269-9648 (print), 1469-8951 (electronic)",
ISSN-L = "0269-9648",
bibdate = "Thu Aug 24 08:19:22 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://www.cambridge.org/core/product/F03252060CD00649B02534E0CF74CD68",
acknowledgement = ack-nhfb,
ajournal = "Probab. Engrg. Inform. Sci.",
fjournal = "Probability in the Engineering and Informational
Sciences",
journal-URL = "http://www.journals.cambridge.org/jid_PES",
onlinedate = "01 July 2009",
}
@Article{Said:1996:NFE,
author = "A. Said and W. A. Pearlman",
title = "A New Fast and Efficient Image Codec Based on Set
Partitioning in Hierarchical Trees",
journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH,
volume = "6",
number = "6",
pages = "243--250",
month = jun,
year = "1996",
CODEN = "ITCTEM",
ISSN = "1051-8215 (print), 1558-2205 (electronic)",
ISSN-L = "1051-8215",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Circuits and Systems for Video
Technology",
rawdata = "Said, A. and W. A. Pearlman (1996), ``A New Fast and
Efficient Image Codec Based on Set Partitioning in
Hierarchical Trees,'' {\it IEEE Transactions on
Circuits and Systems for Video Technology},
{\bf6}(6):243--250, June.",
}
@InProceedings{Sarma:1996:HRT,
author = "D. Das Sarma and D. W. Matula",
title = "Hardware Reciprocal Table Compression\slash
Decompression Techniques",
crossref = "Alefeld:1996:SCV",
pages = "11--17",
year = "1996",
bibdate = "Mon May 20 06:32:10 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib; OCLC
Proceedings database",
acknowledgement = ack-nhfb,
}
@Article{Saupe:1996:LDP,
author = "Dietmar Saupe",
title = "Lean domain pools for fractal image compression",
journal = j-PROC-SPIE,
volume = "2669",
number = "??",
pages = "150--157",
month = jan,
year = "1996",
CODEN = "PSISDG",
DOI = "https://doi.org/10.1117/1.482688",
ISSN = "????",
ISSN-L = "0277-786X",
bibdate = "Sat Sep 8 13:53:06 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
}
@Book{Sayood:1996:IDC,
author = "Khalid Sayood",
title = "Introduction to Data Compression",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adrsf,
pages = "xx + 636",
year = "1996",
ISBN = "1-55860-346-8",
ISBN-13 = "978-1-55860-346-2",
LCCN = "TK5102.92 .S39 1996",
bibdate = "Mon Jan 28 06:42:59 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Coding theory",
xxpages = "xviii + 475",
}
@InProceedings{Slyz:1996:PLT,
author = "M. J. Slyz and D. L. Neuhoff",
title = "Piecewise linear tree-structured models for lossless
image compression",
crossref = "Storer:1996:DDC",
pages = "260--269",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488331",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488331",
acknowledgement = ack-nhfb,
}
@Book{Stollnitz:1996:WCG,
author = "E. J. Stollnitz and T. D. DeRose and D. H. Salesin",
title = "Wavelets for Computer Graphics",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adrsf,
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata-1 = "Stollnitz, E. J., T. D. DeRose, and D. H. Salesin
(1996) {\it Wavelets for Computer Graphics}, San
Francisco, CA, Morgan Kaufmann.",
rawdata-2 = "Stollnitz, E. J., T. D. DeRose, and D. H. Salesin
(1996) {\it Wavelets for Computer Graphics}, San
Francisco, Morgan Kaufmann.",
}
@InProceedings{Storer:1996:LIC,
author = "J. A. Storer",
title = "Lossless image compression using generalized
{LZ1}-type methods",
crossref = "Storer:1996:DDC",
pages = "290--299",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488334",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488334",
acknowledgement = ack-nhfb,
}
@Book{Strang:1996:WFB,
author = "Gilbert Strang and Truong Nguyen",
title = "Wavelets and Filter Banks",
publisher = pub-WCP,
address = pub-WCP:adr,
pages = "xxi + 490",
year = "1996",
ISBN = "0-9614088-7-1",
ISBN-13 = "978-0-9614088-7-9",
LCCN = "TK7872.F5 S79 1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Matlab",
rawdata = "Strang, Gilbert, and Truong Nguyen (1996) {\it
Wavelets and Filter Banks}, Wellesley, MA,
Wellesley-Cambridge Press.",
subject = "Electric filters; Mathematics; Signal processing;
Mathematics; Wavelets (Mathematics)",
}
@InProceedings{Suzuki:1996:CSN,
author = "J. Suzuki",
title = "A {CTW} scheme for non-tree sources",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488386",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488386",
acknowledgement = ack-nhfb,
}
@Misc{Sweldens:1996:BYO,
author = "Wim Sweldens and Peter Schr{\"o}der",
title = "Building Your Own Wavelets At Home",
howpublished = "SIGGRAPH 96 Course Notes. Available on the WWW.",
pages = "??",
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Sweldens, Wim and Peter Schr{\"o}der (1996), {\it
Building Your Own Wavelets At Home}, SIGGRAPH 96 Course
Notes. Available on the WWW.",
}
@InProceedings{Tamir:1996:ECC,
author = "D. E. Tamir and K. Phillips and A. Abdul-Karim",
title = "Efficient chain-code encoding for segmentation-based
image compression",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488387",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488387",
acknowledgement = ack-nhfb,
}
@InProceedings{Teahan:1996:EEU,
author = "W. J. Teahan and J. G. Cleary",
title = "The entropy of {English} using {PPM}-based models",
crossref = "Storer:1996:DDC",
pages = "53--62",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488310",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488310",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Teng:1996:QGW,
author = "Chia-Yuan Teng and D. L. Neuhoff",
title = "Quadtree-guided wavelet image coding",
crossref = "Storer:1996:DDC",
pages = "406--415",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488346",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488346",
acknowledgement = ack-nhfb,
}
@InProceedings{Tian:1996:LIC,
author = "Jun Tian and R. O. {Wells, Jr.}",
title = "A lossy image codec based on index coding",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488388",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488388",
acknowledgement = ack-nhfb,
}
@InProceedings{Topiwala:1996:HPW,
author = "P. Topiwala",
title = "High performance wavelet image compression optimized
for {MSE} and {HVS} metrics",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488389",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488389",
acknowledgement = ack-nhfb,
}
@MastersThesis{Trott:1996:AWLa,
author = "Aaron Gregory Trott",
title = "The application of wavelets to lossless compression
and progressive transmission of floating point data in
three-dimensional curvilinear grids",
type = "{M.S.E.E.} thesis",
school = "Mississippi State University",
address = "Mississippi State, MS 39762, USA",
pages = "103",
year = "1996",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://search.proquest.com/docview/304273691",
acknowledgement = ack-nhfb,
advisor = "Robert J. Moorhead",
classification = "0538: Aerospace materials; 0544: Electrical
engineering",
dissertation-thesis-number = "1379238",
subject = "Electrical engineering; Aerospace materials",
}
@InProceedings{Trott:1996:AWLb,
author = "A. Trott and R. Moorhead and J. Mcginley",
title = "The application of wavelets to lossless compression
and progressive transmission of floating point data in
{$3$-D} curvilinear grids",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488390",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488390",
acknowledgement = ack-nhfb,
}
@Article{Turner:1996:ELI,
author = "Martin J. Turner and Neil E. Wiseman",
title = "Efficient Lossless Image Contour Coding",
journal = j-CGF,
volume = "15",
number = "2",
pages = "107--117",
month = jun,
year = "1996",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.1520107",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Tue Mar 17 15:44:38 MST 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
affiliation = "De Montfort Univ",
affiliationaddress = "Leicester, Engl",
classification = "723.1; 723.2; 723.5; B6120B (Codes); B6140C (Optical
information, image and video signal processing); C5260B
(Computer vision and image processing techniques)",
corpsource = "De Montfort Univ., Leicester, UK",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
journalabr = "Comput Graphics Forum",
keywords = "Algorithms; Boundary descriptions; boundary
descriptions; compression method; Computational
efficiency; Computer graphics; contour coder; Contour
representation; data compression; Decoding; discrete
set; Edge coding; edge coding schemes; edge detection;
efficient lossless image contour coding; image; Image
coding; image coding; Image coding; Image compression;
Image contour coding; Raster image; raster image",
treatment = "P Practical",
}
@InProceedings{Turner:1996:IOU,
author = "M. J. Turner",
title = "Image operations using a semi-compressed contour tree
image definition",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488391",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488391",
acknowledgement = ack-nhfb,
}
@Article{Uhl:1996:PAU,
author = "A. Uhl",
title = "Parallel Algorithms for Using Non-Stationary {MRA} in
Image Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1124",
pages = "151--??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Oct 29 14:12:39 MST 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Uhl:1996:PIC,
author = "A. Uhl and J. Hammerle",
title = "Parallel image compression on a workstation cluster
using {PVM}",
crossref = "Bode:1996:PVM",
pages = "301--??",
year = "1996",
bibdate = "Wed Apr 16 06:39:19 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); B6140C (Optical information, image
and video signal processing); C1250 (Pattern
recognition); C4240P (Parallel programming and
algorithm theory); C5440 (Multiprocessing systems)",
corpsource = "Dept. of Comput. Sci. and Syst. Anal., Salzburg Univ.,
Austria",
keywords = "data compression; FDDI; fractal image compression;
image coding; interconnected workstation-cluster;
parallel algorithms; parallel image compression;
parallel machines; parallel meta-algorithm; PVM;
virtual machines; workstation cluster",
pubcountry = "Germany",
treatment = "A Application; P Practical",
}
@InProceedings{Usevitch:1996:OBA,
author = "B. Usevitch",
title = "Optimal bit allocation for biorthogonal wavelet
coding",
crossref = "Storer:1996:DDC",
pages = "387--395",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488344",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488344",
acknowledgement = ack-nhfb,
}
@InProceedings{Villasenor:1996:SDC,
author = "J. D. Villasenor and R. A. Ergas and P. L. Donoho",
title = "Seismic data compression using high-dimensional
wavelet transforms",
crossref = "Storer:1996:DDC",
pages = "396--405",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488345",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488345",
acknowledgement = ack-nhfb,
}
@Article{Vitter:1996:OPD,
author = "Jeffrey Scott Vitter and P. Krishnan",
title = "Optimal prefetching via data compression",
journal = j-J-ACM,
volume = "43",
number = "5",
pages = "771--793",
month = sep,
year = "1996",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/234752.234753",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Thu Dec 5 11:52:29 MST 1996",
bibsource = "http://www.acm.org/pubs/contents/journals/jacm/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/jacm/234753.html",
abstract = "Caching and prefetching are important mechanisms for
speeding up access time to data on secondary storage.
Recent work in competitive online algorithms has
uncovered several promising new algorithms for caching.
In this paper, we apply a form of the competitive
philosophy for the first time to the problem of
prefetching to develop an optimal universal prefetcher
in terms of fault rate, with particular applications to
large-scale databases and hypertext systems. Our
prediction algorithms with particular applications to
large-scale databases and hypertext systems. Our
prediction algorithms for prefetching are novel in that
they are based on data compression techniques that are
both theoretically optimal and good in practice.
Intuitively, in order to compress data effectively, you
have to be able to predict future data well, and thus
good data compressors should be able to predict well
for purposes of prefetching. We show for powerful
models such as Markov sources and $m$ th order Markov
sources that the page fault rate incurred by our
prefetching algorithms are optimal in the limit for
almost all sequences of page requests.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "algorithms; design; performance; theory",
subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
Management, Swapping. {\bf D.4.2}: Software, OPERATING
SYSTEMS, Storage Management, Virtual memory. {\bf
D.4.8}: Software, OPERATING SYSTEMS, Performance,
Stochastic analysis. {\bf E.4}: Data, CODING AND
INFORMATION THEORY, Data compaction and compression.
{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Learning.",
}
@InProceedings{Weinberger:1996:LLC,
author = "M. J. Weinberger and G. Seroussi and G. Sapiro",
title = "{LOCO-I}: a Low Complexity, Context-Based, Lossless
Image Compression Algorithm",
crossref = "Storer:1996:DDC",
pages = "140--149",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488319",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488319",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata-1 = "Weinberger, M. J., G. Seroussi, and G. Sapiro (1996)
``LOCO-I: A Low Complexity, Context-Based, Lossless
Image Compression Algorithm,'' {\it Proceedings of Data
Compression Conference}, J. Storer, editor, Los
Alamitos, CA, IEEE Computer Society Press, pp.
140--149.",
rawdata-2 = "Weinberger, M. J., G. Seroussi, and G. Sapiro (1996)
``LOCO-I: A Low Complexity, Context-Based, Lossless
Image Compression Algorithm,'' {\it Proceedings of Data
Compression Conference}, Storer J., editor, Los
Alamitos, CA, IEEE Computer Society Press, pp.
140--149.",
}
@PhdThesis{Wilton:1996:AFI,
author = "Andrew Philip Wilton",
title = "Applications of fractals to image data compression",
type = "{Ph.D.} thesis",
school = "Aston University",
address = "Birmingham, UK",
pages = "????",
year = "1996",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Report C519664 (??).",
URL = "http://search.proquest.com/pqdtft/docview/304336659",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
subject = "Computer science",
}
@InProceedings{Wong:1996:OPP,
author = "Ping Wah Wong and N. Moayeri and C. Herley",
title = "Optimum pre- and post-filters for robust scalar
quantization",
crossref = "Storer:1996:DDC",
pages = "240--249",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488329",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488329",
acknowledgement = ack-nhfb,
}
@Misc{Woods:1996:RPD,
author = "J. Woods",
title = "{RFC 1979}: {PPP Deflate Protocol}",
month = aug,
year = "1996",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Status: INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1979.txt;
http://www.faqs.org/rfcs/rfc1979.html;
https://www.math.utah.edu/pub/rfc/rfc1979.txt",
acknowledgement = ack-ds # " and " # ack-nhfb,
format = "TXT=18803 bytes",
online = "yes",
rawdata-1 = "RFC1979 (1996) |http://www.faqs.org/rfcs/rfc1979.html|
({\it PPP Deflate Protocol\/}).",
rawdata-2 = "RFC1979 (1996) {\it PPP Deflate Protocol}, is
|http://www.faqs.org/rfcs/rfc1979.html|.",
status = "INFORMATIONAL",
}
@InProceedings{Wu:1996:ASL,
author = "Xiaolin Wu",
title = "An Algorithmic Study on Lossless Image Compression",
crossref = "Storer:1996:DDC",
pages = "150--159",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488320",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488320",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wu, Xiaolin (1996), ``An Algorithmic Study on Lossless
Image Compression,'' in James A. Storer, ed., {\it DCC
'96, Data Compression Conference}, Los Alamitos, CA,
IEEE Computer Society Press.",
}
@InProceedings{Yang:1996:MMF,
author = "Xuguang Yang and K. Ramchandran",
title = "Morphological motion field representation for
region-based image sequence coding",
crossref = "Storer:1996:DDC",
pages = "112--121",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488316",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488316",
acknowledgement = ack-nhfb,
}
@InProceedings{Yokoo:1996:ADC,
author = "Hidetoshi Yokoo",
title = "An Adaptive Data Compression Method Based on Context
Sorting",
crossref = "Storer:1996:DDC",
pages = "160--169",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488321",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488321",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Yokoo, Hidetoshi (1996) ``An Adaptive Data Compression
Method Based on Context Sorting,'' in {\it Proceedings
of the 1996 Data Compression Conference}, J. Storer,
ed., Los Alamitos, CA, IEEE Computer Society Press, pp.
160--169.",
}
@Article{Yu:1996:DCP,
author = "Tong Lai Yu",
title = "Data Compression for {PC} Software Distribution",
journal = j-SPE,
volume = "26",
number = "11",
pages = "1181--1195",
month = nov,
year = "1996",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Thu Jul 29 15:11:07 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=16769",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Yu:1996:DMC,
author = "Tong Lai Yu",
title = "Dynamic {Markov} Compression",
journal = j-DDJ,
volume = "21",
number = "1",
pages = "30, 32, 96, 98--100",
month = jan,
year = "1996",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "Compendex database;
http://www.ddj.com/index/author/index.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
affiliation = "California State Univ.",
affiliationaddress = "San Bernardino, CA, USA",
classification = "721.1; 723.2; 723.5; 921.6; 922.1; 922.2",
fjournal = "Dr. Dobb's Journal of Software Tools",
journalabr = "Dr Dobb's J Software Tools Prof Program",
keywords = "Binary files; Codes (symbols); Computer aided software
engineering; Computer simulation; Data compression;
Data structures; Decoding; Dynamic Markov compression;
Encoding (SYMBOLS); Finite automata; Finite state;
Markov processes; Mathematical models; Performance;
State assignment; State transition; Statistical
methods",
pagecount = "2",
rawdata = "Yu, Tong Lai (1996) ``Dynamic Markov Compression,''
{\it Dr Dobb's Journal}, pp. 30--31, January.",
xxpages = "30--31",
}
@InProceedings{Yu:1996:SDC,
author = "Tong Lai Yu",
title = "Speech data compression for embedded systems",
crossref = "Storer:1996:DDC",
pages = "??--??",
year = "1996",
DOI = "https://doi.org/10.1109/DCC.1996.488392",
bibdate = "Tue Feb 5 08:26:50 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=488392",
acknowledgement = ack-nhfb,
}
@InProceedings{Aberg:1997:TCC,
author = "J. Aberg and Yu. M. Shtarkov",
title = "Text compression by context tree weighting",
crossref = "Storer:1997:DDC",
pages = "377--386",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582062",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582062",
acknowledgement = ack-nhfb,
}
@InProceedings{Aberg:1997:TUI,
author = "J. Aberg and Yu. M. Shtarkov and B. J. M. Smeets",
title = "Towards understanding and improving escape
probabilities in {PPM}",
crossref = "Storer:1997:DDC",
pages = "22--31",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581954",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581954",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@Article{Ahlswede:1997:UCI,
author = "Rudolf Ahlswede and Te Sun Han and Kingo Kobayashi",
title = "Universal Coding of Integers and Unbounded Search
Trees",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "43",
number = "2",
pages = "669--682",
year = "1997",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.556122",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Ahlswede, Rudolf, Te Sun Han, and Kingo Kobayashi
(1997) ``Universal Coding of Integers and Unbounded
Search Trees,'' {\it IEEE Transactions on Information
Theory}, {\bf43}(2):669--682.",
}
@InProceedings{Albert:1997:VCW,
author = "J. Albert and S. Frank and U. Hafner and M. Unger",
title = "Video compression with weighted finite automata",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582071",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582071",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1997:LGH,
author = "Anonymous",
title = "{Linux Gazette}: History of the Portable Network
Graphics ({PNG}) Format",
journal = j-LINUX-J,
volume = "36",
pages = "??--??",
month = apr,
year = "1997",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Fri Oct 9 08:35:26 MDT 1998",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue36/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Antoshenkov:1997:DBO,
author = "Gennady Antoshenkov",
title = "Dictionary-based order-preserving string compression
(*)",
journal = j-VLDB-J,
volume = "6",
number = "1",
pages = "26--39",
month = feb,
year = "1997",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s007780050031",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Jun 23 10:50:40 MDT 2008",
bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/vldb/vldb6.html;
http://link.springer.de/link/service/journals/00778/tocs/t7006001.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
note = "Electronic edition.",
URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/a/Antoshenkov:Gennady.html;
http://link.springer.de/link/service/journals/00778/bibs/7006001/70060026.htm;
http://link.springer.de/link/service/journals/00778/papers/7006001/70060026.pdf;
http://link.springer.de/link/service/journals/00778/papers/7006001/70060026.ps.gz",
abstract = "As no database exists without indexes, no index
implementation exists without order-preserving key
compression, in particular, without prefix and tail
compression. However, despite the great potentials of
making indexes smaller and faster, application of
general compression methods to ordered data sets has
advanced very little. This paper demonstrates that the
fast dictionary-based methods can be applied to
order-preserving compression almost with the same
freedom as in the general case. The proposed new
technology has the same speed and a compression rate
only marginally lower than the traditional
order-indifferent dictionary encoding. Procedures for
encoding and generating the encode tables are described
covering such order-related features as ordered data
set restrictions, sensitivity and insensitivity to a
character position, and one-symbol encoding of each
frequent trailing character sequence. The experimental
results presented demonstrate five-folded compression
on real-life data sets and twelve-folded compression on
Wisconsin benchmark text fields.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "indexing; order-preserving key compression",
remark = "Check month: January or February??",
}
@InProceedings{Arnavut:1997:BSC,
author = "Z. Arnavut and S. S. Magliveras",
title = "Block sorting and compression",
crossref = "Storer:1997:DDC",
pages = "181--190",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582009",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582009",
acknowledgement = ack-nhfb,
}
@InProceedings{Arnavut:1997:RTB,
author = "Z. Arnavut",
title = "A remapping technique based on permutations for
lossless compression of multispectral images",
crossref = "Storer:1997:DDC",
pages = "407--416",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582067",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582067",
acknowledgement = ack-nhfb,
}
@InProceedings{Arnold:1997:CEL,
author = "R. Arnold and T. Bell",
title = "A corpus for the evaluation of lossless compression
algorithms",
crossref = "Storer:1997:DDC",
pages = "201--210",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582019",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582019",
acknowledgement = ack-nhfb,
}
@InProceedings{Bajaj:1997:PIT,
author = "C. L. Bajaj and Guozhong Zhuang",
title = "Progressive image transmission: an adaptive
quadtree-pruning approach",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582075",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582075",
acknowledgement = ack-nhfb,
}
@Article{Ball:1997:GIF,
author = "Jimmy Ball",
title = "{GIF} Images on the Fly: New images from old, in real
time",
journal = j-LINUX-J,
volume = "43",
pages = "??--??",
month = nov,
year = "1997",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Fri Oct 9 08:35:26 MDT 1998",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue43/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "ftp://ftp.ssc.com/pub/lj/listings/issue43/2411.tgz",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Bao:1997:CCB,
author = "P. G. Bao and S. W.-C. Lam",
title = "Calligraphic character boundary coding with rational
{B}-spline based on energy minimization using genetic
algorithm",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582076",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582076",
acknowledgement = ack-nhfb,
}
@InProceedings{Bayrakeri:1997:TSV,
author = "S. Bayrakeri and R. M. Mersereau",
title = "Temporally scalable video coding using nonlinear
deinterlacing",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582078",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582078",
acknowledgement = ack-nhfb,
}
@Article{Bekesi:1997:GAL,
author = "J{\'o}zsef B{\'e}k{\'e}si and G{\'a}bor Galambos and
Ulrich Pferschy and Gerhard J. Woeginger",
title = "Greedy Algorithms for On-Line Data Compression",
journal = j-J-ALG,
volume = "25",
number = "2",
pages = "274--289",
month = nov,
year = "1997",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1006/jagm.1997.0885",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:16:52 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677497908853",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
@MastersThesis{Benschop:1997:LDC,
author = "Leonard Cornelius Benschop",
title = "Lossless Data Compression in {VLSI}",
type = "Masterarbeit",
school = "Technische Universiteit Eindhoven",
address = "Eindhoven, The Netherlands",
pages = "242",
year = "1997",
ISBN = "90-386-0400-9",
ISBN-13 = "978-90-386-0400-8",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304401746",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "C646520",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Bernardini:1997:OSF,
author = "R. Bernardini and J. Kovacevic",
title = "Orthonormal sets of filters obtained by modulations
and rotations of a prototype",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582079",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582079",
acknowledgement = ack-nhfb,
}
@Article{Bhatt:1997:DTM,
author = "B. Bhatt and D. Birks and D. Hermreck",
title = "Digital television: making it work",
journal = j-IEEE-SPECTRUM,
volume = "34",
number = "10",
pages = "19--28",
month = oct,
year = "1997",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.625222",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "asynchronous transfer mode; Asynchronous transfer
mode; ATM router; central switch; compressed bit
stream; compressed format conversion; compressed
operations; compressed technology; computer networks;
Computer networks; data compression; digital audio;
digital television; Digital TV; encoders; HDTV;
high-speed ATM computer network; network interface
device; NIST HDBT project; offline transcoder;
Production; servers; Splicing; studio control
workstation; Switches; telecommunication computing;
telecommunication control; Telecommunication control;
telecommunication network routing; telecommunications
networks; television broadcasting; television
equipment; television studios; TV broadcasting; TV
editing; TV production; TV studios; US standard; video
coding; Video compression; video production",
}
@InProceedings{Bhattacharjee:1997:PAA,
author = "S. Bhattacharjee and S. Das and Y. Chowdhury and P. P.
Chaudhuri",
title = "A pipelined architecture algorithm for image
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582080",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582080",
acknowledgement = ack-nhfb,
}
@Article{Bookstein:1997:MWO,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "Modeling Word Occurrences for the Compression of
Concordances",
journal = j-TOIS,
volume = "15",
number = "3",
pages = "254--290",
month = jul,
year = "1997",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/256163.256166",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80/tois/abstracts/bookstein.html",
abstract = "An earlier paper developed a procedure for compressing
concordances, assuming that all elements occurred
independently. The models introduced in that paper are
extended here to take the possibility of clustering
into account. The concordance is conceptualized as a
set of bitmaps, in which the bit locations represent
documents, and the one-bits represent the occurrence of
given terms. Hidden Markov Models (HMMs) are used to
describe the clustering of the one-bits. However, for
computational reasons, the HMM is approximated by
traditional Markov models. A set of criteria is
developed to constrain the allowable set of n-state
models, and a full inventory is given for n less than
or equal 4. Graph-theoretic reduction and
complementation operations are defined among the
various models and are used to provide a structure
relating the models studied. Finally, the new methods
were tested on the concordances of the English Bible
and of two of the world's largest full-text retrieval
system: the Tr{\'e}sor de la Langue Fran{\c{c}}aise and
the Responsa Project.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Chicago",
affiliationaddress = "Chicago, IL, USA",
classification = "723.2; 903.3; 921; 921.4; 921.6; 922.1",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Approximation theory; Classification (of information);
Computational methods; Data compression; Data storage
equipment; Data structures; Full text retrieval
systems; Graph theory; Hidden Markov models (HMM);
Information retrieval systems; Markov processes;
Mathematical models",
wwwpages = "254--291",
}
@InProceedings{Bookstein:1997:ORT,
author = "A. Bookstein and S. T. Klein and T. Raita",
title = "An overhead reduction technique for mega-state
compression schemes",
crossref = "Storer:1997:DDC",
pages = "367--376",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582061",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582061",
acknowledgement = ack-nhfb,
}
@InProceedings{Bunton:1997:ETL,
author = "S. Bunton",
title = "An executable taxonomy of on-line modeling
algorithms",
crossref = "Storer:1997:DDC",
pages = "42--51",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581959",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581959",
acknowledgement = ack-nhfb,
}
@InProceedings{Bunton:1997:GIP,
author = "S. Bunton",
title = "Generalization and improvement to {PPM}'s `blending'",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582082",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582082",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Bunton:1997:PSS,
author = "S. Bunton",
title = "A percolating state selector for suffix-tree context
models",
crossref = "Storer:1997:DDC",
pages = "32--41",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581957",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581957",
acknowledgement = ack-nhfb,
}
@Article{Carpentieri:1997:NLI,
author = "B. Carpentieri",
title = "A New Lossless Image Compression Algorithm Based on
Arithmetic Coding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1311",
pages = "54--??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Carpentieri:1997:NTV,
author = "B. Carpentieri and G. Motta",
title = "A new trellis vector residual quantizer with
applications to speech and image coding",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582083",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582083",
acknowledgement = ack-nhfb,
}
@Article{Carson:1997:SPP,
author = "George S. Carson",
title = "Standards Pipeline: {PNG}, {VRML 97}, {BIIF}, Imaging
Standards",
journal = j-COMP-GRAPHICS,
volume = "31",
number = "3",
pages = "18--20",
month = aug,
year = "1997",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/262171.262179",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Tue Mar 12 17:52:47 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sgml.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
}
@Book{Chaitin:1997:LM,
author = "Gregory J. Chaitin",
title = "The Limits of Mathematics",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Chaitin, Gregory J. (1997) {\it The Limits of
Mathematics}, Singapore, Springer-Verlag.",
}
@InProceedings{Chan:1997:FTD,
author = "R. K. W. Chan and M. C. Lee",
title = "A fast three dimensional {Discrete Cosine Transform}",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582085",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582085",
acknowledgement = ack-nhfb,
}
@Article{Chang:1997:LAD,
author = "Chin-Chen Chang and Chih-Hung Wang",
title = "A Locally Adaptive Data Compression Strategy for
{Chinese--English} Characters",
journal = j-J-SYST-SOFTW,
volume = "36",
number = "2",
pages = "167--179",
month = feb,
year = "1997",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/0164-1212(95)00200-6",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Sep 9 05:51:44 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Chen:1997:FCV,
author = "Shenfeng Chen and J. H. Reif",
title = "Fast and compact volume rendering in the compressed
transform domain",
crossref = "Storer:1997:DDC",
pages = "271--280",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582050",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582050",
acknowledgement = ack-nhfb,
}
@InProceedings{Chin:1997:PRC,
author = "Yi-Jen Chin and T. Berger",
title = "Perceptual rate control algorithms for fax-based video
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582086",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582086",
acknowledgement = ack-nhfb,
}
@Article{Chow:1997:PIF,
author = "S. K. Chow and M. Gillies and S. L. Chan",
title = "Parallel Implementation of Fractal Image Compression
Using Multiple Digital Signal Processors",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1351",
pages = "I--??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Chrysafis:1997:ECB,
author = "C. Chrysafis and A. Ortega",
title = "Efficient context-based entropy coding for lossy
wavelet image compression",
crossref = "Storer:1997:DDC",
pages = "241--250",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582047",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582047",
acknowledgement = ack-nhfb,
}
@InProceedings{Chu:1997:MAC,
author = "Chung-Tao Chu and D. Anastassiou and Shih-Fu Chang",
title = "Motion-adapted content-based temporal scalability in
very low bitrate video coding",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582087",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582087",
acknowledgement = ack-nhfb,
}
@Article{Chung:1997:EHD,
author = "Kuo-Liang Chung",
title = "Efficient {Huffman} decoding",
journal = j-INFO-PROC-LETT,
volume = "61",
number = "2",
pages = "97--99",
day = "28",
month = feb,
year = "1997",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(96)00204-9",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "68P05 (94B35)",
MRnumber = "1 439 875",
bibdate = "Sat Nov 7 17:55:50 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
note = "See comment \cite{Turpin:1998:CEH}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Cleary:1997:ULC,
author = "John G. Cleary and W. J. Teahan",
title = "Unbounded Length Contexts for {PPM}",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "67--75",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.67",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/67.full.pdf+html;
http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractCleary;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractCleary",
acknowledgement = ack-ds # " and " # ack-nhfb,
email-1 = "jcleary@cs.waikato.ac.nz",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "prediction by partial matching (PPM) data compression
algorithm",
rawdata = "Cleary, John G. and W. J. Teahan (1997) ``Unbounded
Length Contexts for PPM,'' {\it The Computer Journal},
{\bf40}(2/3):67--75.",
}
@InProceedings{Constantinescu:1997:FRC,
author = "C. Constantinescu and R. Arps",
title = "Fast Residue Coding for Lossless Textual Image
Compression",
crossref = "Storer:1997:DDC",
pages = "397--406",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582065",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582065",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Constantinescu, C., and R. Arps (1997) ``Fast Residue
Coding for Lossless Textual Image Compression,'' {\it
Proceedings of the 1997 Data Compression Conference},
J. Storer, ed., Los Alamitos, CA, IEEE Computer Society
Press, pp. 397--406.",
}
@InProceedings{Creusere:1997:LMC,
author = "C. D. Creusere",
title = "Out-of-loop motion compensation for reduced complexity
video encoding",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582084",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582084",
acknowledgement = ack-nhfb,
}
@InProceedings{Crump:1997:ILB,
author = "V. J. Crump and T. R. Fischer",
title = "Intraframe low bit rate video coding robust to packet
erasure",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582088",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582088",
acknowledgement = ack-nhfb,
}
@InProceedings{Culik:1997:CSLa,
author = "K. {Culik II} and J. Kari and V. Valenta",
title = "Compression of silhouette-like images based on {WFA}",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582089",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582089",
acknowledgement = ack-nhfb,
}
@Article{Culik:1997:CSLb,
author = "Karel {Culik II} and Vladimir Valenta and Jarkko
Kari",
title = "Compression of Silhouette-like Images Based on {WFA}",
journal = j-J-UCS,
volume = "3",
number = "10",
pages = "1100--1113",
day = "28",
month = oct,
year = "1997",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://medoc.springer.de:8000/jucs/jucs_3_10/compression_of_silhouette_like",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
rawdata = "Culik, Karel II, and V. Valenta (1997b) ``Compression
of Silhouette-like Images Based on WFA,'' {\it Journal
of Universal Computer Science}, {\bf3}:1100--1113.",
}
@Article{Culik:1997:FAB,
author = "Karel {Culik II} and Vladimir Valenta",
title = "Finite Automata Based Compression of Bi-Level and
Simple Color Images",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "21",
number = "1",
pages = "61--68",
month = jan # "--" # feb,
year = "1997",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/s0097-8493(96)00070-2",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_free/browse/browse.cgi?year=1997&volume=21&issue=1;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_sub/browse/browse.cgi?year=1997&volume=21&issue=1&aid=9600070",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
rawdata = "Culik, Karel II, and V. Valenta (1997a) ``Finite
Automata Based Compression of Bi-Level and Simple Color
Images,'' {\it Computer and Graphics},
{\bf21}:61--68.",
}
@InProceedings{Danciu:1997:FCC,
author = "I. M. Danciu and J. C. Hart",
title = "Fractal color compression in the {L$^*$ a$^*$ b$^*$}
uniform color space",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582090",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582090",
acknowledgement = ack-nhfb,
}
@InProceedings{Davis:1997:ICU,
author = "G. M. Davis and S. Chawla",
title = "Image coding using optimized significance tree
quantization",
crossref = "Storer:1997:DDC",
pages = "387--396",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582064",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582064",
acknowledgement = ack-nhfb,
}
@InProceedings{Denecker:1997:ECS,
author = "K. Denecker and J. van Overloop and I. Lemahieu",
title = "An experimental comparison of several lossless image
coders for medical images",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582091",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582091",
acknowledgement = ack-nhfb,
}
@Article{Dhem:1997:LCA,
author = "J. F. Dhem and J. J. Quisquater",
title = "Lossless compression algorithms for smart cards: A
progress report",
journal = j-FUT-GEN-COMP-SYS,
volume = "13",
number = "1",
pages = "27--38",
month = jun,
year = "1997",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/S0167-739X(97)89109-1",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue May 07 13:52:32 2013",
bibsource = "http://www.elsevier.com/locate/issn/0167739X;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X97891091",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@InProceedings{Effros:1997:FWU,
author = "M. Effros",
title = "Fast weighted universal transform coding: toward
optimal, low complexity bases for image compression",
crossref = "Storer:1997:DDC",
pages = "211--220",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582021",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582021",
acknowledgement = ack-nhfb,
}
@InProceedings{Fenwick:1997:SRT,
author = "P. Fenwick",
title = "Symbol ranking text compressors",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582093",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582093",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1997:AVQa,
author = "J. E. Fowler and S. C. Ahalt",
title = "Adaptive vector quantization using generalized
threshold replenishment",
crossref = "Storer:1997:DDC",
pages = "317--326",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582055",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582055",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1997:AVQb,
author = "J. E. Fowler",
title = "Adaptive vector quantization --- {Part I}: a unifying
structure",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582094",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582094",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:1997:AVQc,
author = "J. E. Fowler",
title = "Adaptive vector quantization. {II}. {Classification}
and comparison of algorithms",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582095",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582095",
acknowledgement = ack-nhfb,
}
@InProceedings{Fox:1997:CAT,
author = "A. Fox and T. Grun",
title = "Compressing address trace data for cache simulations",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582096",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582096",
acknowledgement = ack-nhfb,
}
@Article{Franz:1997:ACS,
author = "M. Franz",
title = "Adaptive Compression of Syntax Trees and Iterative
Dynamic Code Optimization: Two Basic Technologies for
Mobile Object Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1222",
pages = "263--??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Aug 22 11:59:49 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gage:1997:RAD,
author = "Philip Gage",
title = "Random Access Data Compression",
journal = j-CCCUJ,
volume = "15",
number = "9",
pages = "23--??",
month = sep,
year = "1997",
CODEN = "CCUJEX",
ISSN = "1075-2838",
bibdate = "Wed Aug 20 10:24:19 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "C/C++ Users Journal",
}
@InProceedings{Garcia-Frias:1997:ATC,
author = "J. Garcia-Frias and J. D. Villasenor",
title = "An analytical treatment of channel-induced distortion
in run length coded subbands",
crossref = "Storer:1997:DDC",
pages = "52--61",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581965",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581965",
acknowledgement = ack-nhfb,
}
@InProceedings{Goyal:1997:UTC,
author = "V. K. Goyal and J. Zhuang and M. Vetterli",
title = "Universal transform coding based on backward
adaptation",
crossref = "Storer:1997:DDC",
pages = "231--240",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582046",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582046",
acknowledgement = ack-nhfb,
}
@InProceedings{Graf:1997:EIC,
author = "U. Graf",
title = "Encoding of intervals with conditional coding",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582097",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582097",
acknowledgement = ack-nhfb,
}
@InProceedings{Greene:1997:PZL,
author = "D. Greene and M. Vishwanath and F. Yao and Tong
Zhang",
title = "Progressive {Ziv--Lempel} encoding of synthetic
images",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582099",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582099",
acknowledgement = ack-nhfb,
}
@InProceedings{Hahn:1997:PLI,
author = "P. J. Hahn and V. J. Mathews",
title = "Perceptually lossless image compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582100",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582100",
acknowledgement = ack-nhfb,
}
@InProceedings{Hamzaoui:1997:QBV,
author = "R. Hamzaoui and B. Ganz and D. Saupe",
title = "Quadtree based variable rate oriented mean shape-gain
vector quantization",
crossref = "Storer:1997:DDC",
pages = "327--336",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582056",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582056",
acknowledgement = ack-nhfb,
}
@Article{Han:1997:EDE,
author = "Wei-Yu Han and Ja- Chen Lin",
title = "Edge detection and edge-preserved compression for
error- diffused images",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "21",
number = "6",
pages = "757--767",
month = nov # "--" # dec,
year = "1997",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/s0097-8493(97)00055-1",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Tue Oct 5 21:18:21 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_free/browse/browse.cgi?year=1997&volume=21&issue=6;
https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/cag/cas_sub/browse/browse.cgi?year=1997&volume=21&issue=6&aid=9700055",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Helfgott:1997:GNS,
author = "H. A. Helfgott and J. A. Storer",
title = "Generalized node splitting and bilevel image
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582102",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582102",
acknowledgement = ack-nhfb,
}
@InProceedings{Helfgott:1997:MPS,
author = "H. Helfgott and M. Cohn",
title = "On maximal parsings of strings",
crossref = "Storer:1997:DDC",
pages = "291--299",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582052",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582052",
acknowledgement = ack-nhfb,
}
@Article{Hlavac:1997:ANL,
author = "V. Hlavac and J. Fojtik",
title = "Adaptive Non-linear Predictor for Lossless Image
Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1296",
pages = "279--??",
year = "1997",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/s006070050028",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Hoang:1997:LFM,
author = "D. T. Hoang and E. L. Linzer and J. S. Vitter",
title = "A lexicographic framework for {MPEG} rate control",
crossref = "Storer:1997:DDC",
pages = "101--110",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581982",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581982",
acknowledgement = ack-nhfb,
}
@Book{Hoffman:1997:DCD,
author = "Roy (Roy L.) Hoffman",
title = "Data compression in digital systems",
publisher = pub-CHAPMAN-HALL,
address = pub-CHAPMAN-HALL:adr,
pages = "xvi + 415",
year = "1997",
ISBN = "0-412-08551-8",
ISBN-13 = "978-0-412-08551-2",
LCCN = "QA76.9.D33 H64 1997",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Digital multimedia standards series.",
abstract = "Beginning with early history and continuing to
leading-edge applications and technology of data
compression, this comprehensive account will enlighten
a diverse audience. Information system managers,
product and market analysis, and consultants who need
to become acquainted with data compression technology
and understand how it is changing the world of digital
systems will gain valuable knowledge from the text. In
addition, the book provides system designers,
developers, engineers, programmers, and scientists with
the knowledge needed to apply data compression in
applications and products.",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Digital
electronics",
tableofcontents = "Trademarks \\
1. Overview \\
2. Data Compression in the Marketplace \\
3. Marketplace Factors \\
4. Compression Algorithms for Symbolic Data \\
5. Compression Algorithms for Diffuse Data \\
6. Computer Applications \\
7. Communications - Network Applications \\
8. Communications - Broadcasting Applications \\
9. Consumer-Electronics Applications \\
10. Publishing Applications \\
11. Entertainment Applications \\
12. Healthcare Applications \\
13. Digital System Design \\
14. Managing Compressed Data \\
15. A Window On The Future",
}
@Book{ISO:1997:IIIm,
author = "{ISO}",
title = "{ISO\slash IEC 10918-3:1997: Information technology
--- Digital compression and coding of continuous-tone
still images: Extensions}",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "80",
year = "1997",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Tue Dec 12 07:21:13 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
price = "CHF 164",
URL = "http://www.iso.ch/cate/d25037.html",
acknowledgement = ack-nhfb,
keywords = "JPEG",
pricecode = "W",
}
@TechReport{ITU-R:1997:MSA,
author = "ITU-R and BS1116",
title = "Methods for the Subjective Assessment of Small
Impairments in Audio Systems Including Multichannel
Sound Systems",
type = "UTR-R document",
number = "BS 1116 (Rev. 1)",
institution = "ITU",
address = "Geneva, Switzerland",
pages = "??",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "ITU-R/BS1116 (1997) ITU-R, document BS 1116 ``Methods
for the Subjective Assessment of Small Impairments in
Audio Systems Including Multichannel Sound Systems,''
Rev. 1, Geneva.",
}
@InProceedings{Jacquin:1997:CAP,
author = "A. Jacquin and H. Okada and P. Crouch",
title = "Content-adaptive postfiltering for very low bit rate
video",
crossref = "Storer:1997:DDC",
pages = "111--120",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581986",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581986",
acknowledgement = ack-nhfb,
}
@InProceedings{Jafarkhani:1997:ECS,
author = "H. Jafarkhani and H. Brunk and N. Farvardin",
title = "Entropy-constrained successively refinable scalar
quantization",
crossref = "Storer:1997:DDC",
pages = "337--346",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582057",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582057",
acknowledgement = ack-nhfb,
}
@Book{Jayant:1997:SCC,
editor = "N. Jayant",
title = "Signal Compression: Coding of Speech, Audio, Text,
Image and Video",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "??",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Jayant N. (ed.) (1997) {\it Signal Compression: Coding
of Speech, Audio, Text, Image and Video}, Singapore,
World Scientific Publications.",
}
@InProceedings{Jones:1997:CCM,
author = "D. K. Jones and M. W. Maier",
title = "Compression comparisons for multiview stereo",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582103",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582103",
acknowledgement = ack-nhfb,
}
@InProceedings{Karadimitriou:1997:ICM,
author = "K. Karadimitriou and M. Fenstermacher",
title = "Image compression in medical image databases using set
redundancy",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582104",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582104",
acknowledgement = ack-nhfb,
}
@InProceedings{Kess:1997:CGR,
author = "B. L. Kess and S. E. Reichenbach",
title = "Capturing global redundancy to improve compression of
large images",
crossref = "Storer:1997:DDC",
pages = "62--71",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581967",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581967",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:1997:EWV,
author = "Beong-Jo Kim and W. A. Pearlman",
title = "An embedded wavelet video coder using
three-dimensional set partitioning in hierarchical
trees ({SPIHT})",
crossref = "Storer:1997:DDC",
pages = "251--260",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582048",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582048",
acknowledgement = ack-nhfb,
}
@Article{Klein:1997:EOR,
author = "S. T. Klein",
title = "Efficient Optimal Recompression",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "117--126",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.117",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:49 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/117.full.pdf+html;
http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractKlein;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractKlein",
acknowledgement = ack-nhfb,
email-1 = "tomi@cs.biu.ac.il",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Kolarav:1997:CFD,
author = "K. Kolarav and W. Lynch",
title = "Compression of functions defined on surfaces of {$3$D}
objects",
crossref = "Storer:1997:DDC",
pages = "281--290",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582051",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582051",
acknowledgement = ack-nhfb,
}
@MastersThesis{Kopooshian:1997:DCE,
author = "Hrag H. Kopooshian",
title = "Data compression and encryption",
type = "Thesis ({M.S.})",
school = "California State University, Northridge",
address = "Northridge, CA, USA",
pages = "vi + 127",
year = "1997",
bibdate = "Mon Oct 19 08:47:56 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kosaraju:1997:SEB,
author = "S. Rao Kosaraju and G. Manzini",
title = "Some entropic bounds for {Lempel--Ziv} algorithms",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582106",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582106",
acknowledgement = ack-nhfb,
}
@InProceedings{Kruse:1997:DCU,
author = "H. Kruse and A. Mukherjee",
title = "Data compression using text encryption",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582107",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582107",
acknowledgement = ack-nhfb,
}
@InProceedings{Lakhani:1997:EJI,
author = "G. Lakhani",
title = "Enhancements to the {JPEG} implementation of block
smoothing method",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582108",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582108",
acknowledgement = ack-nhfb,
}
@Book{Li:1997:VDC,
editor = "Hua Harry Li and Shan Sun and Haluk Derin",
title = "Video data compression for multimedia computing:
statistically based and biologically inspired
techniques",
volume = "{SECS 378}",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xvi + 421",
year = "1997",
ISBN = "0-7923-9790-8",
ISBN-13 = "978-0-7923-9790-8",
LCCN = "QA76.575 .V52 1997",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "The Kluwer international series in engineering and
computer science; Multimedia systems and applications",
URL = "http://www.loc.gov/catdir/enhancements/fy0820/96047147-d.html;
http://www.loc.gov/catdir/enhancements/fy0820/96047147-t.html",
acknowledgement = ack-nhfb,
subject = "Multimedia systems; Video compression",
}
@InProceedings{Liang:1997:RBV,
author = "J. Liang and I. Moccagatta and K. Oehler",
title = "Region-based video coding with embedded zero-trees",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582110",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582110",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1997:OJC,
author = "C. C. Lin and D. J. Pease and R. R. Raje",
title = "An optimal-joint-coordinate block matching algorithm
for motion-compensated coding",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582111",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582111",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:1997:SAT,
author = "J. Lin",
title = "The search accuracy of tree-structured {VQ}",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582112",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582112",
acknowledgement = ack-nhfb,
}
@Article{Lippert:1997:CDV,
author = "L. Lippert and M. H. Gross and C. Kurmann",
title = "Compression Domain Volume Rendering for Distributed
Environments",
journal = j-CGF,
volume = "16",
number = "3",
pages = "C95--C107",
day = "4--8",
month = sep,
year = "1997",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.16.3conferenceissue.11",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Oct 11 06:13:34 MDT 2000",
bibsource = "Compendex database;
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&src=cts;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "aid=146&
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&
iid=3& src=ard& vid=16",
acknowledgement = ack-nhfb,
affiliation = "Federal Inst of Technology",
affiliationaddress = "Zurich, Switz",
author-1-adr = "Department of Computer Science, Federal Institute of
Technology, Z{\"u}rich, Switzerland",
author-2-adr = "Department of Computer Science, Federal Institute of
Technology, Z{\"u}rich, Switzerland",
author-3-adr = "Department of Computer Science, Federal Institute of
Technology, Z{\"u}rich, Switzerland",
classification = "721.1; 722.4; 723.2; 723.5; 921.3",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
journalabr = "Comput Graphics Forum",
keywords = "Bandwidth; Client server; Computer graphics; Computer
networks; Constraint theory; Distributed computer
systems; Encoding (symbols); Image compression; Image
quality; Interactive computer systems; Volume
compression method; Volume rendering method; Wavelet
transforms",
}
@Article{Liu:1997:NTS,
author = "C. P. Liu",
title = "A New Two Successive Process Image Compression
Technique Using Subband Coding and {JPEG} Discrete
Cosine Transform Coding",
journal = j-GRAPH-MODELS-IMAGE-PROC,
volume = "59",
number = "3",
pages = "179--191",
month = may,
year = "1997",
CODEN = "GMIPF4",
DOI = "https://doi.org/10.1006/gmip.1997.0430",
ISSN = "1077-3169",
ISSN-L = "1077-3169",
bibdate = "Wed Mar 8 15:09:14 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=gmip;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.idealibrary.com/links/artid/gmip.1997.0430/production;
http://www.idealibrary.com/links/artid/gmip.1997.0430/production/pdf",
acknowledgement = ack-nhfb,
fjournal = "Graphical models and image processing: GMIP",
journal-URL = "http://www.sciencedirect.com/science/journal/10773169",
}
@InProceedings{Loewenstern:1997:SLE,
author = "D. Loewenstern and P. N. Yianilos",
title = "Significantly lower entropy estimates for natural
{DNA} sequences",
crossref = "Storer:1997:DDC",
pages = "151--160",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581998",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581998",
acknowledgement = ack-nhfb,
}
@InProceedings{Long:1997:TCA,
author = "P. M. Long and A. I. Natsev and J. S. Vitter",
title = "Text compression via alphabet re-representation",
crossref = "Storer:1997:DDC",
pages = "161--170",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582003",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582003",
acknowledgement = ack-nhfb,
}
@InProceedings{LoPresto:1997:ICB,
author = "S. M. LoPresto and K. Ramchandran and M. T. Orchard",
title = "Image coding based on mixture modeling of wavelet
coefficients and a fast estimation-quantization
framework",
crossref = "Storer:1997:DDC",
pages = "221--230",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582045",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582045",
acknowledgement = ack-nhfb,
}
@Article{Manber:1997:TCS,
author = "Udi Manber",
title = "A Text Compression Scheme That Allows Fast Searching
Directly in the Compressed File",
journal = j-TOIS,
volume = "15",
number = "2",
pages = "124--136",
month = apr,
year = "1997",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/248625.248639",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 16 19:04:41 MST 1999",
bibsource = "Compendex database;
http://www.acm.org/pubs/tois/toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80/tois/abstracts/manber.html",
abstract = "A new text compression scheme is presented in this
article. The main purpose of this scheme is to speed up
string matching by searching the compressed file
directly. The scheme requires no modification of the
string-matching algorithm, which is used as a black
box; any string-matching procedure can be used.
Instead, the pattern is modified; only the outcome of
the matching of the modified pattern against the
compressed file is decompressed. Since the compressed
file is smaller than the original file, the search is
faster both in terms of I/O time and processing time
than a search in the original file. For typical text
files, we achieve about 30\% reduction of space and
slightly less of search time. A 30\% space saving is
not competitive with good text compression schemes, and
thus should not be used where space is the predominant
concern. The intended applications of this scheme are
files that are searched often, such as catalogs,
bibliographic files, and address books. Such files are
typically not compressed, but with this scheme they can
remain compressed indefinitely, saving space while
allowing faster search at the same time. A particular
application to an information retrieval system that we
developed is also discussed.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Arizona",
affiliationaddress = "Tucson, AZ, USA",
classification = "723; 723.2; 723.5; 903.3",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journalabr = "ACM Trans Inf Syst",
keywords = "Algorithms; Data compression; Information retrieval
systems; Pattern recognition; String matching
algorithms",
}
@InProceedings{Manor:1997:ITU,
author = "D. Manor and M. Feder",
title = "An iterative technique for universal lossy compression
of individual sequences",
crossref = "Storer:1997:DDC",
pages = "141--150",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581995",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581995",
acknowledgement = ack-nhfb,
}
@InProceedings{Marchand:1997:NIP,
author = "J. F. P. Marchand and H. E. Rhody",
title = "Noncausal image prediction and reconstruction",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582114",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582114",
acknowledgement = ack-nhfb,
}
@InProceedings{Martins:1997:LLC,
author = "B. Martins and S. Forchhammer",
title = "Lossy\slash lossless coding of bi-level images",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582116",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582116",
acknowledgement = ack-nhfb,
}
@InProceedings{Meadows:1997:LBR,
author = "S. Meadows and S. Mitra",
title = "Low bit rate color image coding with adaptive encoding
of wavelet coefficients",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582118",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582118",
acknowledgement = ack-nhfb,
}
@Article{Memon:1997:RDC,
author = "N. Memon and X. Wu",
title = "Recent Developments in Context-Based Predictive
Techniques for Lossless Image Compression",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "127--136",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.127",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:49 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/127.full.pdf+html;
http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractMemon;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractMemon",
acknowledgement = ack-nhfb,
author-2-adr = "Department of Computer Science, The University of
Western Ontario, London, Ontario, Canada N6A 5B7",
email-1 = "memon@cs.niu.edu",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{mme:1997:CFR,
author = "{\O}yvind Str{\o}mme and Douglas R. McGregor",
booktitle = "Proceedings of The First European Conference on Signal
Analysis and Prediction (ECSAP 97), Prague,
Czechoslovakia",
title = "Comparison of Fidelity of Reproduction of Images After
Lossy Compression Using Standard and Nonstandard
Wavelet Decompositions",
publisher = "????",
address = "????",
pages = "??",
month = jun,
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Str\o mme, \O yvind, and Douglas R. McGregor (1997)
``Comparison of Fidelity of Reproduction of Images
After Lossy Compression Using Standard and Nonstandard
Wavelet Decompositions,'' in {\it Proceedings of The
First European Conference on Signal Analysis and
Prediction (ECSAP 97)}, Prague, June.",
}
@Article{Moffat:1997:ESI,
author = "A. Moffat",
title = "Editorial for Special Issue on Lossless Compression",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "65--66",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2/3.65",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Jul 21 09:55:08 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractEditorial;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractEditorial;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractEditorial",
acknowledgement = ack-nhfb,
email-1 = "alistair@cs.mu.oz.au",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Moni:1997:FAS,
author = "S. Moni and S. Sista",
title = "A framework for application specific image
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582119",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582119",
acknowledgement = ack-nhfb,
}
@Article{Mulcahy:1997:ICU,
author = "Colm Mulcahy",
title = "Image Compression Using the {Haar} Wavelet Transform",
journal = j-SPELMAN-SCI-MATH-J,
volume = "1",
number = "1",
pages = "22--31",
month = apr,
year = "1997",
CODEN = "",
ISSN = "1098-4593",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "It has been claimed that any smart 15-year-old could
follow this introduction to wavelets",
URL = "http://www.spelman.edu/~colm/wav.ps",
acknowledgement = ack-ds,
fjournal = "Spelman Science and Mathematics Journal",
rawdata-1 = "Mulcahy, Colm (1997) ``Image Compression Using the
Haar Wavelet Transform,'' {\it Spelman College Science
and Mathematics Journal}, {\bf1}(1):22--31, April. Also
available at URL |http://www.spelman.edu/~colm/wav.ps|.
(It has been claimed that any smart 15-year-old could
follow this introduction to wavelets.)",
rawdata-2 = "Mulcahy, Colm (1997) ``Image Compression Using the
Haar Wavelet Transform,'' {\it Spelman College Science
and Mathematics Journal}, {\bf1}(1):22--31, April. Also
available as |http://www.spelman.edu/~colm/wav.ps|. (It
has been claimed that any smart 15-year-old could
follow this introduction to wavelets.)",
xxjournal = "Spelman College Science and Mathematics Journal",
}
@Article{Nelson:1997:JZF,
author = "Mark R. Nelson and Mark Nelson",
title = "{Java} and the Zip File Format: Using {Java} to
compress and extract files",
journal = j-DDJ,
volume = "22",
number = "12",
pages = "50, 52--54, 102",
month = dec,
year = "1997",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 09 13:00:54 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/java.bib",
abstract = "By compressing data and reducing the number of
download transactions, Sun's java.util.zip package
speeds the loading of applet components across the
Internet. Data-compression guru Mark Nelson examines
this package.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Nevill-Manning:1997:CEU,
author = "C. G. Nevill-Manning and Ian H. Witten",
title = "Compression and Explanation Using Hierarchical
Grammars",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "103--116",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.103",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/103.full.pdf+html;
http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractNevill;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractNevill;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractNevill",
acknowledgement = ack-ds # " and " # ack-nhfb,
email-1 = "cgn@cs.waikato.ac.nz",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
rawdata = "Nevill-Manning, C. G., and Ian H. Witten (1997)
``Compression and Explanation Using Hierarchical
Grammars,'' {\it The Computer Journal},
{\bf40}(2/3):104--116.",
xxpages = "104--116",
}
@InProceedings{Nevill-Manning:1997:LTI,
author = "C. G. Nevill-Manning and I. H. Witten",
title = "Linear-time, incremental hierarchy inference for
compression",
crossref = "Storer:1997:DDC",
pages = "3--11",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581951",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581951",
acknowledgement = ack-nhfb,
}
@InProceedings{Ng:1997:WBM,
author = "K. S. Ng and L. M. Cheng",
title = "Word based multiple dictionary scheme for text
compression with application to {$2$D} bar code",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582120",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582120",
acknowledgement = ack-nhfb,
}
@InProceedings{Nguyen-Phi:1997:BLI,
author = "K. Nguyen-Phi and H. Weinrichter",
title = "Bi-level image compression using adaptive tree model",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582122",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582122",
acknowledgement = ack-nhfb,
}
@InProceedings{Nguyen-Phi:1997:FIT,
author = "K. Nguyen-Phi and H. Weinrichter",
title = "Fast implementation of two-level compression method
using {QM}-coder",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582123",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582123",
acknowledgement = ack-nhfb,
}
@InProceedings{Nosratinia:1997:PWM,
author = "A. Nosratinia",
title = "Parametric warping for motion estimation",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582124",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582124",
acknowledgement = ack-nhfb,
}
@InProceedings{Ogunbona:1997:CBR,
author = "P. O. Ogunbona and P. Sangassapaviriya",
title = "Content-based retrieval from compressed-image
databases",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582126",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582126",
acknowledgement = ack-nhfb,
}
@InProceedings{Okada:1997:EMC,
author = "Y. Okada and M. Tokuyo and S. Yoshida and N. Okayasu
and H. Shimoi",
title = "Effective management of compressed data with packed
file systems",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582127",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582127",
acknowledgement = ack-nhfb,
}
@InProceedings{Panagopoulou:1997:ESC,
author = "G. Panagopoulou and S. Sirmakessis and A. Tsakalidis",
title = "Efficient storage compression for {$3$D} regions",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582128",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582128",
acknowledgement = ack-nhfb,
}
@InProceedings{Pavlovic:1997:UTI,
author = "V. Pavlovic and K. Ramchandran and P. Moulin",
title = "`Universal' transform image coding based on joint
adaptation of filter banks, tree structures and
quantizers",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582130",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582130",
acknowledgement = ack-nhfb,
}
@InProceedings{Puga:1997:CGG,
author = "A. T. Puga and A. P. Alves",
title = "Compression of generalised {Gaussian} sources",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582131",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582131",
acknowledgement = ack-nhfb,
}
@InProceedings{Ramos:1997:RIC,
author = "M. G. Ramos and S. S. Hemami",
title = "Robust image coding with perceptual-based
scalability",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582133",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582133",
acknowledgement = ack-nhfb,
}
@InProceedings{Regunathan:1997:MIC,
author = "S. L. Regunathan and K. Rose and S. Gadkari",
title = "Multimode image coding for noisy channels",
crossref = "Storer:1997:DDC",
pages = "82--90",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581974",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581974",
acknowledgement = ack-nhfb,
}
@Article{Robinson:1997:EGP,
author = "John A. Robinson",
title = "Efficient General-Purpose Image Compression with
Binary Tree Predictive Coding",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "6",
number = "4",
pages = "601--607",
month = apr,
year = "1997",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.563325",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Robinson, John A. (1997) ``Efficient General-Purpose
Image Compression with Binary Tree Predictive Coding,''
{\it IEEE Transactions on Image Processing},
{\bf6}(4):601--607 April.",
}
@InProceedings{Ruhl:1997:OFC,
author = "M. Ruhl and H. Hartenstein",
title = "Optimal fractal coding is {NP}-hard",
crossref = "Storer:1997:DDC",
pages = "261--270",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582049",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582049",
acknowledgement = ack-nhfb,
}
@InProceedings{Satoh:1997:SJT,
author = "N. Satoh and T. Morihara and Y. Okada and S. Yoshida",
title = "Study of {Japanese} text compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582134",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582134",
acknowledgement = ack-nhfb,
}
@InProceedings{Savari:1997:RLZ,
author = "S. A. Savari",
title = "Redundancy of the {Lempel--Ziv--Welch} code",
crossref = "Storer:1997:DDC",
pages = "191--200",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582011",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582011",
acknowledgement = ack-nhfb,
}
@InProceedings{Schiller:1997:SRS,
author = "I. Schiller and C.-K. Chuang and S. M. King and J. A.
Storer",
title = "Selective resolution for surveillance video
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582136",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582136",
acknowledgement = ack-nhfb,
}
@InProceedings{Schindler:1997:FBS,
author = "M. Schindler",
title = "A fast block-sorting algorithm for lossless data
compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582137",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582137",
acknowledgement = ack-nhfb,
}
@InProceedings{Sedgewick:1997:FAS,
author = "R. Sedgewick and J. Bentley",
title = "Fast Algorithms for Sorting and Searching Strings",
crossref = "ACM:1997:PEA",
pages = "360--369",
year = "1997",
bibdate = "Tue Dec 06 08:48:26 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
note = "This is the fourth of four key papers behind the {\tt
bzip2} compression tools. The others are
\cite{Hirschberg:1990:EDP,Burrows:1994:BSL,Wheeler:1997:UBM}.",
URL = "http://www.cs.princeton.edu/~rs/talks/strings.ps",
acknowledgement = ack-nhfb,
}
@InProceedings{Seemann:1997:GLA,
author = "T. Seemann and P. Tischer",
title = "Generalised locally adaptive {DPCM}",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582142",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582142",
acknowledgement = ack-nhfb,
}
@InProceedings{Seroussi:1997:ASE,
author = "G. Seroussi and M. J. Weinberger",
title = "On adaptive strategies for an extended family of
{Golomb}-type codes",
crossref = "Storer:1997:DDC",
pages = "131--140",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581993",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581993",
acknowledgement = ack-nhfb,
}
@InProceedings{Sherwood:1997:PIC,
author = "P. G. Sherwood and K. Zeger",
title = "Progressive image coding on noisy channels",
crossref = "Storer:1997:DDC",
pages = "72--81",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581971",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581971",
acknowledgement = ack-nhfb,
}
@Misc{Simpson:1997:RPV,
author = "W. Simpson",
title = "{RFC 2153}: {PPP} Vendor Extensions",
month = may,
year = "1997",
bibdate = "Thu Oct 16 09:34:09 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
note = "Updates RFC1661, RFC1962
\cite{Simpson:1994:RPP,Rand:1996:RPC}. Status:
INFORMATIONAL.",
URL = "ftp://ftp.internic.net/rfc/rfc1661.txt;
ftp://ftp.internic.net/rfc/rfc1962.txt;
ftp://ftp.internic.net/rfc/rfc2153.txt;
https://www.math.utah.edu/pub/rfc/rfc1661.txt;
https://www.math.utah.edu/pub/rfc/rfc1962.txt;
https://www.math.utah.edu/pub/rfc/rfc2153.txt",
acknowledgement = ack-nhfb,
format = "TXT=10780 bytes",
online = "yes",
status = "INFORMATIONAL",
updates = "Updates RFC1661, RFC1962
\cite{Simpson:1994:RPP,Rand:1996:RPC}.",
}
@Article{Storer:1997:ERO,
author = "James A. Storer and John H. Reif",
title = "Error-Resilient Optimal Data Compression",
journal = j-SIAM-J-COMPUT,
volume = "26",
number = "4",
pages = "934--949",
month = aug,
year = "1997",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539792240789",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
MRclass = "68Q25",
MRnumber = "1 460 710",
bibdate = "Mon Nov 29 11:03:10 MST 2010",
bibsource = "Compendex database;
http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/26/4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/24078",
acknowledgement = ack-nhfb,
affiliation = "Brandeis Univ",
affiliationaddress = "Waltham, MA, USA",
classification = "716.1; 721.1; 723.2; 723.5; 731.5",
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
journalabr = "SIAM J Comput",
keywords = "Adaptive algorithms; Adaptive lossless data
compression; Communication channels (information
theory); Computational learning theory; Data
compression; Error detection; Error propagation; Error
resilient communication; Learning systems; Network
protocols; Robotics; Signal receivers",
}
@InProceedings{Storer:1997:LCP,
author = "J. A. Storer and J. Reif",
title = "Low-cost prevention of error-propagation for data
compression with dynamic dictionaries",
crossref = "Storer:1997:DDC",
pages = "171--180",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582007",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582007",
acknowledgement = ack-nhfb,
}
@Article{Storer:1997:LIC,
author = "James A. Storer and Harald Helfgott",
title = "Lossless Image Compression by Block Matching",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "137--145",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.137",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/137.full.pdf+html;
http://www.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractStorer;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractStorer",
acknowledgement = ack-ds # " and " # ack-nhfb,
email-1 = "storer@cs.brandeis.edu",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
rawdata = "Storer, James A., and Harald Helfgott (1997)
``Lossless Image Compression by Block Matching,'' {\it
The Computer Journal}, {\bf40}(2/3):137--145.",
}
@InProceedings{Subrahmanya:1997:MDE,
author = "P. Subrahmanya and T. Berger",
title = "Multiple descriptions encoding of images",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582138",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582138",
acknowledgement = ack-nhfb,
}
@InProceedings{Teahan:1997:MET,
author = "W. J. Teahan and J. G. Cleary",
title = "Models of {English} text",
crossref = "Storer:1997:DDC",
pages = "12--21",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581953",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581953",
acknowledgement = ack-nhfb,
}
@InProceedings{Tilgner:1997:RBS,
author = "M. Tilgner and M. Ishida and T. Yamaguchi",
title = "Recursive block structured data compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582139",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582139",
acknowledgement = ack-nhfb,
}
@InProceedings{Tjalkens:1997:CTW,
author = "T. J. Tjalkens and P. A. J. Volf and F. M. J.
Willems",
title = "A context-tree weighting method for text generating
sources",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582140",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582140",
acknowledgement = ack-nhfb,
}
@InProceedings{Turner:1997:FIF,
author = "M. J. Turner and K. C. Halton",
title = "Facsimile-images of the future",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582143",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582143",
acknowledgement = ack-nhfb,
}
@InProceedings{Turpin:1997:EAA,
author = "A. Turpin and A. Moffat",
title = "Efficient approximate adaptive coding",
crossref = "Storer:1997:DDC",
pages = "357--366",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582059",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582059",
acknowledgement = ack-nhfb,
}
@InProceedings{Vasconcelos:1997:LBC,
author = "N. Vasconcelos and A. Lippman",
title = "Library-based coding: a representation for efficient
video compression and retrieval",
crossref = "Storer:1997:DDC",
pages = "121--130",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581989",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581989",
acknowledgement = ack-nhfb,
}
@InProceedings{Volf:1997:CTW,
author = "Paul A. J. Volf",
editor = "James A. Storer",
booktitle = "DCC '97: Data Compression Conference",
title = "A Context-Tree Weighting Algorithm for Text Generating
Sources [poster]",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "132--139",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Volf, Paul A. J. (1997) ``A Context-Tree Weighting
Algorithm for Text Generating Sources,'' in Storer,
James A. (ed.), {\it DCC '97: Data Compression
Conference}, Los Alamitos, CA, IEEE Computer Society
Press, pp. 132--139, (Poster).",
}
@InProceedings{vonBerg:1997:EBA,
author = "D. C. Linne von Berg",
title = "Effects of boundary artifacts in parallel
implementations of wavelet compression for large-format
digital framing reconnaissance camera systems",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582113",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582113",
acknowledgement = ack-nhfb,
}
@Article{Warmuth:1997:SCL,
author = "M. Warmuth",
title = "Sample compression, learnability, and the
{Vapnik--Chervonenkis} dimension",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1208",
pages = "1--??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Aug 22 11:59:49 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Wheeler:1997:UBM,
author = "David Wheeler",
title = "Upgrading {\tt bred} with multiple tables",
type = "Report",
institution = "The Computer Laboratory, Cambridge University",
address = "Cambridge, UK",
month = apr,
year = "1997",
bibdate = "Tue Dec 06 08:44:00 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
note = "This is the third of four key papers behind the {\tt
bzip2} compression tools. The others are
\cite{Hirschberg:1990:EDP,Burrows:1994:BSL,Sedgewick:1997:FAS}.",
URL = "http://ftp.cl.cam.ac.uk/users/djw3/bred3.ps",
acknowledgement = ack-nhfb,
}
@InProceedings{Withers:1997:ECR,
author = "D. Withers",
title = "The {ELS}-coder: a rapid entropy coder",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582144",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582144",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1997:CEC,
author = "Xiaolin Wu and Jiang Wen and Wing Hung Wong",
title = "Conditional entropy coding of {VQ} indexes for image
compression",
crossref = "Storer:1997:DDC",
pages = "347--356",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582058",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582058",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1997:CHF,
author = "Xiaolin Wu and Wai Kin Choi and P. Bao",
title = "{$ L_\infty $}-constrained high-fidelity image
compression via adaptive context modeling",
crossref = "Storer:1997:DDC",
pages = "91--100",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581978",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=581978",
acknowledgement = ack-nhfb,
}
@InProceedings{Xue:1997:ACI,
author = "Xiaohui Xue and Wen Gao",
title = "Arithmetic coding with improved solution for the
carry-over problem",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582146",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582146",
acknowledgement = ack-nhfb,
}
@InProceedings{Xue:1997:HPA,
author = "Xiaohui Xue and Wen Gao",
title = "High performance arithmetic coding for small
alphabets",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582149",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582149",
acknowledgement = ack-nhfb,
}
@Article{Yokoo:1997:DCU,
author = "Hidetoshi Yokoo",
title = "Data Compression Using a Sort-Based Context Similarity
Measure",
journal = j-COMP-J,
volume = "40",
number = "2--3",
pages = "94--102",
month = "????",
year = "1997",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/40.2_and_3.94",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://comjnl.oxfordjournals.org/content/40/2--3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.index.html",
URL = "http://comjnl.oxfordjournals.org/content/40/2_and_3/94.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_02.body.html#AbstractYokoo;
http://www3.oup.co.uk/computer_journal/Volume_40/Issue_02/Vol40_03.body.html#AbstractYokoo",
acknowledgement = ack-ds # " and " # ack-nhfb,
email-1 = "yokoo@cs.gunma-u.ac.jp",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
rawdata = "Yokoo, Hidetoshi (1997) ``Data Compression Using
Sort-Based Context Similarity Measure,'' {\it The
Computer Journal}, {\bf40}(2/3):94--102.",
}
@InProceedings{Youssef:1997:ERI,
author = "A. Youssef",
title = "Error resiliency issues in wavelet compression",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582150",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582150",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:1997:FRQ,
author = "Dongchang Yu and M. W. Marcellin",
title = "A fixed-rate quantizer using block-based
entropy-constrained quantization and run-length
coding",
crossref = "Storer:1997:DDC",
pages = "310--316",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582054",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582054",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:1997:PBE,
author = "G.-S. Yu and M. W. Marcellin and M. M.-K. Liu",
title = "{POCS} based error concealment for packet video",
crossref = "Storer:1997:DDC",
pages = "??--??",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582151",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582151",
acknowledgement = ack-nhfb,
}
@Article{Yun:1997:LCC,
author = "Hee Cheol Yun and Brian K. Guenter and Russell M.
Mersereau",
title = "Lossless compression of computer generated animation
frames",
journal = j-TOG,
volume = "16",
number = "4",
pages = "359--396",
month = oct,
year = "1997",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/263834.263835",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Wed Nov 26 06:52:24 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p359-yun/",
abstract = "This article presents a new lossless compression
algorithm for computer animation image sequences. The
algorithm uses transformation information available in
the animation script and floating point depth and
object number information at each pixel to perform
highly accurate motion prediction with vary low
computation. The geometric data (i.e., the depth and
object number) can either be computed during the
original rendering process and stored with the image or
computed on the fly during compression and
decompression. In the former case the stored geometric
data are very efficiently compressed using motion
prediction and a new technique called direction coding,
typically to 1 to 2 bits per pixel. The geometric data
are also useful in $z$-buffer image compositing and
this new compression algorithm offers a very low
storage overhead method for saving the information
needed for this compositing. The overall compression
ratio of the new algorithm, including the geometric
data overhead, in compared to conventional spatial
linear prediction compression and block-matching
motion. The algorithm improves on a previous motion
prediction algorithm by incorporating block predictor
switching and color ratio prediction. The combination
of these techniques gives compression ratios 30\%
better than those reported previously.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
keywords = "algorithms; measurement",
subject = "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Compression (Coding), Exact
coding**.",
}
@InProceedings{Zhang:1997:CGA,
author = "Qin Zhang and J. M. Danskin and N. E. Young",
title = "A codebook generation algorithm for document image
compression",
crossref = "Storer:1997:DDC",
pages = "300--309",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.582053",
bibdate = "Tue Feb 5 08:32:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=582053",
acknowledgement = ack-nhfb,
}
@Article{Zingirian:1997:CMV,
author = "N. Zingirian and P. Baglietto and M. Maresca and M.
Migliardi",
title = "Customizing {MPEG} Video Compression Algorithms to
Specific Application Domains: The Case of Highway
Monitoring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1311",
pages = "46--??",
year = "1997",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Aberg:1998:NUP,
author = "J. Aberg and Yu. M. Shtarkov and B. J. M. Smeets",
title = "Non-uniform {PPM} and context tree models",
crossref = "Storer:1998:PDD",
pages = "279--288",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672156",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672156",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@Article{Albers:1998:ACA,
author = "Susanne Albers and Michael Mitzenmacher",
title = "Average Case Analyses of List Update Algorithms, with
Applications to Data Compression",
journal = j-ALGORITHMICA,
volume = "21",
number = "3",
pages = "312--329",
month = jul,
year = "1998",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/pl00009217",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68P10 (68Q25 94A29)",
MRnumber = "MR1622138 (99c:68060)",
bibdate = "Fri Jan 6 11:38:09 MST 2006",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica21.html#AlbersM98;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=21&issue=3;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=21&issue=3&spage=312",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "AlbersM98",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/AlbersM98",
}
@Article{Anonymous:1998:BRIc,
author = "Anonymous",
title = "Book Review: {{\booktitle{Information systems and data
compression}}: By Jerzy A. Seidler. Kluwer Academic
Publishers, Boston. (1997). 472 pages. \$160.00, NLG
335.00, GBP 108.80}",
journal = j-COMPUT-MATH-APPL,
volume = "35",
number = "5",
pages = "135--135",
month = mar,
year = "1998",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:48:47 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122198907532",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Apostolico:1998:STP,
author = "A. Apostolico and S. Lonardi",
title = "Some theory and practice of greedy off-line textual
substitution",
crossref = "Storer:1998:PDD",
pages = "119--128",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672138",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672138",
acknowledgement = ack-nhfb,
}
@InProceedings{Appadwedula:1998:JSC,
author = "S. Appadwedula and D. L. Jones and K. Ramchandran and
I. Konzintsev",
title = "Joint source channel matching for a wireless
communications link",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672230",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672230",
acknowledgement = ack-nhfb,
}
@InProceedings{Arnavut:1998:BST,
author = "Z. Arnavut and D. Leavitt and M. Abdulazizoglu",
title = "Block sorting transformations",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672232",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672232",
acknowledgement = ack-nhfb,
}
@InProceedings{Arps:1998:PMF,
author = "R. Arps and C. Constantinescu",
title = "{PRECIS}: a method for fast compression of periodic
halftones",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672234",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672234",
acknowledgement = ack-nhfb,
}
@InProceedings{Ausbeck:1998:CMP,
author = "P. J. {Ausbeck, Jr.}",
title = "Context models for palette images",
crossref = "Storer:1998:PDD",
pages = "309--318",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672159",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672159",
acknowledgement = ack-nhfb,
}
@InProceedings{Bainbridge:1998:MIC,
author = "D. Bainbridge and S. Inglis",
title = "Musical image compression",
crossref = "Storer:1998:PDD",
pages = "209--218",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672149",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672149",
acknowledgement = ack-nhfb,
}
@InProceedings{Bao:1998:HIC,
author = "Paul Bao and Xiaolin Wu",
title = "Hybrid image compression scheme based on wavelet
transform and adaptive context modeling",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672235",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672235",
acknowledgement = ack-nhfb,
}
@InProceedings{Barcaccia:1998:PMT,
author = "P. Barcaccia and A. Cresti and S. {De Agostino}",
title = "Pattern matching in text compressed with the {ID}
heuristic",
crossref = "Storer:1998:PDD",
pages = "113--118",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672137",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672137",
acknowledgement = ack-nhfb,
}
@InProceedings{Bell:1998:CSM,
author = "T. Bell and B. McKenzie",
title = "Compression of sparse matrices by arithmetic coding",
crossref = "Storer:1998:PDD",
pages = "23--32",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672126",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672126",
acknowledgement = ack-nhfb,
}
@Article{Bergadano:1998:HDC,
author = "Francesco Bergadano and Bruno Crispo and Giancarlo
Ruffo",
title = "High dictionary compression for proactive password
checking",
journal = j-TISSEC,
volume = "1",
number = "1",
pages = "3--25",
month = nov,
year = "1998",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/290163.290164",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Jul 27 17:35:45 MDT 1999",
bibsource = "http://www.acm.org/tissec/;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
URL = "http://www.acm.org:80/pubs/citations/journals/tissec/1998-1-1/p3-bergadano/",
abstract = "The important problem of user password selection is
addressed and a new proactive password-checking
technique is presented. In a training phase, a decision
tree is generated based on a given dictionary of weak
passwords. Then, the decision tree is used to determine
whether a user password should be accepted.
Experimental results described here show that the
method leads to a very high dictionary compression (up
to 1000 to 1) with low error rates (of the order of
1\%). A prototype implementation, called ProCheck, is
made available online. We survey previous approaches to
proactive password checking, and provide an in-depth
comparison.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "experimentation; management; performance; security",
subject = "{\bf D.4.6} Software, OPERATING SYSTEMS, Security and
Protection, Authentication. {\bf K.6.5} Computing
Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
SYSTEMS, Security and Protection, Authentication.",
}
@InProceedings{Berkovich:1998:REC,
author = "S. Berkovich and E. El-Qawasmeh",
title = "Reversing the error-correction scheme for a
fault-tolerant indexing",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672237",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672237",
acknowledgement = ack-nhfb,
}
@InProceedings{Bilgin:1998:ELC,
author = "A. Bilgin and G. Zweig and M. W. Marcellin",
title = "Efficient lossless coding of medical image volumes
using reversible integer wavelet transforms",
crossref = "Storer:1998:PDD",
pages = "428--437",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672188",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672188",
acknowledgement = ack-nhfb,
}
@Misc{Bloom:1998:SPC,
author = "Charles R. Bloom",
title = "Solving the Problems of Context Modeling",
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cbloom.com/papers/ppmz.zip",
acknowledgement = ack-ds,
rawdata = "Bloom, Charles R. (1998) ``Solving the Problems of
Context Modeling,'' available for ftp from
|http://www.cbloom.com/papers/ppmz.zip|.",
}
@InProceedings{Bottou:1998:CAB,
author = "L. Bottou and P. G. Howard and Y. Bengio",
title = "The {$Z$}-coder adaptive binary coder",
crossref = "Storer:1998:PDD",
pages = "13--22",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672124",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672124",
acknowledgement = ack-nhfb,
}
@InProceedings{Bottou:1998:LCP,
author = "L. Bottou and S. Pigeon",
title = "Lossy compression of partially masked still images",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672238",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672238",
acknowledgement = ack-nhfb,
}
@Article{Breinholt:1998:AGH,
author = "Greg Breinholt and Christoph Schierz",
title = "{Algorithm 781}: generating {Hilbert}'s space-filling
curve by recursion",
journal = j-TOMS,
volume = "24",
number = "2",
pages = "184--189",
month = jun,
year = "1998",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/290200.290219",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Mon Feb 8 17:51:43 MST 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/1998-24/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "http://www.acm.org:80/pubs/citations/journals/toms/1998-24-2/p184-breinholt/",
abstract = "An efficient algorithm for the generation of Hilbert's
space-filling curve is given. The algorithm implements
a recursive procedure that involves simple integer
operations and quickly converges to the set of points
that make the Hilbert curve. The algorithm is elegant,
short, and considerably easier to implement than
previous recursive and nonrecursive algorithms and can
be efficiently implemented in all programming languages
that have integer operations and allow recursion. The
fundamental Hilbert shape (a line joining the four
corners of a square) is represented by two variables
with values of either 0 or 1. This coding technique
could be successfully applied to the generation of
other regular space-filling curves, such as the Peano
curve.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://portal.acm.org/toc.cfm?idx=J782",
keywords = "algorithms",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations. {\bf I.3.3} Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Line and
curve generation. {\bf I.3.5} Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations.",
}
@InProceedings{Brunk:1998:ETC,
author = "H. Brunk and N. Farvardin",
title = "Embedded trellis coded quantization",
crossref = "Storer:1998:PDD",
pages = "93--102",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672135",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672135",
acknowledgement = ack-nhfb,
}
@InProceedings{Bunton:1998:BSC,
author = "S. Bunton",
title = "{Bayesian} state combining for context models",
crossref = "Storer:1998:PDD",
pages = "329--338",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672161",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672161",
acknowledgement = ack-nhfb,
}
@Article{Burroughs:1998:DCT,
author = "S. H. Burroughs and T. R. Lattrell",
title = "Data compression technology in {ASIC} cores",
journal = j-IBM-JRD,
volume = "42",
number = "6",
pages = "725--731",
month = "????",
year = "1998",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.426.0725",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Mon Feb 12 08:11:29 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.almaden.ibm.com/journal/rd/426/burroughs.html",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@InProceedings{Cachin:1998:ITM,
author = "Christian Cachin",
title = "An Information-Theoretic Model for Steganography",
crossref = "Aucsmith:1998:IHI",
volume = "1525",
pages = "306--318",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1525.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs1998b.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1525/15250306.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1525/15250306.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "IH; information hiding",
rawdata = "Cachin, Christian (1998) ``An Information-Theoretic
Model for Steganography,'' {\it Proceedings of the
Second International Workshop on Information Hiding},
D. Aucsmith, ed. vol. 1525 of {\it Lecture Notes in
Computer Science}, Berlin, Springer-Verlag, pp.
306--318.",
}
@Article{Calude:1998:TNL,
author = "Cristian Calude and Tudor Zamfirescu",
title = "The Typical Number is a Lexicon",
journal = j-NEW-ZEALAND-J-MATH,
volume = "27",
pages = "7--13",
year = "1998",
CODEN = "",
ISSN = "1171-6096 (print), 1179-4984 (electronic)",
ISSN-L = "1171-6096",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "New Zealand Journal of Mathematics",
rawdata = "Calude, Cristian and Tudor Zamfirescu (1998) ``The
Typical Number is a Lexicon,'' {\it New Zealand Journal
of Mathematics}, {\bf27}:7--13.",
}
@Article{Carretero:1998:CPRa,
author = "J. Carretero and J. No and S.-S. Park and A.
Choudhary",
title = "{COMPASSION}: a Parallel {I/O} Runtime System
Including Chunking and Compression for Irregular
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1401",
pages = "668--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Oct 10 14:40:24 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Carretero:1998:CPRb,
author = "J. Carretero and J. No and A. Choudhary and P. Chen",
title = "{COMPASSION}: a Parallel {I/O} Runtime System
Including Chunking and Compression for Irregular
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1457",
pages = "262--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Oct 10 14:40:24 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Chan:1998:FPL,
author = "T. F. Chan and H. M. Zhou",
title = "Feature preserving lossy image compression using
nonlinear {PDEs}",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672240",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672240",
acknowledgement = ack-nhfb,
}
@InProceedings{Chande:1998:JSC,
author = "V. Chande and N. Farvardin",
title = "A joint source-channel coding scheme for robust image
transmission",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672244",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672244",
acknowledgement = ack-nhfb,
}
@InProceedings{Chandramouli:1998:ECM,
author = "R. Chandramouli and N. Ranganathan and S. J.
Ramadoss",
title = "Empirical channel matched quantizer design and {UEP}
for robust image transmission",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672245",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672245",
acknowledgement = ack-nhfb,
}
@InProceedings{Chapin:1998:HCB,
author = "B. Chapin and S. R. Tate",
title = "Higher compression from the {Burrows--Wheeler}
transform by modified sorting",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672253",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672253",
acknowledgement = ack-nhfb,
}
@InProceedings{Chi:1998:SML,
author = "Chi-Hung Chi",
title = "Study on mult-lingual {LZ77} and {LZ78} text
compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672254",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672254",
acknowledgement = ack-nhfb,
}
@InProceedings{Chiu:1998:PPS,
author = "Y.-J. Chiu",
title = "A perceptual preprocessor to segment video for motion
estimation",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672255",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672255",
acknowledgement = ack-nhfb,
}
@InProceedings{Chrysafis:1998:LBR,
author = "C. Chrysafis and A. Ortega",
title = "Line based reduced memory, wavelet image compression",
crossref = "Storer:1998:PDD",
pages = "398--407",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672177",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672177",
acknowledgement = ack-nhfb,
}
@InProceedings{Chu:1998:AFC,
author = "Hsueh-Ting Chu and Chaur-Chin Chen",
title = "On accelerating fractal compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672256",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672256",
acknowledgement = ack-nhfb,
}
@InProceedings{Chung:1998:JSC,
author = "S.-Y. Chung and M. D. Trott",
title = "Joint source-channel coding using space-filling curves
for bandwidth compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672258",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672258",
acknowledgement = ack-nhfb,
}
@Article{Cieplinski:1998:ECM,
author = "Leszek Cieplinski",
title = "Entropy-Constrained Multiresolution Vector
Quantisation for Image Coding",
journal = j-FUND-INFO,
volume = "34",
number = "4",
pages = "389--396",
month = jul,
year = "1998",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1998-34403",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:55:47 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Claypoole:1998:AWT,
author = "R. Claypoole and G. Davis and W. Sweldens and R.
Baraniuk",
title = "Adaptive wavelet transforms for image coding using
lifting",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672259",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672259",
acknowledgement = ack-nhfb,
}
@Article{Craft:1998:FHD,
author = "D. J. Craft",
title = "A fast hardware data compression algorithm and some
algorithmic extensions",
journal = j-IBM-JRD,
volume = "42",
number = "6",
pages = "733--745",
month = "????",
year = "1998",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.426.0733",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Mon Feb 12 08:11:29 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.almaden.ibm.com/journal/rd/426/craft.html",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@InProceedings{Craft:1998:SPP,
author = "D. J. Craft",
title = "Simple pre-processors significantly improve {LZ} 1
compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672261",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672261",
acknowledgement = ack-nhfb,
}
@InProceedings{Craft:1998:SPS,
author = "David J. Craft",
title = "Simple pre-processors significantly improve {LZ 1}
compression",
crossref = "Storer:1998:PDD",
pages = "538--??",
year = "1998",
bibdate = "Fri Aug 21 07:06:53 MDT 1998",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unicode.bib",
acknowledgement = ack-nhfb,
affiliation = "Austin IBM Microelectronics",
affiliationaddress = "Austin, TX, USA",
annote = "This paper discusses a hardware implementation of a
compression algorithm that can easily achieve 100
MB/sec using as little as one square mm chip area.
Tests on Unicode show a 40\% reduction in size.",
classification = "714.2; 722; 723.2; 723.3",
keywords = "Algorithms; CMOS integrated circuits; Computer
hardware; Data compression; Data sequences; Database
systems; Decompression; Image coding; Unicode
preprocessor",
}
@InProceedings{Creusere:1998:SCR,
author = "C. D. Creusere",
title = "Successive coefficient refinement for embedded
lossless image compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672262",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672262",
acknowledgement = ack-nhfb,
}
@InProceedings{Cvetkovic:1998:ASC,
author = "Z. Cvetkovic",
title = "Accurate subband coding with low resolution
quantization",
crossref = "Storer:1998:PDD",
pages = "448--457",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672192",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672192",
acknowledgement = ack-nhfb,
}
@InProceedings{Danciu:1998:FCC,
author = "I. M. Danciu and J. C. Hart",
title = "Fractal color compression in the {L$^*$ a$^*$ b$^*$}
uniform color space",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672264",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672264",
acknowledgement = ack-nhfb,
}
@Article{Davis:1998:PRL,
author = "G. Davis and L. Lau and R. Young and F. Duncalfe and
L. Brebber",
title = "Parallel Run Length Encoding Compression: Reducing
{I/O} in Dynamic Environmental Simulations",
journal = j-IJHPCA,
volume = "12",
number = "4",
pages = "396--410",
month = "Winter",
year = "1998",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/109434209801200402",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 28 19:11:28 1998",
bibsource = "http://hpc.sagepub.com/content/by/year;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "http://hpc.sagepub.com/content/by/year",
}
@InProceedings{Demir:1998:JSC,
author = "N. Demir and K. Sayood",
title = "Joint source\slash channel coding for variable length
codes",
crossref = "Storer:1998:PDD",
pages = "139--148",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672140",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672140",
acknowledgement = ack-nhfb,
}
@InProceedings{Denecker:1998:ILH,
author = "K. Denecker and P. {De Neve} and I. Lemahieu",
title = "Improved lossless halftone image coding using a fast
adaptive context template selection scheme",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672265",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672265",
acknowledgement = ack-nhfb,
}
@Article{DePrisco:1998:DEH,
author = "Roberto {De Prisco} and Alfredo {De Santis}",
title = "On the Data Expansion of the {Huffman} Compression
Algorithm",
journal = j-COMP-J,
volume = "41",
number = "3",
pages = "137--144",
month = "????",
year = "1998",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/41.3.137",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:51 MST 2012",
bibsource = "http://comjnl.oxfordjournals.org/content/41/3.toc;
https://www.math.utah.edu/pub/tex/bib/compj.bib;
https://www.math.utah.edu/pub/tex/bib/compj1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/Volume_41/Issue_03/Vol41_03.index.html",
URL = "http://comjnl.oxfordjournals.org/content/41/3/137.full.pdf+html;
http://www3.oup.co.uk/computer_journal/Volume_41/Issue_03/Vol41_03.body.html#AbstractDePrisco",
acknowledgement = ack-nhfb,
author-1-adr = "MIT Laboratory for Computer Science, 545 Technology
Square, Cambridge, MA 02139, USA",
author-2-adr = "Dipartimento di Informatica ed Applicazioni,
Universit{\`a} di Salerno, 84081 Baronissi (SA),
Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Donoho:1998:DCH,
author = "David L. Donoho and Martin Vetterli and R. A. DeVore
and Ingrid Daubechies",
title = "Data compression and harmonic analysis",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "44",
number = "6",
pages = "2435--2476",
month = oct,
year = "1998",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.720544",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A29 (94A11 94A12 94A34)",
MRnumber = "1658775",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Information theory: 1948--1998",
ZMnumber = "1125.94311",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
keywords = "block codes; Block codes; block coding; Contracts;
data compression; Data compression; Fourier basis;
Fourier transforms; Gabor transforms; Gaussian
processes; Gaussian stationary processes; harmonic
analysis; Harmonic analysis; image coding; Image
coding; information theory; optimal lossy compression
technique; Quantization; review; reviews; sampling
theorem; Shannon theory; signal sampling;
time-frequency analysis; transform coding; Transform
coding; Wavelet packets; wavelet transforms; Wavelet
transforms",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056; Vetterli,
Martin/0000-0002-6122-1216",
researcherid-numbers = "Vetterli, Martin/B-3612-2010",
unique-id = "ISI:000076437400016",
}
@InProceedings{Eck:1998:NCS,
author = "P. Eck and X. Changsong and R. Matzner",
title = "A new compression scheme for syntactically structured
messages (programs) and its application to {Java} and
the {Internet}",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672266",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672266",
acknowledgement = ack-nhfb,
}
@InProceedings{Edgoose:1998:MML,
author = "T. Edgoose and L. Allison",
title = "Minimum message length hidden {Markov} modelling",
crossref = "Storer:1998:PDD",
pages = "169--178",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672145",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672145",
acknowledgement = ack-nhfb,
}
@InProceedings{Effros:1998:PMR,
author = "M. Effros",
title = "Practical multi-resolution source coding: {TSVQ}
revisited",
crossref = "Storer:1998:PDD",
pages = "53--62",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672131",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672131",
acknowledgement = ack-nhfb,
}
@InProceedings{Ekstrand:1998:WDE,
author = "N. Ekstrand and B. Smeets",
title = "Weighting of double exponential distributed data in
lossless image compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672268",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672268",
acknowledgement = ack-nhfb,
}
@InProceedings{Erol:1998:HVC,
author = "B. Erol and M. Gallant and G. Cote and F. Kossentini",
title = "The {H.263+} video coding standard: complexity and
performance",
crossref = "Storer:1998:PDD",
pages = "259--268",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672154",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672154",
acknowledgement = ack-nhfb,
}
@InProceedings{Evans:1998:CGP,
author = "W. S. Evans",
title = "Compression via guided parsing",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672269",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672269",
acknowledgement = ack-nhfb,
}
@Article{Even:1998:FVA,
author = "S. Even",
title = "Four value-adding algorithms",
journal = j-IEEE-SPECTRUM,
volume = "35",
number = "5",
pages = "33--38",
month = may,
year = "1998",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.669974",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Code standards; cryptography; data compression; EFT
based systems; electronic wallet; Encoding; encryption;
Fiat-Shamir ID protocol; Huffman codes; Internet;
Jacobian matrices; Lempel--Ziv solution; magnetic
cards; Modems; proof of identification; protocols;
randomised algorithms; value-adding algorithms",
}
@InProceedings{Fan:1998:PPL,
author = "G. L. Fan and W. K. Cham",
title = "Post-processing for low bit-rate wavelet-based image
coding using multiscale edge characterization",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672270",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672270",
acknowledgement = ack-nhfb,
}
@Article{Farach:1998:SML,
author = "Martin Farach and Mikkel Thorup",
title = "String Matching in {Lempel--Ziv} Compressed Strings",
journal = j-ALGORITHMICA,
volume = "20",
number = "4",
pages = "388--404",
month = apr,
year = "1998",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/pl00009202",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68Q25 (68P99)",
MRnumber = "MR1600834 (99a:68086)",
bibdate = "Fri Jan 6 11:38:09 MST 2006",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica20.html#FarachT98;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=20&issue=4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=20&issue=4&spage=388",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "FarachT98",
remark = "STOC'95. Part of this work was done while the first
author was visiting the University of Copenhagen; he
was supported in part by DIMACS (Center for Discrete
Mathematics and Theoretical Computer Science), a
National Science Foundation Science andi Technology
Center under NSF Contract STC-8809648. This work was
done while the second author was visiting DIMACS.",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/FarachT98",
}
@InProceedings{Feder:1998:UDC,
author = "M. Feder and A. C. Singer",
title = "Universal data compression and linear prediction",
crossref = "Storer:1998:PDD",
pages = "511--520",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672225",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672225",
acknowledgement = ack-nhfb,
}
@Article{Federovsky:1998:BPB,
author = "Eitan Federovsky and Meir Feder and Sholomo Weiss",
title = "Branch prediction based on universal data compression
algorithms",
journal = j-COMP-ARCH-NEWS,
volume = "26",
number = "3",
pages = "62--72",
month = jun,
year = "1998",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/279361.279370",
ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Feng:1998:LSE,
author = "Wu Feng and Gao Wen and Xiang YangZhao and Gao Peng
and Chen DaTong",
title = "On-line sprite encoding with large global motion
estimation",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672272",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672272",
acknowledgement = ack-nhfb,
}
@InProceedings{Fenwick:1998:CUF,
author = "P. Fenwick and S. Brierley",
title = "Compression of {Unicode} files",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672274",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672274",
acknowledgement = ack-nhfb,
}
@InProceedings{Flierl:1998:LOD,
author = "M. Flierl and T. Wiegand and B. Girod",
title = "A locally optimal design algorithm for block-based
multi-hypothesis motion-compensated prediction",
crossref = "Storer:1998:PDD",
pages = "239--248",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672152",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672152",
acknowledgement = ack-nhfb,
}
@Article{Fojtik:1998:IMP,
author = "J. Fojtik and V. Hlavac",
title = "Invisible Modification of the Palette Color Image
Enhancing Lossless Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1451",
pages = "1029--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Oct 10 14:40:24 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fortnow:1998:NOL,
author = "L. Fortnow and S. Laplante",
title = "Nearly Optimal Language Compression Using Extractors",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1373",
pages = "84--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Apr 28 08:51:33 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Fowler:1998:VCU,
author = "J. E. Fowler",
title = "Video coding using vector zerotrees and adaptive
vector quantization",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672275",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672275",
acknowledgement = ack-nhfb,
}
@InProceedings{Freina:1998:PFI,
author = "T. Freina and A. Uhl",
title = "Predictive fractal image coding: hybrid algorithms and
compression of residuals",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672277",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672277",
acknowledgement = ack-nhfb,
}
@Book{Frey:1998:GMM,
author = "Brendan J. Frey",
title = "Graphical models for machine learning and digital
communication",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "xiii + 195",
year = "1998",
ISBN = "0-262-06202-X",
ISBN-13 = "978-0-262-06202-2",
LCCN = "Q325.5 .F74 1998",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Adaptive computation and machine learning.",
URL = "http://cognet.mit.edu/library/books/view?isbn=026206202X",
acknowledgement = ack-nhfb,
remark = "Bradford Books.",
subject = "Digital communications; Graph theory; Machine
learning",
tableofcontents = "Preface \\
1. Introduction \\
2. Probabilistic Inference in Graphical Models \\
3. Pattern Classification \\
4. Unsupervised Learning \\
5. Data Compression \\
6. Channel Coding \\
7. Future Research Directions \\
References \\
Index",
}
@Article{Gaither:1998:TDD,
author = "Justin Gaither",
title = "A Tale of {DXPC}: Differential {X} Protocol
Compression",
journal = j-LINUX-J,
volume = "53",
pages = "??--??",
month = sep,
year = "1998",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Fri Oct 9 08:35:26 MDT 1998",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue53/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Garcia-Frias:1998:TDH,
author = "J. Garcia-Frias and J. D. Villasenor",
title = "Turbo decoding of hidden {Markov} sources with unknown
parameters",
crossref = "Storer:1998:PDD",
pages = "159--168",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672143",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672143",
acknowledgement = ack-nhfb,
}
@Book{Gibson:1998:DCM,
author = "Jerry D. Gibson and Toby Berger and Tom Lookabaugh and
David Lindbergh and Richard L. Baker",
title = "Digital Compression for Multimedia: Principles and
Standards",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xvii + 476",
year = "1998",
ISBN = "1-55860-369-7",
ISBN-13 = "978-1-55860-369-1",
LCCN = "QA76.575 .D535 1998",
bibdate = "Tue Feb 12 17:48:50 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$74.95, CAN\$104.95, UK\pounds 49.95",
series = "Morgan Kaufmann series in multimedia information and
systems",
acknowledgement = ack-nhfb,
tableofcontents = "1: Introduction to Data Compression \\
2: Lossless Source Coding \\
3: Universal Lossless Source Coding \\
4: Quantization \\
5: Predictive Coding \\
6: Linear Predictive Speech Coding Standards \\
7: Frequency Domain Coding \\
8: Frequency Domain Speech and Audio Coding Standards
\\
9: JPEG Still-Image Compression Standard \\
10: Multimedia Conferencing Standards \\
11: MPEG Compression \\
Appendix A: Speech Quality and Intelligibility \\
Appendix B: Proof that Huffman Codes Minimize l \\
Appendix C: Proof That Every UD Code Satisfies the
Kraft Inequality \\
Appendix D: Behavior of Approximations to Entropy Rate
\\
Appendix E: Proof of Forward March Property for LZY \\
Appendix F: Efficient Coding of $L_k$ for LZ77",
}
@InProceedings{Gilbert:1998:LDI,
author = "Jeffrey M. Gilbert and Robert W. Brodersen",
title = "A lossless {$2$-D} image compression technique for
synthetic discrete-tone images",
crossref = "Storer:1998:PDD",
pages = "359--368",
month = mar,
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672166",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://bwrc.eecs.berkeley.edu/Publications/1999/A_lossless_2-D_image_compression_technique/JMG_DCC98.pdf;
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672166",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Gilbert, Jeffrey M., and Robert W. Brodersen (1998)
``A Lossless 2-D Image Compression Technique for
Synthetic Discrete-Tone Images,'' {\it Proceedings of
the 1998 Data Compression Conference}, J. Storer, ed.,
Los Alamitos, CA, IEEE Computer Society Press, pp.
359--368, March. This is also available from
URL\hfil\break
|http://bwrc.eecs.berkeley.edu/Publications/|\hfil\break
|1999/A_lossless_2-D_image_compression_technique/JMG_DCC98.pdf|.",
}
@InProceedings{Goyal:1998:OMD,
author = "V. K. Goyal and J. Kovacevic",
title = "Optimal multiple description transform coding of
{Gaussian} vectors",
crossref = "Storer:1998:PDD",
pages = "388--397",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672173",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672173",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:1998:QCD,
author = "R. M. Gray and K. O. Perlmutter and R. A. Olshen",
title = "Quantization, classification, and density estimation
for {Kohonen}'s {Gaussian} mixture",
crossref = "Storer:1998:PDD",
pages = "63--72",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672132",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672132",
acknowledgement = ack-nhfb,
}
@Article{Haffner:1998:HQD,
author = "Patrick Haffner and others",
title = "High-Quality Document Image Compression with {DjVu}",
journal = j-J-ELECTRON-IMAGING,
volume = "7",
number = "3",
pages = "410--425",
year = "1998",
CODEN = "JEIME5",
DOI = "https://doi.org/10.1117/1.482609",
ISSN = "1017-9909 (print), 1560-229X (electronic)",
ISSN-L = "1017-9909",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://citeseer.ist.psu.edu/old/523172.html",
acknowledgement = ack-ds,
fjournal = "Journal of Electronic Imaging",
rawdata = "Haffner, Patrick, et al. (1998) ``High-Quality
Document Image Compression with DjVu,'' {\it Journal of
Electronic Imaging}, {\bf7}(3):410--425, SPIE. This is
also available from\hfil\break
|http://citeseer.ist.psu.edu/old/523172.html|.",
}
@InProceedings{Hans:1998:AIA,
author = "M. Hans and R. Schafer",
title = "{AudioPaK} --- an integer arithmetic lossless audio
codec",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672286",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672286",
acknowledgement = ack-nhfb,
}
@InProceedings{Hartenstein:1998:ATQ,
author = "H. Hartenstein and Xiaolin Wu",
title = "Analysis of trellis quantization for near-lossless
image coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672288",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672288",
acknowledgement = ack-nhfb,
}
@InProceedings{Helfgott:1998:LTC,
author = "H. Helfgott and M. Cohn",
title = "Linear-time construction of optimal context trees",
crossref = "Storer:1998:PDD",
pages = "369--377",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672167",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672167",
acknowledgement = ack-nhfb,
}
@InProceedings{Howard:1998:IEC,
author = "Paul G. Howard",
booktitle = "{Proceedings Compression and Complexity of Sequences
1997, Salerno, Italy}",
title = "Interleaving Entropy Codes",
publisher = "????",
address = "????",
pages = "45--55",
month = jun,
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Howard, Paul G. (1998) ``Interleaving Entropy Codes,''
{\it Proceedings Compression and Complexity of
Sequences 1997}, Salerno, Italy, pp. 45--55, June.",
}
@Article{Ignatchenko:1998:AOD,
author = "Sergey Ignatchenko",
title = "An Algorithm for Online Data Compression",
journal = j-CCCUJ,
volume = "16",
number = "10",
pages = "63--??",
month = oct,
year = "1998",
CODEN = "CCUJEX",
ISSN = "1075-2838",
bibdate = "Tue May 14 18:09:17 MDT 2002",
bibsource = "http://www.cuj.com/articles/1998/9810/9810toc.htm?topic=articles;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Compressing data on the fly involves different
tradeoffs than when you have all the time and space in
the world.",
acknowledgement = ack-nhfb,
fjournal = "C/C++ Users Journal",
}
@Book{ISO:1998:IGT,
author = "{ISO}",
title = "{ISO 12639:1998: Graphic technology --- Prepress
digital data exchange --- Tag image file format for
image technology (TIFF/IT)}",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "43",
year = "1998",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon May 01 05:30:09 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
price = "CHF 128",
URL = "http://www.iso.ch/cate/d2181.html",
acknowledgement = ack-nhfb,
pricecode = "S",
}
@Article{Iyengar:1998:EFS,
author = "Vikram Iyengar and Krishnendu Chakrabarty",
title = "An efficient finite-state machine implementation of
{Huffman} decoders",
journal = j-INFO-PROC-LETT,
volume = "64",
number = "6",
pages = "271--275",
day = "15",
month = jan,
year = "1998",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(97)00176-2",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 7 17:55:56 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
note = "See \cite{Turpin:1998:CEH}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Jafarkhani:1998:SRT,
author = "H. Jafarkhani and V. Tarokh",
title = "Successively refinable trellis coded quantization",
crossref = "Storer:1998:PDD",
pages = "83--92",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672134",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672134",
acknowledgement = ack-nhfb,
}
@Article{Jordan:1998:PCB,
author = "Corinne Le Buhan Jordan and Touradj Ebrahimi and Murat
Kunt",
title = "Progressive Content-Based Shape Compression for
Retrieval of Binary Images",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "71",
number = "2",
pages = "198--212",
month = aug,
year = "1998",
CODEN = "CVIUF4",
DOI = "https://doi.org/10.1006/cviu.1998.0707",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Wed Mar 8 08:53:25 MST 2000",
bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=cviu;
https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.idealibrary.com/links/artid/cviu.1998.0707/production;
http://www.idealibrary.com/links/artid/cviu.1998.0707/production/pdf;
http://www.idealibrary.com/links/artid/cviu.1998.0707/production/ref",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@InProceedings{Joung:1998:BCM,
author = "Hwayong Joung and E. K. Wong and S. P. Kim",
title = "Block context modeling approach for binary image
coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672289",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672289",
acknowledgement = ack-nhfb,
}
@Article{Kampf:1998:PFC,
author = "F. A. Kampf",
title = "Performance as a function of compression",
journal = j-IBM-JRD,
volume = "42",
number = "6",
pages = "759--766",
month = "????",
year = "1998",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.426.0759",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Mon Feb 12 08:11:30 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.almaden.ibm.com/journal/rd/426/kampf.html",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@InProceedings{Kari:1998:ICM,
author = "J. Kari and M. Gavrilescu",
title = "Intensity controlled motion compensation",
crossref = "Storer:1998:PDD",
pages = "249--258",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672153",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672153",
acknowledgement = ack-nhfb,
}
@Article{Karkkainen:1998:LZI,
author = "Juha K{\"a}rkk{\"a}inen and Erkki Sutinen",
title = "{Lempel--Ziv} index for {$q$}-grams",
journal = j-ALGORITHMICA,
volume = "21",
number = "1",
pages = "137--154",
year = "1998",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/pl00009205",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68Q20 (68P20)",
MRnumber = "MR1612235 (99a:68081)",
bibdate = "Mon Jan 22 05:30:27 MST 2001",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica21.html#KarkkainenS98;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Fourth European Symposium on Algorithms (Barcelona,
1996)",
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "KarkkainenS98",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/KarkkainenS98",
}
@InProceedings{Kawahara:1998:HSS,
author = "M. Kawahara and Yi-Jen Chiu and T. Berger",
title = "High-speed software implementation of {Huffman}
coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672291",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672291",
acknowledgement = ack-nhfb,
}
@InProceedings{Kida:1998:MPM,
author = "T. Kida and M. Takeda and A. Shinohara and M. Miyazaki
and S. Arikawa",
title = "Multiple pattern matching in {LZW} compressed text",
crossref = "Storer:1998:PDD",
pages = "103--112",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672136",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672136",
acknowledgement = ack-nhfb,
}
@InProceedings{Kieffer:1998:CPM,
author = "J. Kieffer and En-Hui Yang and T. Park and S.
Yakowitz",
title = "Complexity of preprocessor in {MPM} data compression
system",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672292",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672292",
acknowledgement = ack-nhfb,
}
@Article{Klasing:1998:ICCa,
author = "R. Klasing",
title = "Improved Compressions of Cube-Connected Cycles
Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1517",
pages = "242--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Jan 5 08:21:58 MST 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Klasing:1998:ICCb,
author = "R. Klasing",
title = "Improved Compressions of Cube-Connected Cycles
Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "9",
number = "8",
pages = "803--812",
month = aug,
year = "1998",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/71.706051",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Nov 6 12:31:15 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://dlib.computer.org/td/books/td1998/pdf/l0803.pdf;
http://www.computer.org/tpds/td1998/l0803abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@InProceedings{Kleider:1998:ARC,
author = "J. E. Kleider and G. P. Abousleman",
title = "Adaptive-rate coding modulation system for digital
image transmission",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672294",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672294",
acknowledgement = ack-nhfb,
}
@Article{Knott:1998:AAA,
author = "Gary D. Knott",
title = "Algorithm Alley: Adaptive Delta Modulation: Algorithms
for Audio Compression",
journal = j-DDJ,
volume = "23",
number = "4",
pages = "124, 126, 128, 139",
month = apr,
year = "1998",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Fri Mar 6 18:42:46 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/ftp/1998/1998_04/aa498.txt",
abstract = "Delta modulation is a data-encoding technique that's
particularly useful for transmitting fewer bits and
archival storage. Gary examines the basic algorithm,
then reviews variations that implement and `adaptive'
delta modulation. Additional resources include
aa498.txt (listings).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Knutsson:1998:OGW,
author = "Lukas Knutsson",
title = "Optimized {GIFs} from {Windows DIBs}",
journal = j-CCCUJ,
volume = "16",
number = "12",
pages = "??--??",
month = dec,
year = "1998",
CODEN = "CCUJEX",
ISSN = "1075-2838",
bibdate = "Tue May 14 18:09:18 MDT 2002",
bibsource = "http://www.cuj.com/articles/1998/9812/9812toc.htm?topic=articles;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Much of the ``World Wide Wait'' is spent downloading
poorly encoded images. Anything that helps make images
smaller is a boon.",
acknowledgement = ack-nhfb,
fjournal = "C/C++ Users Journal",
}
@InProceedings{Kozen:1998:EAO,
author = "D. Kozen and Y. Minsky and B. Smith",
title = "Efficient algorithms for optimal video transmission",
crossref = "Storer:1998:PDD",
pages = "229--238",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672151",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672151",
acknowledgement = ack-nhfb,
}
@InProceedings{Kozintsev:1998:ITU,
author = "I. Kozintsev and J. Chou and K. Ramchandran",
title = "Image transmission using arithmetic coding based
continuous error detection",
crossref = "Storer:1998:PDD",
pages = "339--348",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672162",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672162",
acknowledgement = ack-nhfb,
}
@InProceedings{Kruse:1998:PTI,
author = "H. Kruse and A. Mukherjee",
title = "Preprocessing text to improve compression ratios",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672295",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672295",
acknowledgement = ack-nhfb,
}
@InProceedings{Lakhani:1998:AJQ,
author = "G. Lakhani",
title = "Adjustments for {JPEG} de-quantization coefficients",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672297",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672297",
acknowledgement = ack-nhfb,
}
@InProceedings{Lanza:1998:EDC,
author = "P. Lanza",
title = "Entropy and data compression performances",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672298",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672298",
acknowledgement = ack-nhfb,
}
@InProceedings{Larsson:1998:CTB,
author = "N. J. Larsson",
title = "The context trees of block sorting compression",
crossref = "Storer:1998:PDD",
pages = "189--198",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672147",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672147",
acknowledgement = ack-nhfb,
}
@InProceedings{Lindarto:1998:MCB,
author = "T. Lindarto",
title = "A multimode context-based lossless wavelet image
coder",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672300",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672300",
acknowledgement = ack-nhfb,
}
@InProceedings{Linder:1998:MDR,
author = "T. Linder and R. Zamir and K. Zeger",
title = "The multiple description rate region for high
resolution source coding",
crossref = "Storer:1998:PDD",
pages = "149--158",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672141",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672141",
acknowledgement = ack-nhfb,
}
@InProceedings{Llados-Bernaus:1998:CAF,
author = "R. Llados-Bernaus and R. L. Stevenson",
title = "Codeword assignment for fixed-length entropy coded
video streams",
crossref = "Storer:1998:PDD",
pages = "269--278",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672155",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672155",
acknowledgement = ack-nhfb,
}
@Misc{Manning:1998:MCV,
author = "Manning",
title = "Motion Compensated Video Compression Overview",
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.newmediarepublic.com/dvideo/compression/adv08.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Manning (1998), is file |compression/adv08.html|
at\hfil\break
|http://www.newmediarepublic.com/dvideo/|.",
}
@InProceedings{Martins:1998:LCV,
author = "B. Martins and S. Forchhammer",
title = "Lossless compression of video using motion
compensation",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672302",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672302",
acknowledgement = ack-nhfb,
}
@InProceedings{Mayer:1998:PPE,
author = "J. Mayer and G. G. Langdon",
title = "Post-processing enhancement of decompressed images
using variable order {B{\'e}zier} polynomials and
distance transform",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672303",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672303",
acknowledgement = ack-nhfb,
}
@InProceedings{Mello:1998:LBR,
author = "M. A. Mello and T. R. Fischer",
title = "Low bit-rate video coding with trellis source codes",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672304",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672304",
acknowledgement = ack-nhfb,
}
@Article{Merlini:1998:ACA,
author = "Donatella Merlini and Renzo Sprugnoli and M. Cecilia
Verri",
title = "Average-Case Analysis for a Simple Compression
Algorithm",
journal = j-ALGORITHMICA,
volume = "22",
number = "4",
pages = "585--599",
month = dec,
year = "1998",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/pl00009242",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68P10 (68W40)",
MRnumber = "MR1701631 (2000h:68058)",
bibdate = "Fri Jan 6 11:38:10 MST 2006",
bibsource = "dblp-journals-algorithmica.bib;
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica22.html#MerliniSV98;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=22&issue=4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Average-case analysis of algorithms",
URL = "http://link.springer.de/link/service/journals/00453/bibs/22n4p585.html;
http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=22&issue=4&spage=585",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
oldlabel = "MerliniSV98",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/MerliniSV98",
}
@InProceedings{Meyer:1998:ETN,
author = "B. Meyer and P. Tischer",
title = "Extending {TMW} for near lossless compression of
greyscale images",
crossref = "Storer:1998:PDD",
pages = "458--470",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672194",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672194",
acknowledgement = ack-nhfb,
}
@InProceedings{Meyer:1998:FWP,
author = "F. G. Meyer and A. Z. Averbuch and J. O. Stromberg and
R. R. Coifman",
title = "Fast wavelet packet image compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672305",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672305",
acknowledgement = ack-nhfb,
}
@Article{Mitra:1998:SPI,
author = "Suman K. Mitra and C. A. Murthy and Malay K. Kundu",
title = "A Study on Partitioned Iterative Function Systems for
Image Compression",
journal = j-FUND-INFO,
volume = "34",
number = "4",
pages = "413--428",
month = jul,
year = "1998",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1998-34405",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:55:47 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Moayeri:1998:LCF,
author = "Nader Moayeri",
title = "A Low-Complexity, Fixed-Rate Compression Scheme for
Color Images and Documents",
journal = j-HEWLETT-PACKARD-J,
volume = "50",
number = "1",
pages = "46--??",
month = nov,
year = "1998",
CODEN = "HPJOAX",
ISSN = "0018-1153",
bibdate = "Thu Nov 05 16:11:57 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.hp.com/hpj/98nov/tc-11-98.htm",
abstract = "A computationally simple data compression scheme
provides a modest compression ratio of 3 to 4 and is
useful when hardware is limited and coding delays
cannot be tolerated.",
acknowledgement = ack-nhfb,
fjournal = "Hewlett-Packard Journal: technical information from
the laboratories of Hewlett-Packard Company",
}
@Article{Moffat:1998:ACR,
author = "Alistair Moffat and Radford M. Neal and Ian H.
Witten",
title = "Arithmetic Coding Revisited",
journal = j-TOIS,
volume = "16",
number = "3",
pages = "256--294",
month = jul,
year = "1998",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/290159.290162",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org:80/pubs/citations/journals/tois/1998-16-3/p256-moffat/",
abstract = "Over the last decade, arithmetic coding has emerged as
an important compression tool. It is now the method of
choice for adaptive coding on multisymbol alphabets
because of its speed, low storage requirements, and
effectiveness of compression. This article describes a
new implementation of arithmetic coding that
incorporates several improvements over a widely used
earlier version by Witten, Neal, and Cleary, which has
become a {\em de facto\/} standard. These improvements
include fewer multiplicative operations, greatly
extended range of alphabet sizes and symbol
probabilities, and the use of low-precision arithmetic,
permitting implementation by fast shift/add operations.
We also describe a modular structure that separates the
coding, modeling, and probability estimation components
of a compression system. To motivate the improved
coder, we consider the needs of a word-based text
compression program. We report a range of experimental
results using this and other models. Complete source
code is available.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "algorithms; performance",
rawdata = "Moffat, Alistair, Radford Neal, and Ian H. Witten
(1998) ``Arithmetic Coding Revisited,'' {\it ACM
Transactions on Information Systems},
{\bf16}(3):256--294, July.",
subject = "{\bf E.4} Data, CODING AND INFORMATION THEORY, Data
compaction and compression. {\bf E.1} Data, DATA
STRUCTURES.",
}
@Article{Moore:1998:DCY,
author = "Robert L. Moore and D. Gregory Foley",
title = "Date Compression and {Year 2000} Challenges",
journal = j-DDJ,
volume = "23",
number = "5",
pages = "20--22, 24, 109",
month = may,
year = "1998",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Apr 1 16:59:28 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/ftp/1998/1998_05/y2kcomp.txt;
http://www.ddj.com/ftp/1998/1998_05/y2kcomp.zip",
abstract = "Ultimately, fixing Y2K problems is about fixing
storage overflow, and there are a variety of solutions
that address the problem. Bob and Greg examine some of
these solutions, focusing on date compression.
Additional resources include Y2KCOMP.TXT (listings) and
Y2KCOMP.ZIP (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Morihara:1998:JTC,
author = "T. Morihara and N. Satoh and H. Yahagi and S.
Yoshida",
title = "{Japanese} text compression using word-based coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672306",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672306",
acknowledgement = ack-nhfb,
}
@InProceedings{Moss:1998:RDE,
author = "K. N. Moss",
title = "Recovery from dropout errors in {LZ77} compressed
text",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672307",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672307",
acknowledgement = ack-nhfb,
}
@Book{Motte:1998:OPP,
author = "Warren F. Motte",
title = "{Oulipo}, a Primer of Potential Literature",
publisher = "Daleky Archive Press",
address = "Normal, IL, USA",
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Motte, Warren F. (1998) {\it Oulipo, A Primer of
Potential Literature}, Normal, Ill, Daleky Archive
Press.",
}
@Misc{MPEG:1998:RWM,
author = "{MPEG}",
title = "The reference website for {MPEG}!",
pages = "??",
year = "1998, 2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.mpeg.org/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "MPEG (1998), |http://www.mpeg.org/|.",
}
@InProceedings{Nand:1998:MSE,
author = "A. Nand and Tong Lai Yu",
title = "Mail servers with embedded data compression
mechanisms",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672308",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672308",
acknowledgement = ack-nhfb,
}
@InProceedings{Nevill-Manning:1998:PHI,
author = "C. G. Nevill-Manning and I. H. Witten",
title = "Phrase hierarchy inference and compression in bounded
space",
crossref = "Storer:1998:PDD",
pages = "179--188",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672146",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672146",
acknowledgement = ack-nhfb,
}
@InProceedings{Novak:1998:TER,
author = "M. Novak",
title = "Transmission error robust fractal coding using a
model-residual approach",
crossref = "Storer:1998:PDD",
pages = "349--358",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672164",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672164",
acknowledgement = ack-nhfb,
}
@Misc{Okumura:1998:HDC,
author = "Haruhiko Okumura",
title = "History of Data Compression in {Japan}",
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://oku.edu.mie-u.ac.jp/~okumura/compression.html;
http://oku.edu.mie-u.ac.jp/~okumura/compression/history.html",
acknowledgement = ack-ds,
keywords = "Huffman coding; LHarc algorithm; LZARI compression
algorithm; LZHUF compression algorithm; LZSS
compression algorithm",
lastaccess = "27 January 2013",
rawdata = "Okumura, Haruhiko (1998)
|http://oku.edu.mie-u.ac.jp/~okumura/|
directories\hfil\break |compression/history.html| and
|compression.html|.",
}
@InProceedings{Ordentlich:1998:LCM,
author = "E. Ordentlich and M. Weinberger and G. Seroussi",
title = "A low-complexity modeling approach for embedded coding
of wavelet coefficients",
crossref = "Storer:1998:PDD",
pages = "408--417",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672180",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672180",
acknowledgement = ack-nhfb,
}
@InProceedings{Palau:1998:FSC,
author = "A. Palau and G. Mirchandani",
title = "A fast symbol coding scheme with specific application
in bulk compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672309",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672309",
acknowledgement = ack-nhfb,
}
@Article{Pigeon:1998:AAM,
author = "Steven Pigeon and Yoshua Bengio",
title = "Algorithm Alley: Memory-Efficient Adaptive {Huffman}
Coding",
journal = j-DDJ,
volume = "23",
number = "10",
pages = "131--132, 134--135",
month = oct,
year = "1998",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Fri Sep 11 09:12:05 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/ddj/1998/1998_10/Shas/Shas.htm;
http://www.ddj.com/ftp/1998/1998_10/aa108.txt;
http://www.ddj.com/ftp/1998/1998_10/aa108.zip",
abstract = "Although simple and often effective, Huffman's
compression algorithm requires a lot of memory for
16-bit Unicode text files, and it doesn't adapt to
varying conditions within the data. Steven and Yoshua
explain how they updated Huffman's classic technique.
Additional resources include aa108.txt (listings) and
aa108.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Pigeon:1998:MEA,
author = "S. Pigeon and Y. Bengio",
title = "A memory-efficient adaptive {Huffman} coding algorithm
for very large sets of symbols",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672310",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672310",
acknowledgement = ack-nhfb,
}
@Article{Plandowski:1998:ALZ,
author = "Wojciech Plandowski and Wojciech Rytter",
title = "Application of {Lempel--Ziv} Encodings to the Solution
of Word Equations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1443",
pages = "731--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:52:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1443.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1443/14430731.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1443/14430731.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Przelaskowski:1998:DPW,
author = "Artur Przelaskowski",
title = "Detail Preserving Wavelet-based Compression with
Adaptive Context-based Quantisation",
journal = j-FUND-INFO,
volume = "34",
number = "4",
pages = "369--388",
month = jul,
year = "1998",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1998-34402",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:55:47 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Book{Rao:1998:WTI,
author = "Raghuveer M. Rao and Ajit S. Bopardikar",
title = "Wavelet Transforms: Introduction to Theory and
Applications",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xiii + 310",
year = "1998",
ISBN = "0-201-63463-5",
ISBN-13 = "978-0-201-63463-1",
LCCN = "QA403.3 .R36 1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-ds # " and " # ack-nhfb,
keywords = "Matlab",
rawdata = "Rao, Raghuveer M., and Ajit S. Bopardikar (1998) {\it
Wavelet Transforms: Introduction to Theory and
Applications}, Reading, MA, Addison-Wesley.",
remark = "System requirements: IBM-compatible PC; MS-DOS; MATLAB
version 4.2.",
subject = "Wavelets (Mathematics); Signal processing;
Mathematics",
}
@InProceedings{Reif:1998:OLC,
author = "J. H. Reif and J. A. Storer",
title = "Optimal lossless compression of a class of dynamic
sources",
crossref = "Storer:1998:PDD",
pages = "501--510",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672221",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672221",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:1998:LH,
author = "Y. A. Reznik",
title = "{LZRW1} without hashing",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672311",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672311",
acknowledgement = ack-nhfb,
}
@InProceedings{Rogers:1998:RWZ,
author = "J. K. Rogers and P. C. Cosman",
title = "Robust wavelet zerotree image compression with
fixed-length packetization",
crossref = "Storer:1998:PDD",
pages = "418--427",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672184",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672184",
acknowledgement = ack-nhfb,
}
@TechReport{Rossignac:1998:ECC,
author = "J. Rossignac",
title = "Edgebreaker: Connectivity Compression for Triangle
Meshes",
type = "Technical Report",
number = "GIT-GVU-98-35",
institution = "Georgia Institute of Technology",
address = "Atlanta, GA, USA",
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rossignac, J. (1998) ``Edgebreaker: Connectivity
Compression for Triangle Meshes,'' GVU Technical Report
GIT-GVU-98-35, Atlanta, GA, Georgia Institute of
Technology.",
}
@InProceedings{Sadakane:1998:FAM,
author = "K. Sadakane",
title = "A fast algorithm for making suffix arrays and for
{Burrows--Wheeler} transformation",
crossref = "Storer:1998:PDD",
pages = "129--138",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672139",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672139",
acknowledgement = ack-nhfb,
}
@InProceedings{Sadakane:1998:OVB,
author = "K. Sadakane",
title = "On optimality of variants of the block sorting
compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672312",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672312",
acknowledgement = ack-nhfb,
}
@Article{Sadeh:1998:BDC,
author = "Ilan Sadeh",
title = "Bounds on Data Compression Ratio with a Given
Tolerable Error Probability",
journal = j-PROBAB-ENGRG-INFORM-SCI,
volume = "12",
number = "2",
pages = "189--210",
month = apr,
year = "1998",
CODEN = "????",
DOI = "https://doi.org/10.1017/S0269964800005143",
ISSN = "0269-9648 (print), 1469-8951 (electronic)",
ISSN-L = "0269-9648",
bibdate = "Thu Aug 24 08:19:37 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib",
URL = "https://www.cambridge.org/core/product/A2EDAF726A22B80AE89F80B7B15BC62B",
acknowledgement = ack-nhfb,
ajournal = "Probab. Engrg. Inform. Sci.",
fjournal = "Probability in the Engineering and Informational
Sciences",
journal-URL = "http://www.journals.cambridge.org/jid_PES",
onlinedate = "01 July 2009",
}
@InProceedings{Salami:1998:LCH,
author = "M. Salami and H. Sakanashi and M. Tanaka and M. Iwata
and T. Kurita and T. Higuchi",
title = "On-line compression of high precision printer images
by evolvable hardware",
crossref = "Storer:1998:PDD",
pages = "219--228",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672150",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672150",
acknowledgement = ack-nhfb,
}
@Book{Salomon:1998:DCC,
author = "David Salomon",
title = "Data Compression: The Complete Reference",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xx + 427",
year = "1998",
ISBN = "0-387-98280-9",
ISBN-13 = "978-0-387-98280-9",
LCCN = "QA76.9.D33S25 1997",
bibdate = "Fri Sep 10 09:21:56 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$39.95",
URL = "http://www.booksbydavidsalomon.com/;
http://www.ecs.csun.edu/~dxs/DCadvertis/DcompAd.html",
abstract = "Data compression is one of the most important
techniques in computing engineering. From archiving
data to CD-ROMs and from coding theory to image
analysis, many facets of computing make use of data
compression in one form or another. This book is
intended to provide an overview of the many different
types of compression: it includes a taxonomy, an
analysis of the most common systems of compression,
discussion of their relative benefits and
disadvantages, and their most common usages. Readers
are presupposed to have a basic understanding of
computer science: essentially the storage of data in
bytes and bits and computing terminology, but otherwise
this book is self-contained. The book divides naturally
into four main parts based on the main branches of data
compression: run length encoding, statistical methods,
dictionary-based methods, and lossy image compression
(where in contrast to the other techniques, information
in the data may be lossed but an acceptable standard of
image quality retained). Detailed descriptions of many
of the most well-known compression techniques are
covered including: Zip, BinHex, Huffman coding, GIF and
many others.",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
tableofcontents = "Preface \\
1: Basic Techniques \\
2: Statistical Methods \\
3: Dictionary Methods \\
4: Image Compression \\
5: Other Methods \\
A: ASCII Code \\
B: Bibliography \\
C: Curves That Fill Space \\
D: Determinants and Matrices \\
E: Error Correcting Codes \\
F: Fourier Transform \\
G: Group 4 Codes Summary \\
H: Hashing \\
I: Interpolating Polynomials \\
Answers to Exercises \\
Glossary \\
Index",
}
@InProceedings{Savari:1998:VFL,
author = "S. A. Savari",
title = "Variable-to-fixed length codes for predictable
sources",
crossref = "Storer:1998:PDD",
pages = "481--490",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672213",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672213",
acknowledgement = ack-nhfb,
}
@InProceedings{Sayir:1998:CSC,
author = "J. Sayir",
title = "Conditional source coding with competitive lists",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672313",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672313",
acknowledgement = ack-nhfb,
}
@InProceedings{Schindler:1998:FRA,
author = "Michael Schindler",
title = "A Fast Renormalisation for Arithmetic Coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672314",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "A poster in the Data Compression Conference, 1998.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672314;
http://www.compressconsult.com/rangecoder/",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Schindler, Michael (1998) ``A Fast Renormalisation for
Arithmetic Coding,'' a poster in the Data Compression
Conference, 1998, available at URL\hfil\break
|http://www.compressconsult.com/rangecoder/|.",
}
@Article{Shinya:1998:PMS,
author = "Mikio Shinya and Takeaki Mori and Noriyoshi Osumi",
title = "Periodic Motion Synthesis and {Fourier} Compression",
journal = j-J-VIS-COMP-ANIMATION,
volume = "9",
number = "2",
pages = "95--107",
month = apr # "--" # jun,
year = "1998",
CODEN = "JVCAEO",
ISSN = "1049-8907",
ISSN-L = "1049-8907",
bibdate = "Thu Jul 29 07:22:52 MDT 1999",
bibsource = "http://www.interscience.wiley.com/jpages/1049-8907;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=5508;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=5508&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Visualization and Computer Animation",
}
@InProceedings{Simon:1998:SMC,
author = "S. F. Simon",
title = "On suboptimal multidimensional companding",
crossref = "Storer:1998:PDD",
pages = "438--447",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672191",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672191",
acknowledgement = ack-nhfb,
}
@Article{Skarbek:1998:MOR,
author = "W{\l}adys{\l}aw Skarbek and Adam Pietrowcew and
Rados{\l}aw Sikora",
title = "The Modified Oja-{RLS} Algorithm, Stochastic
Convergence Analysis and Application for Image
Compression",
journal = j-FUND-INFO,
volume = "36",
number = "4",
pages = "345--365",
month = dec,
year = "1998",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1998-3644",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:56:14 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Skarbek:1998:PSI,
author = "W{\l}adys{\l}aw Skarbek",
title = "Preface: Special Issue on Image Compression",
journal = j-FUND-INFO,
volume = "34",
number = "4",
pages = "??--??",
month = jul,
year = "1998",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-1998-34410",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 16:55:47 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo1990.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Smith:1998:FCG,
author = "T. C. Smith and R. Peeters",
title = "Fast convergence with a greedy tag-phrase dictionary",
crossref = "Storer:1998:PDD",
pages = "33--42",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672128",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672128",
acknowledgement = ack-nhfb,
}
@Article{Soulodre:1998:SES,
author = "G. A. Soulodre and T. Grusec and M. Lavoie and L.
Thibault",
key = "CRC",
title = "Subjective Evaluation of State-of-the-Art 2-Channel
Audio Codecs",
journal = j-J-AUDIO-ENG-SOC,
volume = "46",
number = "3",
pages = "164--176",
month = mar,
year = "1998",
CODEN = "ADIOA3",
ISSN = "1549-4950",
ISSN-L = "",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of the Audio Engineering Society",
rawdata = "CRC (1998) Soulodre, G. A., T. Grusec, M. Lavoie, and
L. Thibault, ``Subjective Evaluation of
State-of-the-Art 2-Channel Audio Codecs,'' {\it Journal
of the Audio Engineering Society}, {\bf46}(3):164--176,
March.",
}
@Book{Starck:1998:IPD,
author = "J. L. Starck and F. Murtagh and A. Bijaoui",
title = "Image Processing and Data Analysis: The Multiscale
Approach",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Starck, J. L., F. Murtagh, and A. Bijaoui (1998) {\it
Image Processing and Data Analysis: The Multiscale
Approach}, Cambridge, UK, Cambridge University Press.",
}
@InProceedings{Storer:1998:PEP,
author = "J. A. Storer",
title = "The prevention of error propagation in dictionary
compression with update and deletion",
crossref = "Storer:1998:PDD",
pages = "199--208",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672148",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672148",
acknowledgement = ack-nhfb,
}
@InProceedings{Stuiver:1998:PIM,
author = "L. Stuiver and A. Moffat",
title = "Piecewise integer mapping for arithmetic coding",
crossref = "Storer:1998:PDD",
pages = "3--12",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672121",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672121",
acknowledgement = ack-nhfb,
}
@InProceedings{Subbalakshmi:1998:ODE,
author = "K. P. Subbalakshmi and J. Vaisey",
title = "Optimal decoding of entropy coded memoryless sources
over binary symmetric channels",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672315",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672315",
acknowledgement = ack-nhfb,
}
@PhdThesis{Tadayon:1998:ALD,
author = "Nasser Tadayon",
title = "Adaptive lossless data compression algorithms with new
approaches and modeling techniques",
type = "{Ph.D.} thesis",
school = "University of Southwestern Louisiana",
address = "Lafayette, LA, USA",
pages = "122",
year = "1998",
ISBN = "0-599-09971-2",
ISBN-13 = "978-0-599-09971-5",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304454825",
acknowledgement = ack-nhfb,
advisor = "Gui-Liang Feng",
classification = "0984: Computer science",
dissertation-thesis-number = "9911728",
subject = "Computer science",
}
@InProceedings{Tadayon:1998:GAL,
author = "N. Tadayon and Gui-Liang Feng and T. R. N. Rao and E.
Hinds",
title = "Grouping algorithm for lossless data compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672316",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672316",
acknowledgement = ack-nhfb,
}
@InProceedings{Tam:1998:BSR,
author = "D. Tam and W. Barrett and B. Morse and E. Mortensen",
title = "Breakpoint skeletal representation and compression of
document images",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672317",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672317",
acknowledgement = ack-nhfb,
}
@Article{Tanaka:1998:DCD,
author = "Masaharu Tanaka and Hidenori Sakanashi and Mehrdad
Salami and Masaya Iwata and Takio Kurita and Tetsuya
Higuchi",
title = "Data Compression for Digital Color Electrophotographic
Printer with Evolvable Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1478",
pages = "106--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:52:53 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1478.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1478/14780106.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1478/14780106.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Taubin:1998:GCT,
author = "Gabriel Taubin and Jarek Rossignac",
title = "Geometric compression through topological surgery",
journal = j-TOG,
volume = "17",
number = "2",
pages = "84--115",
month = apr,
year = "1998",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/274363.274365",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p84-taubin/",
abstract = "The abundance and importance of complex 3-D data bases
in major industry segments, the affordability of
interactive 3-D rendering for office and consumer use,
and the exploitation of the Internet to distribute and
share 3-D data have intensified the need for an
effective 3-D geometric compression technique that
would significantly reduce the time required to
transmit 3-D models over digital communication
channels, and the amount of memory or disk space
required to store the models. Because the prevalent
representation of 3-D models for graphics purposes is
polyhedral and because polyhedral models are in general
triangulated for rendering, this article introduces a
new compressed representation for complex triangulated
models and simple, yet efficient, compression and
decompression algorithms. In this scheme, vertex
positions are quantized within the desired accuracy, a
vertex spanning tree is used to predict the position of
each vertex from 2,3, or 4 of its ancestors in the
tree, and the correction vectors are entropy encoded.
Properties, such as normals, colors, and texture
coordinates, are compressed in a similar manner. The
connectivity is encoded with no loss of information to
an average of less than two bits per triangle. The
vertex spanning tree and a small set of jump edges are
used to split the model into a simple polygon. A
triangle spanning tree and a sequence of marching bits
are used to encode the triangulation of the polygon.
Our approach improves on Michael Deering's pioneering
results by exploiting the geometric coherence of
several ancestors in the vertex spanning tree,
preserving the connectivity with no loss of
information, avoiding vertex repetitions, and using
about three fewer bits for the connectivity. However,
since decompression requires random access to all
vertices, this method must be modified for hardware
rendering with limited onboard memory. Finally, we
demonstrate implementation results for a variety of
VRML models with up to two orders of magnitude
compression.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
keywords = "algorithms; standardization",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Taubin:1998:PFS,
author = "Gabriel Taubin and Andr{\'e} Gueziec and William Horn
and Francis Lazarus",
title = "Progressive Forest Split Compression",
journal = j-COMP-GRAPHICS,
volume = "32",
number = "{Annual Conference Series}",
pages = "123--132",
month = aug,
year = "1998",
CODEN = "CGRADI, CPGPBZ",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Mon Oct 4 18:57:39 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://w3imagis.imag.fr/Membres/Frederic.Durand/Book/sig98.html;
http://www.acm.org:80/pubs/citations/proceedings/graph/280814/p123-taubin/",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "algorithms; performance",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf E.4} Data,
CODING AND INFORMATION THEORY, Data compaction and
compression.",
}
@InProceedings{Teahan:1998:CET,
author = "W. J. Teahan and S. Inglis and J. G. Cleary and G.
Holmes",
title = "Correcting {English} text using {PPM} models",
crossref = "Storer:1998:PDD",
pages = "289--298",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672157",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672157",
acknowledgement = ack-nhfb,
}
@InProceedings{Teahan:1998:TBM,
author = "W. J. Teahan and J. G. Cleary",
title = "Tag based models of {English} text",
crossref = "Storer:1998:PDD",
pages = "43--52",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672130",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672130",
acknowledgement = ack-nhfb,
}
@InProceedings{Teixeira:1998:AJV,
author = "L. Teixeira",
title = "Analysis of a joint video coding system",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672318",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672318",
acknowledgement = ack-nhfb,
}
@InProceedings{Tsai:1998:CIC,
author = "Min-Jen Tsai",
title = "Color image compression by stack-run-end coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672319",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672319",
acknowledgement = ack-nhfb,
}
@Article{Turpin:1998:CEH,
author = "Andrew Turpin and Alistair Moffat",
title = "Comment on {``Efficient Huffman decoding''} and {``An
efficient finite-state machine implementation of
Huffman decoders''}",
journal = j-INFO-PROC-LETT,
volume = "68",
number = "1",
pages = "1--2",
day = "15",
month = oct,
year = "1998",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(98)00136-7",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 7 17:56:02 MST 1998",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
note = "See \cite{Chung:1997:EHD,Iyengar:1998:EFS}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{VanAssche:1998:LCP,
author = "S. {Van Assche} and W. Philips and I. Lemahiue",
title = "Lossless compression of pre-press images using linear
color decorrelation",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672320",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672320",
acknowledgement = ack-nhfb,
}
@InProceedings{vanderVleuten:1998:LCB,
author = "R. J. {van der Vleuten} and F. Bruekers",
title = "Lossless compression of binary audio signals",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672321",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672321",
acknowledgement = ack-nhfb,
}
@InProceedings{Vasconcelos:1998:BFC,
author = "N. Vasconcelos and A. Lippman",
title = "A {Bayesian} framework for content-based indexing and
retrieval",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672322",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672322",
acknowledgement = ack-nhfb,
}
@Article{Verdu:1998:FYS,
author = "S. Verdu",
title = "Fifty years of {Shannon} theory",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "44",
number = "6",
pages = "2057--2078",
month = oct,
year = "1998",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.720531",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Nov 20 16:41:32 2010",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "A brief chronicle is given of the historical
development of the central problems in the theory of
fundamental limits of data compression and reliable
communication",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
}
@InProceedings{Verma:1998:SEC,
author = "T. Verma and T. Meng",
title = "A scalable entropy code",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672323",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672323",
acknowledgement = ack-nhfb,
}
@InProceedings{Volf:1998:SBT,
author = "P. A. J. Volf and F. M. J. Willems",
title = "Switching between two universal source coding
algorithms",
crossref = "Storer:1998:PDD",
pages = "491--500",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672217",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672217",
acknowledgement = ack-nhfb,
}
@InProceedings{Wen:1998:RVL,
author = "Jiangtao Wen and John D. Villasenor",
title = "Reversible Variable Length Codes for Efficient and
Robust Image and Video Coding",
crossref = "Storer:1998:PDD",
pages = "471--480",
month = mar # "\slash " # apr,
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672209",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672209",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Wen, Jiangtao and John D. Villasenor (1998)
``Reversible Variable Length Codes for Efficient and
Robust Image and Video Coding,'' {\it Data Compression
Conference}, pp. 471--480, Snowbird, UT,
March--April.",
}
@InProceedings{Wright:1998:CSE,
author = "R. G. Wright and E. Keenan and M. Mannucci and M.
Rajan and T. Hanaratty and J. Dummer",
title = "Control structure efficiency enhancement for
predictive video coding",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672324",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672324",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1998:LII,
author = "X. Wu and Wai-Kin Choi and N. Memon",
title = "Lossless interframe image compression via context
modeling",
crossref = "Storer:1998:PDD",
pages = "378--387",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672169",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672169",
acknowledgement = ack-nhfb,
}
@Article{Yacobi:1998:FEU,
author = "Yacov Yacobi",
title = "Fast Exponentiation Using Data Compression",
journal = j-SIAM-J-COMPUT,
volume = "28",
number = "2",
pages = "700--703",
month = apr,
year = "1998",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539792234974",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Dec 5 17:26:53 MST 1998",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/28/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/23497",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Yokoo:1998:CTT,
author = "H. Yokoo",
title = "Context tables: a tool for describing text compression
algorithms",
crossref = "Storer:1998:PDD",
pages = "299--308",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672158",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672158",
acknowledgement = ack-nhfb,
}
@InProceedings{Yoo:1998:EID,
author = "Youngjun Yoo and Younggap Kwon and Antonio Ortega",
title = "Embedded Image-Domain Adaptive Compression of Simple
Images",
crossref = "Matthews:1998:CRT",
pages = "??--??",
year = "1998",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Yoo, Youngjun, Younggap Kwon, and Antonio Ortega
(1998) ``Embedded Image-Domain Adaptive Compression of
Simple Images,'' {\it Proceedings of the 32nd Asilomar
Conference on Signals, Systems, and Computers}, Pacific
Grove, CA, Nov. 1998.",
}
@InProceedings{Youssef:1998:ACV,
author = "A. Youssef",
title = "Analysis and comparison of various image downsampling
and upsampling methods",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672325",
bibdate = "Tue Feb 5 11:30:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672325",
acknowledgement = ack-nhfb,
}
@InProceedings{Youssef:1998:PAM,
author = "A. Youssef",
title = "Parallel algorithms for multi-indexed recurrence
relations with applications to {DPCM} image
compression",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672326",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672326",
acknowledgement = ack-nhfb,
}
@InProceedings{Zeevi:1998:PVQ,
author = "A. J. Zeevi",
title = "On the performance of vector quantizers empirically
designed from dependent sources",
crossref = "Storer:1998:PDD",
pages = "73--82",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672133",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672133",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:1998:CMC,
author = "Tong Zhang",
title = "Compression by model combination",
crossref = "Storer:1998:PDD",
pages = "319--328",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672160",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672160",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:1998:PTT,
author = "Bo Zhang and Y. F. Zheng",
title = "Packed-{TS} transform [for image compression]",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672327",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672327",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:1998:FFC,
author = "D. Zhao and Y. K. Chan and Wen Gao",
title = "{FACOLA} --- {FAce COder based on Location and
Attention}",
crossref = "Storer:1998:PDD",
pages = "??--??",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672328",
bibdate = "Tue Feb 5 08:38:49 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672328",
acknowledgement = ack-nhfb,
}
@InProceedings{Aberg:1999:TAS,
author = "J. Aberg",
title = "On taking advantage of similarities between parameters
in lossless sequential coding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785670",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785670",
acknowledgement = ack-nhfb,
}
@InProceedings{Adams:1999:PER,
author = "M. D. Adams and F. Kossentini",
title = "Performance evaluation of reversible
integer-to-integer wavelet transforms for image
compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785671",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785671",
acknowledgement = ack-nhfb,
}
@Article{Ageenko:1999:FAM,
author = "Eugene I. Ageenko and Pasi Fr{\"a}nti",
title = "Forward-adaptive method for context-based compression
of large binary images",
journal = j-SPE,
volume = "29",
number = "11",
pages = "943--952",
month = sep,
year = "1999",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/(sici)1097-024x(199909)29:11<943::aid-spe266>3.0.co;2-k",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Sep 18 18:25:59 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=63501201;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=63501201&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Alzina:1999:PMI,
author = "M. Alzina and W. Szpankowski and A. Grama",
title = "{$2$D}-pattern matching image and video compression",
crossref = "Storer:1999:DPD",
pages = "424--433",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755692",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755692",
acknowledgement = ack-nhfb,
}
@InProceedings{Apostolico:1999:LGD,
author = "A. Apostolico and M. E. Bock and S. Lonardi",
title = "Linear global detectors of redundant and rare
substrings",
crossref = "Storer:1999:DPD",
pages = "168--177",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755666",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755666",
acknowledgement = ack-nhfb,
}
@InProceedings{Arnavut:1999:MFP,
author = "Z. Arnavut",
title = "Move-to-front and permutation based inversion coding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785672",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785672",
acknowledgement = ack-nhfb,
}
@InProceedings{Ausbeck:1999:SPC,
author = "P. J. {Ausbeck, Jr.}",
title = "A streaming piecewise-constant model",
crossref = "Storer:1999:DPD",
pages = "208--217",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755670",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755670",
acknowledgement = ack-nhfb,
}
@Article{B:1999:DIF,
author = "Praveen B. and Deepak Gupta and Rajat Moona",
title = "Design and implementation of a file system with
on-the-fly data compression for {GNU/Linux}",
journal = j-SPE,
volume = "29",
number = "10",
pages = "863--874",
month = aug,
year = "1999",
CODEN = "SPEXBL",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Aug 31 11:31:54 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=63001367;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=63001367&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Bach:1999:LAT,
author = "J. Bach and I. H. Witten",
title = "Lexical attraction for text compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785673",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785673",
acknowledgement = ack-nhfb,
}
@InProceedings{Bajaj:1999:SRC,
author = "C. L. Bajaj and V. Pascucci and G. Zhuang",
title = "Single-resolution compression of arbitrary triangular
meshes with properties",
crossref = "Storer:1999:DPD",
pages = "247--256",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755674",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755674",
acknowledgement = ack-nhfb,
}
@InProceedings{Baker:1999:CDE,
author = "Brenda Baker and Udi Manber and Robert Muth",
booktitle = "ACM SIGPLAN Workshop on Compiler Support for System
Software (WCSSS '99)",
title = "Compressing Differences of Executable Code",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Baker, Brenda, Udi Manber, and Robert Muth (1999)
``Compressing Differences of Executable Code,'' {\it
ACM SIGPLAN Workshop on Compiler Support for System
Software (WCSSS '99)}.",
}
@InProceedings{Balkenhol:1999:MBW,
author = "B. Balkenhol and S. Kurtz and Y. M. Shtarkov",
title = "Modifications of the {Burrows} and {Wheeler} data
compression algorithm",
crossref = "Storer:1999:DPD",
pages = "188--197",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755668",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755668",
acknowledgement = ack-nhfb,
}
@InProceedings{Banister:1999:QCT,
author = "Brian A. Banister and Thomas R. Fischer",
title = "Quadtree Classification and {TCQ} Image Coding",
crossref = "Storer:1999:DPD",
pages = "149--157",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755664",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755664",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Banister, Brian, and Thomas R. Fischer (1999)
``Quadtree Classification and TCQ Image Coding,'' in
Storer, James A., and Martin Cohn (eds.) (1999) {\it
DCC '99: Data Compression Conference}, Los Alamitos,
CA, IEEE Computer Society Press, pp. 149--157.",
}
@InProceedings{Barequet:1999:SSI,
author = "R. Barequet and M. Feder",
title = "{SICLIC}: a simple inter-color lossless image coder",
crossref = "Storer:1999:DPD",
pages = "501--510",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755700",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755700",
acknowledgement = ack-nhfb,
}
@InProceedings{Bentley:1999:DCU,
author = "J. Bentley and D. McIlroy",
title = "Data compression using long common strings",
crossref = "Storer:1999:DPD",
pages = "287--295",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755678",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755678",
acknowledgement = ack-nhfb,
}
@InProceedings{Berke:1999:CAP,
author = "J. Berke",
title = "Comparison and application possibilities of {JPEG} and
fractal-based image compressing methods in the
development of multimedia-based material",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785674",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785674",
acknowledgement = ack-nhfb,
}
@Article{Booth:1999:DTU,
author = "S. A. Booth",
title = "Digital {TV} in the {United States}",
journal = j-IEEE-SPECTRUM,
volume = "36",
number = "3",
pages = "39--41",
month = mar,
year = "1999",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.750399",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu Jan 16 07:37:23 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "alternative displays; antennas; Cable TV; data
compression; digital television; Digital TV; digital
TV; digital TV formats; digital TV sets; Displays;
HDTV; Marketing and sales; Monitoring; pioneering
digital TV products; scaling; Snow; television
antennas; terrestrial digital broadcasting; TV
broadcasting; United States; Virtual manufacturing;
Watches",
}
@InProceedings{Brandenburg:1999:MAE,
author = "Karlheinz Brandenburg",
editor = "????",
booktitle = "{The AES 17th International Conference, Florence,
Italy, Sept. 2--5}",
title = "{MP3} and {AAC} Explained",
publisher = "????",
address = "????",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cselt.it/mpeg/tutorials.htm",
acknowledgement = ack-ds,
rawdata = "Brandenburg, Karlheinz (1999) ``MP3 and AAC
Explained,'' {\it The AES 17th International
Conference}, Florence, Italy, Sept. 2--5. Available
at\hfil\break
|http://www.cselt.it/mpeg/tutorials.htm|.",
}
@InProceedings{Brunk:1999:JDP,
author = "H. Brunk and N. Farvardin",
title = "Joint design of progressive fixed-rate source-channel
codes",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785675",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785675",
acknowledgement = ack-nhfb,
}
@PhdThesis{Cabrera-Mercader:1999:RCM,
author = "Carlos R. Cabrera-Mercader",
title = "Robust compression of multispectral remote sensing
data",
type = "{Ph.D.} thesis",
school = "Massachusetts Institute of Technology",
address = "Cambridge, MA, USA",
pages = "????",
year = "1999",
ISBN = "0-315-79189-6",
ISBN-13 = "978-0-315-79189-3",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304562114",
acknowledgement = ack-nhfb,
advisor = "David H. Staelin",
classification = "0544: Electrical engineering; 0799: Remote sensing",
dissertation-thesis-number = "0801276",
subject = "Electrical engineering; Remote sensing",
}
@InProceedings{Cannane:1999:GPC,
author = "A. Cannane and H. E. Williams and J. Zobel",
title = "A general-purpose compression scheme for databases",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785676",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785676",
acknowledgement = ack-nhfb,
}
@InProceedings{Cen:1999:DTE,
author = "S. Cen and P. Cosman and F. Azadegan",
title = "Decision trees for error concealment in video
decoding",
crossref = "Storer:1999:DPD",
pages = "384--393",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755688",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755688",
acknowledgement = ack-nhfb,
}
@InProceedings{Chande:1999:JSC,
author = "V. Chande and N. Farvardin",
title = "Joint source-channel coding for progressive
transmission of embedded source coders",
crossref = "Storer:1999:DPD",
pages = "52--61",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755654",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755654",
acknowledgement = ack-nhfb,
}
@Article{Chen:1999:MEF,
author = "Hong-Chung Chen and Yue-Li Wang and Yu-Feng Lan",
title = "A memory-efficient and fast {Huffman} decoding
algorithm",
journal = j-INFO-PROC-LETT,
volume = "69",
number = "3",
pages = "119--122",
day = "12",
month = feb,
year = "1999",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(99)00002-2",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Oct 12 06:43:43 MDT 2000",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
URL = "http://www.elsevier.nl/gej-ng/10/23/20/47/19/20/abstract.html;
http://www.elsevier.nl/gej-ng/10/23/20/47/19/20/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@PhdThesis{Chen:1999:SDC,
author = "Xiao Chen",
title = "Study on Data Compression Coding in Multimedia
Communication",
type = "{D.Eng.} thesis",
school = "Huazhong (Central China) University of Science and
Technology",
address = "Huazhong, Peoples Republic of China",
year = "1999",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1027904819",
acknowledgement = ack-nhfb,
advisor = "Yao Ting Zhu and Guang Xi Zhu and Guang Xi",
classification = "9998: No UMI subject assigned",
dissertation-thesis-number = "H144800",
language = "Chinese",
subject = "No UMI subject assigned",
}
@InProceedings{Cheung:1999:SSV,
author = "G. Cheung and S. McCanne and C. Papadimitriou",
title = "Software synthesis of variable-length code decoder
using a mixture of programmed logic and table lookups",
crossref = "Storer:1999:DPD",
pages = "121--130",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755661",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755661",
acknowledgement = ack-nhfb,
}
@InProceedings{Chi:1999:DCM,
author = "C.-H. Chi and Y. Zhang",
title = "Design consideration for multi-lingual cascading text
compressors",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785677",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785677",
acknowledgement = ack-nhfb,
}
@InProceedings{Chiu:1999:PBV,
author = "Y.-J. Chiu",
title = "A perceptual-based video coder for error resilience",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785678",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785678",
acknowledgement = ack-nhfb,
}
@InProceedings{Chou:1999:MDD,
author = "P. A. Chou and S. Mehrotra and A. Wang",
title = "Multiple description decoding of overcomplete
expansions using projections onto convex sets",
crossref = "Storer:1999:DPD",
pages = "72--81",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755656",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755656",
acknowledgement = ack-nhfb,
}
@InProceedings{Cleary:1999:OIP,
author = "J. G. Cleary and W. J. Teahan",
title = "An open interface for probabilistic models of text",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785679",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785679",
acknowledgement = ack-nhfb,
}
@Article{Cohen-Or:1999:DCS,
author = "Daniel Cohen-Or and Yair Mann and Shachar Fleishman",
title = "Deep compression for streaming texture intensive
animations",
journal = j-COMP-GRAPHICS,
volume = "33",
number = "{Annual Conference Series}",
pages = "261--268",
year = "1999",
CODEN = "CGRADI, CPGPBZ",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Mon Oct 4 10:28:38 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.acm.org/pubs/citations/proceedings/graph/311535/p261-cohen-or/",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
}
@InProceedings{Cvetkovic:1999:SCQ,
author = "Z. Cvetkovic",
title = "Source coding with quantized redundant expansions:
accuracy and reconstruction",
crossref = "Storer:1999:DPD",
pages = "344--353",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755684",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755684",
acknowledgement = ack-nhfb,
}
@InProceedings{Dvorsky:1999:WBC,
author = "J. Dvorsky and J. Pokorny and V. Snasel",
title = "Word-based compression methods for large text
documents",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785680",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785680",
acknowledgement = ack-nhfb,
}
@InProceedings{Effros:1999:ULS,
author = "M. Effros",
title = "Universal lossless source coding with the
{Burrows--Wheeler} transform",
crossref = "Storer:1999:DPD",
pages = "178--187",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755667",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755667",
acknowledgement = ack-nhfb,
}
@Misc{Fielding:1999:RHT,
author = "R. Fielding and J. Gettys and J. Mogul and H. Frystyk
and L. Masinter and P. Leach and T. Berners-Lee",
title = "{RFC 2616: Hypertext Transfer Protocol --- HTTP/1.1}",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/rfc.bib",
URL = "http://www.faqs.org/rfcs/rfc2616.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "RFC2616 (1999) {\it Hypertext Transfer Protocol --
HTTP/1.1}. Available in PDF format at URL
|http://www.faqs.org/rfcs/rfc2616.html|.",
}
@InProceedings{Fleming:1999:GMD,
author = "M. Fleming and M. Effros",
title = "Generalized multiple description vector quantization",
crossref = "Storer:1999:DPD",
pages = "3--12",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755648",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755648",
acknowledgement = ack-nhfb,
}
@InProceedings{Forchhammer:1999:ICU,
author = "S. Forchhammer",
title = "Image coding using {Markov} models with hidden
states",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785681",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785681",
acknowledgement = ack-nhfb,
}
@Article{Furht:1999:PRM,
author = "Borko Furht and Raymond Westwater and Jeffrey Ice",
title = "Project Reports: Multimedia broadcasting over the
{Internet}. {II}. {Video} compression",
journal = j-IEEE-MULTIMEDIA,
volume = "6",
number = "1",
pages = "85--89",
month = jan # "--" # mar,
year = "1999",
CODEN = "IEMUE4",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jan 29 16:49:44 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "http://dlib.computer.org/mu/books/mu1999/pdf/u1085.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@InProceedings{Gallant:1999:RDO,
author = "M. Gallant and F. Kossentini",
title = "Rate-distortion optimized spatial scalability for
{DCT}-based video coding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785682",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785682",
acknowledgement = ack-nhfb,
}
@InProceedings{Gasieniec:1999:AOF,
author = "L. Gasieniec and W. Rytter",
title = "Almost-optimal fully {LZW}-compressed pattern
matching",
crossref = "Storer:1999:DPD",
pages = "316--325",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755681",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755681",
acknowledgement = ack-nhfb,
}
@Article{Girod:1999:BDS,
author = "Bernd Girod",
title = "Bidirectionally Decodable Streams of Prefix
Code-Words",
journal = j-IEEE-COMMUN-LET,
volume = "3",
number = "8",
pages = "245--247",
month = aug,
year = "1999",
CODEN = "ICLEF6",
DOI = "https://doi.org/10.1109/4234.781009",
ISSN = "1089-7798 (print), 1558-2558 (electronic)",
ISSN-L = "1089-7798",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Communications Letters",
rawdata = "Girod, Bernd (1999) ``Bidirectionally Decodable
Streams of Prefix Code-Words,'' {\it IEEE
Communications Letters}, {\bf3}(8):245--247, August.",
}
@InProceedings{Gong:1999:ECR,
author = "Y. Gong and M. K. H. Fan and C.-M. Huang",
title = "On entropy-constrained residual vector quantization
design",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785683",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785683",
acknowledgement = ack-nhfb,
}
@InProceedings{Goyal:1999:QFE,
author = "V. K. Goyal and J. Kovacevic and M. Vetterli",
title = "Quantized frame expansions as source-channel codes for
erasure channels",
crossref = "Storer:1999:DPD",
pages = "326--335",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755682",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755682",
acknowledgement = ack-nhfb,
}
@InProceedings{Graf:1999:SSW,
author = "U. Graf",
title = "Sorted sliding window compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785684",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785684",
acknowledgement = ack-nhfb,
}
@Article{Gross:1999:CMV,
author = "Markus H. Gross and Lars Lippert and Oliver G.
Staadt",
title = "Compression Methods for Visualization",
journal = j-FUT-GEN-COMP-SYS,
volume = "15",
number = "1",
pages = "11--29",
day = "12",
month = feb,
year = "1999",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/s0167-739x(98)00053-3",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Feb 27 12:41:18 MST 2002",
bibsource = "ftp://ftp.ira.uka.de/bibliography/Graphics/EVlib/EVL-1999.bib;
http://www.elsevier.com/locate/issn/0167739X;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://visinfo.zib.de/EVlib/Show?EVL-1999-101;
http://www.elsevier.com/gej-ng/10/19/19/30/18/18/abstract.html",
abstract = "Compression methods have become of fundamental
importance in almost every subfield of scientific
visualization. However, unlike image compression,
advanced visualization applications impose manifold
constraints on the design of appropriate algorithms,
where progressiveness, multiresolution or topology
preservation are some of the key issues. This paper
demonstrates the importance of multiresolution
compression methods for visualization using two
examples: The first, compression domain volume
rendering, enables one to visualize volume data
progressively and instantaneously from its compressed
data format and is designed for WWW and networked
applications. The second one is a multiresolution
compression and reconstruction method that allows for
progressive coding, transmission and geometric
reconstruction of surfaces and volumes. Both of the
presented methods are so-called transform coding
schemes and use wavelets for data representation.",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
keywords = "visualization, compression, wavelets, volume
rendering",
}
@InProceedings{Guan:1999:CAC,
author = "Y. Guan and R. J. Moorhead",
title = "Compression of arbitrary cutting planes",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785685",
bibdate = "Tue Feb 5 11:30:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785685",
acknowledgement = ack-nhfb,
}
@Article{Haemmerle:1999:CBS,
author = "J. Haemmerle and A. Uhl",
title = "Classification Based Speed-Up Methods for Fractal
Image Compression on Multicomputers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1557",
pages = "276--285",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 14 06:09:05 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "image processing; multimedia; parallel computation;
parallel computing; parallel numerics; ParNum",
}
@Article{Hammerle:1999:CBS,
author = "Jutta H{\"a}mmerle and Andreas Uhl",
title = "Classification Based Speed-Up Methods for Fractal
Image Compression on Multicomputers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1557",
pages = "276--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:53:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1557.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1557/15570276.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1557/15570276.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hankerson:1999:TMI,
author = "Darrel Hankerson and Greg A. Harris",
title = "Transform Methods and Image Compression",
journal = j-LINUX-J,
volume = "57",
pages = "??--??",
month = jan,
year = "1999",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Jun 3 06:33:53 MDT 1999",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue57/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "An introduction to JPEG and wavelet transform
techniques.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Hemami:1999:RVL,
author = "S. S. Hemami and T. Chang and R. Lau",
title = "Resynchronizing variable-length codes for robust image
transmission",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785686",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785686",
acknowledgement = ack-nhfb,
}
@Article{Hlavac:1999:APL,
author = "V. Hlav{\'a}{\v{c}} and J. Fojt{\'\i}k",
title = "Adaptive Predictor for Lossless Image Compression",
journal = j-COMPUTING,
volume = "62",
number = "4",
pages = "339--354",
month = dec,
year = "1999",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s006070050028",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
MRclass = "68T10",
MRnumber = "1 698 531",
bibdate = "Tue Oct 12 16:33:42 MDT 1999",
bibsource = "Compendex database;
http://link.springer-ny.com/link/service/journals/00607/tocs/t9000004.htm;
http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
MathSciNet database; OCLC Contents1st database",
URL = "http://link.springer-ny.com/link/service/journals/00607/bibs/9062004/90620339.htm;
http://link.springer-ny.com/link/service/journals/00607/papers/9062004/90620339.pdf",
acknowledgement = ack-nhfb,
classification = "723.2; 741",
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
journalabr = "Comput Vienna New York",
keywords = "Adaptive predictors; Image analysis; Image
compression; Image quality",
}
@InProceedings{Hoang:1999:RTV,
author = "D. T. Hoang",
title = "Real-time {VBR} rate control of {MPEG} video based
upon lexicographic bit allocation",
crossref = "Storer:1999:DPD",
pages = "374--383",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755687",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755687",
acknowledgement = ack-nhfb,
}
@InProceedings{Hong:1999:FAR,
author = "S.-W. Hong and P. Bao",
title = "Finite automata and regularized edge-preserving
wavelet transform scheme",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785687",
bibdate = "Tue Feb 5 11:30:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785687",
acknowledgement = ack-nhfb,
}
@InProceedings{Ismaeil:1999:MEU,
author = "I. R. Ismaeil and A. Docef and F. Kossentini and R.
Ward",
title = "Motion estimation using long-term motion vector
prediction",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785688",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785688",
acknowledgement = ack-nhfb,
}
@Book{ISO:1999:IIA,
author = "{ISO}",
title = "{ISO\slash IEC 10918-3:1997\slash Amd 1:1999:
Provisions to allow registration of new compression
types and versions in the SPIFF header}",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "1",
year = "1999",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon May 01 05:30:09 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
price = "CHF 13",
URL = "http://www.iso.ch/cate/d30961.html",
acknowledgement = ack-nhfb,
keywords = "JPEG",
pricecode = "XZ",
}
@Book{ISO:1999:IIIw,
author = "{ISO}",
title = "{ISO\slash IEC 10918-4:1999: Information technology
--- Digital compression and coding of continuous-tone
still images: Registration of JPEG profiles, SPIFF
profiles, SPIFF tags, SPIFF colour spaces, APPn
markers, SPIFF compression types and Registration
Authorities (REGAUT)}",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "29",
year = "1999",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon May 01 05:26:03 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
note = "Available in English only.",
price = "CHF 104",
URL = "http://www.iso.ch/cate/d25431.html",
acknowledgement = ack-nhfb,
keywords = "JPEG",
pricecode = "N",
}
@Article{Jena:1999:ILZ,
author = "S. K. Jena",
title = "An Improved {Lempel--Ziv} Algorithm for Sequential
Data Compression",
journal = j-INT-J-HIGH-SPEED-COMPUTING,
volume = "10",
number = "3",
pages = "275--284",
month = sep,
year = "1999",
CODEN = "IHSCEZ",
DOI = "https://doi.org/10.1142/s0129053399000132",
ISSN = "0129-0533",
bibdate = "Mon Feb 25 11:19:21 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijhsc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
OCLC Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Speed Computing
(IJHSC)",
}
@InProceedings{Ji:1999:MVA,
author = "T. Ji and W. E. Stark",
title = "Modified {Viterbi} algorithm for predictive {TCQ}",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785689",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785689",
acknowledgement = ack-nhfb,
}
@InProceedings{Jiang:1999:LCI,
author = "W. Jiang and L. Bruton",
title = "Lossless color image compression using chromatic
correlation",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785690",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785690",
acknowledgement = ack-nhfb,
}
@Article{Jin:1999:FPD,
author = "Jionghua Jin and Jianjun Shi",
title = "Feature-Preserving Data Compression of Stamping
Tonnage Information Using Wavelets",
journal = j-TECHNOMETRICS,
volume = "41",
number = "4",
pages = "327--339",
month = nov,
year = "1999",
CODEN = "TCMTA2",
DOI = "https://doi.org/10.2307/1271349",
ISSN = "0040-1706 (print), 1537-2723 (electronic)",
ISSN-L = "0040-1706",
bibdate = "Sat Jun 21 13:20:33 MDT 2014",
bibsource = "http://www.jstor.org/journals/00401706.html;
http://www.jstor.org/stable/i254379;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/technometrics1990.bib",
URL = "http://www.jstor.org/stable/1271349",
acknowledgement = ack-nhfb,
fjournal = "Technometrics",
journal-URL = "http://www.jstor.org/journals/00401706.html",
}
@InProceedings{Kashyap:1999:CDS,
author = "N. Kashyap and D. L. Neuhoff",
title = "Codes for data synchronization with timing",
crossref = "Storer:1999:DPD",
pages = "443--452",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755694",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755694",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaukoranta:1999:RCS,
author = "T. Kaukoranta and P. Franti and O. Nevalainen",
title = "Reduced comparison search for the exact {GLA}",
crossref = "Storer:1999:DPD",
pages = "33--41",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755651",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755651",
acknowledgement = ack-nhfb,
}
@InProceedings{Kawanaka:1999:ZCW,
author = "A. Kawanaka and V. R. Algazi",
title = "Zerotree coding of wavelet coefficients for image data
on arbitrarily shaped support",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785691",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785691",
acknowledgement = ack-nhfb,
}
@InProceedings{Khalil:1999:CWP,
author = "H. Khalil and A. Jacquin and C. Podilchuk",
title = "Constrained wavelet packets for tree-structured video
coding algorithms",
crossref = "Storer:1999:DPD",
pages = "354--363",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755685",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755685",
acknowledgement = ack-nhfb,
}
@Article{Kida:1999:SAP,
author = "Takuya Kida and Masayuki Takeda and Ayumi Shinohara
and Setsuo Arikawa",
title = "Shift-And Approach to Pattern Matching in {LZW}
Compressed Text",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1645",
pages = "1--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:54:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1645/16450001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kieffer:1999:STB,
author = "J. C. Kieffer and E.-H. Yang",
title = "A simple technique for bounding the pointwise
redundancy of the 1978 {Lempel--Ziv} algorithm",
crossref = "Storer:1999:DPD",
pages = "434--442",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755693",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755693",
acknowledgement = ack-nhfb,
}
@Article{Kientzle:1999:AAI,
author = "Tim Kientzle",
title = "Algorithm Alley: Implementing Fast {DCTs}",
journal = j-DDJ,
volume = "24",
number = "3",
pages = "115--119",
month = mar,
year = "1999",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 2 06:29:28 MST 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/1999/9902/9902toc.htm;
http://www.ddj.com/ftp/1999/1999_03/aa399.txt;
http://www.ddj.com/ftp/1999/1999_03/aa399.zip",
abstract = "The Discrete Cosine Transform (DCT) is a crucial part
of modern image and sound compression. Tim discusses
several fast algorithms for computing the 8-point DCT
and IDCT. Additional resources include aa399.txt
(listings) and aa399.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Kirovski:1999:PBP,
author = "Darko Kirovski and Johnson Kin and William H.
Mangione-Smith",
title = "Procedure Based Program Compression",
journal = j-INT-J-PARALLEL-PROG,
volume = "27",
number = "6",
pages = "457--475",
month = dec,
year = "1999",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1023/A:1018728216668",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Wed Jul 6 16:39:54 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=27&issue=6;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
OCLC Contents1st database",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=27&issue=6&spage=457",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
remark = "Special Issue: {30th Annual ACM\slash IEEE
International Symposium on Microarchitecture}, Part
{II}.",
}
@Article{Knutsson:1999:AEE,
author = "Bj{\"o}rn Knutsson and Mats Bj{\"o}rkman",
title = "Adaptive end-to-end compression for variable-bandwidth
communication",
journal = j-COMP-NET-AMSTERDAM,
volume = "31",
number = "7",
pages = "767--779",
day = "8",
month = apr,
year = "1999",
CODEN = "????",
DOI = "https://doi.org/10.1016/s0169-7552(98)00299-2",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Fri Sep 24 19:43:22 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/cna/cas_free/browse/browse.cgi?year=1999&volume=31&issue=7;
https://www.math.utah.edu/pub/tex/bib/compnetamsterdam1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.elsevier.com/cas/tree/store/comnet/sub/1999/31/7/2105.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InProceedings{Kolarov:1999:FCW,
author = "K. Kolarov and W. Lynch and B. Arrighi and B. Hoover",
title = "A fractional chip wavelet zero tree codec ({WZT}) for
video compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785692",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785692",
acknowledgement = ack-nhfb,
}
@Article{Kosaraju:1999:CLE,
author = "S. Rao Kosaraju and Giovanni Manzini",
title = "Compression of Low Entropy Strings with {Lempel--Ziv}
Algorithms",
journal = j-SIAM-J-COMPUT,
volume = "29",
number = "3",
pages = "893--911",
month = jun,
year = "1999",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539797331105",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Jan 22 13:21:38 MST 2000",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/29/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/33110",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Kruse:1999:ITC,
author = "H. Kruse and A. Mukherjee",
title = "Improving text compression ratios with the
{Burrows--Wheeler} transform",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785693",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785693",
acknowledgement = ack-nhfb,
}
@MastersThesis{Lambert:1999:IAC,
author = "Sean M. Lambert",
title = "Implementing {Associative Coder of Buyanovsky} ({ACB})
Data Compression",
type = "{M.S.} Thesis",
school = "Montana State University",
address = "Bozeman, MT, USA",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "sum1els@mindless.com",
acknowledgement = ack-ds,
rawdata = "Lambert, Sean M. (1999) ``Implementing Associative
Coder of Buyanovsky (ACB) Data Compression,'' M.S.
thesis, Bozeman, MT, Montana State University
(available from Sean Lambert at
|sum1els@mindless.com|).",
}
@InProceedings{Larsson:1999:ODB,
author = "N. J. Larsson and A. Moffat",
title = "Offline dictionary-based compression",
crossref = "Storer:1999:DPD",
pages = "296--305",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755679",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755679",
acknowledgement = ack-nhfb,
}
@PhdThesis{Larsson:1999:SSM,
author = "N. Jesper Larsson",
title = "Structures of string matching and data compression",
type = "{Ph.D.} thesis",
school = "Lunds Universitet",
address = "Lund, Sweden",
pages = "130",
year = "1999",
ISBN = "91-628-3685-4",
ISBN-13 = "978-91-628-3685-6",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304568808",
acknowledgement = ack-nhfb,
advisor = "Hui Long Duan",
classification = "0984: Computer science",
dissertation-thesis-number = "C801205",
subject = "Computer science",
}
@InProceedings{Lee:1999:EAP,
author = "W. S. Lee",
title = "Edge-adaptive prediction for lossless image coding",
crossref = "Storer:1999:DPD",
pages = "483--490",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755698",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755698",
acknowledgement = ack-nhfb,
}
@InProceedings{Lekatsas:1999:RAD,
author = "H. Lekatsas and W. Wolf",
title = "Random access decompression using binary arithmetic
coding",
crossref = "Storer:1999:DPD",
pages = "306--315",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755680",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755680",
acknowledgement = ack-nhfb,
}
@InProceedings{Lengwehasatit:1999:CDT,
author = "K. Lengwehasatit and A. Ortega",
title = "Complexity-distortion tradeoffs in vector matching
based on probabilistic partial distance techniques",
crossref = "Storer:1999:DPD",
pages = "394--403",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755689",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755689",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:1999:JIC,
author = "J. Li and R. M. Gray and R. Olshen",
title = "Joint image compression and classification with vector
quantization and a two dimensional hidden {Markov}
model",
crossref = "Storer:1999:DPD",
pages = "23--32",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755650",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755650",
acknowledgement = ack-nhfb,
}
@Article{Liao:1999:TCB,
author = "Stan Liao and Srinivas Devadas and Kurt Keutzer",
title = "A text-compression-based method for code size
minimization in embedded systems",
journal = j-TODAES,
volume = "4",
number = "1",
pages = "12--38",
month = jan,
year = "1999",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/298865.298867",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 27 10:05:33 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
URL = "http://www.acm.org/pubs/articles/journals/todaes/1999-4-1/p12-liao/p12-liao.pdf;
http://www.acm.org/pubs/citations/journals/todaes/1999-4-1/p12-liao/",
abstract = "We address the problem of code-size minimization in
VLSI systems with embedded DSP processors. Reducing
code size reduces the production cost of embedded
systems \par
we use data-compression methods to develop code-size
minimization strategies. In our framework, the
compressed program consists of a skeleton and a
dictionary. We show that the dictionary can be computed
by solving a set-covering problem derived from the
original program. To execute the compressed code, we
describe two methods that have different performance
characteristics and different degrees of freedom in
compressing the code. We also address performance
considerations, and show that they can be incorporated
easily into the set-covering formulation, and present
experimental results obtained with Texas Instruments'
optimizing TMS3220C25 compiler.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
generalterms = "Algorithms; Experimentation; Measurement;
Performance",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
keywords = "code size optimization; compression",
subject = "Software --- Programming Languages --- Processors
(D.3.4): {\bf Compilers}; Software --- Programming
Languages --- Processors (D.3.4): {\bf Optimization};
Data --- Coding and Information Theory (E.4): {\bf Data
compaction and compression}",
}
@InProceedings{Liefke:1999:XEC,
author = "Hartmut Liefke and Dan Suciu",
booktitle = "{Proceedings of the ACM SIGMOD Symposium on the
Management of Data, 2000}",
title = "{XMill}: an Efficient Compressor for {XML} Data",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "153--164",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://citeseer.ist.psu.edu/327443.html",
acknowledgement = ack-ds,
rawdata = "Liebchen, Tilman et al. (2005) ``The MPEG-4 Audio
Lossless Coding (ALS) Standard - Technology and
Applications,'' AES 119th Convention, New York, October
7--10, 2005. Available at URL\hfil\break
|http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html|.
Liefke, Hartmut and Dan Suciu (1999) ``XMill: an
Efficient Compressor for XML Data,'' {\it Proceedings
of the ACM SIGMOD Symposium on the Management of Data,
2000}, pp. 153--164. Available at
|http://citeseer.ist.psu.edu/327443.html|.",
}
@InProceedings{Lin:1999:VQV,
author = "K. K. Lin and R. M. Gray",
title = "Vector quantization of video with two codebooks",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785694",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785694",
acknowledgement = ack-nhfb,
}
@Article{Louchard:1999:APG,
author = "Guy Louchard and Wojciech Szpankowski and Jing Tang",
title = "Average Profile of the Generalized Digital Search Tree
and the Generalized {Lempel--Ziv} Algorithm",
journal = j-SIAM-J-COMPUT,
volume = "28",
number = "3",
pages = "904--934",
month = jun,
year = "1999",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539796301811",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Oct 23 07:53:15 MDT 2002",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/28/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/30181",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Lu:1999:PJS,
author = "J. Lu and A. Nosratinia and B. Aazhang",
title = "Progressive joint source-channel coding in feedback
channels",
crossref = "Storer:1999:DPD",
pages = "140--148",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755663",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755663",
acknowledgement = ack-nhfb,
}
@InProceedings{Lynch:1999:FMC,
author = "W. Lynch and K. Kolarov and B. Arrighi",
title = "Fast, modified {$Z$}-coding of wavelet pyramids",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785695",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785695",
acknowledgement = ack-nhfb,
}
@InProceedings{Malvar:1999:FPW,
author = "H. S. Malvar",
title = "Fast progressive wavelet coding",
crossref = "Storer:1999:DPD",
pages = "336--343",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755683",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755683",
acknowledgement = ack-nhfb,
}
@InProceedings{Matias:1999:EFP,
author = "Y. Matias and N. Rajpoot and S. C. Sahinalp",
title = "The effect of flexible parsing for dynamic
dictionary-based data compression",
crossref = "Storer:1999:DPD",
pages = "238--246",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755673",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755673",
acknowledgement = ack-nhfb,
}
@InProceedings{Mayer:1999:BME,
author = "J. Mayer",
title = "A blending model for efficient compression of smooth
images",
crossref = "Storer:1999:DPD",
pages = "228--237",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755672",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755672",
acknowledgement = ack-nhfb,
}
@InProceedings{Mehes:1999:PQN,
author = "A. Mehes and K. Zeger",
title = "Performance of quantizers on noisy channels using
structured families of codes",
crossref = "Storer:1999:DPD",
pages = "473--482",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755697",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755697",
acknowledgement = ack-nhfb,
}
@Book{Miano:1999:CIF,
author = "John Miano",
title = "Compressed Image File Formats: {JPEG}, {PNG}, {GIF},
{XBM}, {BMP}: Your guide to graphics files on the
{Web}",
publisher = "ACM Press and Addison-Wesley",
address = "New York, NY, USA",
pages = "xi + 264",
year = "1999",
ISBN = "0-201-60443-4, 0-201-61657-2",
ISBN-13 = "978-0-201-60443-6, 978-0-201-61657-6",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Miano, John (1999) {\it Compressed Image File
Formats}, New York, ACM Press and Addison-Wesley.",
tableofcontents = "Windows BMP \\
XBM \\
Introduction to JPEG \\
JPEG File Format \\
JPEG Human Coding \\
The Discrete Cosine Transform \\
Decoding Sequential-Mode JPEG Images \\
Creating Sequential JPEG Files \\
Optimizing the DCT \\
Progressive JPEG \\
GIF \\
PNG \\
Decompressing PNG Image Data \\
Creating PNG Files",
}
@InProceedings{Milidiu:1999:BCL,
author = "R. L. Milidiu and E. S. Laber and A. A. Pessoa",
title = "Bounding the compression loss of the {FGK} algorithm",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785696",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785696",
acknowledgement = ack-nhfb,
}
@InProceedings{Milidiu:1999:TSE,
author = "R. L. Milidiu and A. A. Pessoa and E. S. Laber",
title = "Two space-economical algorithms for calculating
minimum redundancy prefix codes",
crossref = "Storer:1999:DPD",
pages = "267--276",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755676",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755676",
acknowledgement = ack-nhfb,
}
@InProceedings{Milidiu:1999:WEP,
author = "R. L. Milidiu and E. S. Laber and A. A. Pessoa",
title = "A work-efficient parallel algorithm for constructing
{Huffman} codes",
crossref = "Storer:1999:DPD",
pages = "277--286",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755677",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755677",
acknowledgement = ack-nhfb,
}
@PhdThesis{mme:1999:AWT,
author = "{\O}yvind Str{\o}mme",
title = "On The Applicability of Wavelet Transforms to Image
and Video Compression",
type = "{Ph.D.} Thesis",
school = "University of Strathclyde",
address = "????",
pages = "??",
month = feb,
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Str\o mme, \O yvind (1999) {\it On The Applicability
of Wavelet Transforms to Image and Video Compression},
Ph.D. thesis, University of Strathclyde, February.",
}
@InProceedings{Mohr:1999:GDP,
author = "A. E. Mohr and E. A. Riskin and R. E. Ladner",
title = "Graceful degradation over packet erasure channels
through forward error correction",
crossref = "Storer:1999:DPD",
pages = "92--101",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755658",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755658",
acknowledgement = ack-nhfb,
}
@Article{Mohsenian:1999:SPC,
author = "N. Mohsenian and R. Rajagopalan and C. A. Gonzales",
title = "Single-pass constant- and variable-bit-rate {MPEG-2}
video compression",
journal = j-IBM-JRD,
volume = "43",
number = "4",
pages = "489--509",
month = jul,
year = "1999",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.434.0489",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Mon Feb 12 08:11:45 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/434/mohsenian.html",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@InProceedings{Moo:1999:RPA,
author = "P. W. Moo and X. Wu",
title = "Resynchronization properties of arithmetic coding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785697",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785697",
acknowledgement = ack-nhfb,
}
@InProceedings{Motta:1999:ALP,
author = "G. Motta and J. A. Storer and B. Carpentieri",
title = "Adaptive linear prediction lossless image coding",
crossref = "Storer:1999:DPD",
pages = "491--500",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755699",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755699",
acknowledgement = ack-nhfb,
}
@InProceedings{Mukherjee:1999:BRD,
author = "K. Mukherjee and A. Mukherjee and T. Acharya",
title = "`Bit rate on demand' using pruned tree-structured
hierarchical lookup vector quantization",
crossref = "Storer:1999:DPD",
pages = "42--51",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755652",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755652",
acknowledgement = ack-nhfb,
}
@InProceedings{Mukherjee:1999:JOF,
author = "K. Mukherjee and A. Mukherjee",
title = "Joint optical flow motion compensation and video
compression using hybrid vector quantization",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785698",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785698",
acknowledgement = ack-nhfb,
}
@Article{Nagano:1999:EIM,
author = "H. Nagano and A. Matsuura and A. Nagoya",
title = "An Efficient Implementation Method of Fractal Image
Compression on Dynamically Reconfigurable
Architecture",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1586",
pages = "670--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Sep 13 16:57:02 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nagumo:1999:PPA,
author = "H. Nagumo and M. Lu and K. L. Watson",
title = "Parallel Parsing Algorithms for Static Dictionary
Compression",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "10",
number = "12",
pages = "241--??",
month = dec,
year = "1999",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/71.819946",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Oct 12 18:48:32 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://dlib.computer.org/td/books/td1999/pdf/l1241.pdf;
http://www.computer.org/tpds/td1999/l1241abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Navarro:1999:GPA,
author = "Gonzalo Navarro and Mathieu Raffinot",
title = "A General Practical Approach to Pattern Matching over
{Ziv--Lempel} Compressed Text",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1645",
pages = "14--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:54:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450014.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1645/16450014.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Nevill-Manning:1999:PI,
author = "C. G. Nevill-Manning and I. H. Witten",
title = "Protein is incompressible",
crossref = "Storer:1999:DPD",
pages = "257--266",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755675",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755675",
acknowledgement = ack-nhfb,
}
@InProceedings{Nieto-Santisteban:1999:DCN,
author = "M. A. Nieto-Santisteban and D. J. Fixsen and J. D.
Offenberg and R. J. Hanisch and H. S. Stockman",
title = "Data compression for the next-generation space
telescope",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785699",
bibdate = "Tue Feb 5 11:30:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785699",
acknowledgement = ack-nhfb,
}
@InProceedings{Nosratinia:1999:EPP,
author = "A. Nosratinia",
title = "Embedded post-processing for enhancement of compressed
images",
crossref = "Storer:1999:DPD",
pages = "62--71",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755655",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755655",
acknowledgement = ack-nhfb,
}
@Misc{OConnor:1999:RF,
author = "John J. O'Connor and Edmund F. Robertson",
title = "References for {Fibonacci}",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www-groups.dcs.st-and.ac.uk/~history/References/Fibonacci.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Fibonacci (1999) is file |Fibonacci.html|
in\hfil\break
|http://www-groups.dcs.st-and.ac.uk/~history/References/|.",
}
@InProceedings{Ordentlich:1999:MES,
author = "E. Ordentlich and D. Taubman and M. Weinberger and G.
Seroussi and M. W. Marcellin",
title = "Memory-efficient scalable line-based image coding",
crossref = "Storer:1999:DPD",
pages = "218--227",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755671",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755671",
acknowledgement = ack-nhfb,
}
@InProceedings{Papaefstathiou:1999:CAS,
author = "I. Papaefstathiou",
title = "Compressing {ATM} streams on-line",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785700",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785700",
acknowledgement = ack-nhfb,
}
@InProceedings{Park:1999:IJS,
author = "M. S. Park and D. J. Miller",
title = "Improved joint source-channel decoding for
variable-length encoded data using soft decisions and
{MMSE} estimation",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785701",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785701",
acknowledgement = ack-nhfb,
}
@Article{Pigeon:1999:AAI,
author = "Steven Pigeon",
title = "Algorithm Alley: Image Compression with Wavelets",
journal = j-DDJ,
volume = "24",
number = "8",
pages = "111--115",
month = aug,
year = "1999",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Fri Jul 16 19:10:34 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "9908n/9908n.htm;
http://www.ddj.com/ftp/1999/1999_08/aa899.txt;
http://www.ddj.com/ftp/1999/1999_08/aa899.zip",
abstract = "Wavelets offer an attractive alternative when it comes
to image compression. Steven gives us a practical guide
to image compression via wavelets, and compares the
results to more familiar techniques, such as Jpeg.
Additional resources include aa899.txt (listings) and
aa899.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Pigeon:1999:BPA,
author = "S. Pigeon and Y. Bengio",
title = "Binary pseudowavelets and applications to bilevel
image processing",
crossref = "Storer:1999:DPD",
pages = "364--373",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755686",
bibdate = "Tue Feb 5 11:30:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755686",
acknowledgement = ack-nhfb,
}
@Article{Piner:1999:CSN,
author = "Mary-Louise G. Piner",
title = "{Computer Society} Notes: {David Huffman}
(1925--1999)",
journal = j-COMPUTER,
volume = "32",
number = "12",
pages = "86--86",
month = dec,
year = "1999",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Mar 11 09:52:58 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://dlib.computer.org/co/books/co1999/pdf/rz086.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Pinho:1999:FMM,
author = "M. S. Pinho and W. A. Finamore and W. A. Pearlman",
title = "Fast multi-match {Lempel--Ziv}",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785702",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785702",
acknowledgement = ack-nhfb,
}
@InProceedings{Pradhan:1999:DSC,
author = "S. S. Pradhan and K. Ramchandran",
title = "Distributed source coding using syndromes ({DISCUS}):
design and construction",
crossref = "Storer:1999:DPD",
pages = "158--167",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755665",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755665",
acknowledgement = ack-nhfb,
}
@InProceedings{Qian:1999:GJS,
author = "L. Qian and D. L. Jones and K. Ramchandran and S.
Appadwedula",
title = "A general joint source-channel matching method for
wireless video transmission",
crossref = "Storer:1999:DPD",
pages = "414--423",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755691",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755691",
acknowledgement = ack-nhfb,
}
@Article{Ristov:1999:ZLC,
author = "Strahil Ristov and Eric Laporte",
title = "{Ziv--Lempel} Compression of Huge Natural Language
Data Tries Using Suffix Arrays",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1645",
pages = "196--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:54:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450196.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1645/16450196.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Rizzo:1999:ESP,
author = "F. Rizzo and J. A. Storer and B. Carpentieri",
title = "Experiments with single-pass adaptive vector
quantization",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785703",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785703",
acknowledgement = ack-nhfb,
}
@Book{Roelofs:1999:PDG,
author = "Greg Roelofs",
title = "{PNG}: The Definitive Guide",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xix + 327 + 4",
year = "1999",
ISBN = "1-56592-542-4",
ISBN-13 = "978-1-56592-542-7",
LCCN = "T385 .R588 1999",
bibdate = "Mon Apr 18 14:56:25 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ora.bib;
http://www.oreilly.com/catalog/;
z3950.loc.gov:7090/Voyager",
price = "US\$32.95",
URL = "http://www.libpng.org/pub/png/pngbook.html;
http://www.oreilly.com/catalog/9781565925427;
http://www.oreilly.com/catalog/pngdefg",
acknowledgement = ack-nhfb,
remark = "``Creating and programming portable network graphics''
--- cover.",
subject = "Computer graphics; Portable network graphics",
}
@InProceedings{Rosiles:1999:CSU,
author = "J.-G. Rosiles and M. J. T. Smith",
title = "Compression of {SAR} and ultrasound imagery using
texture models",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785704",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785704",
acknowledgement = ack-nhfb,
}
@Article{Sadakane:1999:CDT,
author = "K. Sadakane and H. Imai",
title = "A Cooperative Distributed Text Database Management
Method Unifying Search and Compression Based on the
{Burrows--Wheeler} Transformation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1552",
pages = "434--445",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 14 06:09:05 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "ADT; conceptual modelling; database technologies;
mobile data access; spatio-; temporal data management",
}
@InProceedings{Sadakane:1999:MBW,
author = "K. Sadakane",
title = "A modified {Burrows--Wheeler} transformation for
case-insensitive search with application to suffix
array compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785705",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785705",
acknowledgement = ack-nhfb,
}
@InProceedings{Salih:1999:ETR,
author = "I. Salih and S. H. Smith",
title = "Encoding time reduction in fractal image compression",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785706",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785706",
acknowledgement = ack-nhfb,
}
@Book{Salomon:1999:CGG,
author = "David Salomon",
title = "Computer Graphics and Geometric Modeling",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 851",
year = "1999",
ISBN = "0-387-98682-0",
ISBN-13 = "978-0-387-98682-1",
LCCN = "T385 S243 1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
URL = "http://www.booksbydavidsalomon.com/;
http://www.ecs.csun.edu/~dxs/CGGMadvertis/CGad.html",
abstract = "This is a book for those interested in understanding
how graphics programs work and how present-day computer
graphics can generate realistic-looking curves,
surfaces, and solid objects. The book emphasizes the
mathematics behind computer graphics, and most of the
required mathematics is included in an appendix. With
its numerous illustrative examples and (solved)
exercises, the book makes a splendid text for a
two-semester course in computer graphics for advanced
undergraduate or graduate students. It also serves as a
fine reference for professionals in the computer
graphics field.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata-1 = "Salomon, David (1999) {\it Computer Graphics and
Geometric Modeling}, New York, Springer.",
rawdata-2 = "Salomon, David (1999) {\it Computer Graphics and
Geometric Modeling}, New York, Springer-Verlag.",
tableofcontents = "1: First Principles \\
2: Scan-Converting Methods \\
3: Transformations and Projections \\
4: Curves \\
5: Surfaces \\
6: Rendering \\
7: Color \\
8: Computer Animation \\
9: Image Compression \\
10: Short Topics \\
Appendix: Mathematical Topics",
}
@InProceedings{Savari:1999:VFL,
author = "S. A. Savari",
title = "Variable-to-fixed length codes and plurally parsable
dictionaries",
crossref = "Storer:1999:DPD",
pages = "453--462",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755695",
bibdate = "Tue Feb 5 11:30:26 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755695",
acknowledgement = ack-nhfb,
}
@Article{Schelkens:1999:WBC,
author = "Peter Schelkens and Adrian Munteanu and Jan Cornelis",
title = "Wavelet-based compression of medical images:
{Protocols} to improve resolution and quality
scalability and region-of-interest coding",
journal = j-FUT-GEN-COMP-SYS,
volume = "15",
number = "2",
pages = "171--184",
day = "11",
month = mar,
year = "1999",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/s0167-739x(98)00061-2",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Feb 27 12:41:18 MST 2002",
bibsource = "http://www.elsevier.com/locate/issn/0167739X;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.elsevier.com/gej-ng/10/19/19/30/17/20/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@InProceedings{Servetto:1999:MDL,
author = "S. D. Servetto and V. A. Vaishampayan and N. J. A.
Sloane",
title = "Multiple description lattice vector quantization",
crossref = "Storer:1999:DPD",
pages = "13--22",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755649",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755649",
acknowledgement = ack-nhfb,
}
@Article{Shohdohji:1999:OQT,
author = "T. Shohdohji and Y. Hoshino and N. Kutsuwada",
title = "Optimization of quantization table based on visual
characteristics in {DCT} image coding",
journal = j-COMPUT-MATH-APPL,
volume = "37",
number = "11--12",
pages = "225--232",
month = jun,
year = "1999",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/s0898-1221(99)00160-1",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:48:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122199001601",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Skarbek:1999:MOR,
author = "W. Skarbek and A. Pietrowcew and R. Sikora",
title = "Modified {Oja-RLS} algorithm --- stochastic
convergence analysis and application for image
compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1609",
pages = "402--??",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Sep 13 16:57:02 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Srinivasan:1999:EWH,
author = "S. Srinivasan and L. N. Kanal",
title = "Eigen wavelet: hyperspectral image compression
algorithm",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785707",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785707",
acknowledgement = ack-nhfb,
}
@InProceedings{Srinivasan:1999:IDM,
author = "M. Srinivasan",
title = "Iterative decoding of multiple descriptions",
crossref = "Storer:1999:DPD",
pages = "463--472",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755696",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755696",
acknowledgement = ack-nhfb,
}
@Article{Strang:1999:DCT,
author = "Gilbert Strang",
title = "The Discrete Cosine Transform",
journal = j-SIAM-REVIEW,
volume = "41",
number = "1",
pages = "135--147",
month = mar,
year = "1999",
CODEN = "SIREAD",
DOI = "https://doi.org/10.1137/S0036144598336745",
ISSN = "0036-1445 (print), 1095-7200 (electronic)",
ISSN-L = "0036-1445",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/SIREV/41/1;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/33674",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "SIAM Review",
journal-URL = "http://epubs.siam.org/sirev",
rawdata = "Strang, Gilbert (1999) ``The Discrete Cosine
Transform,'' {\it SIAM Review}, {\bf41}(1):135--147.",
}
@PhdThesis{Strohbeck:1999:NAI,
author = "Uwe Strohbeck",
title = "A new approach in image data compression by
multiple-resolution frame processing",
type = "{Ph.D.} thesis",
school = "University of Northumbria at Newcastle",
address = "Newcastle, UK",
pages = "140",
year = "1999",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304587067",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "C730143",
subject = "Computer science; Electrical engineering",
}
@InProceedings{Stuart:1999:MLC,
author = "J. R. Stuart and others",
booktitle = "{AES 9th Regional Convention, Tokyo}",
title = "{MLP} Lossless Compression",
publisher = "????",
address = "????",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.meridian-audio.com/w_paper/mlp_jap_new.PDF",
acknowledgement = ack-ds,
rawdata = "Stuart, J. R. et al. (1999) ``MLP Lossless
Compression,'' {\it AES 9th Regional Convention,
Tokyo}. Available at
|http://www.meridian-audio.com/w_paper/mlp_jap_new.PDF|.",
}
@InProceedings{Subrahmanya:1999:AOD,
author = "P. Subrahmanya",
title = "An asymptotically optimal data compression algorithm
based on an inverted index",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785708",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785708",
acknowledgement = ack-nhfb,
}
@Article{Tan:1999:PIB,
author = "Min Tan and Janet M. Siegel and Howard Jay Siegel",
title = "Parallel Implementations of Block-Based Motion Vector
Estimation for Video Compression on Four Parallel
Processing Systems",
journal = j-INT-J-PARALLEL-PROG,
volume = "27",
number = "3",
pages = "195--225",
month = jun,
year = "1999",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1023/A:1018785512609",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Wed Jul 6 16:39:53 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=27&issue=3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
OCLC Contents1st database",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=27&issue=3&spage=195",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
}
@InProceedings{Tanskanen:1999:PMV,
author = "J. Tanskanen and J. Niittylahti",
title = "Parallel memories in video encoding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785709",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785709",
acknowledgement = ack-nhfb,
}
@InProceedings{Titchener:1999:TCC,
author = "M. R. Titchener and P. M. Fenwick and M. C. Chen",
title = "Towards a calibrated corpus for compression testing",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785711",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785711",
acknowledgement = ack-nhfb,
}
@InProceedings{Tompkins:1999:LJC,
author = "D. A. D. Tompkins and F. Kossentini",
title = "Lossless {JBIG2} coding performance",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785710",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785710",
acknowledgement = ack-nhfb,
}
@Misc{Udupa:1999:PC,
author = "Raghavendra U. Udupa and Vinayaka D. Pandit and Ashok
Rao",
title = "Private Communication",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Udupa, Raghavendra U., Vinayaka D. Pandit, and Ashok
Rao (1999), Private Communication.",
}
@InProceedings{vanderVleuten:1999:NMM,
author = "R. J. {van der Vleuten}",
title = "New methods for multiplication-free arithmetic
coding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785712",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785712",
acknowledgement = ack-nhfb,
}
@InProceedings{Wagner:1999:VCB,
author = "M. Wagner and R. Herz and H. Hartenstein and R.
Hamzaoui and D. Saupe",
title = "A video codec based on {R/D}-optimized adaptive vector
quantization",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785713",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785713",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:1999:NDP,
author = "N.-T. Wang and N. Ling",
title = "A novel dual-path architecture for {HDTV} video
decoding",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785714",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785714",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:1999:TDW,
author = "A. Wang and Zixiang Xiong and P. A. Chou and S.
Mehrotra",
title = "Three-dimensional wavelet coding of video with global
motion compensation",
crossref = "Storer:1999:DPD",
pages = "404--413",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755690",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755690",
acknowledgement = ack-nhfb,
}
@InProceedings{Weidmann:1999:RDA,
author = "C. Weidmann and M. Vetterli",
title = "Rate-distortion analysis of spike processes",
crossref = "Storer:1999:DPD",
pages = "82--91",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755657",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755657",
acknowledgement = ack-nhfb,
}
@InProceedings{Wen:1999:USI,
author = "J. Wen and J. D. Villasenor",
title = "Utilizing soft information in decoding of variable
length codes",
crossref = "Storer:1999:DPD",
pages = "131--139",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755662",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755662",
acknowledgement = ack-nhfb,
}
@Book{Witten:1999:MGC,
author = "Ian H. Witten and Alistair Moffat and Timothy C.
Bell",
title = "Managing Gigabytes: Compressing and Indexing Documents
and Images",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Second",
pages = "xxxi + 519",
year = "1999",
ISBN = "1-55860-570-3",
ISBN-13 = "978-1-55860-570-1",
LCCN = "TA1637 .W58 1994",
bibdate = "Thu May 12 08:02:54 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$54.95",
URL = "ftp://ftp.math.utah.edu/pub/mg/;
ftp://ftp.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz;
ftp://munnari.oz.au:/pub/mg;
http://www.cs.mu.oz.au/mg/;
http://www.cs.mu.oz.au/~alistair/arith_coder/;
https://www.math.utah.edu/pub/mg/;
https://www.math.utah.edu/pub/mg/mg-1.3x/bibsearch-1.02.tar.gz;
http://www.mkp.com/books_catalog/1-55860-570-3.asp",
abstract = "In this fully updated second edition of the highly
acclaimed \booktitle{Managing Gigabytes}, authors
Witten, Moffat, and Bell continue to provide
unparalleled coverage of state-of-the-art techniques
for compressing and indexing data. Whatever your field,
if you work with large quantities of information, this
book is essential reading --- an authoritative
theoretical resource and a practical guide to meeting
the toughest storage and access challenges. It covers
the latest developments in compression and indexing and
their application on the Web and in digital libraries.
It also details dozens of powerful techniques supported
by mg, the authors' own system for compressing,
storing, and retrieving text, images, and textual
images. Mg's source code is freely available on the
Web.",
acknowledgement = ack-ds # " and " # ack-nhfb,
tableofcontents = "Overview \\
Text compression \\
Indexing \\
Querying \\
Index construction \\
Image compression \\
Textual images \\
Mixed text and images \\
Implementation \\
The information explosion \\
Guide to the MG system \\
Guide to the NZDL",
}
@InProceedings{Witten:1999:TMN,
author = "I. H. Witten and Z. Bray and M. Mahoui and B. Teahan",
title = "Text mining: a new frontier for lossless compression",
crossref = "Storer:1999:DPD",
pages = "198--207",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755669",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755669",
acknowledgement = ack-nhfb,
}
@Article{Wolff:1999:CIC,
author = "G. Wolff",
title = "Computing as Information Compression by Multiple
Alignment, Unification and Search",
journal = j-J-UCS,
volume = "5",
number = "11",
pages = "777--815",
day = "28",
month = nov,
year = "1999",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Oct 12 14:21:58 MDT 2000",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_5_11/computing_as_information_compression",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Wolff:1999:PRI,
author = "J. G. Wolff",
title = "Probabilistic Reasoning as Information Compression by
Multiple Alignment, Unification and Search: An
Introduction and Overview",
journal = j-J-UCS,
volume = "5",
number = "7",
pages = "418--462",
day = "28",
month = jul,
year = "1999",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Oct 12 14:21:59 MDT 2000",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_5_7/probabilistic_reasoning_as_information",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Misc{Wolff:1999:U,
author = "Gerry Wolff",
title = "[unknown]",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cognitionresearch.org.uk/sp.htm",
acknowledgement = ack-ds,
rawdata = "Wolff, Gerry (1999)
|http://www.cognitionresearch.org.uk/sp.htm|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Wu:1999:CQF,
author = "X. Wu",
title = "Context quantization with {Fisher} discriminant for
adaptive embedded wavelet image coding",
crossref = "Storer:1999:DPD",
pages = "102--111",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755659",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755659",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:1999:LCH,
author = "X. Wu",
title = "Low complexity high-order context modeling of embedded
wavelet bit streams",
crossref = "Storer:1999:DPD",
pages = "112--120",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755660",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755660",
acknowledgement = ack-nhfb,
}
@InProceedings{Xue:1999:ICBa,
author = "X. Xue",
title = "Image compression based on low-pass wavelet transform
and multi-scale edge compensation. {Part II}: {MSEC}
model",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785715",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785715",
acknowledgement = ack-nhfb,
}
@InProceedings{Xue:1999:ICBb,
author = "X. Xue",
title = "Image compression based on low-pass wavelet transform
and multi-scale edge compensation. {Part II}: evidence
and experiments",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785716",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785716",
acknowledgement = ack-nhfb,
}
@InProceedings{Yan:1999:RVL,
author = "Z. Yan and S. Kumar and J. Li and C. C. J. Kuo",
title = "Reversible variable length codes ({RVLC}) for robust
coding of {$3$D} topological mesh data",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785717",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785717",
acknowledgement = ack-nhfb,
}
@InProceedings{Yokoo:1999:DDS,
author = "Hidetoshi Yokoo",
editor = "M. Crochemore and M. Paterson",
booktitle = "Combinatorial Pattern Matching",
title = "A Dynamic Data Structure for Reverse Lexicographically
Sorted Prefixes",
volume = "1645",
publisher = pub-SV,
address = pub-SV:adr,
pages = "150--162",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1645.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1645/16450150.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1645/16450150.pdf",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Yokoo, Hidetoshi (1999a) ``A Dynamic Data Structure
for Reverse Lexicographically Sorted Prefixes,'' {\it
Combinatorial Pattern Matching, Lecture Notes in
Computer Science 1645}, M. Crochemore and M. Paterson,
eds., Berlin, Springer Verlag, pp. 150--162.",
}
@Misc{Yokoo:1999:PC,
author = "Hidetoshi Yokoo",
title = "Private Communication",
pages = "??",
year = "1999",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Yokoo, Hidetoshi (1999b) Private Communication.",
}
@InProceedings{Yoshida:1999:AWB,
author = "S. Yoshida and T. Morihara and H. Yahagi and N.
Satoh",
title = "Application of a word-based text compression method to
{Japanese} and {Chinese} texts",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785718",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785718",
acknowledgement = ack-nhfb,
}
@Article{Young-Lai:1999:ASM,
author = "Matthew Young-Lai",
title = "Adding state merging to the {DMC} data compression
algorithm",
journal = j-INFO-PROC-LETT,
volume = "70",
number = "5",
pages = "223--228",
day = "21",
month = jun,
year = "1999",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(99)00066-6",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Oct 12 06:44:01 MDT 2000",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
URL = "http://www.elsevier.nl/gej-ng/10/23/20/48/21/18/abstract.html;
http://www.elsevier.nl/gej-ng/10/23/20/48/21/18/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Zeng:1999:MSE,
author = "Z. Zeng and I. Cumming",
title = "Modified {SPIHT} encoding for {SAR} image data",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785719",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785719",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:1999:EDN,
author = "D. Zhao and Y. K. Chan and W. Gao",
title = "Extending {DACLIC} for near-lossless compression with
postprocessing of greyscale images",
crossref = "Storer:1999:DPD",
pages = "??--??",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.785720",
bibdate = "Tue Feb 5 08:44:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785720",
acknowledgement = ack-nhfb,
}
@MastersThesis{Zhao:1999:RDC,
author = "Ping Hong Zhao",
title = "Research on data compression of industrial {TV} images
based on wavelet transformation",
type = "{M.Eng.}",
school = "China University of Mining and Technology",
address = "Beijing, People's Republic of China",
year = "1999",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
advisor = "Hong Zhen Yu",
classification = "0544: Electrical engineering",
subject = "Electrical engineering",
}
@Article{Abu-Mostafa:2000:MCL,
author = "Y. S. Abu-Mostafa and R. J. McEliece",
title = "Maximal codeword lengths in {Huffman} codes",
journal = j-COMPUT-MATH-APPL,
volume = "39",
number = "11",
pages = "129--134",
month = jun,
year = "2000",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/s0898-1221(00)00119-x",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:05 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S089812210000119X",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Anonymous:2000:BRPa,
author = "Anonymous",
title = "Book Reviews: {PNG: The Definitive Guide by Michael J.
Hammel; The Cathedral and the Bazaar by Peter Salus}",
journal = j-LINUX-J,
volume = "69",
pages = "??--??",
month = jan,
year = "2000",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Sep 21 07:44:11 MDT 2000",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue69/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://noframes.linuxjournal.com/lj-issues/issue69/3628.html;
http://noframes.linuxjournal.com/lj-issues/issue69/3763.html",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Apostolico:2000:CBS,
author = "A. Apostolico and S. Lonardi",
title = "Compression of biological sequences by greedy off-line
textual substitution",
crossref = "Storer:2000:DPD",
pages = "143--152",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838154",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838154",
acknowledgement = ack-nhfb,
}
@InProceedings{Arnavut:2000:MFI,
author = "Z. Arnavut",
title = "Move-to-front and inversion coding",
crossref = "Storer:2000:DPD",
pages = "193--202",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838159",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838159",
acknowledgement = ack-nhfb,
}
@InProceedings{Ausbeck:2000:SIM,
author = "P. J. {Ausbeck, Jr.}",
title = "The skip-innovation model for sparse images",
crossref = "Storer:2000:DPD",
pages = "43--52",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838144",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838144",
acknowledgement = ack-nhfb,
}
@Article{Balan:2000:ADW,
author = "Radu Balan and Ingrid Daubechies and Vinay
Vaishampayan",
title = "The analysis and design of windowed {Fourier} frame
based multiple description source coding schemes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "46",
number = "7",
pages = "2491--2536",
month = nov,
year = "2000",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.887860",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A29 65T60 94A34",
MRnumber = "1806816",
MRreviewer = "Boris D. Kudryashov",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
ZMnumber = "0998.94011",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
keywords = "asymptotic formulas; decoding; Decoding; Degradation;
distortion; Electronic mail; Fourier transforms;
Frequency conversion; frequency-shift division; Helium;
Mathematics; modulation; multiple description
compression problem; nonlocalization results; rate
distortion theory; Rate distortion theory;
Rate-distortion; redundancy; representation formulas;
source coding; Source coding; time-shift division;
translation index; transmission rate; window functions;
windowed Fourier encoding-decoding scheme; windowed
Fourier frame based multiple description source coding
schemes; Zak transform",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056; Vaishampayan,
Vinay/0000-0001-7781-0990",
researcherid-numbers = "Daubechies, Ingrid/B-5886-2012",
unique-id = "ISI:000165606900017",
}
@Article{Balkenhol:2000:UDC,
author = "B. Balkenhol and S. Kurtz",
title = "Universal data compression based on the
{Burrows--Wheeler} transformation: theory and
practice",
journal = j-IEEE-TRANS-COMPUT,
volume = "49",
number = "10",
pages = "1043--1053",
month = oct,
year = "2000",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.888040",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 10:35:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=888040",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Banerji:2000:AYA,
author = "A. Banerji and En-Hui Yang",
title = "Applications of {YK} algorithm to the {Internet}
transmission of {Web}-data: implementation issues and
modifications",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838193",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838193",
acknowledgement = ack-nhfb,
}
@Article{Baran:2000:NVNb,
author = "Nicholas Baran",
title = "News and Views: Neural Net Crowned King; Smart Shirts
Monitor Vital Signs; {McMaster} Team Wins College
Design Contest; {Java} Applet Tracks Space Station;
{Sandia Red Team} Batting 1000; New Digital Geometry
Compression Algorithm",
journal = j-DDJ,
volume = "25",
number = "10",
pages = "18--18",
month = oct,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Nov 8 15:09:24 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Baran:2000:NVV,
author = "Nicholas Baran",
title = "News and Views: Volunteers Needed for Weather
Simulation Model; {Bill Gates} Meets {Bill Blass} ---
Not!; Computer Lemon Law May Debut in {Pennsylvania};
Inventor of {Huffman} Encoding Dies; Green Cards, Not
Guest Visas; Online Forums on Electronic Recycling",
journal = j-DDJ,
volume = "25",
number = "1",
pages = "18--18",
month = jan,
year = "2000",
CODEN = "DDJOEB",
DOI = "https://doi.org/10.1093/combul/42.3.18",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:13 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Barros:2000:VAC,
author = "Jo{\~a}o Paulo Barros and Rui Pais",
title = "A versatile assignment in {CS} 2 (poster session): a
file compression utility based on the {Huffman} code",
journal = j-SIGCSE,
volume = "32",
number = "3",
pages = "185--185",
month = sep,
year = "2000",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/353519.343183",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:56:43 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Bauer:2000:ISC,
author = "R. Bauer and J. Hagenauer",
title = "Iterative source\slash channel-decoding using
reversible variable length codes",
crossref = "Storer:2000:DPD",
pages = "93--102",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838149",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838149",
acknowledgement = ack-nhfb,
}
@InProceedings{Cao:2000:PCR,
author = "L. Cao and Chang Wen Chen",
title = "Product code and recurrent alternative decoding for
wireless image transmission",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838194",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838194",
acknowledgement = ack-nhfb,
}
@InProceedings{Cardinal:2000:TBS,
author = "J. Cardinal",
title = "Tree-based search for {ECVQ}",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838195",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838195",
acknowledgement = ack-nhfb,
}
@Article{Carpentieri:2000:LCC,
author = "B. Carpentieri and M. J. Weinberger and G. Seroussi",
title = "Lossless Compression of Continuous-Tone Images",
journal = j-PROC-IEEE,
volume = "88",
number = "11",
pages = "1797--1809",
month = nov,
year = "2000",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.892715",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Carpentieri, B., M. J. Weinberger, and G. Seroussi
(2000) ``Lossless Compression of Continuous-Tone
Images,'' {\it Proceedings of the IEEE},
{\bf88}(11):1797--1809, November.",
}
@InProceedings{Chang:2000:APP,
author = "Yung-Ching Chang and Bin-Kai Shyu and Chuan-Yu Cho and
Jia-Shung Wang",
title = "Adaptive post-processing for region-based fractal
image compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838196",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838196",
acknowledgement = ack-nhfb,
}
@InProceedings{Chapin:2000:SBT,
author = "B. Chapin",
title = "Switching between two on-line list update algorithms
for higher compression of {Burrows--Wheeler}
transformed data",
crossref = "Storer:2000:DPD",
pages = "183--192",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838158",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838158",
acknowledgement = ack-nhfb,
}
@InProceedings{Cheney:2000:SMT,
author = "J. Cheney",
title = "Statistical models for term compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838197",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838197",
acknowledgement = ack-nhfb,
}
@InProceedings{Chou:2000:FPA,
author = "P. A. Chou and A. Mohr and A. Wang and S. Mehrotra",
title = "{FEC} and pseudo-{ARQ} for receiver-driven layered
multicast of audio and video",
crossref = "Storer:2000:DPD",
pages = "440--449",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838184",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838184",
acknowledgement = ack-nhfb,
}
@InProceedings{Christiansen:2000:NCT,
author = "B. O. Christiansen and K. E. Schauser and M. Munke",
title = "A novel codec for thin client computing",
crossref = "Storer:2000:DPD",
pages = "13--22",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838141",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838141",
acknowledgement = ack-nhfb,
}
@Article{Cortes:2000:SCR,
author = "Toni Cortes and Yolanda Becerra and Ra{\'u}l Cervera",
title = "Swap compression: resurrecting old ideas",
journal = j-SPE,
volume = "30",
number = "5",
pages = "567--587",
day = "25",
month = apr,
year = "2000",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/(SICI)1097-024X(20000425)30:5<567::AID-SPE312>3.0.CO;2-Z",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Mar 13 06:45:45 2001",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/71004434/START;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=71004434&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Crochemore:2000:DCU,
author = "Maxime Crochemore and Filippo Mignosi and Antonio
Restivo and Sergio Salemi",
title = "Data Compression Using Antidictionaries",
journal = j-PROC-IEEE,
volume = "88",
number = "11",
pages = "1756--1768",
year = "2000",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.892711",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "A special issue on lossless data compression, edited
by J. Storer.",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Crochemore, Maxime, Filippo Mignosi, Antonio Restivo,
and Sergio Salemi (2000) ``Data Compression Using
Antidictionaries,'' {\it Proceedings of the IEEE},
{\bf88}(11):1756--1768 (a special issue on lossless
data compression, edited by J. Storer).",
}
@InProceedings{Cvetkovic:2000:SBO,
author = "Z. Cvetkovic and Ingrid Daubechies",
title = "Single-bit oversampled {A/D} conversion with
exponential accuracy in the bit-rate",
crossref = "Storer:2000:DPD",
pages = "343--352",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838174",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838174",
acknowledgement = ack-nhfb,
keywords = "Analog-digital conversion; analog-to-digital
conversion; analogue-digital conversion; bandlimited
signal; bandlimited signals; Bit rate; deterministic
dither function; Entropy coding; exponential bit-rate
accuracy; exponential error decay; input signal
representation; Laboratories; mean square error
methods; mean squared error; oversampled A/D
conversion; Quantization; Rate-distortion; Sampling
methods; Signal analysis; signal reconstruction; signal
representation; Signal resolution; signal sampling;
single bit quantization; White noise; zero crossings",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{DeAgostino:2000:EPC,
author = "Sergio {De Agostino}",
title = "Erratum to {``P-complete Problems in Data
Compression'' [Theoret. Comput. Sci. 127 (1994)
181--186]}",
journal = j-THEOR-COMP-SCI,
volume = "234",
number = "1--2",
pages = "325--326",
day = "6",
month = mar,
year = "2000",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/0304-3975(94)90106-6",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Oct 31 11:38:05 MST 2000",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs1990.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
note = "See \cite{DeAgostino:1994:PCP}.",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/170/21/37/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/170/21/37/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{DeAgostino:2000:WOP,
author = "S. {De Agostino}",
title = "Work-optimal parallel decoders for {LZ2} data
compression",
crossref = "Storer:2000:DPD",
pages = "393--399",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838179",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838179",
acknowledgement = ack-nhfb,
}
@InProceedings{Deever:2000:WYS,
author = "A. Deever and S. S. Hemami",
title = "{What}'s your sign?: efficient sign coding for
embedded wavelet image coding",
crossref = "Storer:2000:DPD",
pages = "273--282",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838167",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838167",
acknowledgement = ack-nhfb,
}
@Article{Deorowicz:2000:IBW,
author = "Sebastian Deorowicz",
title = "Improvements to {Burrows--Wheeler} compression
algorithm",
journal = j-SPE,
volume = "30",
number = "13",
pages = "1465--1483",
day = "10",
month = nov,
year = "2000",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Mar 13 06:46:11 2001",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/73001202/START;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=73001202&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Diggavi:2000:DAM,
author = "S. N. Diggavi and N. J. A. Sloane and V. A.
Vaishampayan",
title = "Design of asymmetric multiple description lattice
vector quantizers",
crossref = "Storer:2000:DPD",
pages = "490--499",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838189",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838189",
acknowledgement = ack-nhfb,
}
@InProceedings{Dragotti:2000:AOF,
author = "P. L. Dragotti and S. D. Servetto and M. Vetterli",
title = "Analysis of optimal filter banks for multiple
description coding",
crossref = "Storer:2000:DPD",
pages = "323--332",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838172",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838172",
acknowledgement = ack-nhfb,
}
@MastersThesis{Du:2000:DCP,
author = "Ying Du",
title = "Data compression --- the process of encoding data to
reduce their storage requirements",
type = "{M.Eng.}",
school = "Donghua University",
address = "Donghua, Peoples Republic of China",
year = "2000",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1027130485",
acknowledgement = ack-nhfb,
advisor = "He Qun Xu",
classification = "0984: Computer science",
dissertation-thesis-number = "H000946",
language = "Chinese",
subject = "Computer science",
}
@InProceedings{Duval:2000:SDC,
author = "L. C. Duval and Van Bui-Tran and T. Q. Nguyen and T.
D. Tran",
title = "Seismic data compression using {GenLOT}: towards
``optimality''?",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838199",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838199",
acknowledgement = ack-nhfb,
}
@InProceedings{Effros:2000:PPB,
author = "M. Effros",
title = "{PPM} performance with {BWT} complexity: a new method
for lossless data compression",
crossref = "Storer:2000:DPD",
pages = "203--212",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838160",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838160",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT); prediction by
partial matching (PPM) data compression algorithm",
}
@InProceedings{Ekstrand:2000:SNC,
author = "N. Ekstrand and B. Smeets",
title = "Some notes on the context mapping function in lossless
data compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838200",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838200",
acknowledgement = ack-nhfb,
}
@InProceedings{Engelson:2000:LCH,
author = "V. Engelson and D. Fritzson and P. Fritzson",
title = "Lossless compression of high-volume numerical data
from simulations",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838221",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838221",
acknowledgement = ack-nhfb,
}
@InProceedings{Forchhammer:2000:CLP,
author = "S. Forchhammer and O. R. Jensen",
title = "Content layer progressive coding of digital maps",
crossref = "Storer:2000:DPD",
pages = "233--242",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838163",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838163",
acknowledgement = ack-nhfb,
}
@Article{Forst:2000:MHT,
author = "Gunnar Forst and Anders Thorup",
title = "Minimal {Huffman} trees",
journal = j-ACTA-INFO,
volume = "36",
number = "9/10",
pages = "721--734",
month = apr,
year = "2000",
CODEN = "AINFA2",
DOI = "https://doi.org/10.1007/s002360050172",
ISSN = "0001-5903 (print), 1432-0525 (electronic)",
ISSN-L = "0001-5903",
bibdate = "Thu Sep 28 06:06:54 MDT 2000",
bibsource = "http://link.springer-ny.com/link/service/journals/00236/tocs/t0036009.htm;
https://www.math.utah.edu/pub/tex/bib/actainfo.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/journals/00236/bibs/0036009/00360721.htm;
http://link.springer-ny.com/link/service/journals/00236/papers/0036009/00360721.pdf",
acknowledgement = ack-nhfb,
fjournal = "Acta Informatica",
journal-URL = "http://www.springerlink.com/content/0001-5903",
}
@InProceedings{Fowler:2000:QOS,
author = "J. E. Fowler",
title = "{QccPack}: an open-source software library for
quantization, compression, and coding",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838201",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838201;
http://www.ece.msstate.edu/~fowler/QccPack",
acknowledgement = ack-nhfb,
remark = "The msstate URL is no longer accessible on 06 February
2013.",
}
@InProceedings{Frank-Dayan:2000:ULB,
author = "Y. Frank-Dayan and R. Zamir",
title = "Universal lattice-based quantizers for multiple
descriptions",
crossref = "Storer:2000:DPD",
pages = "500--509",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838190",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838190",
acknowledgement = ack-nhfb,
}
@InProceedings{Frank:2000:TCU,
author = "E. Frank and Chang Chui and I. H. Witten",
title = "Text categorization using compression models",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838202",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838202",
acknowledgement = ack-nhfb,
}
@InProceedings{Gong:2000:ICU,
author = "Yun Gong and M. K. H. Fan and Chien-Min Huang",
title = "Image compression using lossless coding on {VQ}
indexes",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838230",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838230",
acknowledgement = ack-nhfb,
}
@InProceedings{Guivarch:2000:JSC,
author = "L. Guivarch and J.-C. Carlach and P. Siohan",
title = "Joint source-channel soft decoding of {Huffman} codes
with turbo-codes",
crossref = "Storer:2000:DPD",
pages = "83--92",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838148",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838148",
acknowledgement = ack-nhfb,
}
@InProceedings{Hong:2000:GTI,
author = "E. S. Hong and R. E. Ladner",
title = "Group testing for image compression",
crossref = "Storer:2000:DPD",
pages = "3--12",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838140",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838140",
acknowledgement = ack-nhfb,
}
@InProceedings{Iren:2000:SNN,
author = "S. Iren and P. D. Amer",
title = "{SPIHT-NC}: network-conscious zerotree encoding",
crossref = "Storer:2000:DPD",
pages = "313--322",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838171",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838171",
acknowledgement = ack-nhfb,
}
@Misc{ISO:2000:ITJ,
author = "{ISO/IEC}",
title = "{International Standard IS 15444-1}: Information
Technology---{JPEG 2000} Image Coding System.",
pages = "??",
day = "16",
month = mar,
year = "2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "This is the FDC (final committee draft) version 1.0",
acknowledgement = ack-ds,
rawdata = "ISO/IEC (2000), International Standard IS 15444-1
``Information Technology---JPEG 2000 Image Coding
System.'' This is the FDC (final committee draft)
version 1.0, 16 March 2000.",
}
@InProceedings{Itagaki:2000:PSC,
author = "S. Itagaki and H. Yokoo",
title = "{PPM}*-style context sorting compression method using
a prefix list",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838203",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838203",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@Article{Ivanov:2000:CDN,
author = "Denis V. Ivanov and Yevgeniy P. Kuzmin",
title = "Color Distribution --- a New Approach to Texture
Compression",
journal = j-CGF,
volume = "19",
number = "3",
pages = "??--??",
month = aug,
year = "2000",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00420",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Oct 11 06:13:38 MDT 2000",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "aid=420&
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&
iid=3& src=ard& vid=19",
acknowledgement = ack-nhfb,
author-1-adr = "Department of Mathematics and Mechanics, Moscow State
University, Moscow, Russia",
author-2-adr = "Department of Mathematics and Mechanics, Moscow State
University, Moscow, Russia",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Misc{JPEG:2000:JON,
author = "{JPEG 2000 Organization}",
title = "{JPEG 2000} Our New Standard!",
pages = "??",
year = "2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.jpeg.org/JPEG2000.htm",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "JPEG 2000 Organization (2000)
|http://www.jpeg.org/JPEG2000.htm|.",
}
@Article{Kaklamanis:2000:HAS,
author = "C. Kaklamanis and C. Konstantopoulos and A. Svolos",
title = "A Hypercube Algorithm for Sliding Window Compression",
journal = j-PARALLEL-PROCESS-LETT,
volume = "10",
number = "4",
pages = "315--??",
month = dec,
year = "2000",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/s0129626400000305",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
bibdate = "Wed Jul 25 16:34:42 2001",
bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
URL = "http://ejournals.wspc.com.sg/ppl/10/1004/S0129626400000305.html",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@InProceedings{Kelner:2000:MDL,
author = "J. A. Kelner and V. K. Goyal and J. Kovacevic",
title = "Multiple description lattice vector quantization:
variations and extensions",
crossref = "Storer:2000:DPD",
pages = "480--489",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838188",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838188",
acknowledgement = ack-nhfb,
}
@Article{Khuri:2000:IPL,
author = "Sami Khuri and Hsiu-Chin Hsu",
title = "Interactive packages for learning image compression
algorithms",
journal = j-SIGCSE,
volume = "32",
number = "3",
pages = "73--76",
month = sep,
year = "2000",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/353519.343081",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:56:43 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "This paper introduces three interactive packages for
learning image compression algorithms. The first two
packages, RLE and Quadtree, animate bitmap image
compression algorithms, and the third package, JPEG, is
a tutorial about the Joint Photographic Expert Group
(JPEG) standard. The goal in designing and developing
the packages was to provide instructors with tutorial
and demonstration tools for teaching various
interesting algorithms to students in CS1/CS2, Data
Structures and Algorithms, Data Compression and Image
Processing courses. The packages visualize image
compression algorithms by displaying their different
states of execution, using different colors to
highlight the important areas, and providing textual
explanations to help users understand the
visualization. All three packages are interactive,
platform-independent, and easy to use.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Klein:2000:NCM,
author = "S. T. Klein and D. Shapira",
title = "A new compression method for compressed matching",
crossref = "Storer:2000:DPD",
pages = "400--409",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838180",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838180",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2000:PHD,
author = "S. T. Klein and Y. Wiseman",
title = "Parallel {Huffman} decoding",
crossref = "Storer:2000:DPD",
pages = "383--392",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838178",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838178",
acknowledgement = ack-nhfb,
}
@InProceedings{Klimesh:2000:OSD,
author = "M. Klimesh",
title = "Optimal subtractive dither for near-lossless
compression",
crossref = "Storer:2000:DPD",
pages = "223--232",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838162",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838162",
acknowledgement = ack-nhfb,
}
@Article{Knessl:2000:ABH,
author = "Charles Knessl and Wojciech Szpankowski",
title = "Asymptotic Behavior of the Height in a Digital Search
Tree and the Longest Phrase of the {Lempel--Ziv}
Scheme",
journal = j-SIAM-J-COMPUT,
volume = "30",
number = "3",
pages = "923--964",
month = jun,
year = "2000",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539799356812",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Fri Oct 27 06:28:43 MDT 2000",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/30/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/35681",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Kroeker:2000:PIM,
author = "Kirk L. Kroeker",
title = "Products: {iCompression}'s {MPEG-2} Encoder Reference
Design Kit for {USB}; Free Project Management Support
Tools; {Force Computers}' Protocol Software for Telecom
Integration; {Data Junction}'s Free {XML} Tool; {Fookes
Software}'s Text Editor for Programmers; {Research
Systems}' {IDL} Wavelet Toolkit; {Be} Opens Source Code
to {BeOS 5}; {JafSoft}'s Utility for Converting Text
Files into {RTF}",
journal = j-COMPUTER,
volume = "33",
number = "5",
pages = "98--100",
month = may,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 30 17:20:19 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/r5098.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Lafe:2000:CAT,
author = "Olu Lafe",
title = "Cellular automata transforms: theory and applications
in multimedia compression, encryption and modeling",
volume = "MMSA16",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xii + 177",
year = "2000",
ISBN = "0-7923-7857-1",
ISBN-13 = "978-0-7923-7857-0",
LCCN = "QA267.5.C45 L34 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Multimedia systems and applications series",
acknowledgement = ack-nhfb,
keywords = "cellular automata",
}
@InProceedings{Lake:2000:PGM,
author = "J. M. Lake",
title = "Prediction by grammatical match",
crossref = "Storer:2000:DPD",
pages = "153--162",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838155",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838155",
acknowledgement = ack-nhfb,
}
@InProceedings{Lakhani:2000:MHC,
author = "G. Lakhani",
title = "A modification to the {Huffman} coding of {JPEG}'s
baseline compression algorithm",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838204",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838204",
acknowledgement = ack-nhfb,
}
@Article{Larsson:2000:LDB,
author = "Larsson and Moffat",
title = "Off-Line Dictionary-Based Compression",
journal = j-PROC-IEEE,
volume = "88",
number = "11",
pages = "1722--1732",
year = "2000",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.892708",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "An earlier, shorter version was published {\it
Proceedings of the Conference on Data Compression}
1999, pages 296--305.",
URL = "http://www.bic.kyoto-u.ac.jp/pathway/rwan/software/restore.html",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Larsson and Moffat (2000) ``Off-Line Dictionary-Based
Compression,'' {\it Proceedings of the IEEE},
{\bf88}(11)1722--1732. An earlier, shorter version was
published {\it Proceedings of the Conference on Data
Compression} 1999, pages~296--305. An implementation is
available at
|http://www.bic.kyoto-u.ac.jp/pathway/rwan/software/restore.html|",
}
@InProceedings{Lee:2000:TWT,
author = "Wee Sun Lee",
title = "Trees, windows and tiles for wavelet image
compression",
crossref = "Storer:2000:DPD",
pages = "283--292",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838168",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838168",
acknowledgement = ack-nhfb,
}
@InProceedings{leGuen:2000:BRL,
author = "D. le Guen and S. Pateux and C. Labit and G. Moury and
D. Lebedeff",
title = "Bit rate and local quality control for on-board
satellite image compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838205",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838205",
acknowledgement = ack-nhfb,
}
@InProceedings{Lekatsas:2000:ACL,
author = "H. Lekatsas and J. Henkel and W. Wolf",
title = "Arithmetic coding for low power embedded system
design",
crossref = "Storer:2000:DPD",
pages = "430--439",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838183",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838183",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2000:DPR,
author = "A. H. Li and S. Kittitornkun and Yu-Hen Hu and
Dong-Seek Park and J. Villasenor",
title = "Data partitioning and reversible variable length codes
for robust video communications",
crossref = "Storer:2000:DPD",
pages = "460--469",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838186",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838186",
acknowledgement = ack-nhfb,
}
@Article{Lin:2000:LPC,
author = "Kun-Jin Lin and Cheng-Wen Wu",
title = "A low-power {CAM} design for {LZ} data compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "49",
number = "10",
pages = "1139--1145",
month = oct,
year = "2000",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.888055",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 10:35:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=888055",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Lu:2000:PLI,
author = "Tianyu Lu and Zisheng Le and D. Y. Y. Yun",
title = "Piecewise linear image coding using surface
triangulation and geometric compression",
crossref = "Storer:2000:DPD",
pages = "410--419",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838181",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838181",
acknowledgement = ack-nhfb,
}
@Article{Lucco:2000:SSD,
author = "Steven Lucco",
title = "Split-stream dictionary program compression",
journal = j-SIGPLAN,
volume = "35",
number = "5",
pages = "27--34",
month = may,
year = "2000",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145.349307",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Nov 7 17:22:50 MST 2000",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/pldi/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/intel-ia-64.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
URL = "http://delivery.acm.org/10.1145/350000/349307/p27-lucco.pdf;
http://www.acm.org/pubs/articles/proceedings/pldi/349299/p27-lucco/p27-lucco.pdf;
http://www.acm.org/pubs/citations/proceedings/pldi/349299/p27-lucco/",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "IA-64",
}
@InProceedings{Mahmoud:2000:ELB,
author = "H. A. Mahmoud and M. Bayoumi",
title = "An efficient low-bit rate motion compensation
technique based on quadtree",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838207",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838207",
acknowledgement = ack-nhfb,
}
@InProceedings{Mahmoud:2000:ESE,
author = "H. A. Mahmoud and M. Bayoumi",
title = "An efficient successive elimination algorithm for
block-matching motion estimation",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838206",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838206",
acknowledgement = ack-nhfb,
}
@InProceedings{Malvar:2000:FPI,
author = "H. S. Malvar",
title = "Fast progressive image coding without wavelets",
crossref = "Storer:2000:DPD",
pages = "243--252",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838164",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838164",
acknowledgement = ack-nhfb,
}
@InProceedings{Manduchi:2000:SPT,
author = "R. Manduchi and S. Dolinar and F. Pollara and A.
Matache",
title = "Semantic progressive transmission for deep space
communications",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838208",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838208",
acknowledgement = ack-nhfb,
}
@InProceedings{Marcellin:2000:OJ,
author = "M. W. Marcellin and M. J. Gormish and A. Bilgin and M.
P. Boliek",
title = "An overview of {JPEG-2000}",
crossref = "Storer:2000:DPD",
pages = "523--541",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838192",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838192",
acknowledgement = ack-nhfb,
}
@Article{Meyer:2000:FAW,
author = "F. G. Meyer and A. Averbuch and J. O. Str{\"o}mberg",
title = "Fast Adaptive Wavelet Packet Image Compression",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "9",
number = "5",
pages = "792--800",
month = may,
year = "2000",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.841526",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Meyer, F. G., A. Averbuch, and J.O. Str{\"o}mberg
(1998) ``Fast Adaptive Wavelet Packet Image
Compression,'' {\it IEEE Transactions on Image
Processing}, {\bf9}(5) May 2000.",
}
@InProceedings{Miguel:2000:PRI,
author = "A. C. Miguel and E. A. Riskin",
title = "Protection of regions of interest against data loss in
a generalized multiple description framework",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838209",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838209",
acknowledgement = ack-nhfb,
}
@Article{Moffat:2000:BIC,
author = "Alistair Moffat and Lang Stuiver",
title = "Binary Interpolative Coding for Effective Index
Compression",
journal = j-INF-RETR,
volume = "3",
number = "1",
pages = "25--47",
month = jul,
year = "2000",
CODEN = "IFRTFY",
ISSN = "1386-4564 (print), 1573-7659 (electronic)",
ISSN-L = "1386-4564",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Information Retrieval",
rawdata = "Moffat, Alistair and Lang Stuiver (2000) ``Binary
Interpolative Coding for Effective Index Compression,''
{\it Information Retrieval}, {\bf3}(1):25--47, July.",
}
@InProceedings{Moffat:2000:CIS,
author = "Alistair Moffat",
editor = "Ming-Yang Kao",
booktitle = "Encyclopedia of Algorithms",
title = "Compressing Integer Sequences and Sets",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Moffat, Alistair (2000) ``Compressing Integer
Sequences and Sets,'' {\it Encyclopedia of Algorithms},
Ming-Yang Kao (Ed.), Springer Verlag.",
}
@InProceedings{Motta:2000:ISC,
author = "G. Motta and J. A. Storer and B. Carpentieri",
title = "Improving scene cut quality for real-time video
decoding",
crossref = "Storer:2000:DPD",
pages = "470--479",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838187",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838187",
acknowledgement = ack-nhfb,
}
@Article{Motta:2000:LIC,
author = "Giovanni Motta and James A. Storer and Bruno
Carpentieri",
title = "Lossless Image Coding via Adaptive Linear Prediction
and Classification",
journal = j-PROC-IEEE,
volume = "88",
number = "11",
pages = "1790--1796",
month = nov,
year = "2000",
CODEN = "IEEPAD",
DOI = "https://doi.org/10.1109/5.892714",
ISSN = "0018-9219 (print), 1558-2256 (electronic)",
ISSN-L = "0018-9219",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Proceedings of the IEEE",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5",
rawdata = "Motta, Giovanni, James A. Storer, and Bruno
Carpentieri (2000) ``Lossless Image Coding via Adaptive
Linear Prediction and Classification,'' {\it
Proceedings of the IEEE}, {\bf88}(11):1790--1796,
November.",
}
@InProceedings{Mukherjee:2000:DIA,
author = "K. Mukherjee and A. Mukherjee and T. Acharya",
title = "Distributed {Internet}-adaptive image compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838210",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838210",
acknowledgement = ack-nhfb,
}
@InProceedings{Mukherjee:2000:SCD,
author = "K. Mukherjee and A. Mukherjee",
title = "A spatially coherent discrete wavelet transform ---
accessing the localization property for data
compression",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838211",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838211",
acknowledgement = ack-nhfb,
}
@InProceedings{Murata:2000:WCD,
author = "D. Murata and T. Otake and A. Kawanaka",
title = "Wavelet coding of {$3$-D} shape data using
space-frequency quantization",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838198",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838198",
acknowledgement = ack-nhfb,
}
@InProceedings{Na:2000:DCT,
author = "Joong Chae Na and Kunsoo Park",
title = "Data compression with truncated suffix trees",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838212",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838212",
acknowledgement = ack-nhfb,
}
@InProceedings{Nekritch:2000:DCH,
author = "Y. Nekritch",
title = "Decoding of canonical {Huffman} codes with look-up
tables",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838213",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838213",
acknowledgement = ack-nhfb,
}
@Article{Neve:2000:ACR,
author = "P. De Neve and K. Denecker and W. Philips and I.
Lemahieu",
title = "An Advanced Color Representation for Lossy Compression
of {CMYK} Prepress Images",
journal = j-CGF,
volume = "19",
number = "1",
pages = "??--??",
month = mar,
year = "2000",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00384",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Oct 11 06:13:38 MDT 2000",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "aid=384&
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&
iid=1& src=ard& vid=19",
acknowledgement = ack-nhfb,
author-1-adr = "Department of Electronics and Information Systems,
University of Ghent, Belgium",
author-2-adr = "Department of Electronics and Information Systems,
University of Ghent, Belgium",
author-3-adr = "Department for Telecommunication and Information
Processing, University of Ghent, Belgium",
author-4-adr = "Department of Electronics and Information Systems,
University of Ghent, Belgium",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@InProceedings{Novak:2000:CIR,
author = "M. Novak",
title = "Coding of image residuals with tailbiting
convolutional codes and {BCJR} decoding",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838214",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838214",
acknowledgement = ack-nhfb,
}
@InProceedings{Pan:2000:CST,
author = "W. Pan and A. Ortega",
title = "Complexity-scalable transform coding using variable
complexity algorithms",
crossref = "Storer:2000:DPD",
pages = "263--272",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838166",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838166",
acknowledgement = ack-nhfb,
}
@InProceedings{Perez-Cordoba:2000:HDC,
author = "J. L. Perez-Cordoba and A. J. Rubio and J. M.
Lopez-Soler and M. C. Benitez",
title = "Hard-decision in {COVQ} over waveform channels",
crossref = "Storer:2000:DPD",
pages = "53--62",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838145",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838145",
acknowledgement = ack-nhfb,
}
@InProceedings{Pettijohn:2000:JSC,
author = "B. D. Pettijohn and K. Sayood and M. W. Hoffman",
title = "Joint source\slash channel coding using arithmetic
codes",
crossref = "Storer:2000:DPD",
pages = "73--82",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838147",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838147",
acknowledgement = ack-nhfb,
}
@InProceedings{Pradhan:2000:DSC,
author = "S. S. Pradhan and K. Ramchandran",
title = "Distributed source coding: symmetric rates and
applications to sensor networks",
crossref = "Storer:2000:DPD",
pages = "363--372",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838176",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838176",
acknowledgement = ack-nhfb,
}
@InProceedings{Przelaskowski:2000:MUQ,
author = "A. Przelaskowski",
title = "Modifications of uniform quantization applied in
wavelet coder",
crossref = "Storer:2000:DPD",
pages = "293--302",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838169",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838169",
acknowledgement = ack-nhfb,
}
@InProceedings{Rajwan:2000:UFM,
author = "D. Rajwan and M. Feder",
title = "Universal finite memory machines for coding binary
sequences",
crossref = "Storer:2000:DPD",
pages = "113--122",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838151",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838151",
acknowledgement = ack-nhfb,
}
@Book{Rao:2000:TDC,
author = "Kamisetty Ramamohan Rao and Patrick C. Yip and
editors",
title = "The Transform and Data Compression Handbook",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "??",
year = "2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Rao, Kamisetty Ramamohan and Patrick C. Yip, editors
(2000) {\it The Transform and Data Compression
Handbook}, Boca Raton, FL, CRC Press.",
}
@InProceedings{Reznik:2000:ARR,
author = "Y. A. Reznik and W. Szpankowski",
title = "On the average redundancy rate of the {Lempel--Ziv}
code with $k$-error protocol",
crossref = "Storer:2000:DPD",
pages = "373--382",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838177",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838177",
acknowledgement = ack-nhfb,
}
@InProceedings{Rishe:2000:HPL,
author = "N. Rishe and A. Shaposhnikov and A. Vaschillo and D.
Vasilevsky and Shu-Ching Chen",
title = "High performance {Lempel--Ziv} compression using
optimized longest string parsing and adaptive {Huffman}
window size",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838215",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838215",
acknowledgement = ack-nhfb,
}
@InProceedings{Sachs:2000:WIT,
author = "D. G. Sachs and R. Anand and K. Ramchandran",
title = "Wireless image transmission using multiple-description
based concatenated codes",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838216",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838216",
acknowledgement = ack-nhfb,
}
@InProceedings{Sadakane:2000:ICT,
author = "K. Sadakane and T. Okazaki and H. Imai",
title = "Implementing the context tree weighting method for
text compression",
crossref = "Storer:2000:DPD",
pages = "123--132",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838152",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838152",
acknowledgement = ack-nhfb,
}
@InProceedings{Saha:2000:EIA,
author = "S. Saha and R. Vemuri",
title = "Effect of image activity on lossy and lossless coding
performance",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838217",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838217",
acknowledgement = ack-nhfb,
}
@Book{Salomon:2000:DCC,
author = "David Salomon",
title = "Data Compression: The Complete Reference",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xvi + 823",
year = "2000",
ISBN = "0-387-95045-1",
ISBN-13 = "978-0-387-95045-7",
LCCN = "QA76.9.D33 S25 2000",
bibdate = "Mon Oct 16 05:47:11 2000",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$39.95",
URL = "http://www.booksbydavidsalomon.com/;
http://www.ecs.csun.edu/~dxs/DCadvertis/Dcomp2Ad.html",
abstract = "This new edition of Data Compression provides a
comprehensive reference for the many different types
and methods of compression. Included are a detailed and
helpful taxonomy, a description of most common methods,
and discussions on the use and comparative benefits of
methods and descriptions of ``how to'' use them. The
presentation is organized into the main branches of the
field of data compression: run length encoding,
statistical methods, dictionary-based methods, image
compression, audio compression, and video
compression.\par
The book provides an invaluable reference and guide for
all computer scientists, computer engineers, electrical
engineers, signal/image processing engineers, and other
scientists needing a comprehensive compilation for a
broad range of compression methods.",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Salomon, David (2000) {\it Data Compression: The
Complete Reference}, New York, Springer-Verlag.",
subject = "Data compression (Computer science)",
tableofcontents = "1. Basic Techniques \\
2. Statistical Methods \\
3. Dictionary Methods \\
4. Image Compression \\
5. Wavelet Methods \\
6. Video Compression \\
7. Audio Compression \\
8. Other Methods \\
Joining the Data Compression Community",
}
@Article{Salomon:2000:PCS,
author = "David Salomon",
title = "Prefix Compression of Sparse Binary Strings",
journal = j-CROSSROADS,
volume = "6",
number = "3",
pages = "??--??",
month = feb,
year = "2000",
CODEN = "",
DOI = "https://doi.org/10.1145/331624.331631",
ISSN = "1528-4972 (print), 1528-4980 (electronic)",
ISSN-L = "1528-4972",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Crossroads",
rawdata = "Salomon, David (2000) ``Prefix Compression of Sparse
Binary Strings,'' {\it ACM Crossroads Magazine},
{\bf6}(3), February.",
}
@Book{Sayood:2000:IDC,
author = "Khalid Sayood",
title = "Introduction to Data Compression",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adrnew,
edition = "Second",
pages = "xx + 636",
year = "2000",
ISBN = "1-55860-558-4",
ISBN-13 = "978-1-55860-558-9",
LCCN = "TK5102.92 .S39 2000",
bibdate = "Mon Jan 28 06:42:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$69.95",
URL = "http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-558-4",
abstract = "This book provides an extensive introduction to the
theory underlying today's compression techniques with
detailed instruction for their application. The
coverage has been significantly updated to reflect the
state of the art in data compression, including both
new algorithms and older methods for which new uses are
being found. And the downloadable software gives you
the opportunity to see firsthand how various algorithms
work, to choose and implement appropriate techniques in
your own applications, and to build your own
algorithms.",
acknowledgement = ack-nhfb,
libnote = "Not yet in my library.",
tableofcontents = "1: Introduction \\
2: Mathematical Preliminaries for Lossless Compression
\\
3: Huffman Coding \\
4: Arithmetic Coding \\
5: Dictionary Techniques \\
6: Predictive Coding \\
7: Mathematical Preliminaries for Lossy Coding \\
8: Scalar Quantization \\
9: Vector Quantization \\
10: Differential Encoding \\
11: Mathematical Preliminaries for Transforms,
Subbands, and Wavelets \\
12: Transform Coding \\
13: Subband Coding \\
14: Wavelet-Based Compression \\
15: Analysis/Synthesis Schemes \\
16: Video Compression \\
A: Probability and Random Processes \\
B: A Brief Review of Matrix Concepts \\
C: The Root Lattices",
}
@Article{Sebe:2000:SDI,
author = "Francesc Seb{\'e} and Josep Domingo-Ferrer and Jordi
Herrera",
title = "Spatial-Domain Image Watermarking Robust against
Compression, Filtering, Cropping and Scaling",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "44--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750044.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750044.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Servetto:2000:LQS,
author = "S. D. Servetto",
title = "Lattice quantization with side information",
crossref = "Storer:2000:DPD",
pages = "510--519",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838191",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838191",
acknowledgement = ack-nhfb,
}
@InProceedings{Seward:2000:PBS,
author = "J. Seward",
title = "On the performance of {BWT} sorting algorithms",
crossref = "Storer:2000:DPD",
pages = "173--182",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838157",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838157",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Article{Shibata:2000:SPM,
author = "Yusuke Shibata and Takuya Kida and Shuichi Fukamachi
and Masayuki Takeda and Ayumi Shinohara and Takeshi
Shinohara and Setsuo Arikawa",
title = "Speeding Up Pattern Matching by Text Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1767",
pages = "306--??",
year = "2000",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1016/s0304-3975(02)00426-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:10 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1767.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1767/17670306.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1767/17670306.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Shlepakov:2000:ZMA,
author = "D. V. Shlepakov and L. N. Shlepakov",
title = "On zonal morphological approach to natural language
texts processing",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838218",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838218",
acknowledgement = ack-nhfb,
}
@Article{SilvadeMoura:2000:FFW,
author = "Edleno {Silva de Moura} and Gonzalo Navarro and Nivio
Ziviani and Ricardo Baeza-Yates",
title = "Fast and flexible word searching on compressed text",
journal = j-TOIS,
volume = "18",
number = "2",
pages = "113--139",
month = apr,
year = "2000",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/348751.348754",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Tue Sep 26 09:34:01 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tois/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
URL = "http://www.acm.org/pubs/citations/journals/tois/2000-18-2/p113-silva_de_moura/",
abstract = "We present a fast compression technique for natural
language texts. The novelties are that (1)
decompression of arbitrary portions of the text can be
done very efficiently, (2) exact search for words and
phrases can be done on the compressed text directly,
using any known sequential pattern-matching algorithm,
and (3) word-based approximate and extended search can
also be done efficiently without any decoding. The
compression scheme uses a semistatic word-based model
and a Huffman code where the coding alphabet is
byte-oriented rather than bit-oriented. We compress
typical English texts to about 30\% of their original
size, against 40\% and 35\% for {\em Compress\/} and
{\em Gzip}, respectively. Compression time is close to
that of {\em Compress\/} and approximately half of the
time of {\em Gzip}, and decompression time is lower
than that of {\em Gzip\/} and one third of that of {\em
Compress}. We present three algorithms to search the
compressed text. They allow a large number of
variations over the basic word and phrase search
capability, such as sets of characters, arbitrary
regular expressions, and approximate matching.
Separators and stopwords can be discarded at search
time without significantly increasing the cost. When
searching for simple words, the experiments show that
running our algorithms on a compressed text is twice as
fast as running the best existing software on the
uncompressed version of the same text. When searching
complex or approximate patterns, our algorithms are up
to 8 times faster than the search on uncompressed text.
We also discuss the impact of our technique in inverted
files pointing to logical blocks and argue for the
possibility of keeping the text compressed all the
time, decompressing only for displaying purposes.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "compressed pattern matching; natural language text
compression; word searching; word-based Huffman
coding",
subject = "Data --- Coding and Information Theory (E.4): {\bf
Data compaction and compression}; Information Systems
--- Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process}",
}
@PhdThesis{Spaan:2000:ERC,
author = "Franciscus Henricus Petrus Spaan",
title = "Error resilient compression of digital video data",
type = "Doctoral",
school = "Technische Universiteit Delft",
address = "Delft, The Netherlands",
pages = "157",
year = "2000",
ISBN = "90-90-13218-X",
ISBN-13 = "978-90-90-13218-1",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304672016",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science",
dissertation-thesis-number = "C803360",
subject = "Electrical engineering; Computer science",
}
@InProceedings{Tabus:2000:TCB,
author = "I. Tabus and G. Korodi and J. Rissanen",
title = "Text compression based on variable-to-fixed codes for
{Markov} sources",
crossref = "Storer:2000:DPD",
pages = "133--142",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838153",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838153",
acknowledgement = ack-nhfb,
}
@Article{Taubman:2000:HPS,
author = "David Taubman",
title = "High Performance Scalable Image Compression with
{EBCOT}",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "9",
number = "7",
pages = "1158--1170",
month = jul,
year = "2000",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.847830",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Taubman, David~(1999) ''High Performance Scalable
Image Compression with EBCOT,'' {\it IEEE Transactions
on Image Processing}, {\bf9}(7):1158--1170.",
}
@InProceedings{Teng:2000:CSD,
author = "Chia-Yuan Teng",
title = "Compression of {SMIL} documents",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838219",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838219",
acknowledgement = ack-nhfb,
}
@InProceedings{Titchener:2000:MI,
author = "M. R. Titchener",
title = "A measure of information",
crossref = "Storer:2000:DPD",
pages = "353--362",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838175",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838175",
acknowledgement = ack-nhfb,
}
@InProceedings{Tjalkens:2000:VFL,
author = "T. Tjalkens and F. Willems",
title = "Variable-to-fixed length codes: a geometrical approach
to low-complexity source codes",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838220",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838220",
acknowledgement = ack-nhfb,
}
@InProceedings{VanAssche:2000:EIR,
author = "S. {Van Assche} and D. {De Rycke} and W. Philips and
I. Lemahieu",
title = "Exploiting interframe redundancies in the lossless
compression of {$3$D} medical images",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838222",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838222",
acknowledgement = ack-nhfb,
}
@InProceedings{vanderVleuten:2000:LCS,
author = "R. J. {van der Vleuten} and R. P. Kleihorst",
title = "Low-complexity scalable image compression",
crossref = "Storer:2000:DPD",
pages = "23--32",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838142",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838142",
acknowledgement = ack-nhfb,
}
@InProceedings{Varnica:2000:MRA,
author = "N. Varnica and M. Fleming and M. Effros",
title = "Multi-resolution adaptation of the {SPIHT} algorithm
for multiple description",
crossref = "Storer:2000:DPD",
pages = "303--312",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838170",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838170",
acknowledgement = ack-nhfb,
}
@InProceedings{Veaux:2000:CDU,
author = "C. Veaux and P. Scalart and A. Gilloire",
title = "Channel decoding using inter- and intra-correlation of
source encoded frames",
crossref = "Storer:2000:DPD",
pages = "103--112",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838150",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838150",
acknowledgement = ack-nhfb,
}
@InProceedings{Wagner:2000:ROH,
author = "M. Wagner and D. Saupe",
title = "{RD}-optimization of hierarchical structured adaptive
vector quantization for video coding",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838223",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838223",
acknowledgement = ack-nhfb,
}
@InProceedings{Ware:2000:TLT,
author = "F. W. Ware and J. D. Gibson",
title = "A three-layer, two description image coder",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838224",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838224",
acknowledgement = ack-nhfb,
}
@InProceedings{Weidmann:2000:RDB,
author = "C. Weidmann and M. Vetterli",
title = "Rate distortion behavior of threshold-based nonlinear
approximations",
crossref = "Storer:2000:DPD",
pages = "333--342",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838173",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838173",
acknowledgement = ack-nhfb,
}
@InProceedings{Weinberger:2000:LDM,
author = "M. J. Weinberger and E. Ordentlich",
title = "On-line decision making for a class of loss functions
via {Lempel--Ziv} parsing",
crossref = "Storer:2000:DPD",
pages = "163--172",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838156",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838156",
acknowledgement = ack-nhfb,
}
@Article{Weinberger:2000:LLI,
author = "M. J. Weinberger and G. Seroussi and G. Sapiro",
title = "The {LOCO-I} Lossless Image Compression Algorithm:
Principles and Standardization Into {JPEG-LS}",
journal = j-IEEE-TRANS-IMAGE-PROCESS,
volume = "9",
number = "8",
pages = "1309--1324",
month = aug,
year = "2000",
CODEN = "IIPRE4",
DOI = "https://doi.org/10.1109/83.855427",
ISSN = "1057-7149 (print), 1941-0042 (electronic)",
ISSN-L = "1057-7149",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Image Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=83",
rawdata = "Weinberger, M. J., G. Seroussi, and G. Sapiro (2000)
``The LOCO-I Lossless Image Compression Algorithm:
Principles and Standardization Into {JPEG-LS},'' {\it
IEEE Transactions on Image Processing},
{\bf9}(8):1309--1324, August.",
}
@InProceedings{Wilson:2000:CDT,
author = "B. Wilson and M. A. Bayoumi",
title = "Compressed domain texture classification from a
modified {EZW} symbol stream",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838226",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838226",
acknowledgement = ack-nhfb,
}
@InProceedings{Wilson:2000:WBL,
author = "J. P. Wilson",
title = "Wavelet-based lossy compression of turbulence data",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838225",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838225",
acknowledgement = ack-nhfb,
}
@TechReport{Wolf:2000:SCS,
author = "Misha Wolf and others",
title = "A Standard Compression Scheme for {Unicode}",
type = "{Unicode} Technical Report",
number = "6",
institution = pub-UNICODE,
address = pub-UNICODE:adr,
pages = "??",
year = "2000",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://unicode.org/unicode/reports/tr6/index.html",
acknowledgement = ack-ds,
rawdata = "Wolf, Misha et al. (2000) ``A Standard Compression
Scheme for Unicode,'' Unicode Technical Report \#6,
available at
|http://unicode.org/unicode/reports/tr6/index.html|.",
}
@PhdThesis{Woods:2000:CPT,
author = "John Charles Woods",
title = "Compression and packetised transport of model-based
video data",
type = "{Ph.D.} thesis",
school = "University of Essex",
address = "Southend-on-Sea, Essex, UK",
pages = "????",
year = "2000",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/304662752",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0790: Systems design",
dissertation-thesis-number = "C804502",
subject = "Systems design; Electrical engineering",
}
@InProceedings{Wu:2000:OPE,
author = "Xiaolin Wu and Zixiang Xiong",
title = "Optimal packetization of embedded bitstreams",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838227",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838227",
acknowledgement = ack-nhfb,
}
@Article{Yamamoto:2000:NRU,
author = "Hirosuke Yamamoto",
title = "A New Recursive Universal Code of the Positive
Integers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "46",
number = "2",
pages = "717--723",
month = mar,
year = "2000",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.825850",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Yamamoto, Hirosuke (2000) ``A New Recursive Universal
Code of the Positive Integers,'' {\it IEEE Transactions
on Information Theory}, {\bf46}(2):717--723, March.",
}
@InProceedings{Yang:2000:SSC,
author = "Yan Yang and S. S. Hemami",
title = "Separate source and channel rate selection for video
over {ATM}",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838228",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838228",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2000:SSF,
author = "Dow-Yung Yang and A. Johar and A. Grama and W.
Szpankowski",
title = "Summary structures for frequency queries on large
transaction sets",
crossref = "Storer:2000:DPD",
pages = "420--429",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838182",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838182",
acknowledgement = ack-nhfb,
}
@InProceedings{Ye:2000:SDD,
author = "Yan Ye and D. Schilling and P. Cosman and Hyung Hwa
Ko",
title = "Symbol dictionary design for the {JBIG2} standard",
crossref = "Storer:2000:DPD",
pages = "33--42",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838143",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838143",
acknowledgement = ack-nhfb,
}
@InProceedings{Yeates:2000:UCI,
author = "S. Yeates and D. Bainbridge and I. H. Witten",
title = "Using compression to identify acronyms in text",
crossref = "Storer:2000:DPD",
pages = "??--??",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838229",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838229",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2000:CLM,
author = "Cha Zhang and Jin Li",
title = "Compression of {Lumigraph} with multiple reference
frame ({MRF}) prediction and just-in-time rendering",
crossref = "Storer:2000:DPD",
pages = "253--262",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838165",
bibdate = "Tue Feb 5 14:06:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838165",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2000:RVC,
author = "Rui Zhang and S. L. Regunathan and K. Rose",
title = "Robust video coding for packet networks with
feedback",
crossref = "Storer:2000:DPD",
pages = "450--459",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838185",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838185",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2000:LLB,
author = "Qian Zhao and M. Effros",
title = "Lossless and lossy broadcast system source codes:
theoretical limits, optimal design, and empirical
performance",
crossref = "Storer:2000:DPD",
pages = "63--72",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838146",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838146",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2000:NMO,
author = "Minyi Zhao and A. A. Alatan and A. N. Akansu",
title = "A new method for optimal rate allocation for
progressive image transmission over noisy channels",
crossref = "Storer:2000:DPD",
pages = "213--222",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838161",
bibdate = "Tue Feb 5 14:06:51 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838161",
acknowledgement = ack-nhfb,
}
@Article{Ziviani:2000:CKN,
author = "Nivio Ziviani and Edleno Silva de Moura and Gonzalo
Navarro and Ricardo Baeza-Yates",
title = "Compression: a Key for Next-Generation Text Retrieval
Systems",
journal = j-COMPUTER,
volume = "33",
number = "11",
pages = "37--44",
month = nov,
year = "2000",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/2.881693",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Nov 7 15:11:30 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/ry037.pdf;
http://www.computer.org/computer/co/ry037abs.htm",
abstract = "Searching compressed data improves the overall
efficiency of information retrieval systems.",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "Binary Huffman; Gnu GZIP; Plain Huffman; Tagged
Huffman; UNIX Compress",
}
@InProceedings{Adler:2001:TCW,
author = "M. Adler and M. Mitzenmacher",
title = "Towards compressing {Web} graphs",
crossref = "Storer:2001:DPD",
pages = "203--212",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917151",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917151",
acknowledgement = ack-nhfb,
}
@InProceedings{Aggarwal:2001:AOS,
author = "A. Aggarwal and S. L. Regunathan and K. Rose",
title = "Asymptotically optimal scalable coding for minimum
weighted mean square error",
crossref = "Storer:2001:DPD",
pages = "43--52",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917135",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917135",
acknowledgement = ack-nhfb,
}
@Misc{Alistair:2001:U,
author = "?. Alistair and ?. Abbott",
title = "[unknown]",
pages = "??",
year = "2001",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.pd.uwa.edu.au/pub/Wavelets/",
acknowledgement = ack-ds,
rawdata = "Alistair and Abbott (2001)
|ftp://ftp.pd.uwa.edu.au/pub/Wavelets/|.",
remark = "URL no longer accessible on 27 January 2013.",
xxnote = "Is this Alastair Abbott
(\path=http://www.cs.auckland.ac.nz/~aabb009/=)??",
}
@InProceedings{Archer:2001:COT,
author = "C. Archer and T. K. Leen",
title = "The coding-optimal transform",
crossref = "Storer:2001:DPD",
pages = "381--390",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917169",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917169",
acknowledgement = ack-nhfb,
}
@InProceedings{Babu:2001:SMBa,
author = "Shivnath Babu and Minos Garofalakis and Rajeev
Rastogi",
title = "{SPARTAN}: a model-based semantic compression system
for massive data tables",
crossref = "Sellis:2001:PAS",
pages = "283--294",
year = "2001",
bibdate = "Fri Oct 31 08:03:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib",
acknowledgement = ack-nhfb,
}
@Article{Babu:2001:SMBb,
author = "Shivnath Babu and Minos Garofalakis and Rajeev
Rastogi",
title = "{SPARTAN}: a model-based semantic compression system
for massive data tables",
journal = j-SIGMOD,
volume = "30",
number = "2",
pages = "283--294",
month = jun,
year = "2001",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/376284.375693",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jan 12 08:46:06 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}
@Article{Bajaj:2001:RIC,
author = "Chandrajit Bajaj and Insung Ihm and Sanghun Park",
title = "{$3$D RGB} Image Compression for Interactive
Applications",
journal = j-TOG,
volume = "20",
number = "1",
pages = "10--38",
month = jan,
year = "2001",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/383745.383747",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Tue Oct 22 15:33:29 2002",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
URL = "http://www.acm.org/pubs/citations/journals/tog/2001-20-1/p10-bajaj/",
abstract = "This paper presents a new 3D RGB image compression
scheme designed for interactive real-time applications.
In designing our compression method, we have
compromised between two important goals: high
compression ratio and fast random access ability, and
have tried to minimize the overhead caused during
run-time reconstruction. Our compression technique is
suitable for applications wherein data are accessed in
a somewhat unpredictable fashion, and real-time
performance of decompression is necessary. The
experimental results on three different kinds of 3D
images from medical imaging, image-based rendering, and
solid texture mapping suggest that the compression
method can be used effectively in developing real-time
applications that must handle large volume data, made
of color samples taken in three- or higher-dimensional
space.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Bartkowiak:2001:SAO,
author = "Maciej Bartkowiak and Adam {\L}uczak",
title = "A Simple Algorithm for Ordering and Compression of
Vector Codebooks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2124",
pages = "102--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:26 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2124.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2124/21240102.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2124/21240102.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Bauer:2001:VLC,
author = "Rainer Bauer and Joachim Hagenauer",
title = "On Variable-Length Codes for Iterative Source\slash
Channel-Decoding",
crossref = "Storer:2001:DPD",
pages = "273--282",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917158",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917158",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Bauer, Rainer and Joachim Hagenauer (2001) ``On
Variable-Length Codes for Iterative
Source/Channel-Decoding,'' {\it Proceedings of the IEEE
Data Compression Conference, 2001}, Snowbird, UT, pp.
273--282.",
}
@InProceedings{Beferull-Lozano:2001:CLC,
author = "B. Beferull-Lozano and A. Ortega",
title = "Construction of low complexity regular quantizers for
overcomplete expansions in {$ R^N $}",
crossref = "Storer:2001:DPD",
pages = "193--202",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917150",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917150",
acknowledgement = ack-nhfb,
}
@Misc{BOCU:2001:U,
author = "BOCU",
title = "[unknown]",
pages = "??",
year = "2001",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://oss.software.ibm.com/icu/docs/papers/binary_ordered_compression_for_unicode.html",
acknowledgement = ack-ds,
rawdata = "BOCU (2001)
|http://oss.software.ibm.com/icu/docs/papers/|\hfil\break
|binary_ordered_compression_for_unicode.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Article{Cannane:2001:GPC,
author = "Adam Cannane and Hugh E. Williams",
title = "General-purpose compression for efficient retrieval",
journal = j-J-AM-SOC-INF-SCI-TECHNOL,
volume = "52",
number = "5",
pages = "430--437",
month = "????",
year = "2001",
CODEN = "JASIEF",
DOI = "https://doi.org/10.1002/1532-2890(2001)9999:9999<::AID-ASI1084>3.0.CO%3B2-Z",
ISSN = "1532-2882 (print), 1532-2890 (electronic)",
ISSN-L = "1532-2882",
bibdate = "Fri Sep 11 10:41:56 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasist.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science and Technology: JASIST",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1532-2890",
onlinedate = "5 Feb 2001",
}
@InProceedings{Cardinal:2001:DTS,
author = "J. Cardinal",
title = "Design of tree-structured multiple description vector
quantizers",
crossref = "Storer:2001:DPD",
pages = "23--32",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917133",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917133",
acknowledgement = ack-nhfb,
}
@Misc{ccitt:2001:U,
author = "ccitt",
title = "[unknown]",
pages = "??",
year = "2001",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://src.doc.ic.ac.uk/computing/ccitt/ccitt-standards/1988/",
acknowledgement = ack-ds,
rawdata = "ccitt (2001)
|src.doc.ic.ac.uk/computing/ccitt/ccitt-standards/1988/|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Article{Chang:2001:BLL,
author = "Chin-Chen Chang and Guu-In Chen",
title = "Bi-level Lossless Calligraphy Compression Using
Location Propagation and Width Inheritance",
journal = j-INT-J-COMP-PROC-ORIENTAL-LANG,
volume = "14",
number = "4",
pages = "309--??",
year = "2001",
CODEN = "????",
DOI = "https://doi.org/10.1142/s0219427901000461",
ISSN = "0219-4279",
bibdate = "Thu Jan 15 07:02:34 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijcpol/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijcpol.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Processing of
Oriental Languages (IJCPOL)",
}
@InProceedings{Cheney:2001:CXM,
author = "J. Cheney",
title = "Compressing {XML} with multiplexed hierarchical {PPM}
models",
crossref = "Storer:2001:DPD",
pages = "163--172",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917147",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917147",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Christiansen:2001:STC,
author = "B. O. Christiansen and K. E. Schauser and M. Munke",
title = "Streaming thin client compression",
crossref = "Storer:2001:DPD",
pages = "223--232",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917153",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917153",
acknowledgement = ack-nhfb,
}
@Book{Cormen:2001:IA,
author = "Thomas H. Cormen and Charles E. (Eric) Leiserson and
Ronald L. Rivest",
title = "Introduction to Algorithms",
publisher = pub-MIT,
address = pub-MIT:adr,
edition = "Second",
pages = "xxi + 1180",
year = "2001",
ISBN = "0-262-53196-8 (paperback), 0-262-03293-7 (hardcover),
0-07-013151-1 (McGraw-Hill), 0-07-297054-5 (McGraw-Hill
with CD-ROM)",
ISBN-13 = "978-0-262-53196-2 (paperback), 978-0-262-03293-3
(hardcover), 978-0-07-013151-4 (McGraw-Hill),
978-0-07-297054-8 (McGraw-Hill with CD-ROM)",
LCCN = "QA76.6 .I5858 2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
abstract = "This title covers a broad range of algorithms in
depth, yet makes their design and analysis accessible
to all levels of readers. Each chapter is relatively
self-contained and can be used as a unit of study. The
algorithms are described in English and in a pseudocode
designed to be readable by anyone who has done a little
programming. The explanations have been kept elementary
without sacrificing depth of coverage or mathematical
rigor. This second edition features new chapters on the
role of algorithms, probabilistic analysis and
randomized algorithms, and linear programming, as well
as extensive revisions to virtually every section of
the book. In a subtle but important change, loop
invariants are introduced early and used throughout the
text to prove algorithm correctness. Without changing
the mathematical and analytic focus, the authors have
moved much of the mathematical foundations material
from Part I to an appendix and have included additional
motivational material at the beginning.",
acknowledgement = ack-ds # " and " # ack-nhfb,
libnote = "Not yet in my library.",
rawdata = "Cormen, Thomas H., Charles E. Leiserson, Ronald L.
Rivest and Clifford Stein (2001) {\it Introduction to
Algorithms}, 2nd Edition, MIT Press and McGraw-Hill.",
remark = "MIT Press 2001, McGraw-Hill 2002 (third printing),
McGraw-Hill 2003 (fourth printing)",
shorttableofcontents = "1: The Role of Algorithms in Computing \\
2: Getting Started \\
3: Growth of Functions \\
4: Recurrences \\
5: Probabilistic Analysis and Randomized Algorithms \\
6: Heapsort \\
7: Quicksort \\
8: Sorting in Linear Time \\
9: Medians and Order Statistics \\
10: Elementary Data Structures \\
11: Hash Tables \\
12: Binary Search Trees \\
13: Red-Black Trees \\
14: Augmenting Data Structures \\
15: Dynamic Programming \\
16: Greedy Algorithms \\
17: Amortized Analysis \\
18: B-Trees \\
19: Binomial Heaps \\
20: Fibonacci Heaps \\
21: Data Structures for Disjoint Sets \\
22: Elementary Graph Algorithms \\
23: Minimum Spanning Trees \\
24: Single-Source Shortest Paths \\
25: All-Pairs Shortest Paths \\
26: Maximum Flow \\
27: Sorting Networks \\
28: Matrix Operations \\
29: Linear Programming \\
30: Polynomials and the FFT \\
31: Number-Theoretic Algorithms \\
32: String Matching \\
33: Computational Geometry \\
34: NP-Completeness \\
35: Approximation Algorithms \\
A: Summations \\
B: Sets, etc. \\
C: Counting and probability",
subject = "Computer programming; Computer algorithms",
tableofcontents = "Preface / xiii \\
I Foundations \\
Introduction / 3 \\
1 The Role of Algorithms in Computing / 5 \\
1.1 Algorithms / 5 \\
1.2 Algorithms as a technology / 10 \\
2 Getting Started / 75 \\
2.1 Insertion sort / 15 \\
2.2 Analyzing algorithms / 21 \\
2.3 Designing algorithms / 27 \\
3 Growth of Functions / 41 \\
3.1 Asymptotic notation / 41 \\
3.2 Standard notations and common functions / 51 \\
4 Recurrences / 62 \\
4.1 The substitution method / 63 \\
4.2 The recursion-tree method / 67 \\
4.3 The master method / 73 \\
4.4 Proof of the master theorem / 76 \\
5 Probabilistic Analysis and Randomized Algorithms / 91
\\
5.1 The hiring problem / 91 \\
5.2 Indicator random variables / 94 \\
5.3 Randomized algorithms / 99 \\
5.4 Probabilistic analysis and further uses of
indicator random variables / 106 \\
II Sorting and Order Statistics \\
Introduction / 123 \\
6 Heapsort / 127 \\
6.1 Heaps / 127 \\
6.2 Maintaining the heap property / 130 \\
6.3 Building a heap / 132 \\
6.4 The heapsort algorithm / 135 \\
6.5 Priority queues / 138 \\
7 Quicksort / 145 \\
7.1 Description of quicksort / 145 \\
7.2 Performance of quicksort / 149 \\
7.3 A randomized version of quicksort / 153 \\
7.4 Analysis of quicksort / 755 \\
8 Sorting in Linear Time / 165 \\
8.1 Lower bounds for sorting / 765 \\
8.2 Counting sort / 168 \\
8.3 Radix sort / 770 \\
8.4 Bucket sort / 174 \\
9 Medians and Order Statistics / 183 \\
9.1 Minimum and maximum / 184 \\
9.2 Selection in expected linear time / 785 \\
9.3 Selection in worst-case linear time / 189 \\
III Data Structures \\
Introduction / 197 \\
10 Elementary Data Structures / 200 \\
10.1 Stacks and queues / 200 \\
10.2 Linked lists / 204 \\
10.3 Implementing pointers and objects / 209 \\
10.4 Representing rooted trees / 214 \\
11 Hash Tables / 221 \\
11.1 Direct-address tables / 222 \\
11.2 Hash tables / 224 \\
11.3 Hash functions / 229 \\
11.4 Open addressing / 237 \\
11.5 Perfect hashing / 245 \\
12 Binary Search Trees / 253 \\
12.1 What is a binary search tree? / 253 \\
12.2 Querying a binary search tree / 256 \\
12.3 Insertion and deletion / 261 \\
12.4 Randomly built binary search trees / 265 \\
13 Red--Black Trees / 273 \\
13.1 Properties of red-black trees / 273 \\
13.2 Rotations / 277 \\
13.3 Insertion / 280 \\
13.4 Deletion / 288 \\
14 Augmenting Data Structures / 302 \\
14.1 Dynamic order statistics / 302 \\
14.2 How to augment a data structure / 308 \\
14.3 Interval trees / 311 \\
IV Advanced Design and Analysis Techniques \\
Introduction / 321 \\
15 Dynamic Programming / 323 \\
15.1 Assembly-line scheduling / 324 \\
15.2 Matrix-chain multiplication / 331 \\
15.3 Elements of dynamic programming / 339 \\
15.4 Longest common subsequence / 350 \\
15.5 Optimal binary search trees / 356 \\
16 Greedy Algorithms / 370 \\
16.1 An activity-selection problem / 377 \\
16.2 Elements of the greedy strategy / 379 \\
16.3 Huffman codes / 385 \\
* 16.4 Theoretical foundations for greedy methods / 393
\\
* 16.5 A task-scheduling problem / 399 \\
17 Amortized Analysis / 405 \\
17.1 Aggregate analysis / 406 \\
17.2 The accounting method / 470 \\
17.3 The potential method / 412 \\
17.4 Dynamic tables / 476 \\
V Advanced Data Structures \\
Introduction / 431 \\
18 B-Trees / 434 \\
18.1 Definition of B-trees / 438 \\
18.2 Basic operations on B-trees / 441 \\
18.3 Deleting a key from -tree / 449 \\
19 Binomial Heaps / 455 \\
19.1 Binomial trees and binomial heaps / 457 \\
19.2 Operations on binomial heaps / 461 \\
20 Fibonacci Heaps / 476 \\
20.1 Structure of Fibonacci heaps / 477 \\
20.2 Mergeable-heap operations / 479 \\
20.3 Decreasing a key and deleting a node / 489 \\
20.4 Bounding the maximum degree / 493 \\
21 Data Structures for Disjoint Sets / 498 \\
21.1 Disjoint-set operations / 498 \\
21.2 Linked-list representation of disjoint sets / 501
\\
21.3 Disjoint-set forests / 505 \\
* 21.4 Analysis of union by rank with path compression
/ 509 \\
VI Graph Algorithms \\
Introduction / 525 \\
22 Elementary Graph Algorithms / 527 \\
22.1 Representations of graphs / 527 \\
22.2 Breadth-first search / 531 \\
22.3 Depth-first search / 540 \\
22.4 Topological sort / 549 \\
22.5 Strongly connected components / 552 \\
23 Minimum Spanning Trees / 561 \\
23.1 Growing a minimum spanning tree / 562 \\
23.2 The algorithms of Kruskal and Prim / 567 \\
24 Single-Source Shortest Paths / 580 \\
24.1 The Bellman--Ford algorithm / 588 \\
24.2 Single-source shortest paths in directed acyclic
graphs / 592 \\
24.3 Dijkstra's algorithm / 595 \\
24.4 Difference constraints and shortest paths / 607
\\
24.5 Proofs of shortest-paths properties / 607 \\
25 All-Pairs Shortest Paths / 620 \\
25.1 Shortest paths and matrix multiplication / 622 \\
25.2 The Floyd--Warshall algorithm / 629 \\
25.3 Johnson's algorithm for sparse graphs / 636 \\
26 Maximum Flow / 643 \\
26.1 Flow networks / 644 \\
26.2 The Ford--Fulkerson method / 657 \\
26.3 Maximum bipartite matching / 664 \\
* 26.4 Push-relabel algorithms / 669 \\
26.5 The relabel-to-front algorithm / 681 \\
VII Selected Topics \\
Introduction / 701 \\
27 Sorting Networks / 704 \\
21 Comparison networks / 704 \\
27.2 The zero-one principle / 709 \\
21.3 A bitonic sorting network / 712 \\
21.4 A merging network / 716 \\
27.5 A sorting network / 719 \\
28 Matrix Operations / 725 \\
28.1 Properties of matrices / 725 \\
28.2 Strassen's algorithm for matrix multiplication /
735 \\
28.3 Solving systems of linear equations / 742 \\
28.4 Inverting matrices / 755 \\
28.5 Symmetric positive-definite matrices and
least-squares approximation / 760 \\
29 Linear Programming / 770 \\
29.1 Standard and slack forms / 777 \\
29.2 Formulating problems as linear programs / 785 \\
29.3 The simplex algorithm / 790 \\
29.4 Duality / 804 \\
29.5 The initial basic feasible solution Si / 7 \\
30 Polynomials and the FFT / 822 \\
30.1 Representation of polynomials / 824 \\
30.2 The DFT and FFT / 830 \\
30.3 Efficient FFT implementations / 839 \\
31 Number-Theoretic Algorithms / 849 \\
31.1 Elementary number-theoretic notions / 850 \\
31.2 Greatest common divisor / 856 \\
31.3 Modular arithmetic / 862 \\
31.4 Solving modular linear equations / 869 \\
31.5 The Chinese remainder theorem / 873 \\
31.6 Powers of an element / 876 \\
31.7 The RSA public-key cryptosystem / 881 \\
31.8 Primality testing / 887 \\
31.9 Integer factorization / 896 \\
32 String Matching / 906 \\
32.1 The naive string-matching algorithm / 909 \\
32.2 The Rabin--Karp algorithm / 911 \\
32.3 String matching with finite automata / 976 \\
32.4 The Knuth--Morris--Pratt algorithm / 923 \\
33 Computational Geometry / 933 \\
33.1 Line-segment properties / 934 \\
33.2 Determining whether any pair of segments
intersects / 940 \\
33.3 Finding the convex hull / 947 \\
33.4 Finding the closest pair of points / 957 \\
34 NP-Completeness / 966 \\
34.1 Polynomial time / 971 \\
34.2 Polynomial-time verification / 979 \\
34.3 NP-completeness and reducibility / 984 \\
34.4 NP-completeness proofs / 995 \\
34.5 NP-complete problems / 1003 \\
35 Approximation Algorithms / 1022 \\
35.1 The vertex-cover problem / 1024 \\
35.2 The traveling-salesman problem / 7027 \\
35.3 The set-covering problem / 1033 \\
35.4 Randomization and linear programming / 7039 \\
35.5 The subset-sum problem / 1043 \\
VIII Appendix: Mathematical Background \\
Introduction / 1057 \\
A Summations / 1058 \\
A.1 Summation formulas and properties / 1058 \\
A.2 Bounding summations / 1062",
}
@Article{Daciuk:2001:EAC,
author = "Jan Daciuk",
title = "Experiments with Automata Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2088",
pages = "105--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2088.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2088/20880105.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2088/20880105.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{DeMarchi:2001:AAN,
author = "Stefano {De Marchi} and Marco Vianello",
title = "Approximating the Approximant: a Numerical Code for
Polynomial Compression of Discrete Integral Operators",
journal = j-NUMER-ALGORITHMS,
volume = "28",
number = "1--4",
pages = "101--116",
month = dec,
year = "2001",
CODEN = "NUALEG",
DOI = "https://doi.org/10.1023/a:1014030412645",
ISSN = "1017-1398 (print), 1572-9265 (electronic)",
ISSN-L = "1017-1398",
bibdate = "Mon Sep 29 08:49:11 MDT 2003",
bibsource = "http://www.kluweronline.com/issn/1017-1398;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/numeralgorithms.bib",
URL = "http://ipsapp007.kluweronline.com/content/getfile/5058/37/7/abstract.htm;
http://ipsapp007.kluweronline.com/content/getfile/5058/37/7/fulltext.pdf;
http://ipsapp007.lwwonline.com/content/getfile/5058/37/7/abstract.htm;
http://ipsapp007.lwwonline.com/content/getfile/5058/37/7/fulltext.pdf",
acknowledgement = ack-nhfb,
fjournal = "Numerical Algorithms",
journal-URL = "http://link.springer.com/journal/11075",
}
@InProceedings{Demiroglu:2001:JSC,
author = "C. Demiroglu and M. W. Hoffman and K. Sayood",
title = "Joint source channel coding using arithmetic codes and
trellis coded modulation",
crossref = "Storer:2001:DPD",
pages = "302--311",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917161",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917161",
acknowledgement = ack-nhfb,
}
@Article{Denisowski:2001:HDI,
author = "P. Denisowski",
title = "How does it sound? [voice clarity analysis]",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "2",
pages = "60--64",
month = feb,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.898801",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Communication industry; compressed data networks;
computer-based techniques; Data communication; data
compression; Delay; Manufacturing industries; Natural
languages; packet switching; packetized data networks;
Redundancy; speech coding; Speech coding; speech
processing; Telecommunication standards;
Telecommunication traffic; Telephony; voice clarity
analysis; voice communication; voice quality checking",
}
@Article{Diamantini:2001:EDC,
author = "Claudia Diamantini and Maurizio Panti",
title = "An Efficient Data Compression Approach to the
Classification Task",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2035",
pages = "444--??",
year = "2001",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1145/380995.381014",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:52 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2035.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2035/20350444.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2035/20350444.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Dorward:2001:LDP,
author = "S. Dorward and D. Huang and S. A. Savari and G.
Schuller and B. Yu",
title = "Low delay perceptually lossless coding of audio
signals",
crossref = "Storer:2001:DPD",
pages = "312--320",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917162",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917162",
acknowledgement = ack-nhfb,
}
@InProceedings{Dragotti:2001:QOF,
author = "P. L. Dragotti and J. Kovacevic and V. K. Goyal",
title = "Quantized oversampled filter banks with erasures",
crossref = "Storer:2001:DPD",
pages = "173--182",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917148",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917148",
acknowledgement = ack-nhfb,
}
@InProceedings{Duan:2001:CLD,
author = "Jiangang Duan and Jin Li",
title = "Compression of the layered depth image",
crossref = "Storer:2001:DPD",
pages = "331--340",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917164",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917164",
acknowledgement = ack-nhfb,
}
@Book{ECMA-321,
author = "{ECMA}",
title = "{ECMA-321}: Streaming Lossless Data Compression
Algorithm --- ({SLDC})",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "2001",
bibdate = "Mon May 16 06:24:46 2005",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ecma-321.htm",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-321",
remark = "Also ISO/IEC 22091.",
}
@InProceedings{Factor:2001:SCC,
author = "M. Factor and D. Sheinwald and B.-A. Yassour",
title = "Software compression in the client\slash server
environment",
crossref = "Storer:2001:DPD",
pages = "233--242",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917154",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917154",
acknowledgement = ack-nhfb,
}
@Book{FIPS:2001:AAE,
author = "{FIPS}",
title = "{Announcing the Advanced Encryption Standard (AES)}",
publisher = pub-NIST,
address = pub-NIST:adr,
pages = "51",
day = "26",
month = nov,
year = "2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Federal Information Processing Standards Publication
197.",
URL = "http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf",
acknowledgement = ack-ds,
rawdata = "FIPS197 (2001) {\it Advanced Encryption Standard},
FIPS Publication 197, November 26, 2001. Available
from\hfil\break
|http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf|.",
}
@InProceedings{Fleming:2001:NVQ,
author = "M. Fleming and M. Effros",
title = "Network vector quantization",
crossref = "Storer:2001:DPD",
pages = "13--22",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917132",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917132",
acknowledgement = ack-nhfb,
}
@InProceedings{Flierl:2001:MME,
author = "M. Flierl and B. Girod",
title = "Multihypothesis motion estimation for video coding",
crossref = "Storer:2001:DPD",
pages = "341--350",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917165",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917165",
acknowledgement = ack-nhfb,
}
@InProceedings{Forchhammer:2001:LID,
author = "S. Forchhammer and Xiaolin Wu and J. D. Andersen",
title = "Lossless image data sequence compression using optimal
context quantization",
crossref = "Storer:2001:DPD",
pages = "53--62",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917136",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917136",
acknowledgement = ack-nhfb,
}
@Misc{Funet:2001:TI,
author = "{Funet}",
title = "Test images",
pages = "??",
year = "2001, 2007",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://nic.funet.fi/pub/graphics/misc/test-images/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Funet (2001)
|ftp://nic.funet.fi/pub/graphics/misc/test-images/|.",
}
@Article{Galli:2001:THO,
author = "N. Galli and B. Seybold and K. Simon",
title = "Tetris-Hashing or optimal table compression",
journal = j-DISCRETE-APPL-MATH,
volume = "110",
number = "1",
publisher = "Elsevier Science",
pages = "41--58",
day = "1",
month = jun,
year = "2001",
CODEN = "DAMADU",
DOI = "https://doi.org/10.1016/s0166-218x(00)00302-4",
ISSN = "0166-218X (print), 1872-6771 (electronic)",
ISSN-L = "0166-218X",
bibdate = "Thu Nov 7 20:59:16 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib; Ingenta
database",
acknowledgement = ack-nhfb,
fjournal = "Discrete Applied Mathematics",
pagecount = "18",
}
@InProceedings{Garcia-Frias:2001:JSC,
author = "J. Garcia-Frias",
title = "Joint source-channel decoding of correlated sources
over noisy channels",
crossref = "Storer:2001:DPD",
pages = "283--292",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917159",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917159",
acknowledgement = ack-nhfb,
}
@InProceedings{Golin:2001:OPF,
author = "M. J. Golin and HyeonSuk Na",
title = "Optimal prefix-free codes that end in a specified
pattern and similar problems: the uniform probability
case",
crossref = "Storer:2001:DPD",
pages = "143--152",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917145",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917145",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:2001:ZEC,
author = "R. M. Gray and J. Li",
title = "On {Zador}'s entropy-constrained quantization
theorem",
crossref = "Storer:2001:DPD",
pages = "3--12",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917131",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917131",
acknowledgement = ack-nhfb,
}
@Article{Hafner:2001:FOS,
author = "Ullrich Hafner",
title = "{FIASCO} --- An Open-Source Fractal Image and Sequence
Codec",
journal = j-LINUX-J,
volume = "81",
pages = "152--155",
month = jan,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Mon Dec 18 14:27:27 MST 2000",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue81/index.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "FIASCO (Fractal Image and Sequence Codec) provides
state-of-the-art image and video compression.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Hans:2001:LCD,
author = "Mat Hans and R. W. Schafer",
title = "Lossless Compression of Digital Audio",
journal = j-IEEE-SIGNAL-PROCESS-MAG,
volume = "18",
number = "4",
pages = "21--32",
month = jul,
year = "2001",
CODEN = "ISPRE6",
DOI = "https://doi.org/10.1109/79.939834",
ISSN = "1053-5888 (print), 1558-0792 (electronic)",
ISSN-L = "1053-5888",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE signal processing magazine",
rawdata = "Hans, Mat and R. W. Schafer (2001) ``Lossless
Compression of Digital Audio,'' {\it IEEE Signal
Processing Magazine}, {\bf18}(4):21--32, July.",
}
@InProceedings{Hong:2001:GTW,
author = "E. S. Hong and R. E. Ladner and E. A. Riskin",
title = "Group testing for wavelet packet image compression",
crossref = "Storer:2001:DPD",
pages = "73--82",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917138",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917138",
acknowledgement = ack-nhfb,
}
@InProceedings{Hsiang:2001:EIC,
author = "Shih-Ta Hsiang",
title = "Embedded image coding using zeroblocks of
subband\slash wavelet coefficients and context
modeling",
crossref = "Storer:2001:DPD",
pages = "83--92",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917139",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917139",
acknowledgement = ack-nhfb,
}
@MastersThesis{Huang:2001:DHI,
author = "Cai Wei Huang",
title = "Design of the Down Hole Instruments of Multiplexed
Logging System and Research on the Data Compression of
{DHV} Logging System",
type = "{M.Eng.}",
school = "Beijing University of Aeronautics and Astronautics",
address = "Beijing, Peoples Republic of China",
year = "2001",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024707067",
acknowledgement = ack-nhfb,
advisor = "Zhi Quan Cai",
classification = "0537: Engineering",
subject = "Engineering",
}
@InProceedings{Isal:2001:PSB,
author = "R. Y. K. Isal and A. Moffat",
title = "Parsing strategies for {BWT} compression",
crossref = "Storer:2001:DPD",
pages = "429--438",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917174",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917174",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Article{Isenburg:2001:TSC,
author = "Martin Isenburg",
title = "Triangle Strip Compression",
journal = j-CGF,
volume = "20",
number = "2",
pages = "??--??",
month = jun,
year = "2001",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00481",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Thu Feb 21 09:14:37 2002",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Jacquet:2001:APL,
author = "P. Jacquet and W. Szpankowski and J. Tang",
title = "Average profile of the {Lempel--Ziv} parsing scheme
for a {Markovian} source",
journal = j-ALGORITHMICA,
volume = "31",
number = "3",
pages = "318--360",
month = jul,
year = "2001",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-001-0053-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68P30 (68Q25 94A29)",
MRnumber = "MR1855254 (2002h:68049)",
bibdate = "Fri Jan 6 11:38:14 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=31&issue=3;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Mathematical analysis of algorithms",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=31&issue=3&spage=318",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
}
@InProceedings{Khalil:2001:RPV,
author = "H. Khalil and K. Rose",
title = "Robust predictive vector quantizer design",
crossref = "Storer:2001:DPD",
pages = "33--42",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917134",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917134",
acknowledgement = ack-nhfb,
}
@InProceedings{Kiely:2001:ABE,
author = "A. Kiely and M. Klimesh",
title = "An adaptable binary entropy coder",
crossref = "Storer:2001:DPD",
pages = "391--400",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917170",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917170",
acknowledgement = ack-nhfb,
}
@Article{Kim:2001:SPM,
author = "Wonkoo Kim and Ching-Chung Li",
title = "A Study on Preconditioning Multiwavelet Systems for
Image Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2251",
pages = "22--??",
year = "2001",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1142/s0219691303000049",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:36 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2251.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2251/22510022.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2251/22510022.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Klein:2001:PLZ,
author = "Shmuel Tomi Klein and Yair Wiseman",
title = "Parallel {Lempel--Ziv} Coding (Extended Abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2089",
pages = "18--??",
year = "2001",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1016/j.dam.2004.04.013",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:48 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2089.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2089/20890018.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2089/20890018.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Klein:2001:PMH,
author = "S. T. Klein and D. Shapira",
title = "Pattern matching in {Huffman} encoded texts",
crossref = "Storer:2001:DPD",
pages = "449--458",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917176",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917176",
acknowledgement = ack-nhfb,
}
@InProceedings{Kuo:2001:EIC,
author = "Shyh-shiaw Kuo and J. D. Johnston",
title = "Enhancing image coders by using spatial noise shaping
({SNS})",
crossref = "Storer:2001:DPD",
pages = "321--330",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917163",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917163",
acknowledgement = ack-nhfb,
}
@InProceedings{Liddell:2001:LRC,
author = "M. Liddell and A. Moffat",
title = "Length-restricted coding in static and dynamic
frameworks",
crossref = "Storer:2001:DPD",
pages = "133--142",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917144",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917144",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2001:RDO,
author = "K. K. Lin and R. M. Gray",
title = "Rate-distortion optimization for the {SPIHT} encoder",
crossref = "Storer:2001:DPD",
pages = "123--132",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917143",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917143",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2001:VRC,
author = "K. K. Lin and R. M. Gray",
title = "Video residual coding using {SPIHT} and dependent
optimization",
crossref = "Storer:2001:DPD",
pages = "113--122",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917142",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917142",
acknowledgement = ack-nhfb,
}
@Article{Logeswaran:2001:PSS,
author = "R. Logeswaran and C. Eswaran",
title = "Performance Survey of Several Lossless Compression
Algorithms for Telemetry Applications",
journal = j-INT-J-COMPUT-APPL,
volume = "23",
number = "1",
pages = "1--9",
year = "2001",
CODEN = "IJCAFW",
DOI = "https://doi.org/10.1080/1206212X.2001.11441623",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:19:36 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2001.11441623",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "10 Jul 2015",
}
@Article{Lopez-Rubio:2001:DTN,
author = "Ezequiel L{\'o}pez-Rubio and Jos{\'e}
Mu{\~n}oz-P{\'e}rez and Jos{\'e} Antonio
G{\'o}mez-Ruiz",
title = "Dynamic Topology Networks for Colour Image
Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2085",
pages = "168--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2085.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2085/20850168.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2085/20850168.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lutai:2001:MSD,
author = "Guan L{\"u}tai and Lu Feng",
title = "A Method with Scattered Data Spline and Wavelets for
Image Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2251",
pages = "49--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:36 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2251.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2251/22510049.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2251/22510049.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Malvar:2001:FAE,
author = "H. S. Malvar",
title = "Fast adaptive encoder for bi-level images",
crossref = "Storer:2001:DPD",
pages = "253--262",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917156",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917156",
acknowledgement = ack-nhfb,
}
@Article{Manzini:2001:ABW,
author = "Giovanni Manzini",
title = "An analysis of the {Burrows --- Wheeler} transform",
journal = j-J-ACM,
volume = "48",
number = "3",
pages = "407--430",
month = may,
year = "2001",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/382780.382782",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Apr 1 16:52:07 MST 2002",
bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p407-manzini/",
abstract = "The Burrows--Wheeler Transform (also known as
Block-Sorting) is at the base of compression algorithms
that are the state of the art in lossless data
compression. In this paper, we analyze two algorithms
that use this technique. The first one is the original
algorithm described by Burrows and Wheeler, which,
despite its simplicity outperforms the Gzip compressor.
The second one uses an additional run-length encoding
step to improve compression. We prove that the
compression ratio of both algorithms can be bounded in
terms of the $k$ th order empirical entropy of the
input string for any $ k > 0$. We make no assumptions
on the input and we obtain bounds which hold in the
worst case that is for every possible input string. All
previous results for Block-Sorting algorithms were
concerned with the average compression ratio and have
been established assuming that the input comes from a
finite-order Markov source.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "block sorting; Burrows --- move-to-front encoding;
Wheeler transform; worst-case analysis of compression",
subject = "Data --- Coding and Information Theory (E.4): {\bf
Data compaction and compression}; Theory of Computation
--- Analysis of Algorithms and Problem Complexity ---
Nonnumerical Algorithms and Problems (F.2.2)",
}
@Article{Marpe:2001:WBV,
author = "Detlev Marpe and Thomas Wiegand and Hans L. Cycon",
title = "Wavelet-Based Video Compression Using Long-Term Memory
Motion-Compensated Prediction and Context-Based
Adaptive Arithmetic Coding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2251",
pages = "76--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:36 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2251.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2251/22510076.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2251/22510076.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Matias:2001:EFP,
author = "Yossi Matias and Nasir Rajpoot and Cenk Sahinalp",
title = "The Effect of Flexible Parsing for Dynamic
Dictionary-Based Data Compression",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "6",
pages = "10:1--10:??",
month = "????",
year = "2001",
CODEN = "????",
DOI = "https://doi.org/10.1145/945394.945404",
ISSN = "1084-6654",
ISSN-L = "1084-6654",
bibdate = "Mon Oct 6 16:03:55 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "We report on the performance evaluation of greedy
parsing with a single step lookahead (which we call
flexible Parsing or {\em FP\/}) as an alternative to
the commonly used greedy parsing (with no-lookaheads)
scheme. Greedy parsing is the basis of most popular
compression programs including UNIX {\tt compress} and
{\tt gzip}, however it usually results in far from
optimal parsing\slash compression with regard to the
dictionary construction scheme in use. Flexible
parsing, however, is optimal [MS99], i.e. partitions
any given input to the smallest number of phrases
possible, for dictionary construction schemes which
satisfy the prefix property throughout their
execution.\par
We focus on the application of {\em FP\/} in the
context of the LZW variant of the Lempel--Ziv'78
dictionary construction method [Wel84, ZL78], which is
of considerable practical interest. We implement two
compression algorithms which use (1) {\em FP\/} with
LZW dictionary (LZW-{\em FP\/}), and (2) {\em FP\/}
with an alternative flexible dictionary (FPA as
introduced in [Hor95]). Our implementations are based
on novel on-line data structures enabling us to use
linear time and space. We test our implementations on a
collection of input sequences which includes textual
files, DNA sequences, medical images, and pseudorandom
binary files, and compare our results with two of the
most popular compression programs UNIX {\tt compress}
and {\tt gzip}. Our results demonstrate that flexible
parsing is especially useful for non-textual data, on
which it improves over the compression rates of {\tt
compress} and {\tt gzip} by up to 20\% and 35\%,
respectively.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "Journal of Experimental Algorithmics (JEA)",
}
@InProceedings{Mitarai:2001:CPM,
author = "S. Mitarai and M. Hirao and T. Matsumoto and A.
Shinohara and M. Takeda and S. Arikawa",
title = "Compressed pattern matching for {SEQUITUR}",
crossref = "Storer:2001:DPD",
pages = "469--478",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917178",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917178",
acknowledgement = ack-nhfb,
}
@InProceedings{Mitzenmacher:2001:HFO,
author = "M. Mitzenmacher",
title = "On the hardness of finding optimal multiple preset
dictionaries",
crossref = "Storer:2001:DPD",
pages = "411--418",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917172",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917172",
acknowledgement = ack-nhfb,
}
@InProceedings{Navarro:2001:FAS,
author = "G. Navarro and T. Kida and M. Takeda and A. Shinohara
and S. Arikawa",
title = "Faster approximate string matching over compressed
text",
crossref = "Storer:2001:DPD",
pages = "459--468",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917177",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917177",
acknowledgement = ack-nhfb,
}
@Article{Navarro:2001:RES,
author = "Gonzalo Navarro",
title = "Regular Expression Searching over {Ziv--Lempel}
Compressed Text",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2089",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:48 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2089.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2089/20890001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2089/20890001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2001:RHQ,
author = "Ky Giang Nguyen and Dietmar Saupe",
title = "Rapid High Quality Compression of Volume Data for
Visualization",
journal = j-CGF,
volume = "20",
number = "3",
pages = "??--??",
month = sep,
year = "2001",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00497",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Thu Feb 21 09:14:37 2002",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@InProceedings{Oggier:2001:SPD,
author = "F. E. Oggier and S. D. Servetto",
title = "Semidefinite programs for the design of codes for
delay-constrained communication in networks",
crossref = "Storer:2001:DPD",
pages = "183--192",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917149",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917149",
acknowledgement = ack-nhfb,
}
@Misc{Ohio-State:2001:U,
author = "{Ohio-State}",
title = "[unknown]",
pages = "??",
year = "2001",
bibdate = "Sat Jan 26 12:46:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cis.ohio-state.edu/htbin/rfc/rfc804.html",
acknowledgement = ack-ds,
rawdata = "Ohio-state (2001)
|http://www.cis.ohio-state.edu/htbin/rfc/rfc804.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@PhdThesis{Pigeon:2001:CCD,
author = "Steven Pigeon",
title = "Contributions {\`a} la compression de donn{\'e}es.
({French}) [Contributions to Data Compression]",
type = "{Ph.D.} Thesis",
school = "D{\'e}partement d'informatique et de recherche
op{\'e}rationnelle, Facult{\'e} des Arts \& Sciences,
Universit{\'e} de Montr{\'e}al",
address = "Montr{\'e}al, QC, Canada",
pages = "xvi + 296",
month = dec,
year = "2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "The part on taboo codes is ``Taboo Codes, New Classes
of Universal Codes'', and is available as a separate
report \cite{Pigeon:2002:TCN}.",
URL = "http://www.stevenpigeon.org/Publications/publications/phd.pdf",
acknowledgement = ack-ds,
language = "French",
rawdata = "Pigeon, Steven (2001b) {\it Contributions to Data
Compression}, PhD Thesis, University of Montreal (in
French). Available from\hfil\break
|http://www.stevenpigeon.org/Publications/publications/phd.pdf|.
The part on taboo codes is ``Taboo Codes, New Classes
of Universal Codes,'' and is also available at
|www.iro.umontreal.ca/~brassard/SEMINAIRES/taboo.ps|. A
new version has been submitted to {\it SIAM Journal of
Computing}.",
}
@InProceedings{Pigeon:2001:SSC,
author = "Steven Pigeon",
booktitle = "{Proceedings of the Data Compression Conference (DCC
'01)}",
title = "Start/Stop Codes",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "511",
year = "2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.stevenpigeon.org/Publications/publications/ssc_full.pdf",
acknowledgement = ack-ds,
rawdata = "Pigeon, Steven (2001a) ``Start/Stop Codes,'' {\it
Proceedings of the Data Compression Conference (DCC
'01)}, p. 511. Also available at\hfil\break
|http://www.stevenpigeon.org/Publications/publications/ssc_full.pdf|.",
}
@InProceedings{Pradhan:2001:EAI,
author = "S. S. Pradhan and K. Ramchandran",
title = "Enhancing analog image transmission systems using
digital side information: a new wavelet-based image
coding paradigm",
crossref = "Storer:2001:DPD",
pages = "63--72",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917137",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917137",
acknowledgement = ack-nhfb,
}
@Article{Prasad:2001:IBI,
author = "M. V. N. K. Prasad and K. K. Shukla and R. N.
Mukherjee",
title = "Implementation of {BTTC} Image Compression Algorithm
Using Fuzzy Technique",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2275",
pages = "375--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:51 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2275.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2275/22750375.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2275/22750375.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Randall:2001:LDF,
author = "Keith Randall and Raymie Stata and Rajiv
Wickremesinghe and Janet L. Wiener",
title = "The {LINK} Database: Fast Access to Graphs of the
{Web}",
type = "Research Report",
number = "175",
institution = "Compaq Systems Research Center",
address = "Palo Alto, CA, USA",
pages = "??",
year = "2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Randall, Keith, Raymie Stata, Rajiv Wickremesinghe,
and Janet L. Wiener (2001) ``The LINK Database: Fast
Access to Graphs of the Web.'' {\it Research Report
175}, Compaq Systems Research Center, Palo Alto, CA.",
}
@Book{Rao:2001:TDC,
editor = "K. Ramamohan (Kamisetty Ramamohan) Rao and P. C. (Pat
C.) Yip",
title = "The Transform and Data Compression Handbook",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "xix + 388",
year = "2001",
DOI = "https://doi.org/10.1201/9781315220529",
ISBN = "0-8493-3692-9, 1-315-22052-0, 1-351-82772-3,
1-4200-3738-2 (e-book)",
ISBN-13 = "978-0-8493-3692-8, 978-1-315-22052-9,
978-1-351-82772-0, 978-1-4200-3738-8 (e-book)",
LCCN = "TK5105 .T72 2001",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Electrical engineering and signal processing series",
URL = "http://www.loc.gov/catdir/enhancements/fy0646/00057149-d.html",
abstract = "\booktitle{The Transform and Data Compression
Handbook} serves as a handbook for a wide range of
researchers and engineers. The authors describe various
discrete transforms and their applications in different
disciplines. They cover techniques, such as adaptive
quantization and entropy coding, that result in
significant reduction in bit rates when applied to the
transform coefficients. With presentations of the ideas
and concepts, as well as descriptions of the
algorithms, the authors provide insight into the
applications and their limitations. Data compression is
an essential step towards the efficient storage and
transmission of information. \booktitle{The Transform
and Data Compression Handbook} provides information
regarding different discrete transforms and
demonstrates their power and practicality in data
compression.",
acknowledgement = ack-nhfb,
subject = "Data transmission systems; Handbooks, manuals, etc;
Data compression (Telecommunication)",
tableofcontents = "1. Karhunen--Loeve Transform \\
2. The Discrete Fourier Transform \\
3. Comparametric Transforms for Transmitting Eye Tap
Video with Picture Transfer Protocol (PTP) \\
4. Discrete Cosine and Sine Transforms \\
5. Lapped Transforms for Image Compression \\
6. Wavelet-Based Image Compression \\
7. Fractal-Based Image and Video Compression \\
8. Compression of Wavelet Transform Coefficients",
}
@InProceedings{Reibman:2001:MDD,
author = "A. R. Reibman and L. Bottou",
title = "Managing drift in {DCT}-based scalable video coding",
crossref = "Storer:2001:DPD",
pages = "351--360",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917166",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917166",
acknowledgement = ack-nhfb,
}
@InProceedings{Rizzo:2001:OAV,
author = "F. Rizzo and J. A. Storer",
title = "Overlap in adaptive vector quantization",
crossref = "Storer:2001:DPD",
pages = "401--410",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917171",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917171",
acknowledgement = ack-nhfb,
}
@Article{SantaCruz:2001:JIC,
author = "Diego {Santa Cruz} and Touradj Ebrahimi and Charilaos
Christopoulos",
title = "The {JPEG 2000} Image Coding Standard",
journal = j-DDJ,
volume = "26",
number = "4",
pages = "46, 48, 50--52, 54",
month = apr,
year = "2001",
CODEN = "DDJOEB",
DOI = "https://doi.org/10.1016/s0923-5965(01)00031-5",
ISSN = "1044-789X",
bibdate = "Tue Mar 13 15:22:36 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://jj2000.epfl.ch/; http://www.ddj.com/;
http://www.ece.ubc.ca/~mdadams/jasper/;
http://www.imagepower.com/products/ubcform.htm;
http://www.jpeg.org/;
http://www.jpeg.org/public/wavedemo.zip",
abstract = "The JPEG 2000 is a new image coding standard that
specifies only the decoding algorithm and the
compressed data format --- the encoder algorithm is
deliberately left up to you.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Jasper",
}
@InProceedings{Schilling:2001:FPI,
author = "D. Schilling and P. Cosman",
title = "Feature-preserving image coding for very low bit
rates",
crossref = "Storer:2001:DPD",
pages = "103--112",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917141",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917141",
acknowledgement = ack-nhfb,
}
@InProceedings{Seward:2001:STT,
author = "J. Seward",
title = "Space-time tradeoffs in the inverse {B}-{W}
transform",
crossref = "Storer:2001:DPD",
pages = "439--448",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917175",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917175",
acknowledgement = ack-nhfb,
}
@InProceedings{Shamir:2001:ULC,
author = "G. I. Shamir and D. J. {Costello, Jr.}",
title = "Universal lossless compression of piecewise stationary
slowly varying sources",
crossref = "Storer:2001:DPD",
pages = "371--380",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917168",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917168",
acknowledgement = ack-nhfb,
}
@InProceedings{Simard:2001:WCM,
author = "P. Y. Simard and H. S. Malvar",
title = "A wavelet coder for masked images",
crossref = "Storer:2001:DPD",
pages = "93--102",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917140",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917140",
acknowledgement = ack-nhfb,
}
@Article{Simpson:2001:DRT,
author = "Albert Simpson and Jill Hunter and Moira Wylie and Yi
Hu and David Mann",
title = "Demonstrating Real-Time {JPEG} Image
Compression-Decompression Using Standard Component {IP}
Cores on a Programmable Logic Based Platform for {DSP}
and Image Processing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2147",
pages = "441--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2147.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2147/21470441.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2147/21470441.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Suel:2001:CGS,
author = "T. Suel and Jun Yuan",
title = "Compressing the graph structure of the {Web}",
crossref = "Storer:2001:DPD",
pages = "213--222",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917152",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917152",
acknowledgement = ack-nhfb,
}
@Book{Systems:2001:APD,
author = "{Adobe Systems}",
title = "{Adobe Portable Document Format} Version 1.4",
publisher = pub-AW,
address = pub-AW:adr,
edition = "Third",
pages = "??",
month = dec,
year = "2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "PDF (2001) {\it Adobe Portable Document Format Version
1.4}, 3rd ed., Reading, MA, Addison-Wesley, December.",
}
@InProceedings{Teahan:2001:CPM,
author = "W. J. Teahan and D. J. Harper",
title = "Combining {PPM} models using a text mining approach",
crossref = "Storer:2001:DPD",
pages = "153--162",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917146",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917146",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@Article{Teuhola:2001:GAC,
author = "Jukka Teuhola",
title = "A General Approach to Compression of Hierarchical
Indexes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2113",
pages = "775--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:14 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2113.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2113/21130775.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2113/21130775.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tsai:2001:CHC,
author = "C. W. Tsai and J. L. Wu",
title = "On Constructing the {Huffman}-Code Based Reversible
Variable Length Codes",
journal = j-IEEE-TRANS-COMM,
volume = "49",
number = "9",
pages = "1506--1509",
month = sep,
year = "2001",
CODEN = "IECMBT",
ISSN = "0090-6778 (print), 1558-0857 (electronic)",
ISSN-L = "0090-6778",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Communications",
rawdata = "Tsai, C. W. and J. L. Wu (2001a) ``On Constructing the
Huffman-Code Based Reversible Variable Length Codes,''
{\it IEEE Transactions on Communications},
{\bf49}(9):1506--1509, September.",
}
@Article{Tsai:2001:MSR,
author = "Chien-Wu Tsai and Ja-Ling Wu",
title = "Modified Symmetrical Reversible Variable-Length Code
and its Theoretical Bounds",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "47",
number = "6",
pages = "2543--2548",
month = sep,
year = "2001",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.945265",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Tsai, Chien-Wu and Ja-Ling Wu (2001b) ``Modified
Symmetrical Reversible Variable-Length Code and its
Theoretical Bounds,'' {\it IEEE Transactions on
Information Theory}, {\bf47}(6):2543--2548,
September.",
}
@InProceedings{Venkataramani:2001:SRT,
author = "R. Venkataramani and G. Kramer and V. K. Goyal",
title = "Successive refinement on trees: a special case of a
new {MD} coding region",
crossref = "Storer:2001:DPD",
pages = "293--301",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917160",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917160",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2001:DTC,
author = "Xin Wang and M. T. Orchard",
title = "Design of trellis codes for source coding with side
information at the decoder",
crossref = "Storer:2001:DPD",
pages = "361--370",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917167",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917167",
acknowledgement = ack-nhfb,
}
@InProceedings{Wirth:2001:CWD,
author = "A. I. Wirth and A. Moffat",
title = "Can we do without ranks in {Burrows--Wheeler}
transform compression?",
crossref = "Storer:2001:DPD",
pages = "419--428",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917173",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917173",
acknowledgement = ack-nhfb,
}
@Article{Wiseman:2001:CEC,
author = "Yair Wiseman and Erick Fredj",
title = "Contour extraction of compressed {JPEG} images",
journal = j-J-GRAPHICS-TOOLS,
volume = "6",
number = "3",
pages = "37--43",
year = "2001",
CODEN = "JGTOFD",
DOI = "https://doi.org/10.1080/10867651.2001.10487544",
ISSN = "1086-7651",
ISSN-L = "1086-7651",
bibdate = "Thu Apr 11 07:08:39 2002",
bibsource = "http://www.acm.org/jgt/issues.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jgraphtools.bib",
URL = "http://www.acm.org/jgt/papers/WisemanFredj01/",
abstract = "We present a new algorithm that uses the JPEG
compression format and provides a significant
improvement in contour extraction for medical imaging,
such as X-ray photos. The algorithm searches for an
object's contour in the compressed file. The complexity
is reduced to $ O(n) $ in the case of a high resolution
picture, which is better than the state-of-the-art for
contour extraction.",
acknowledgement = ack-nhfb,
fjournal = "Journal of Graphics Tools: JGT",
journal-URL = "http://www.tandfonline.com/loi/ujgt20",
}
@Article{Yang:2001:CPD,
author = "Dow-Yung Yang and Ananth Grama and Vivek Sarin and
Naren Ramakrishnan",
title = "Compression of particle data from hierarchical
approximate methods",
journal = j-TOMS,
volume = "27",
number = "3",
pages = "317--339",
month = sep,
year = "2001",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/502800.502802",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Wed Feb 6 16:43:42 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
https://www.math.utah.edu/pub/bibnet/subjects/fastmultipole.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
abstract = "This article presents an analytical and computational
framework for the compression of particle data
resulting from hierarchical approximate treecodes such
as the {\em Barnes--Hut} and {\em Fast Multipole
Methods}. Due to approximations introduced by
hierarchical methods, various parameters (such as
position, velocity, acceleration, potential) associated
with a particle can be bounded by distortion radii.
Using this distortion radii, we develop storage schemes
that guarantee error bounds while maximizing
compression. Our schemes make extensive use of spatial
and temporal coherence of particle behavior and yield
compression ratios higher than 12:1 over raw data, and
6:1 over gzipped (LZ) raw data for selected simulation
instances. We demonstrate that for uniform
distributions with 2M particles, storage requirements
can be reduced from 24 MB to about 1.8 MB (about 7 bits
per particle per timestep) for storing particle
positions. This is significant because it enables
faster storage/retrieval, better temporal resolution,
and improved analysis. Our results are shown to scale
from small systems (2K particles) to much larger
systems (over 2M particles). The associated algorithm
is asymptotically optimal in computation time ($ O(n)$)
with a small constant. Our implementations are
demonstrated to run extremely fast---much faster than
the time it takes to compute a single time-step
advance. In addition, our compression framework relies
on a natural hierarchical representation upon which
other analysis tasks such as segmented and window
retrieval can be built.",
accepted = "23 July 2001",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://portal.acm.org/toc.cfm?idx=J782",
keywords = "Astrophysics; Barnes--Hut; data compression and
analysis; Fast Multipole Method; materials simulation;
molecular dynamics; particle dynamics",
}
@MastersThesis{Ye:2001:HTD,
author = "Zhong A. Ye",
title = "Hypothesis Testing and Data Compression",
type = "{M.S.}",
school = "Nankai University",
address = "Nankai, Peoples Republic of China",
year = "2001",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1027128794",
acknowledgement = ack-nhfb,
advisor = "Shi Yi Shen",
classification = "0463: Statistics; 0489: Information Technology",
subject = "Statistics; Information Technology",
}
@InProceedings{Yeates:2001:TIC,
author = "S. Yeates and I. H. Witten and D. Bainbridge",
title = "Tag insertion complexity",
crossref = "Storer:2001:DPD",
pages = "243--252",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917155",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917155",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2001:OCD,
author = "Qian Zhao and M. Effros",
title = "Optimal code design for lossless and near lossless
source coding in multiple access networks",
crossref = "Storer:2001:DPD",
pages = "263--272",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917157",
bibdate = "Tue Feb 5 14:07:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917157",
acknowledgement = ack-nhfb,
}
@InProceedings{Aaron:2002:CSI,
author = "A. Aaron and B. Girod",
title = "Compression with side information using turbo codes",
crossref = "Storer:2002:DPD",
pages = "252--261",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999963",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999963",
acknowledgement = ack-nhfb,
}
@InProceedings{Adjeroh:2002:PMB,
author = "D. Adjeroh and A. Mukherjee and T. Bell and M. Powell
and N. Zhang",
title = "Pattern matching in {BWT}-transformed text",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999988",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999988",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@InProceedings{Ahn:2002:GCD,
author = "Jeong-Hwan Ahn and Yo-Sung Ho",
title = "Geometry compression of {$3$-D} mesh models using a
joint prediction",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999989",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999989",
acknowledgement = ack-nhfb,
}
@Article{Ajtai:2002:CEU,
author = "Miklos Ajtai and Randal Burns and Ronald Fagin and
Darrell D. E. Long and Larry Stockmeyer",
title = "Compactly encoding unstructured inputs with
differential compression",
journal = j-J-ACM,
volume = "49",
number = "3",
pages = "318--367",
month = may,
year = "2002",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/567112.567116",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Tue Sep 10 17:35:44 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@TechReport{Anonymous:2002:SHS,
author = "Anonymous",
key = "SHA256",
title = "{Secure Hash Standard}",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "iv + 71",
day = "1",
month = aug,
year = "2002",
bibdate = "Wed Jan 30 09:35:44 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "FIPS Publication 180-2. Officially replaced by
\cite{Anonymous:2012:SHS}, but that newer version is
much shorter.",
URL = "http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf",
acknowledgement = ack-ds,
rawdata = "SHA256 (2002) {\it Secure Hash Standard}, FIPS
Publication 180-2, August 2002. Available at
|csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf|.",
}
@InProceedings{Arandiga:2002:AHF,
author = "F. Arandiga and G. Chiavassa and R. Donat",
title = "Applications of {Harten}'s Framework for
Multiresolution: From Conservation Laws to Image
Compression",
crossref = "Barth:2002:MMM",
volume = "20",
pages = "281--296",
year = "2002",
DOI = "https://doi.org/10.1007/978-3-642-56205-1_6",
bibdate = "Sat Dec 22 08:36:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncse.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-56205-1_6",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-56205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-56205-1",
}
@InProceedings{Arnavut:2002:GBT,
author = "Z. Arnavut",
title = "Generalization of the {BWT} transformation and
inversion ranks",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999990",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999990",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@InProceedings{Banister:2002:RVT,
author = "B. A. Banister and B. Belzer and T. R. Fischer",
title = "Robust video transmission over binary symmetric
channels with packet erasures",
crossref = "Storer:2002:DPD",
pages = "162--171",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999954",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999954",
acknowledgement = ack-nhfb,
}
@InProceedings{Barros:2002:SMD,
author = "J. Barros and S. D. Servetto",
title = "Sequencing multiple descriptions",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999991",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999991",
acknowledgement = ack-nhfb,
}
@InProceedings{Behnamfar:2002:PIC,
author = "F. Behnamfar and F. Alajaji and T. Linder",
title = "Progressive image communication over binary channels
with additive bursty noise",
crossref = "Storer:2002:DPD",
pages = "272--281",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999965",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999965",
acknowledgement = ack-nhfb,
}
@InProceedings{Bell:2002:SBC,
author = "T. Bell and M. Powell and A. Mukherjee and D.
Adjeroh",
title = "Searching {BWT} compressed text with the
{Boyer--Moore} algorithm and binary search",
crossref = "Storer:2002:DPD",
pages = "112--121",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999949",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999949",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Article{Benini:2002:ODP,
author = "Luca Benini and Alberto Macii and Enrico Macii",
title = "Offline Data Profiling Techniques to Enhance Memory
Compression in Embedded Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2451",
pages = "314--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:32 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2451.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2451/24510314.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2451/24510314.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Blandford:2002:ICT,
author = "D. Blandford and G. Blelloch",
title = "Index compression through document reordering",
crossref = "Storer:2002:DPD",
pages = "342--351",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999972",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999972",
acknowledgement = ack-nhfb,
}
@Misc{Buyanovsky:2002:PC,
author = "George Buyanovsky",
title = "Private communications",
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Buyanovsky, George (2002) Private communications ({\tt
buyanovsky@home.com}).",
remark = "From {\tt buyanovsky@home.com}.",
}
@Article{Cannane:2002:GPC,
author = "Adam Cannane and Hugh E. Williams",
title = "A general-purpose compression scheme for large
collections",
journal = j-TOIS,
volume = "20",
number = "3",
pages = "329--355",
year = "2002",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/568727.568730",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Thu Aug 7 10:37:12 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tois/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information Systems (TOIS)",
}
@InProceedings{Chakareski:2002:CRD,
author = "J. Chakareski and P. A. Chou and B. Aazhang",
title = "Computing rate-distortion optimized policies for
streaming media to wireless clients",
crossref = "Storer:2002:DPD",
pages = "53--62",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999943",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999943",
acknowledgement = ack-nhfb,
}
@Article{Chou:2002:VDC,
author = "Peter H. Chou and Teresa H. Meng",
title = "Vertex Data Compression through Vector Quantization",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "8",
number = "4",
pages = "373--382",
month = oct # "\slash " # dec,
year = "2002",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/tvcg.2002.1044522",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Sat Jan 3 13:59:25 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
URL = "http://csdl.computer.org/comp/trans/tg/2002/04/v0373abs.htm;
http://csdl.computer.org/dl/trans/tg/2002/04/v0373.htm;
http://csdl.computer.org/dl/trans/tg/2002/04/v0373.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@InProceedings{Christiansen:2002:FMD,
author = "B. O. Christiansen and K. E. Schauser",
title = "Fast motion detection for thin client compression",
crossref = "Storer:2002:DPD",
pages = "332--341",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999971",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999971",
acknowledgement = ack-nhfb,
}
@InProceedings{Chu:2002:LLD,
author = "A. Chu",
title = "{LZAC} lossless data compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999992",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999992",
acknowledgement = ack-nhfb,
}
@InProceedings{Cinque:2002:PAL,
author = "L. Cinque and F. Liberati and S. {De Agostino}",
title = "A parallel algorithm for lossless image compression by
block matching",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999993",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999993",
acknowledgement = ack-nhfb,
}
@Article{Cohen:2002:ICW,
author = "Albert Cohen and Ingrid Daubechies and Onur G.
Guleryuz and Michael T. Orchard",
title = "On the importance of combining wavelet-based nonlinear
approximation with coding strategies",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "48",
number = "7",
pages = "1895--1921",
month = jul,
year = "2002",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.2002.1013132",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A12 (41A30 42C40 94A34) 68P30",
MRnumber = "1929999",
MRreviewer = "Gilbert Walter",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
ZMnumber = "1061.94004",
acknowledgement = ack-nhfb,
article-number = "PII S0018-9448(02)05170-2",
fjournal = "IEEE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
keywords = "Approximation methods; approximation theory; Besov
smoothness; Besov spaces; compression performance; data
compression; Decorrelation; Discrete cosine transforms;
Discrete wavelet transforms; functions/random
processes; functions/stochastic processes; image
coding; Image coding; Linear approximation; linear
approximation theory; locally smooth signals;
Mathematical analysis; nonlinear approximation theory;
rate distortion theory; Rate-distortion;
rate-distortion estimates; Signal processing;
singularities; stochastic processes; Stochastic
processes; transform codecs; transform coding;
transform compression; wavelet transforms;
wavelet-based nonlinear approximation",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
researcherid-numbers = "Daubechies, Ingrid/B-5886-2012",
unique-id = "ISI:000176445200011",
}
@InProceedings{Cohen:2002:SRS,
author = "A. S. Cohen and S. C. Draper and E. Martinian and G.
W. Wornell",
title = "Source requantization: successive degradation and bit
stealing",
crossref = "Storer:2002:DPD",
pages = "102--111",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999948",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999948",
acknowledgement = ack-nhfb,
}
@InProceedings{Constantinescu:2002:FPA,
author = "C. Constantinescu and R. Arps",
title = "Fast peak autocorrelation finding for
periodicity-exploiting compression methods",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999994",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999994",
acknowledgement = ack-nhfb,
}
@InProceedings{Creusere:2002:APA,
author = "C. D. Creusere",
title = "An analysis of perceptual artifacts in {MPEG} scalable
audio coding",
crossref = "Storer:2002:DPD",
pages = "152--161",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999953",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999953",
acknowledgement = ack-nhfb,
}
@InProceedings{Crochemore:2002:IAB,
author = "Maxime Crochemore and G. Navarro",
booktitle = "{XII International Conference of the Chilean Computer
Science Society (SCCC'02)}",
title = "Improved Antidictionary Based Compression",
publisher = "????",
address = "????",
pages = "7--13",
month = nov,
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Crochemore, Maxime and G. Navarro (2002) ``Improved
Antidictionary Based Compression,'' {\it XII
International Conference of the Chilean Computer
Science Soc. (SCCC'02)}, pp. 7--13, November.",
}
@InProceedings{Cvetkovic:2002:IBF,
author = "Z. Cvetkovic and Ingrid Daubechies and B. F. Logan",
title = "Interpolation of bandlimited functions from quantized
irregular samples",
crossref = "Storer:2002:DPD",
pages = "412--421",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999981",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999981",
acknowledgement = ack-nhfb,
keywords = "A/D conversion; Analog-digital conversion; average
uniform density; bandlimited functions; bandlimited
signals; binary sequences; Costs; interpolation;
Interpolation; irregular sequence; Lagrangian
functions; Lagrangian interpolation; linear low-pass
filtering; low-pass filters; oversampled
analog-to-digital conversion; pi-bandlimited signal;
Predictive models; quantisation (signal); Quantization;
quantized irregular samples; sample estimation; Signal
analysis; signal reconstruction; Signal resolution;
signal sampling; Signal sampling; Statistical
analysis",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@InProceedings{Das:2002:WBL,
author = "B. Das and S. Banerjee",
title = "A wavelet based low complexity embedded block coding
algorithm",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999995",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999995",
acknowledgement = ack-nhfb,
}
@Article{Deorowicz:2002:SSA,
author = "Sebastian Deorowicz",
title = "Second step algorithms in the {Burrows--Wheeler}
compression algorithm",
journal = j-SPE,
volume = "32",
number = "2",
pages = "99--111",
month = feb,
year = "2002",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.426",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Fri Feb 22 12:06:59 MST 2002",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/88013462/START;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=88013462&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@InProceedings{Drinic:2002:PPC,
author = "M. Drinic and D. Kirovski",
title = "{PPMexe}: {PPM} for compressing software",
crossref = "Storer:2002:DPD",
pages = "192--201",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999957",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999957",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Drmota:2002:PAR,
author = "M. Drmota and Hsien-Kuei Hwang and W. Szpankowski",
title = "Precise average redundancy of an idealized arithmetic
coding",
crossref = "Storer:2002:DPD",
pages = "222--231",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999960",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999960",
acknowledgement = ack-nhfb,
}
@InProceedings{Dumitrescu:2002:GOU,
author = "S. Dumitrescu and Xiaolin Wu and Zhe Wang",
title = "Globally optimal uneven error-protected packetization
of scalable code streams",
crossref = "Storer:2002:DPD",
pages = "73--82",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999945",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999945",
acknowledgement = ack-nhfb,
}
@InProceedings{Effros:2002:CCO,
author = "M. Effros and D. Muresan",
title = "Codecell contiguity in optimal fixed-rate and
entropy-constrained network scalar quantizers",
crossref = "Storer:2002:DPD",
pages = "312--321",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999969",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999969",
acknowledgement = ack-nhfb,
}
@InProceedings{Eriksson:2002:ICM,
author = "T. Eriksson and M. Novak and J. B. Anderson",
title = "Image coding with the {MAP} criterion",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999996",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999996",
acknowledgement = ack-nhfb,
}
@InProceedings{Farber:2002:QUE,
author = "B. Farber and K. Zeger",
title = "Quantizers with uniform encoders and channel optimized
decoders",
crossref = "Storer:2002:DPD",
pages = "292--301",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999967",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999967",
acknowledgement = ack-nhfb,
}
@Article{Fenwick:2002:VLI,
author = "P. Fenwick",
title = "Variable-Length Integer Codes Based on the {Goldbach
Conjecture}, and Other Additive Codes",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "48",
number = "8",
pages = "2412--2417",
month = aug,
year = "2002",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/tit.2002.800483",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Information Theory",
rawdata = "Fenwick, P. (2002), ``Variable-Length Integer Codes
Based on the Goldbach Conjecture, and Other Additive
Codes,'' {\it IEEE Transactions on Information Theory},
{\bf48}(8):2412--2417, August.",
}
@InProceedings{Forchhammer:2002:PCP,
author = "S. Forchhammer and J. M. Salinas",
title = "Progressive coding of palette images and digital
maps",
crossref = "Storer:2002:DPD",
pages = "362--371",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999974",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999974",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:2002:JEC,
author = "J. E. Fowler and Y. Wang",
title = "Joint embedded coding of data and grid using
first-generation wavelet transforms",
crossref = "Storer:2002:DPD",
pages = "432--441",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999983",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999983",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:2002:OBM,
author = "J. E. Fowler and Li Hua",
title = "Omnidirectionally balanced multiwavelets for vector
wavelet transforms",
crossref = "Storer:2002:DPD",
pages = "422--431",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999982",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999982",
acknowledgement = ack-nhfb,
}
@Article{Gandoin:2002:PLC,
author = "Pierre-Marie Gandoin and Olivier Devillers",
title = "Progressive lossless compression of arbitrary
simplicial complexes",
journal = j-TOG,
volume = "21",
number = "3",
pages = "372--379",
month = jul,
year = "2002",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/566654.566591",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Sat Nov 23 17:40:46 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Gibbons:2002:EAS,
author = "Alan Gibbons and Ida Pu and Muthu Muthukrishnan",
title = "Exact Analyses of a Simple Heuristic Employed in Array
Compression",
journal = j-COMP-J,
volume = "45",
number = "2",
pages = "213--220",
month = "????",
year = "2002",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/45.2.213",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Apr 4 07:33:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_02/450213.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_02/pdf/450213.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Gibson:2002:DLW,
author = "D. Gibson and M. Spann and S. I. Woolley",
title = "Diagnostically lossless {$3$D} wavelet compression for
digital angiogram video",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999997",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999997",
acknowledgement = ack-nhfb,
}
@InProceedings{Guleryuz:2002:IDI,
author = "O. G. Guleryuz",
title = "Iterated denoising for image recovery",
crossref = "Storer:2002:DPD",
pages = "3--12",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999938",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999938",
acknowledgement = ack-nhfb,
}
@InProceedings{Hamzaoui:2002:RBV,
author = "R. Hamzaoui and V. Stankovic and Zixiang Xiong",
title = "Rate-based versus distortion-based optimal joint
source-channel coding",
crossref = "Storer:2002:DPD",
pages = "63--72",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999944",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999944",
acknowledgement = ack-nhfb,
}
@Article{Hayden:2002:TQC,
author = "Patrick Hayden and Richard Jozsa and Andreas Winter",
title = "Trading quantum for classical resources in quantum
data compression",
journal = j-J-MATH-PHYS,
volume = "43",
number = "9",
pages = "4404--4444",
month = sep,
year = "2002",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.1497184",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Tue Dec 16 11:35:55 MST 2003",
bibsource = "http://www.aip.org/ojs/jmp.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
}
@InProceedings{He:2002:IFG,
author = "Yuwen He and Xuejun Zhao and Yuzhuo Zhong and Shiqiang
Yang",
title = "Improved fine granular scalable coding with interlayer
prediction",
crossref = "Storer:2002:DPD",
pages = "172--181",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999955",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999955",
acknowledgement = ack-nhfb,
}
@InProceedings{Hong:2002:EGC,
author = "E. S. Hong and R. E. Ladner",
title = "Extended {Golomb} codes for binary {Markov} sources",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999999",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999999",
acknowledgement = ack-nhfb,
}
@InProceedings{Hong:2002:OCR,
author = "B. Hong and A. Nosratinia",
title = "Overhead-constrained rate-allocation for scalable
video transmission over networks",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999998",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999998",
acknowledgement = ack-nhfb,
}
@InProceedings{Hosang:2002:CEA,
author = "M. Hosang",
title = "A character elimination algorithm for lossless data
compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000000",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000000",
acknowledgement = ack-nhfb,
}
@Misc{ITU-T264:2002:AVC,
author = "{ITU-T264}",
title = "{ITU-T Recommendation H.264, ISO/IEC 11496-10:
Advanced Video Coding}",
pages = "??",
month = sep,
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Final Committee Draft, Document JVT-E022.",
acknowledgement = ack-ds,
rawdata = "ITU-T264 (2002) ITU-T Recommendation H.264, ISO/IEC
11496-10, ``Advanced Video Coding,'' Final Committee
Draft, Document JVT-E022, September.",
}
@Article{Iwata:2002:LZC,
author = "Kazunori Iwata and Naohiro Ishii",
title = "{Lempel--Ziv} Coding in Reinforcement Learning",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2412",
pages = "531--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:19 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2412.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2412/24120531.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2412/24120531.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Jagmohan:2002:MDC,
author = "A. Jagmohan and K. Ratakonda",
title = "Multiple description coding of predictively encoded
sequences",
crossref = "Storer:2002:DPD",
pages = "13--22",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999939",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999939",
acknowledgement = ack-nhfb,
}
@Article{Jiang:2002:ESF,
author = "Jianmin Jiang and Baofeng Guo and Pengjie Li",
title = "Extracting Shape Features in {JPEG}-2000 Compressed
Images",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2457",
pages = "123--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2457.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2457/24570123.htm;
http://link.springer.de/link/service/series/0558/papers/2457/24570123.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kelsey:2002:CIL,
author = "John Kelsey",
title = "Compression and Information Leakage of Plaintext",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "263--276",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 25 06:55:26 2003",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650263.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650263.pdf",
abstract = "Cryptosystems like AES and triple-DES are designed to
encrypt a sequence of input bytes (the plaintext) into
a sequence of output bytes (the ciphertext) in such a
way that the output carries no information about that
plaintext except its length. In recent years, concerns
have been raised about `side-channel' attacks on
various cryptosystems-attacks that make use of some
kind of leaked information about the cryptographic
operations (e.g., power consumption or timing) to
defeat them. In this paper, we describe a somewhat
different kind of side-channel provided by data
compression algorithms, yielding information about
their inputs by the size of their outputs. The
existence of some information about a compressor's
input in the size of its output is obvious; here, we
discuss ways to use this apparently very small leak of
information in surprisingly powerful ways.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kim:2002:RCU,
author = "Hyun Mun Kim and Hyung-Suk Kim and T. Acharya",
title = "Rate control using conditional mean estimator",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000001",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000001",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2002:SCD,
author = "S. T. Klein and D. Shapira",
title = "Searching in compressed dictionaries",
crossref = "Storer:2002:DPD",
pages = "142--151",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999952",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999952",
acknowledgement = ack-nhfb,
}
@InProceedings{Kliewer:2002:CFO,
author = "J. Kliewer and R. Thobaben",
title = "Combining {FEC} and optimal soft-input source decoding
for the reliable transmission of correlated
variable-length encoded signals",
crossref = "Storer:2002:DPD",
pages = "83--91",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999946",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999946",
acknowledgement = ack-nhfb,
}
@InProceedings{Kochman:2002:APV,
author = "Y. Kochman and R. Zamir",
title = "Adaptive parametric vector quantization by natural
type selection",
crossref = "Storer:2002:DPD",
pages = "392--401",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999979",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999979",
acknowledgement = ack-nhfb,
}
@InProceedings{Kopylov:2002:CTC,
author = "P. Kopylov and P. Franti",
title = "Context tree compression of multi-component map
images",
crossref = "Storer:2002:DPD",
pages = "212--221",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999959",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999959",
acknowledgement = ack-nhfb,
}
@Misc{Korn:2002:RVG,
author = "D. Korn and J. MacDonald and J. Mogul and K. Vo",
title = "{RFC 3284}: The {VCDIFF} Generic Differencing and
Compression Data Format",
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.internic.net/rfc/rfc3284.txt",
acknowledgement = ack-ds,
rawdata = "Korn D., et al. (2002) ``The VCDIFF Generic
Differencing and Compression Data Format,'' RFC 3284,
June 2002, available on the Internet as text file
``rfc3284.txt''.",
}
@InProceedings{Krivoulets:2002:CST,
author = "A. Krivoulets",
title = "On coding of sources with two-sided geometric
distribution using binary decomposition",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000002",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000002",
acknowledgement = ack-nhfb,
}
@Article{Kutil:2002:OBA,
author = "R. Kutil",
title = "Optimization of Bitstream Assembly in Parallel
Multimedia Compression",
journal = j-PARALLEL-DIST-COMP-PRACT,
volume = "5",
number = "3",
pages = "??--??",
month = sep,
year = "2002",
CODEN = "????",
ISSN = "1097-2803",
bibdate = "Thu Sep 2 12:08:56 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.scpe.org/content/5/3.toc",
acknowledgement = ack-nhfb,
fjournal = "PDCP: Parallel and Distributed Computing Practices",
}
@InProceedings{Lakhani:2002:UMH,
author = "G. Lakhani",
title = "Using multiple {Huffman} code tables for optimal
coding of {DCT} blocks",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000003",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000003",
acknowledgement = ack-nhfb,
}
@Article{Lakovic:2002:DEC,
author = "Ksenija Lakovi{\'c} and John Villasenor",
title = "On Design of Error-Correcting Reversible Variable
Length Codes",
journal = j-IEEE-COMMUN-LET,
volume = "6",
number = "8",
pages = "337--339",
month = aug,
year = "2002",
CODEN = "ICLEF6",
DOI = "https://doi.org/10.1109/lcomm.2002.802041",
ISSN = "1089-7798 (print), 1558-2558 (electronic)",
ISSN-L = "1089-7798",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Communications Letters",
rawdata = "Lakovi\'c, Ksenija and John Villasenor (2002) ``On
Design of Error-Correcting Reversible Variable Length
Codes,'' {\it IEEE Communications Letters},
{\bf6}(8):337--339, August.",
}
@Article{Lefebvre:2002:CLL,
author = "Arnaud Lefebvre and Thierry Lecroq",
title = "{Compror}: On-line lossless data compression with a
factor oracle",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "1",
pages = "1--6",
day = "16",
month = jul,
year = "2002",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/s0020-0190(01)00308-8",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@PhdThesis{Lehman:2002:AAG,
author = "Eric Allen Lehman",
title = "Approximation algorithms for grammar-based data
compression",
type = "{Ph.D.} thesis",
school = "Massachusetts Institute of Technology",
address = "Cambridge, MA, USA",
pages = "????",
year = "2002",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305445788",
acknowledgement = ack-nhfb,
advisor = "Madhu Sudan",
classification = "0984: Computer science",
dissertation-thesis-number = "0804007",
subject = "Computer science",
}
@InProceedings{Li:2002:ECP,
author = "Xin Li",
title = "Embedded coding of palette images in the topological
space",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000005",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000005",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2002:LBR,
author = "Xin Li",
title = "Low bit rate image coding in the scale space",
crossref = "Storer:2002:DPD",
pages = "33--42",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999941",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999941",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2002:LCI,
author = "Fei Li and J. Nieh",
title = "Low-complexity interpolation coding for server-based
computing",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000004",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000004",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2002:SCA,
author = "J. Li",
title = "A source coding approach to classification by vector
quantization and the principle of minimum description
length",
crossref = "Storer:2002:DPD",
pages = "382--391",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999978",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999978",
acknowledgement = ack-nhfb,
}
@InProceedings{Liddell:2002:ICM,
author = "M. Liddell and A. Moffat",
title = "Incremental calculation of minimum-redundancy
length-restricted codes",
crossref = "Storer:2002:DPD",
pages = "182--191",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999956",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999956",
acknowledgement = ack-nhfb,
}
@Article{Logeswaran:2002:RBN,
author = "R. Logeswaran and C. Eswaran",
title = "Radial Basis Neural Network for Lossless Data
Compression",
journal = j-INT-J-COMPUT-APPL,
volume = "24",
number = "1",
pages = "14--19",
year = "2002",
DOI = "https://doi.org/10.1080/1206212X.2002.11441655",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:20:07 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2002.11441655",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "10 Jul 2015",
}
@Article{Loia:2002:FRC,
author = "Vincenzo Loia and Witold Pedrycz and Salvatore Sessa",
title = "Fuzzy relation calculus in the compression and
decompression of fuzzy relations",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "2",
number = "4",
pages = "617--??",
month = oct,
year = "2002",
CODEN = "????",
DOI = "https://doi.org/10.1142/s0219467802000871",
ISSN = "0219-4678",
bibdate = "Thu Jan 06 07:38:12 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Lozano:2002:QFE,
author = "A. C. Lozano and J. Kovacevic and M. Andrews",
title = "Quantized frame expansions in a wireless environment",
crossref = "Storer:2002:DPD",
pages = "232--241",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999961",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999961",
acknowledgement = ack-nhfb,
}
@Article{Marion-Poty:2002:WDS,
author = "V. Marion-Poty and Wilfrid Lefer",
title = "A wavelet decomposition scheme and compression method
for streamline-based vector field visualizations",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "26",
number = "6",
pages = "899--906",
month = dec,
year = "2002",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/S0097-8493(02)00178-4",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Tue Jan 27 12:04:28 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849302001784",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Marquant:2002:PPT,
author = "G. Marquant",
title = "Perceptual preprocessing techniques applied to video
compression: some result elements and analysis",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000006",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000006",
acknowledgement = ack-nhfb,
}
@InProceedings{Mecking:2002:MDM,
author = "M. Mecking and T. Stockhammer",
title = "Minimizing distortion via multiuser resource
allocation",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000007",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000007",
acknowledgement = ack-nhfb,
}
@InProceedings{Mitran:2002:TSC,
author = "P. Mitran and J. Bajcsy",
title = "Turbo source coding: a noise-robust approach to data
compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000008",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000008",
acknowledgement = ack-nhfb,
}
@Book{Moffat:2002:CCA,
author = "Alistair Moffat and Andrew Turpin",
title = "Compression and Coding Algorithms",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Moffat, Alistair and Andrew Turpin (2002) {\it
Compression and Coding Algorithms}, Norwell, MA, Kluwer
Academic.",
}
@InProceedings{Mohr:2002:BAS,
author = "A. E. Mohr",
title = "Bit allocation in sub-linear time and the
multiple-choice knapsack problem",
crossref = "Storer:2002:DPD",
pages = "352--361",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999973",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999973",
acknowledgement = ack-nhfb,
}
@InProceedings{Muresan:2002:QHS,
author = "D. Muresan and M. Effros",
title = "Quantization as histogram segmentation: globally
optimal scalar quantizer design in network systems",
crossref = "Storer:2002:DPD",
pages = "302--311",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999968",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999968",
acknowledgement = ack-nhfb,
}
@Article{Navarro:2002:ITU,
author = "Gonzalo Navarro",
title = "Indexing Text Using the {Ziv--Lempel} Trie",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2476",
pages = "325--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:37 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2476.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2476/24760325.htm;
http://link.springer.de/link/service/series/0558/papers/2476/24760325.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nelson:2002:IIJ,
author = "Mark R. Nelson",
title = "Inside {Intel}'s {JPEG} Library",
journal = j-DDJ,
volume = "27",
number = "7",
pages = "38, 40, 42, 44",
month = jul,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Fri Sep 13 06:15:52 MDT 2002",
bibsource = "http://www.ddj.com/articles/2002/0207/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/ftp/2002/2002_07/slide.zip",
abstract = "Mark examines Intel's Win32 JPEG Library, presents a
slideshow application he built to test it, and compares
Intel's library to Microsoft's standard IPicture
component. Additional resources include slide.zip
(source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Neogi:2002:CTA,
author = "A. Neogi and Tzi-cker Chiueh",
title = "Compression techniques for active video content",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000009",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000009",
acknowledgement = ack-nhfb,
}
@InProceedings{Niedermeier:2002:MBF,
author = "U. Niedermeier and J. Heuer and A. Hutter and W.
Stechele",
title = "{MPEG-7} binary format for {XML} data",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000010",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000010",
acknowledgement = ack-nhfb,
}
@Article{Nilsson:2002:ESC,
author = "S. Nilsson and M. Tikkanen",
title = "An Experimental Study of Compression Methods for
Dynamic Tries",
journal = j-ALGORITHMICA,
volume = "33",
number = "1",
pages = "19--33",
month = jan,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-001-0102-y",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68P30 (68P05)",
MRnumber = "MR1888538",
bibdate = "Fri Jan 6 11:38:15 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=33&issue=1;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Experimental algorithms",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=33&issue=1&spage=19",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
}
@InProceedings{Niu:2002:DBE,
author = "Yan Niu",
title = "{DWT}-based error concealment techniques",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000023",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000023",
acknowledgement = ack-nhfb,
}
@Article{Okazaki:2002:DCM,
author = "Takumi Okazaki and Kunihiko Sadakane and Hiroshi
Imai",
title = "Data Compression Method Combining Properties of {PPM}
and {CTW}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2281",
pages = "268--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:10 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2281.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2281/22810268.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2281/22810268.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Pereira:2002:MB,
author = "Fernando Pereira and Touradj Ebrahimi",
title = "The {MPEG-4} Book",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Pereira, Fernando and Touradj Ebrahimi (2002) {\it The
MPEG-4 Book}, Upper Saddle River, NJ, Prentice-Hall.",
}
@TechReport{Pigeon:2002:TCN,
author = "Steven Pigeon",
title = "Taboo Codes: New Classes of Universal Codes",
type = "Report",
institution = "Universit{\'e} de Montr{\'e}al",
address = "Montr{\'e}al, QC, Canada",
day = "17",
month = jan,
year = "2002",
bibdate = "Tue Jan 29 11:18:13 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "http://www.iro.umontreal.ca/~brassard/SEMINAIRES/taboo.ps",
acknowledgement = ack-nhfb,
}
@InProceedings{Ponomarenko:2002:CIB,
author = "N. N. Ponomarenko and K. Egiazarian and V. V. Lukin
and J. T. Astola",
title = "Compression of image block means for non-equal block
size partition schemes using {Delaunay} triangulation
and prediction",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000011",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000011",
acknowledgement = ack-nhfb,
}
@InProceedings{Puri:2002:CMD,
author = "R. Puri and S. S. Pradhan and K. Ramchandran",
title = "$n$-channel multiple descriptions: theory and
constructions",
crossref = "Storer:2002:DPD",
pages = "262--271",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999964",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999964",
acknowledgement = ack-nhfb,
}
@InProceedings{Randall:2002:LDF,
author = "K. H. Randall and R. Stata and R. G. Wickremesinghe
and J. L. Wiener",
title = "The Link Database: fast access to graphs of the
{Web}",
crossref = "Storer:2002:DPD",
pages = "122--131",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999950",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999950",
acknowledgement = ack-nhfb,
}
@InProceedings{Rath:2002:SDP,
author = "G. Rath and C. Guillemot",
title = "Syndrome decoding and performance analysis of {DFT}
codes with bursty erasures",
crossref = "Storer:2002:DPD",
pages = "282--291",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999966",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999966",
acknowledgement = ack-nhfb,
}
@InProceedings{Rautio:2002:SMS,
author = "J. Rautio and J. Tanninen and J. Tarhio",
title = "String matching with stopper compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000012",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000012",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2002:IBT,
author = "Y. A. Reznik and W. Szpankowski",
title = "Improved behaviour of tries by the
{``symmetrization''} of the source",
crossref = "Storer:2002:DPD",
pages = "372--381",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999975",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999975",
acknowledgement = ack-nhfb,
}
@InProceedings{Ristov:2002:MCL,
author = "S. Ristov and E. Laporte",
title = "A method for compressing lexicons",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000013",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000013",
acknowledgement = ack-nhfb,
}
@Article{Rytter:2002:ALZ,
author = "Wojciech Rytter",
title = "Application of {Lempel--Ziv} Factorization to the
Approximation of Grammar-Based Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2373",
pages = "20--??",
year = "2002",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1016/s0304-3975(02)00777-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2373.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2373/23730020.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2373/23730020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Salomon:2002:CSD,
author = "David Salomon",
title = "Correlation in Statistics and in Data Compression",
pages = "8",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.davidsalomon.name/DC2advertis/Corr.pdf",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "corr.pdf (2002)
|http://www.davidsalomon.name/DC2advertis/Corr.pdf|.",
}
@Book{Salomon:2002:GDC,
author = "David Salomon",
title = "A Guide to Data Compression Methods",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 295",
year = "2002",
ISBN = "0-387-95260-8 (paperback)",
ISBN-13 = "978-0-387-95260-4 (paperback)",
LCCN = "QA76.9.D33 S28 2001",
bibdate = "Tue Mar 12 16:09:14 2002",
bibsource = "clas.caltech.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
URL = "http://www.booksbydavidsalomon.com/",
acknowledgement = ack-nhfb,
tableofcontents = "1. Statistical Methods \\
1. Entropy \\
2. Variable-Size Codes \\
3. Decoding \\
4. Huffman Coding \\
5. Adaptive Huffman Coding \\
6. Facsimile Compression \\
7. Arithmetic Coding \\
8. Adaptive Arithmetic Coding \\
2. Dictionary Methods \\
1. LZ77 (Sliding Window) \\
2. LZSS \\
3. LZ78 \\
4. LZW \\
5. Summary \\
3. Image Compression \\
1. Introduction \\
2. Image Types \\
3. Approaches to Image Compression \\
4. Intuitive Methods \\
5. Image Transforms \\
6. Progressive Image Compression \\
7. JPEG \\
8. JPEG-LS \\
4. Wavelet Methods \\
1. Averaging and Differencing \\
2. The Haar Transform \\
3. Subband Transforms \\
4. Filter Banks \\
5. Deriving the Filter Coefficients \\
6. The DWT \\
7. Examples \\
8. The Daubechies Wavelets \\
9. SPIHT \\
5. Video Compression \\
1. Basic Principles \\
2. Suboptimal Search Methods \\
6. Audio Compression \\
1. Sound \\
2. Digital Audio \\
3. The Human Auditory System \\
4. Conventional Methods \\
5. MPEG-1 Audio Layers \\
Joining the Data Compression Community \\
App. of Algorithms",
}
@TechReport{Scherer:2002:BMC,
author = "Markus W. Scherer and Mark Davis",
title = "{BOCU-1}: {MIME}-Compatible {Unicode} Compression",
type = "{Unicode} Technical Note",
number = "6",
institution = pub-UNICODE,
address = pub-UNICODE-SAN-JOSE:adr,
day = "9",
month = aug,
year = "2002",
bibdate = "Tue Nov 05 14:21:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unicode.bib",
note = "Last revision: 2006-02-04.",
URL = "http://www.unicode.org/notes/tn6/",
acknowledgement = ack-nhfb,
lastaccess = "27 January 2013",
rawdata = "BOCU-1 (2002) |http://www.unicode.org/notes/tn6/|.",
}
@Article{Scott:2002:AAO,
author = "David A. Scott",
title = "Algorithm Alley: Optimal {EOF} Handling with
Arithmetic Compression",
journal = j-DDJ,
volume = "27",
number = "1",
pages = "99, 102",
month = jan,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ddj.com/ftp/2002/2002_01/aa0102.zip",
abstract = "When it comes to compression, properly handling the
end of the bitstream requires modeling what is really
happening. David examines one way to do this using
arithmetic coding. Additional resources include {\tt
aa0102.zip} (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Shekhar:2002:DDA,
author = "S. Shekhar and Yan Huang and J. Djugash",
title = "Dictionary design algorithms for vector map
compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000014",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000014",
acknowledgement = ack-nhfb,
}
@InProceedings{Shkarin:2002:POS,
author = "D. Shkarin",
title = "{PPM}: one step to practicality",
crossref = "Storer:2002:DPD",
pages = "202--211",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999958",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999958",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Simard:2002:LAI,
author = "P. Simard and D. Steinkraus and H. Malvar",
title = "On-line adaptation in image coding with a {$2$-D} tarp
filter",
crossref = "Storer:2002:DPD",
pages = "23--32",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999940",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999940",
acknowledgement = ack-nhfb,
}
@InProceedings{Srinivasamurthy:2002:RCQ,
author = "N. Srinivasamurthy and A. Ortega",
title = "Reduced complexity quantization under classification
constraints",
crossref = "Storer:2002:DPD",
pages = "402--411",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999980",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999980",
acknowledgement = ack-nhfb,
}
@Article{Staller:2002:IJS,
author = "Alexander Staller and Peter Dillinger and Reinhard
M{\"a}nner",
title = "Implementation of the {JPEG} 2000 Standard on a Virtex
1000 {FPGA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "503--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380503.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380503.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Szymczak:2002:OEE,
author = "A. Szymczak",
title = "Optimized Edgebreaker encoding for large and regular
triangle meshes",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000015",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000015",
acknowledgement = ack-nhfb,
}
@Book{Tanenbaum:2002:CN,
author = "Andrew S. Tanenbaum",
title = "Computer Networks",
publisher = pub-PH,
address = pub-PH:adr,
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Tanenbaum, Andrew S. (2002) {\it Computer Networks},
Upper Saddle River, NJ, Prentice Hall.",
}
@Book{Taubman:2002:JIC,
author = "David S. Taubman and Michael W. Marcellin",
title = "{JPEG 2000}, Image Compression Fundamentals, Standards
and Practice",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Taubman, David S., and Michael W. Marcellin (2002)
{\it JPEG 2000, Image Compression Fundamentals,
Standards and Practice}, Norwell, MA, Kluwer
Academic.",
}
@InProceedings{Tham:2002:DLC,
author = "Wei-Ching Tham and S. I. Woolley and S. Cribbs and D.
Anderson",
title = "Diagnostically lossless compression of pipeline
inspection data",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000016",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000016",
acknowledgement = ack-nhfb,
}
@InProceedings{Titchener:2002:CPA,
author = "M. R. Titchener",
title = "Compressor performance, absolutely!",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000017",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000017",
acknowledgement = ack-nhfb,
}
@TechReport{Trendafilov:2002:ZED,
author = "Dimitre Trendafilov and Nasir Memon and Torsten Suel",
title = "{Zdelta}: An Efficient Delta Compression Tool",
type = "Technical Report",
number = "TR-CIS-2002-02",
institution = "Polytechnic Institute of New York University",
address = "New York, NY, USA",
pages = "??",
year = "2002",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Trendafilov, Dimitre, Nasir Memon, and Torsten Suel
(2002) ``Zdelta: An Efficient Delta Compression Tool,''
Technical Report TR-CIS-2002-02, New York, NY,
Polytechnic University.",
remark = "No URL found on 27 January 2013.",
}
@InProceedings{Tsai:2002:COM,
author = "Chang-Ming Tsai and Wen-Yan Chang and Chu-Song Chen
and G. Y. Tang",
title = "Compression of {$3$D} objects with multistage
color-depth panoramic maps",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000018",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000018",
acknowledgement = ack-nhfb,
}
@InProceedings{Tuncel:2002:ZES,
author = "E. Tuncel and P. Koulgi and S. Regunathan and K.
Rose",
title = "Zero-error source coding with maximum distortion
criterion",
crossref = "Storer:2002:DPD",
pages = "92--101",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999947",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999947",
acknowledgement = ack-nhfb,
}
@InProceedings{vanderVleuten:2002:IES,
author = "R. J. {van der Vleuten}",
title = "Improved elastic storage of digital still images",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000019",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000019",
acknowledgement = ack-nhfb,
}
@InProceedings{vanderVleuten:2002:LCL,
author = "R. J. {van der Vleuten}",
title = "Low-complexity lossless and fine-granularity scalable
near-lossless compression of color images",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000020",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000020",
acknowledgement = ack-nhfb,
}
@PhdThesis{Volf:2002:WTD,
author = "Paulus Adrianus Jozef Volf",
title = "Weighting techniques in data compression: Theory and
algorithms",
type = "Doctoral thesis",
school = "Technische Universiteit Eindhoven",
address = "Eindhoven, The Netherlands",
pages = "175 (or 185??)",
year = "2002",
ISBN = "90-386-1980-4",
ISBN-13 = "978-90-386-1980-4",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305446928",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering; 0984: Computer
science; 9998: No UMI subject assigned",
subject = "No UMI subject assigned",
}
@InProceedings{Wakin:2002:ICU,
author = "M. Wakin and J. Romberg and Hyeokho Choi and R.
Baraniuk",
title = "Image compression using an efficient edge cartoon +
texture model",
crossref = "Storer:2002:DPD",
pages = "43--52",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999942",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999942",
acknowledgement = ack-nhfb,
}
@InProceedings{Wei:2002:RSV,
author = "Ming Wei and Hongyang Chao",
title = "Rate scalable video compression based on flexible
block wavelet coding technique",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000021",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000021",
acknowledgement = ack-nhfb,
}
@InProceedings{Wilson:2002:WBL,
author = "J. P. Wilson",
title = "Wavelet-based lossy compression of barotropic
turbulence simulation data",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000022",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000022",
acknowledgement = ack-nhfb,
}
@Article{Wu:2002:DRT,
author = "Hsien-Chu Wu and Chin-Chen Chang",
title = "Detection and restoration of tampered {JPEG}
compressed images",
journal = j-J-SYST-SOFTW,
volume = "64",
number = "2",
pages = "151--161",
day = "15",
month = nov,
year = "2002",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/s0164-1212(02)00033-x",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:10 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Wu:2002:OMR,
author = "Xiaolin Wu and S. Dumitrescu",
title = "On optimal multi-resolution scalar quantization",
crossref = "Storer:2002:DPD",
pages = "322--331",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999970",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999970",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:2002:LRC,
author = "Zhen Yao and N. Rajpoot",
title = "Less redundant codes for variable size dictionaries",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000024",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000024",
acknowledgement = ack-nhfb,
}
@InProceedings{Yong:2002:NTB,
author = "Xuerong Yong and M. J. Golin",
title = "New techniques for bounding the channel capacity of
read\slash write isolated memory",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000025",
bibdate = "Tue Feb 5 14:07:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000025",
acknowledgement = ack-nhfb,
}
@PhdThesis{Yuan:2002:SDP,
author = "Ding Ya Yuan",
title = "Study on Data Processing and Compression of Cobalt-60
Digital Radiographic System",
type = "{D.Eng.}",
school = "Tsinghua University",
address = "Tsinghua, Peoples Republic of China",
year = "2002",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024721621",
acknowledgement = ack-nhfb,
advisor = "Ji Gang An and Zhi Fang Wu and Zhi Fang",
classification = "9998: No UMI subject assigned",
dissertation-thesis-number = "H095616",
subject = "No UMI subject assigned",
}
@Article{Zhang:2002:DCT,
author = "Youtao Zhang and Rajiv Gupta",
title = "Data Compression Transformations for Dynamically
Allocated Data Structures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2304",
pages = "14--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:22 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2304.htm;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2304/23040014.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2304/23040014.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Zhang:2002:PMC,
author = "Youtao Zhang and R. Gupta",
title = "Path matching in compressed control flow traces",
crossref = "Storer:2002:DPD",
pages = "132--141",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999951",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999951",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2002:CCM,
author = "Yafan Zhao and I. E. G. Richardson",
title = "Computational complexity management of motion
estimation in video encoders",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000026",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000026",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2002:DCC,
author = "Ying Zhao and J. Garcia-Frias",
title = "Data compression of correlated non-binary sources
using punctured turbo codes",
crossref = "Storer:2002:DPD",
pages = "242--251",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999962",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999962",
acknowledgement = ack-nhfb,
}
@MastersThesis{Zhu:2002:SDN,
author = "Ping Zhu",
title = "Special data network protocol analysis, data
compression and interface circuit",
type = "{M.Eng.}",
school = "University of Electronic Science and Technology of
China",
address = "Chengdu, Peoples Republic of China",
year = "2002",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024708479",
acknowledgement = ack-nhfb,
advisor = "Zai Ming Li",
classification = "0489: Information Technology",
dissertation-thesis-number = "H047242",
subject = "Information Technology",
}
@InProceedings{Zyto:2002:SDM,
author = "S. Zyto and A. Grama and W. Szpankowski",
title = "Semi-discrete matrix transforms ({SDD}) for image and
video compression",
crossref = "Storer:2002:DPD",
pages = "??--??",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.1000027",
bibdate = "Tue Feb 5 14:07:05 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1000027",
acknowledgement = ack-nhfb,
}
@InProceedings{Aaron:2003:WZC,
author = "A. Aaron and S. Rane and Rui Zhang and B. Girod",
title = "{Wyner--Ziv} coding for video: applications to
compression and error resilience",
crossref = "Storer:2003:DPD",
pages = "93--102",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194000",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194000",
acknowledgement = ack-nhfb,
}
@InProceedings{Alecu:2003:OED,
author = "A. Alecu and A. Munteanu and P. Schelkens and J.
Cornelis and S. Dewitte",
title = "On the optimality of embedded deadzone
scalar-quantizers for wavelet-based
{$L$}-infinite-constrained image coding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194032",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194032",
acknowledgement = ack-nhfb,
}
@Article{Aljifri:2003:ITU,
author = "Hassan Aljifri and Marcel Smets and Alexander Pons",
title = "{IP} Traceback using header compression",
journal = j-COMPUT-SECUR,
volume = "22",
number = "2",
pages = "136--151",
month = feb,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:51 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803002128",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Apostolico:2003:CWF,
author = "A. Apostolico and L. Parida",
title = "Compression and the wheel of fortune",
crossref = "Storer:2003:DPD",
pages = "143--152",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194005",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194005",
acknowledgement = ack-nhfb,
}
@InProceedings{Awan:2003:SRA,
author = "A. M. Awan and N. M. Rajpoot and S. A. Husain",
title = "Stack-run adaptive wavelet image coding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194033",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194033",
acknowledgement = ack-nhfb,
}
@InProceedings{Banerjee:2003:TRU,
author = "S. Banerjee and M. J. Gormish",
title = "The transport of reversible and unreversible embedded
wavelets ({TRUEW})",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194034",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194034",
acknowledgement = ack-nhfb,
}
@Article{Bar-Joseph:2003:CHC,
author = "Ziv Bar-Joseph and Daniel Cohen-Or",
title = "Compression: Hierarchical Context-based Pixel
Ordering",
journal = j-CGF,
volume = "22",
number = "3",
pages = "349--358",
month = sep,
year = "2003",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00682",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 15:15:56 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "4 Nov 2003",
}
@InProceedings{Behr:2003:ECE,
author = "F. Behr and V. Fossum and M. Mitzenmacher and D.
Xiao",
title = "Estimating and comparing entropies across written
natural languages using {PPM} compression",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194035",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194035",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Bilgin:2003:DCJ,
author = "A. Bilgin and Zhenyu Wu and M. W. Marcellin",
title = "Decompression of corrupt {JPEG2000} codestreams",
crossref = "Storer:2003:DPD",
pages = "123--132",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194003",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194003",
acknowledgement = ack-nhfb,
}
@Book{Bosi:2003:IDA,
author = "Marina Bosi and Richard E. Goldberg",
title = "Introduction To Digital Audio Coding and Standards",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Bosi, Marina, and Richard E. Goldberg (2003) {\it
Introduction To Digital Audio Coding and Standards},
Boston, MA, Kluwer Academic.",
}
@InProceedings{Butterman:2003:ERB,
author = "L. Butterman and N. Memon",
title = "An error-resilient blocksorting compression
algorithm",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194036",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194036",
acknowledgement = ack-nhfb,
}
@InProceedings{Chakareski:2003:RDO,
author = "J. Chakareski and B. Girod",
title = "Rate-distortion optimized packet scheduling and
routing for media streaming with path diversity",
crossref = "Storer:2003:DPD",
pages = "203--212",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194011",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194011",
acknowledgement = ack-nhfb,
}
@Article{Chandra:2003:TDC,
author = "A. Chandra and K. Chakrabarty",
title = "Test data compression and test resource partitioning
for system-on-a-chip using frequency-directed
run-length ({FDR}) codes",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "8",
pages = "1076--1088",
month = aug,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1223641",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:53 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1223641",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Charrier:2003:NVM,
author = "C. Charrier and T. Eude",
title = "A new visual masking tool for {JPEG2000}",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194037",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194037",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2003:OAP,
author = "D. Chen and Yi-Jen Chiang and N. Memon and Xiaolin
Wu",
title = "Optimal alphabet partitioning for semi-adaptive coding
of sources of unknown sparse distributions",
crossref = "Storer:2003:DPD",
pages = "372--381",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194028",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194028",
acknowledgement = ack-nhfb,
}
@InProceedings{Cho:2003:IER,
author = "Sungdae Cho and W. A. Pearlman",
title = "Improved error resilient embedded video coding",
crossref = "Storer:2003:DPD",
pages = "83--92",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193999",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193999",
acknowledgement = ack-nhfb,
}
@InProceedings{Chou:2003:TTB,
author = "J. Chou and S. S. Pradhan and K. Ramchandran",
title = "Turbo and trellis-based constructions for source
coding with side information",
crossref = "Storer:2003:DPD",
pages = "33--42",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193994",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193994",
acknowledgement = ack-nhfb,
}
@Article{Cinque:2003:WOP,
author = "L. Cinque and S. De Agostino and F. Liberati",
title = "A Work-Optimal Parallel Implementation of Lossless
Image Compression by Block Matching",
journal = j-NORDIC-J-COMPUT,
volume = "10",
number = "1",
pages = "13--??",
month = "Spring",
year = "2003",
CODEN = "NJCOFR",
ISSN = "1236-6064",
bibdate = "Wed Dec 24 09:24:58 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Selected papers of the Prague Stringology Conference
(PSC'02), September 23--24, 2002.",
acknowledgement = ack-nhfb,
fjournal = "Nordic Journal of Computing",
}
@Article{Corliss:2003:DID,
author = "Marc L. Corliss and E. Christopher Lewis and Amir
Roth",
title = "A {DISE} implementation of dynamic code
decompression",
journal = j-SIGPLAN,
volume = "38",
number = "7",
pages = "232--243",
month = jul,
year = "2003",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/780731.780765",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Oct 11 12:45:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@InProceedings{Cumming:2003:CRD,
author = "I. Cumming and Jing Wang",
title = "Compression of {RADARSAT} data with block adaptive
wavelets",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194038",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194038",
acknowledgement = ack-nhfb,
}
@InProceedings{Dai:2003:BCC,
author = "Vito Dai and A. Zakhor",
title = "Binary combinatorial coding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194039",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194039",
acknowledgement = ack-nhfb,
}
@InProceedings{Das:2003:NRA,
author = "Bipul Das and S. Banerjee",
title = "A novel {RAM} architecture for bit-plane based
coding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194040",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194040",
acknowledgement = ack-nhfb,
}
@InProceedings{DeAgostino:2003:AWO,
author = "S. {De Agostino}",
title = "Almost work-optimal {PRAM EREW} decoders of {LZ}
compressed text",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194041",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194041",
acknowledgement = ack-nhfb,
}
@InProceedings{Dong:2003:RDB,
author = "Yanting Dong and L. Carin",
title = "Rate-distortion bound for joint compression and
classification",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194042",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194042",
acknowledgement = ack-nhfb,
}
@InProceedings{Drinic:2003:PMC,
author = "M. Drinic and D. Kirovski and M. Potkonjak",
title = "{PPM} model cleaning",
crossref = "Storer:2003:DPD",
pages = "163--172",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194007",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194007",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Dumitrescu:2003:OVR,
author = "S. Dumitrescu and Xiaolin Wu",
title = "Optimal variable rate multiplexing of scalable code
streams",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194043",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194043",
acknowledgement = ack-nhfb,
}
@InProceedings{Earl:2003:ESF,
author = "E. Earl and R. E. Ladner",
title = "Enhanced {Sequitur} for finding structure in data",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194044",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194044",
acknowledgement = ack-nhfb,
}
@InProceedings{Ebrahimi-Moghadam:2003:IFB,
author = "A. Ebrahimi-Moghadam and S. Shirani",
title = "Image foveation based on vector quantization",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194045",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194045",
acknowledgement = ack-nhfb,
}
@InProceedings{Effros:2003:SKL,
author = "M. Effros and Hanying Feng and K. Zeger",
title = "Suboptimality of the {Karhunen--Loeve} transform for
transform coding",
crossref = "Storer:2003:DPD",
pages = "293--302",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194020",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194020",
acknowledgement = ack-nhfb,
}
@InProceedings{Eriksson:2003:MCT,
author = "T. Eriksson and M. Novak and J. B. Anderson",
title = "{MAP} criterion trellis source coding for short data
sequences",
crossref = "Storer:2003:DPD",
pages = "43--52",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193995",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193995",
acknowledgement = ack-nhfb,
}
@Misc{Feldspar:2003:EDA,
author = "Antaeus Feldspar",
title = "An Explanation of the {{\em Deflate}} Algorithm",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "This article was originally posted to {\tt
comp.compression} on 23 August 1997.",
URL = "http://www.zlib.org/feldspar.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Feldspar (2003) |http://www.zlib.org/feldspar.html|.",
}
@InProceedings{Feng:2003:NSC,
author = "Hanying Feng and Qian Zhao and M. Effros",
title = "Network source coding using entropy constrained
dithered quantization",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194046",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194046",
acknowledgement = ack-nhfb,
}
@InProceedings{Fenwick:2003:BWA,
author = "P. Fenwick and M. Titchener and M. Lorenz",
title = "{Burrows Wheeler} --- alternatives to move to front",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194047",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194047",
acknowledgement = ack-nhfb,
}
@InProceedings{Florencio:2003:CSB,
author = "D. A. Florencio and P. Simard",
title = "Can the sample being transmitted be used to refine its
own {PDF} estimate?",
crossref = "Storer:2003:DPD",
pages = "233--242",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194014",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194014",
acknowledgement = ack-nhfb,
}
@MastersThesis{Fu:2003:RND,
author = "Min Fu",
title = "The Research on Nonlinear Data Compression and
Reconstruction Based on {MRA}",
type = "{M.S.}",
school = "Huazhong (Central China) University of Science and
Technology",
address = "Huazhong, Peoples Republic of China",
year = "2003",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024720586",
acknowledgement = ack-nhfb,
advisor = "Chang Fa Xu",
classification = "0364: Applied Mathematics",
dissertation-thesis-number = "H112073",
subject = "Applied Mathematics",
}
@Misc{Gailly:2003:ZMS,
author = "Jean-loup Gailly and Mark Adler and Greg Roelofs",
title = "{{\tt zlib}}: a Massively Spiffy Yet Delicately
Unobtrusive Compression Library (Also Free, Not to
Mention Unencumbered by Patents)",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.gzip.org/zlib/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Deflate (2003) |http://www.gzip.org/zlib/|.",
}
@Misc{Gailly:2003:ZTD,
author = "Jean-loup Gailly and Mark Adler and Greg Roelofs",
title = "{{\tt zlib}} Technical Details",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.zlib.org/zlib_tech.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "zlib (2003) |http://www.zlib.org/zlib_tech.html|.",
}
@InProceedings{Gastpar:2003:DPC,
author = "M. Gastpar and P.-L. Dragotti and M. Vetterli",
title = "The distributed, partial, and conditional
{Karhunen--Loeve} transforms",
crossref = "Storer:2003:DPD",
pages = "283--292",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194019",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194019",
acknowledgement = ack-nhfb,
}
@InProceedings{Ghido:2003:AOP,
author = "F. Ghido",
title = "An asymptotically optimal predictor for stereo
lossless audio compression",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194048",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194048",
acknowledgement = ack-nhfb,
}
@InProceedings{Golin:2003:RRT,
author = "M. J. Golin and Yiu-Cho Leung",
title = "Recurrence relations on transfer matrices yield good
lower and upper bounds on the channel capacity of some
2-dimensional constrained systems",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194049",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194049",
acknowledgement = ack-nhfb,
}
@PhdThesis{Gooda:2003:ATD,
author = "Abdel-Hamid Mohamed Gooda",
title = "Application of the techniques of data compression and
nearest neighbor classification to information
retrieval",
type = "{D.Sc.} thesis",
school = "The George Washington University",
address = "Washington, DC, USA",
pages = "????",
year = "2003",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305328703",
acknowledgement = ack-nhfb,
classification = "0984: Computer science",
dissertation-thesis-number = "0388180",
subject = "Computer science",
}
@InProceedings{Goshi:2003:ULP,
author = "J. Goshi and R. Ladner and A. Mohr and E. Riskin and
A. Lippman",
title = "Unequal loss protection for {H.263} compressed video",
crossref = "Storer:2003:DPD",
pages = "73--82",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193998",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193998",
acknowledgement = ack-nhfb,
}
@InProceedings{Graves:2003:RID,
author = "C. A. Graves",
title = "Recasting of the image deblocking problem into the
domain of image denoising",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194050",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194050",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:2003:HRM,
author = "R. M. Gray and T. Linder",
title = "High rate mismatch in entropy constrained
quantization",
crossref = "Storer:2003:DPD",
pages = "173--182",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194008",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194008",
acknowledgement = ack-nhfb,
}
@MastersThesis{Huang:2003:DCM,
author = "Zheng Huang",
title = "Data Compression Methods for Multisensor {Kalman}
Filter Fusion",
type = "{M.S.}",
school = "Sichuan University",
address = "Chengdu, Peoples Republic of China",
year = "2003",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024712628",
acknowledgement = ack-nhfb,
advisor = "Yun Min Zhu",
classification = "9998: No UMI subject assigned",
subject = "No UMI subject assigned",
}
@Article{Ibarria:2003:CCC,
author = "Lawrence Ibarria and Peter Lindstrom and Jarek
Rossignac and Andrzej Szymczak",
title = "Compression: Out-of-core compression and decompression
of large $n$-dimensional scalar fields",
journal = j-CGF,
volume = "22",
number = "3",
pages = "343--348",
month = sep,
year = "2003",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00681",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 15:15:56 MDT 2013",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "4 Nov 2003",
}
@Misc{ISO:2003:IOS,
author = "ISO",
title = "{International Organization for Standardization}",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.iso.ch/",
acknowledgement = ack-ds,
rawdata = "ISO (2003) |http://www.iso.ch/|.",
}
@Book{ISO:2003:ITH,
author = "ISO/IEC",
title = "{International Standard ISO/IEC 13818-7, Information
technology, Generic coding of moving pictures and
associated audio information, Part 7: Advanced Audio
Coding (AAC)}",
publisher = pub-ISO,
address = pub-ISO:adr,
edition = "Second",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Issued 2003-08-01.",
acknowledgement = ack-ds,
rawdata = "ISO/IEC (2003) International Standard ISO/IEC 13818-7,
``Information technology,% \hfil\break Generic coding
of moving pictures and associated audio information,
Part 7: Advanced Audio Coding (AAC),'' 2nd ed.,
2003-08-01.",
}
@InProceedings{Jagmohan:2003:WZE,
author = "A. Jagmohan and N. Ahuja",
title = "{Wyner--Ziv} encoded predictive multiple
descriptions",
crossref = "Storer:2003:DPD",
pages = "213--222",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194012",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194012",
acknowledgement = ack-nhfb,
}
@InProceedings{Jana:2003:OTC,
author = "Soumya Jana and P. Moulin",
title = "Optimal transform coding of {Gaussian} mixtures for
joint classification\slash reconstruction",
crossref = "Storer:2003:DPD",
pages = "313--322",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194022",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194022",
acknowledgement = ack-nhfb,
}
@Misc{JBIG2:2003:JD,
author = "{JBIG2}",
title = "{JBIG2} Development",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.jpeg.org/jbig/jbigpt2.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "JBIG2 (2003)
|http://www.jpeg.org/jbig/jbigpt2.html|.",
}
@Misc{JBIG:2003:JH,
author = "{JBIG (Joint Bi-level Image experts Group)}",
title = "{JBIG} Homepage",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.jpeg.org/jbig/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "JBIG (2003) |http://www.jpeg.org/jbig/index.html|.",
}
@InProceedings{Jia:2003:SAC,
author = "Yunwei Jia and En-Hui Yang and Da-Ke He and S. Chan",
title = "Speeding up arithmetic coding using greedy
re-normalization",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194051",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194051",
acknowledgement = ack-nhfb,
}
@Article{Jiang:2003:UEW,
author = "Zhuhan Jiang and Olivier de Vel and Bruce Litow",
title = "Unification and extension of weighted finite automata
applicable to image compression",
journal = j-THEOR-COMP-SCI,
volume = "302",
number = "1--3",
pages = "275--294",
day = "13",
month = jun,
year = "2003",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/s0304-3975(02)00846-0",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:40 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Kaufman:2003:ECS,
author = "Y. Kaufman and S. T. Klein",
title = "An efficient compression scheme supporting partial
decoding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194052",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194052",
acknowledgement = ack-nhfb,
}
@Article{Kerkyacharian:2003:RCC,
author = "G{\'e}rard Kerkyacharian and Dominique Picard",
title = "Replicant compression coding in {Besov} spaces",
journal = j-ESAIM-PROBAB-STATIST,
volume = "7",
number = "??",
pages = "239--??",
month = mar,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1051/ps:2003011",
ISSN = "1292-8100 (print), 1262-3318 (electronic)",
ISSN-L = "1262-3318",
bibdate = "Mon Feb 9 06:54:48 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/esaim-probab-stat.bib",
acknowledgement = ack-nhfb,
fjournal = "ESAIM: Probability and Statistics",
journal-URL = "http://www.edpsciences.org/ps/",
}
@InProceedings{Kim:2003:RTP,
author = "Junki Kim and Ho Suk Lee",
title = "Real-time preprocessing and video object segmentation
for high compression and content-based {MPEG-4}
coding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194053",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194053",
acknowledgement = ack-nhfb,
}
@InProceedings{Kirovski:2003:F,
author = "D. Kirovski and N. Jojic",
title = "{FaceCerts}",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194054",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194054",
acknowledgement = ack-nhfb,
}
@InProceedings{Kirsanov:2003:ALC,
author = "D. Kirsanov and S. J. Gortler",
title = "Arc-length compression",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194055",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194055",
acknowledgement = ack-nhfb,
}
@Article{Klein:2003:PHD,
author = "S. T. Klein and Y. Wiseman",
title = "Parallel {Huffman} Decoding with Applications to
{JPEG} Files",
journal = j-COMP-J,
volume = "46",
number = "5",
pages = "487--497",
month = sep,
year = "2003",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/46.5.487",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Aug 12 09:10:21 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_05/",
note = "This is an extended version of a paper that appeared
earlier in Klein, S. T. and Wiseman, Y. (2000) Proc.
Data Compression Conf. DCC'00, Snowbird, Utah, pp.
383--392. IEEE Computer Society Press, Los Alamitos,
CA.",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_05/460487.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_05/pdf/460487.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Kopansky:2003:ESC,
author = "A. Kopansky and M. Bystrom",
title = "Extending source codes for error resilience",
crossref = "Storer:2003:DPD",
pages = "23--32",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193993",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193993",
acknowledgement = ack-nhfb,
}
@InProceedings{Kopylov:2003:OLO,
author = "P. Kopylov and P. Franti",
title = "Optimal layer ordering in the compression of map
images",
crossref = "Storer:2003:DPD",
pages = "323--332",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194023",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194023",
acknowledgement = ack-nhfb,
}
@Article{Lakovic:2003:ACE,
author = "Ksenija Lakovi{\'c} and John Villasenor",
title = "An Algorithm for Construction of Efficient Fix-Free
Codes",
journal = j-IEEE-COMMUN-LET,
volume = "7",
number = "8",
pages = "391--393",
month = aug,
year = "2003",
CODEN = "ICLEF6",
DOI = "https://doi.org/10.1109/lcomm.2003.815660",
ISSN = "1089-7798 (print), 1558-2558 (electronic)",
ISSN-L = "1089-7798",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Communications Letters",
rawdata = "Lakovi\'c, Ksenija and John Villasenor (2003) ``An
Algorithm for Construction of Efficient Fix-Free
Codes,'' {\it IEEE Communications Letters},
{\bf7}(8):391--393, August.",
}
@InProceedings{Lavu:2003:EQG,
author = "S. Lavu and Hyeokio Choi and R. Baraniuk",
title = "Estimation-quantization geometry coding using normal
meshes",
crossref = "Storer:2003:DPD",
pages = "362--371",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194027",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194027",
acknowledgement = ack-nhfb,
}
@Article{Lee:2003:AMM,
author = "J.-S. Lee and W.-K. Hong and S.-D. Kim",
title = "Adaptive Methods to Minimize Decompression Overhead
for Compressed On-Chip Caches",
journal = j-INT-J-COMPUT-APPL,
volume = "25",
number = "2",
pages = "98--105",
year = "2003",
DOI = "https://doi.org/10.1080/1206212X.2003.11441690",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:20:50 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2003.11441690",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lemmerling:2003:EIS,
author = "Philippe Lemmerling and Nicola Mastronardi and Sabine
{Van Huffel}",
title = "Efficient implementation of a structured total least
squares based speech compression method",
journal = j-LINEAR-ALGEBRA-APPL,
volume = "366",
number = "C",
pages = "295--315",
day = "1",
month = jun,
year = "2003",
CODEN = "LAAPAW",
DOI = "https://doi.org/10.1016/s0024-3795(02)00465-2",
ISSN = "0024-3795 (print), 1873-1856 (electronic)",
ISSN-L = "0024-3795",
bibdate = "Fri Jun 20 08:19:37 MDT 2003",
bibsource = "http://www.elsevier.com/locate/laa;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/linala2000.bib",
note = "Special issue on Structured Matrices: Analysis,
Algorithms and Applications.",
URL = "http://www.elsevier.nl/gej-ng/10/30/19/215/25/42/abstract.html;
http://www.sciencedirect.com/science?_ob=GatewayURL&_origin=SOCJLA&_urlversion=4&_method=citationSearch&_version=1&_piikey=S0024379502004652&_volkey=00243795%23366%23295&_refkey=Lemmerling%232003%23295%23315&md5=dba27dbbdd79bc42830964db1b0f2c94",
acknowledgement = ack-nhfb,
fjournal = "Linear Algebra and its Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/00243795",
}
@InProceedings{Leontaris:2003:VCI,
author = "A. Leontaris and P. C. Cosman",
title = "Video compression with intra\slash inter mode
switching and a dual frame buffer",
crossref = "Storer:2003:DPD",
pages = "63--72",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193997",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193997",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2003:AIC,
author = "Xiuqi Li and Borko Furht",
booktitle = "{Proceeding of The Sixth International Conference on
Visual Information System 2003 (VIS2003), September
24--26}",
title = "An Approach to Image Compression Using
Three-Dimensional {DCT}",
publisher = "????",
address = "????",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Li, Xiuqi and Borko Furht (2003) ``An Approach to
Image Compression Using Three-Dimensional DCT,'' {\it
Proceeding of The Sixth International Conference on
Visual Information System 2003 (VIS2003)}, September
24--26.",
}
@Article{Li:2003:TDC,
author = "Lei Li and Krishnendu Chakrabarty and Nur A. Touba",
title = "Test data compression using dictionaries with
selective entries and fixed-length indices",
journal = j-TODAES,
volume = "8",
number = "4",
pages = "470--490",
month = oct,
year = "2003",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/944027.944032",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Oct 31 06:04:08 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@InProceedings{Liddell:2003:HPC,
author = "M. Liddell and A. Moffat",
title = "Hybrid prefix codes for practical use",
crossref = "Storer:2003:DPD",
pages = "392--401",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194030",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194030",
acknowledgement = ack-nhfb,
}
@Article{Lin:2003:EDC,
author = "Chun-Yuan Lin and Yeh-Ching Chung and Jen-Shiuh Liu",
title = "Efficient data compression methods for
multidimensional sparse array operations based on the
{EKMR} scheme",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "12",
pages = "1640--1646",
month = dec,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1252859",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:53:00 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1252859",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Liveris:2003:DCB,
author = "A. D. Liveris and Zixiang Xiong and C. N.
Georghiades",
title = "Distributed compression of binary sources using
conventional parallel and serial concatenated
convolutional codes",
crossref = "Storer:2003:DPD",
pages = "193--202",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194010",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194010",
acknowledgement = ack-nhfb,
}
@InProceedings{Lonardi:2003:JSC,
author = "S. Lonardi and W. Szpankowski",
title = "Joint source-channel {LZ'77} coding",
crossref = "Storer:2003:DPD",
pages = "273--282",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194018",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194018",
acknowledgement = ack-nhfb,
}
@InProceedings{Lu:2003:KSC,
author = "Yue Lu and Chew Lim Tan",
title = "Keyword searching in compressed document images",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194056",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194056",
acknowledgement = ack-nhfb,
}
@Article{Mahapatra:2003:PAA,
author = "Nihar R. Mahapatra and Jiangjiang Liu and Krishnan
Sundaresan",
title = "The performance advantage of applying compression to
the memory system",
journal = j-SIGPLAN,
volume = "38",
number = "2s",
pages = "86--96",
month = feb,
year = "2003",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/773039.773048",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu May 15 12:23:14 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Malvar:2003:LCT,
author = "H. S. Malvar and A. Hallapuro and M. Karczewicz and L.
Kerofsky",
title = "Low-Complexity Transform and Quantization in
{H.264\slash AVC}",
journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH,
volume = "13",
number = "7",
pages = "598--603",
month = jul,
year = "2003",
CODEN = "ITCTEM",
DOI = "https://doi.org/10.1109/tcsvt.2003.814964",
ISSN = "1051-8215 (print), 1558-2205 (electronic)",
ISSN-L = "1051-8215",
bibdate = "Sun Jan 27 09:22:54 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://research.microsoft.com/pubs/77882/MalvarCSVTJuly03.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Circuits and Systems for Video
Technology",
}
@Article{Mannan:2003:BHC,
author = "M. Abdul Mannan and M. Kaykobad",
title = "Block {Huffman} coding",
journal = j-COMPUT-MATH-APPL,
volume = "46",
number = "10--11",
pages = "1581--1587",
month = nov # "\slash " # dec,
year = "2003",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/s0898-1221(03)90193-3",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:30 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122103901933",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Mary:2003:SOT,
author = "D. Mary and D. T. M. Slock",
title = "On the suboptimality of orthogonal transforms for
single- or multi-stage lossless transform coding",
crossref = "Storer:2003:DPD",
pages = "303--312",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194021",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194021",
acknowledgement = ack-nhfb,
}
@InProceedings{Matsuo:2003:IPC,
author = "Yoshihiro Matsuo and Shigeyuki Okada and Kazuhiko
Taketa and Tatsushi Ohyama and Yuh Matsuda and Tsugio
Mori and Shin'ichiro Okada and Tsuyoshi Watanabe and
Tatsuya Ichikawa Yuji Yamada and Hideki Yamauchi and
Yoshifumi Matsushita",
title = "An Image Processor Capable of Block-noise-free
{JPEG2000} Compression with 30 frames/s for Digital
Camera Applications",
crossref = "Anonymous:2003:CCV",
pages = "??--??",
year = "2003",
bibdate = "Fri Jan 09 17:02:42 2004",
bibsource = "http://www.coolchips.org/cool6/pdfDocuments/WEB05-Program_COOL6_2003.4.1.pdf;
https://www.math.utah.edu/pub/tex/bib/cool-chips.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Misc{Meridian:2003:MHP,
author = "Meridian",
title = "{Meridian} home page",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.meridian-audio.com/",
acknowledgement = ack-ds,
rawdata = "Meridian (2003) |http://www.meridian-audio.com/|.",
}
@Article{Milenkovic:2003:SBT,
author = "A. Milenkovic and M. Milenkovic",
title = "Stream-Based Trace Compression",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "2",
number = "1",
pages = "4--4",
month = jan,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/L-CA.2003.7",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Fri Jun 21 05:49:19 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Trace-driven simulation has long been used in both
processor and memory studies. The large size of traces
motivated different techniques for trace reduction.
These techniques often combine standard compression
algorithms with trace-specific solutions, taking into
account the tradeoff between reduction in the trace
size and simulation slowdown due to decompression. This
paper introduces SBC, a new algorithm for instruction
and data address trace compression based on instruction
streams. The proposed technique significantly reduces
trace size and simulation time, and it is orthogonal to
general compression algorithms. When combined with
gzip, SBC reduces the size of SPEC CPU2000 traces
94-71968 times.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Architecture Letters",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Clocks; Compression algorithms; Computational
modeling; Computer architecture; Computer simulation;
Data mining; Information analysis; instruction and
address trace; Instruments; Predictive models;
Redundancy; simulation; trace compression",
}
@InProceedings{Milidiu:2003:FDM,
author = "R. L. Milidiu and E. S. Laber and L. O. Moreno and J.
C. Duarte",
title = "A fast decoding method for prefix codes",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194057",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194057",
acknowledgement = ack-nhfb,
}
@InProceedings{Min:2003:XQC,
author = "Jun-Ki Min and Myung-Jae Park and Chin-Wan Chung",
title = "{XPRESS}: a queriable compression for {XML} data",
crossref = "ACM:2003:PAS",
pages = "122--133",
year = "2003",
bibdate = "Fri Oct 31 08:03:18 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib;
https://www.math.utah.edu/pub/tex/bib/sgml2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Mitin:2003:PSI,
author = "Alexander V. Mitin and Jon Baker and Krzysztof
Wolinski and Peter Pulay",
title = "Parallel stored-integral and semidirect
{Hartree--Fock} and {DFT} methods with data
compression",
journal = j-J-COMPUT-CHEM,
volume = "24",
number = "2",
pages = "154--160",
day = "30",
month = jan,
year = "2003",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.10152",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:54:42 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "9 Dec 2002",
}
@InProceedings{Mitra:2003:CDE,
author = "Tulika Mitra and Tzi-cker Chiueh",
title = "Compression-domain editing of {$3$D} models",
crossref = "Storer:2003:DPD",
pages = "343--352",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194025",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194025",
acknowledgement = ack-nhfb,
}
@Misc{MNG:2003:MMI,
author = "{MNG Group}",
title = "{MNG (Multiple-image Network Graphics)} Format Version
1.0",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.libpng.org/pub/mng/spec/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "MNG (2003) |http://www.libpng.org/pub/mng/spec/|.",
}
@InProceedings{Modha:2003:CPQ,
author = "D. S. Modha",
title = "Codelet parsing: quadratic-time, sequential, adaptive
algorithms for lossy compression",
crossref = "Storer:2003:DPD",
pages = "223--232",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194013",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194013",
acknowledgement = ack-nhfb,
}
@InProceedings{Motta:2003:CHI,
author = "G. Motta and F. Rizzo and J. A. Storer",
title = "Compression of hyperspectral imagery",
crossref = "Storer:2003:DPD",
pages = "333--342",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194024",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194024",
acknowledgement = ack-nhfb,
}
@Article{Na:2003:TST,
author = "Joong Chae Na and Alberto Apostolico and Costas S.
Iliopoulos and Kunsoo Park",
title = "Truncated suffix trees and their application to data
compression",
journal = j-THEOR-COMP-SCI,
volume = "304",
number = "1--3",
pages = "87--101",
day = "28",
month = jul,
year = "2003",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/s0304-3975(03)00053-7",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:44 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Nagy:2003:ESB,
author = "D. A. Nagy and T. Linder",
title = "Experimental study of a binary block sorting
compression scheme",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194058",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194058",
acknowledgement = ack-nhfb,
}
@Article{OConnell:2003:PJD,
author = "S. J. O'Connell and N. Winterbottom",
title = "Performing joins without decompression in a compressed
database system",
journal = j-SIGMOD,
volume = "32",
number = "1",
pages = "6--11",
month = mar,
year = "2003",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/640990.640991",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jan 12 07:43:36 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}
@InProceedings{Okada:2003:NDC,
author = "Y. Okada and K. Terazono",
title = "A new delta compression algorithm suitable for program
updating in embedded systems",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194059",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194059",
acknowledgement = ack-nhfb,
}
@InProceedings{Oliver:2003:FES,
author = "J. Oliver and M. P. Malumbres",
title = "Fast and efficient spatial scalable image compression
using wavelet lower trees",
crossref = "Storer:2003:DPD",
pages = "133--142",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194004",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194004",
acknowledgement = ack-nhfb,
}
@InProceedings{Orlitsky:2003:PUC,
author = "A. Orlitsky and N. P. Santhanam",
title = "Performance of universal codes over infinite
alphabets",
crossref = "Storer:2003:DPD",
pages = "402--410",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194031",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194031",
acknowledgement = ack-nhfb,
}
@InProceedings{Orpaz:2003:PMM,
author = "A. Orpaz and S. Weiss",
title = "Pattern matching by means of multi-resolution
compression",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194060",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194060",
acknowledgement = ack-nhfb,
}
@InProceedings{Patra:2003:VMI,
author = "A. Patra and M. D. Wang",
title = "Volumetric medical image compression and
reconstruction for interactive visualization in
surgical planning",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194061",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194061",
acknowledgement = ack-nhfb,
}
@InProceedings{Percival:2003:ABS,
author = "Colin Percival",
booktitle = "Proceedings of BSDCon '03",
title = "An Automated Binary Security Update System For
{FreeBSD}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "29--34",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Percival, Colin (2003a) ``An Automated Binary Security
Update System For FreeBSD,'' {\it Proceedings of BSDCon
'03}, PP. 29--34.",
}
@TechReport{Percival:2003:NDE,
author = "Colin Percival",
title = "Na{\"\i}ve Differences of Executable Code",
institution = "Computing Lab, Oxford University",
address = "Oxford, UK",
pages = "3",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.daemonology.net/papers/bsdiff.pdf",
acknowledgement = ack-ds,
rawdata = "Percival, Colin (2003b) ``Naive Differences of
Executable Code,'' Computing Lab, Oxford University.
Available from\hfil\break
|http://www.daemonology.net/papers/bsdiff.pdf|",
}
@InProceedings{Pereira:2003:MDC,
author = "M. Pereira and M. Antonini and M. Barlaud",
title = "Multiple description coding for noisy-varying
channels",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194062",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194062",
acknowledgement = ack-nhfb,
}
@Article{Pierzchala:2003:CWO,
author = "Stephen Pierzchala",
title = "Compressing {Web} Output Using {{\tt mod\_gzip}} and
{Apache}",
journal = j-LOGIN,
volume = "28",
number = "2",
pages = "??--??",
month = apr,
year = "2003",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:52:26 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib;
http://www.usenix.org/publications/login/2003-04/index.html",
URL = "http://www.usenix.org/publications/login/2003-04/pdfs/pierzchala.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@InProceedings{Pigeon:2003:SCR,
author = "S. Pigeon and Xiaolin Wu",
title = "Searchable compressed representation of very sparse
bitmaps",
crossref = "Storer:2003:DPD",
pages = "353--361",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194026",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194026",
acknowledgement = ack-nhfb,
}
@Misc{PKWare:2003:PHP,
author = "{PKWare}",
title = "{PKWare} home page",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.pkware.com/",
acknowledgement = ack-ds,
rawdata = "PKWare (2003) |http://www.pkware.com|.",
}
@InProceedings{Poss:2003:DCO,
author = "Meikel P{\"o}ss and Dmitry Potapov",
title = "Data Compression in {Oracle}",
crossref = "Freytag:2003:VPI",
pages = "937--947",
year = "2003",
bibdate = "Mon Dec 22 18:34:17 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2003.html",
URL = "http://www.vldb.org/dblp/db/indices/a-tree/p/P=ouml=ss:Meikel.html",
acknowledgement = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/p/P=ouml=ss:Meikel.html;
http://www.vldb.org/dblp/db/indices/a-tree/p/Potapov:Dmitry.html",
}
@InProceedings{Prakash:2003:SFS,
author = "J. Prakash and C. Sandeep and P. Shankar and Y. N.
Srikant",
title = "A simple and fast scheme for code compression for
{VLIW} processors",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194063",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194063",
acknowledgement = ack-nhfb,
}
@InProceedings{Qi:2003:DBM,
author = "Xiaojun Qi and J. M. Tyler",
title = "Differentiation-based multi-resolution approach for
lossless image compression",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194064",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194064",
acknowledgement = ack-nhfb,
}
@InProceedings{Rebmann:2003:ACC,
author = "R. Rebmann and G. Krell and U. Seiffert and B.
Michaelis",
title = "Associative correction of compression artefacts with a
self-organizing map classifying the image content",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194065",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194065",
acknowledgement = ack-nhfb,
}
@InProceedings{Rebollo-Monedero:2003:DOQ,
author = "D. Rebollo-Monedero and Rui Zhang and B. Girod",
title = "Design of optimal quantizers for distributed source
coding",
crossref = "Storer:2003:DPD",
pages = "13--22",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193992",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193992",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2003:ARR,
author = "Y. A. Reznik and A. V. Anisimov",
title = "On the average redundancy rate of adaptive block codes
under mixed sources",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194066",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194066",
acknowledgement = ack-nhfb,
}
@Book{Richardson:2003:HMV,
author = "Iain G. Richardson",
title = "{H.264} and {MPEG-4} Video Compression Video Coding
for Next-generation Multimedia",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Richardson, Iain G. (2003) {\it H.264 and MPEG-4 Video
Compression Video Coding for Next-generation
Multimedia}, Chichester, West Sussex, UK, John Wiley
and Sons",
}
@Misc{Roelofs:2003:PPN,
author = "Greg Roelofs",
key = "PNG",
title = "{PNG: Portable Network Graphics}: an Open, Extensible
Image Format with Lossless Compression",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.libpng.org/pub/png/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "PNG (2003) |http://www.libpng.org/pub/png/|.",
}
@Article{Rytter:2003:ALZ,
author = "Wojciech Rytter",
title = "Application of {Lempel--Ziv} factorization to the
approximation of grammar-based compression",
journal = j-THEOR-COMP-SCI,
volume = "302",
number = "1--3",
pages = "211--222",
day = "13",
month = jun,
year = "2003",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/s0304-3975(02)00777-6",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:40 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{Salomon:2003:DPS,
author = "David Salomon",
title = "Data Privacy and Security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 465",
year = "2003",
ISBN = "0-387-00311-8",
ISBN-13 = "978-0-387-00311-5",
LCCN = "QA76.9.A25 S265 2003",
bibdate = "Mon Jun 16 18:35:35 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
price = "US\$59.95",
URL = "http://www.booksbydavidsalomon.com/",
abstract = "This integrated volume focuses on keeping data secure
and private and covers classical cryptography, modern
cryptography, and steganography. Each topic is
presented and explained by describing various methods,
techniques, and algorithms. Moreover, there are
numerous helpful examples to reinforce the reader's
understanding and expertise with these techniques and
methodologies.",
acknowledgement = ack-nhfb,
tableofcontents = "Part I: Data Encryption \\
1: Monoalphabetic Substitution Ciphers \\
2: Transposition Ciphers \\
3: Polyalphabetic Substitution Ciphers \\
4: Random Numbers \\
5: The Enigma \\
6: Stream Ciphers \\
7: Block Ciphers \\
8: Public-Key Cryptography \\
9: Quantum Cryptography \\
Part II: Data Hiding \\
10: Data Hiding in Text \\
11: Data Hiding in Images \\
12: Data Hiding: Other Methods \\
Part III: Essential Resources \\
Appendix A: Convolution \\
Appendix B: Hashing \\
Appendix C: Cyclic Redundancy Codes \\
Appendix D: Galois Fields",
}
@InProceedings{Saponara:2003:LPV,
author = "Sergio Saponara and Luca Fanucci and Pierangelo
Terren",
booktitle = "Midwest Symposium on Circuits and Systems (MWSCAS)",
title = "Low-Power {VLSI} Architectures for {3D} Discrete
Cosine Transform ({DCT})",
publisher = "????",
address = "????",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Saponara, Sergio, Luca Fanucci, Pierangelo Terren
(2003) ``Low-Power VLSI Architectures for 3D Discrete
Cosine Transform (DCT),'' in {\it Midwest Symposium on
Circuits and Systems (MWSCAS)}.",
}
@InProceedings{Savari:2003:CIC,
author = "S. A. Savari",
title = "On compressing interchange classes of events in a
concurrent system",
crossref = "Storer:2003:DPD",
pages = "153--162",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194006",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194006",
acknowledgement = ack-nhfb,
}
@InProceedings{Sehgal:2003:RPC,
author = "A. Sehgal and N. Ahuja",
title = "Robust predictive coding and the {Wyner--Ziv}
problem",
crossref = "Storer:2003:DPD",
pages = "103--112",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194001",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194001",
acknowledgement = ack-nhfb,
}
@InProceedings{Sermadevi:2003:LPO,
author = "Y. Sermadevi and S. S. Hemami",
title = "Linear programming optimization for video coding under
multiple constraints",
crossref = "Storer:2003:DPD",
pages = "53--62",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193996",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193996",
acknowledgement = ack-nhfb,
}
@InProceedings{Shapira:2003:PDF,
author = "D. Shapira and J. A. Storer",
title = "In-place differential file compression",
crossref = "Storer:2003:DPD",
pages = "263--272",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194017",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194017",
acknowledgement = ack-nhfb,
}
@Misc{Softsound:2003:U,
author = "Softsound",
title = "[unknown]",
pages = "??",
year = "2003, 2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See also \cite{Robinson:1994:SSL}.",
URL = "http://mi.eng.cam.ac.uk/reports/ajr/TR156/tr156.html;
http://www.softsound.com/Shorten.html",
acknowledgement = ack-ds,
rawdata = "Softsound (2003) was
|http://www.softsound.com/Shorten.html| but try also
URL\hfil\break
|http://mi.eng.cam.ac.uk/reports/ajr/TR156/tr156.html|.",
remark = "SoftSound URL no longer accessible on 27 January 2013.
The Cambridge URL works on that day.",
}
@InProceedings{Sun:2003:DBM,
author = "Welfeng Sun and Nan Zhang and A. Mukherjee",
title = "A dictionary-based multi-corpora text compression
system",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194067",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194067",
acknowledgement = ack-nhfb,
}
@Book{Symes:2003:MD,
author = "Peter D. Symes",
title = "{MPEG-4} Demystified",
publisher = "McGraw-Hill Professional",
address = "New York, NY, USA",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Symes, Peter D. (2003) {\it MPEG-4 Demystified}, New
York, NY, McGraw-Hill Professional.",
}
@InProceedings{Tabus:2003:DSC,
author = "I. Tabus and G. Korodi and J. Rissanen",
title = "{DNA} sequence compression using the normalized
maximum likelihood model for discrete regression",
crossref = "Storer:2003:DPD",
pages = "253--262",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194016",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194016",
acknowledgement = ack-nhfb,
}
@InProceedings{Tang:2003:CSP,
author = "Xiaoli Tang and Sungdae Cho and W. A. Pearlman",
title = "Comparison of {$3$D} set partitioning methods in
hyperspectral image compression featuring an improved
{$3$D}-{SPIHT}",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194068",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194068",
acknowledgement = ack-nhfb,
}
@InProceedings{Tang:2003:RAS,
author = "Wenye Tang and Tao He and J. D. Gibson",
title = "Realization adaptive strategies and a comparison of
{Fourier} bandwidth, {Shannon} bandwidth, and
{Campbell} bandwidth",
crossref = "Storer:2003:DPD",
pages = "243--252",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194015",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194015",
acknowledgement = ack-nhfb,
}
@Article{Theisel:2003:CCV,
author = "H. Theisel and Ch. R{\"o}ssl and H.-P. Seidel",
title = "Compression: Compression of {$2$D} Vector Fields Under
Guaranteed Topology Preservation",
journal = j-CGF,
volume = "22",
number = "3",
pages = "333--342",
month = sep,
year = "2003",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/1467-8659.00680",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 15:15:56 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "4 Nov 2003",
}
@InProceedings{Tian:2003:CCS,
author = "Tao Tian and J. Garcia-Frias and Wei Zhong",
title = "Compression of correlated sources using {LDPC} codes",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194069",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194069",
acknowledgement = ack-nhfb,
}
@InProceedings{Tian:2003:UMD,
author = "Chao Tian and S. S. Hemami",
title = "Universal multiple description scalar quantization:
analysis and design",
crossref = "Storer:2003:DPD",
pages = "183--192",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194009",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194009",
acknowledgement = ack-nhfb,
}
@Article{Triantafyllidis:2003:EAE,
author = "G. A. Triantafyllidis and M. Varnuska and D. Sampson
and D. Tzovaras and M. G. Strintzis",
title = "An efficient algorithm for the enhancement of
{JPEG}-coded images",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "27",
number = "4",
pages = "529--534",
month = aug,
year = "2003",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/s0097-8493(03)00088-8",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Tue Jan 27 12:04:28 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00978493",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Tsaig:2003:OFL,
author = "Yaakov Tsaig and Michael Elad and Gene H. Golub and
Peyman Milanfar",
booktitle = "{2003 International Conference on Image Processing,
2003. ICIP 2003. Proceedings}",
title = "Optimal framework for low bit-rate block coders",
volume = "2",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "II-219--II-222 (vol. 3)",
year = "2003",
DOI = "https://doi.org/10.1109/ICIP.2003.1246656",
bibdate = "Tue Mar 5 07:53:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1246656",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8824",
keywords = "data compression",
xxnote = "Resolve volume number conflict in IEEE Xplore data.",
}
@Misc{Unicode:2003:UCH,
author = "Unicode",
title = "The {Unicode Consortium} home page",
pages = "??",
year = "2003, 2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://unicode.org/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Unicode (2003) |http://unicode.org/|.",
}
@Misc{Unisys:2003:UCH,
author = "{Unisys}",
title = "{UNISYS Corporation} home page",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.unisys.com",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Unisys (2003) |http://www.unisys.com|.",
}
@Misc{UPX:2003:UUP,
author = "{UPX}",
title = "{UPX: Ultimate Packer for Executables}",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://upx.sourceforge.net/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "UPX (2003) |http://upx.sourceforge.net/|.",
}
@InProceedings{Usevitch:2003:JEB,
author = "B. E. Usevitch",
title = "{JPEG2000} extensions for bit plane coding of floating
point data",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194070",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194070",
acknowledgement = ack-nhfb,
}
@Article{Wang:2003:DRT,
author = "Ching-Te Wang and Tung-Shou Chen and Shao-Hau He",
title = "Detecting and restoring the tampered images based on
iteration-free fractal compression",
journal = j-J-SYST-SOFTW,
volume = "67",
number = "2",
pages = "131--140",
day = "15",
month = aug,
year = "2003",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/s0164-1212(02)00094-8",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:15 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wick:2003:OOR,
author = "Michael R. Wick",
editor = "Scott Grissom and Deborah Knox and Dan Joyce and Wanda
Dann",
title = "An Object-Oriented Refactoring of {Huffman} Encoding
using the {Java} Collections Framework",
journal = j-SIGCSE,
volume = "35",
number = "1",
pages = "283--287",
month = jan,
year = "2003",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/611892.611988;
https://doi.org/10.1145/792548.611988",
ISBN = "1-58113-648-X",
ISBN-13 = "978-1-58113-648-7",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:56:59 MST 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/conf/sigcse/sigcse2003.html#Wick03;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib;
Ingenta database",
URL = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/java.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2003.bib",
abstract = "Computer science has a relatively stable collection of
time-tested pedagogical programming examples. With the
infusion of object-oriented concepts into the core
computer science curriculum, many of these examples are
being replaced with newer examples that are more
focused on demonstrating the particular object-oriented
features of interest. But classic computer science
examples can be refactored to include the important
object-oriented topics as well, all the while
maintaining the time-tested pedagogical benefits of the
original example. This paper presents a case study of
this refactoring by demonstrating how the classic
Huffman encoding example can be modeled to integrate
important object-oriented concepts.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Misc{Wikipedia:2003:NSS,
author = "{Wikipedia}",
title = "{Nyquist--Shannon} sampling theorem",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.wikipedia.org/wiki/Nyquist-Shannon_sampling_theorem",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Wikipedia (2003) is file
|Nyquist-Shannon_sampling_theorem| in\hfil\break
|http://www.wikipedia.org/wiki/|.",
}
@Misc{WinAce:2003:WHP,
author = "WinAce",
title = "{WinAce} home page",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.winace.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "WinAce (2003) |http://www.winace.com/|.",
}
@InProceedings{Wu:2003:CHD,
author = "Xintao Wu and D. Barbara",
title = "Compressing high dimensional datasets by fractals",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194071",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194071",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2003:EJS,
author = "Zhenyu Wu and A. Bilgin and M. W. Marcellin",
title = "An efficient joint source-channel rate allocation
scheme for {JPEG2000} codestreams",
crossref = "Storer:2003:DPD",
pages = "113--122",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194002",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194002",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2003:EVA,
author = "Yung-Gi Wu and Kuo-Lun Fan",
title = "An efficient {VQ} algorithm using mean value
predictive",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194073",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194073",
acknowledgement = ack-nhfb,
}
@InProceedings{Xie:2003:CCU,
author = "Yuan Xie and W. Wolf and H. Lekatsas",
title = "Code compression using variable-to-fixed coding based
on arithmetic coding",
crossref = "Storer:2003:DPD",
pages = "382--391",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194029",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194029",
acknowledgement = ack-nhfb,
}
@Misc{XMill:2003:XUC,
author = "XMill",
title = "{XMill} user-configurable {XML} compressor",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://sourceforge.net/projects/xmill/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "XMill (2003)
|http://sourceforge.net/projects/xmill/|.",
}
@Misc{XML:2003:XHP,
author = "{XML}",
title = "{XML} home page",
pages = "??",
year = "2003",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xml.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "XML (2003) |http://www.xml.com/|.",
}
@InProceedings{Yahampath:2003:SDB,
author = "P. Yahampath and M. Pawlak",
title = "Soft-decoding based vector quantization for
hidden-{Markov} channels",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194074",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194074",
acknowledgement = ack-nhfb,
}
@MastersThesis{Yan:2003:RPQ,
author = "Bin Ju Yan",
title = "Research for Power Quality Disturbance Recognition and
Disturbance Data Compression",
type = "{M.Eng.}",
school = "Sichuan University",
address = "Chengdu, People's Republic of China",
year = "2003",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024711625",
acknowledgement = ack-nhfb,
advisor = "Hong Geng Yang",
classification = "0544: Electrical engineering",
subject = "Electrical engineering",
}
@InProceedings{Yao:2003:PEG,
author = "Zhen Yao",
title = "Phrase elimination in greedy parsing dictionary coders
with deferred innovation",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194075",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194075",
acknowledgement = ack-nhfb,
}
@InProceedings{Yoon:2003:ICU,
author = "Sangho Yoon and Chee Sun Won and Kyungsuk Pyun and R.
M. Gray",
title = "Image classification using {GMM} with context
information and with a solution of singular covariance
problem",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194076",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194076",
acknowledgement = ack-nhfb,
}
@InProceedings{Yung-Gi:2003:DWS,
author = "Wu Yung-Gi",
title = "Dynamic window search and probability dominated
algorithm for fast vector quantization encoding",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194072",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194072",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2003:APM,
author = "Nan Zhang and A. Mukherjee and D. Adjeroh and T.
Bell",
title = "Approximate pattern matching using the
{Burrows--Wheeler} transform",
crossref = "Storer:2003:DPD",
pages = "??--??",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1194077",
bibdate = "Tue Feb 5 14:07:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1194077",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2003:LCC,
author = "Qian Zhao and M. Effros",
title = "Low complexity code design for lossless and
near-lossless side information source codes",
crossref = "Storer:2003:DPD",
pages = "3--12",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193991",
bibdate = "Tue Feb 5 14:07:20 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193991",
acknowledgement = ack-nhfb,
}
@MastersThesis{Zhen:2003:DIF,
author = "Cheng Zhen",
title = "Design and Implementation of Filesystem with Automatic
Data Compression and Decompression",
type = "{M.Eng.}",
school = "Tsinghua University",
address = "Tsinghua, Peoples Republic of China",
year = "2003",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024722244",
acknowledgement = ack-nhfb,
advisor = "Yue Zhang and Yue",
classification = "9998: No UMI subject assigned",
subject = "No UMI subject assigned",
}
@InProceedings{Abel:2004:RPD,
author = "J. Abel",
title = "Record preprocessing for data compression",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281497",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281497",
acknowledgement = ack-nhfb,
}
@InProceedings{Adiego:2004:LZC,
author = "J. Adiego and G. Navarro and P. de la Fuente",
title = "{Lempel--Ziv} compression of structured text",
crossref = "Storer:2004:DCC",
pages = "112--121",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281456",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281456",
acknowledgement = ack-nhfb,
}
@InProceedings{Adiego:2004:MPP,
author = "J. Adiego and P. de la Puente and G. Navarro",
title = "Merging prediction by partial matching with structural
contexts model",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281498",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281498",
acknowledgement = ack-nhfb,
}
@InProceedings{Agarwal:2004:AGA,
author = "R. C. Agarwal and S. Amalapurapu and S. Jain",
title = "An approximation to the greedy algorithm for
differential compression of very large files",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281499",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281499",
acknowledgement = ack-nhfb,
}
@InProceedings{Aghito:2004:CBC,
author = "S. M. Aghito and S. Forchhammer",
title = "Context based coding of binary shapes by object
boundary straightness analysis",
crossref = "Storer:2004:DCC",
pages = "399--408",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281485",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281485",
acknowledgement = ack-nhfb,
}
@Article{Alameldeen:2004:ACC,
author = "Alaa R. Alameldeen and David A. Wood",
title = "Adaptive Cache Compression for High-Performance
Processors",
journal = j-COMP-ARCH-NEWS,
volume = "32",
number = "2",
pages = "212--212",
month = mar,
year = "2004",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/1028176.1006719",
ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Anonymous:2004:CPa,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2004:DCC",
pages = "iv--iv",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281443",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281443",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2004:WSF,
author = "Anonymous",
title = "Was that slip and fall for real? [video surveillance
and {VideoSave}]",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "5",
pages = "18--18",
month = may,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1296008",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Accidents; Cameras; Cities and towns; Data
compression; data compression; digital image; Image
coding; image compression; image recording; Image
storage; Insurance; insurance companies; Internet;
Internet access; MPEG-4 system; Surveillance;
surveillance; surveillance system; surveillance video
cameras; television applications; video coding; Video
recording; video recording; VideoSave system",
}
@InProceedings{Apostolico:2004:MZL,
author = "A. Apostolico and M. Comin and L. Parida",
title = "Motifs in {Ziv--Lempel-Welch Clef}",
crossref = "Storer:2004:DCC",
pages = "72--81",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281452",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281452",
acknowledgement = ack-nhfb,
}
@InProceedings{Babacan:2004:PIC,
author = "S. D. Babacan and K. Sayood",
title = "Predictive image compression using conditional
averages",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281500",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281500",
acknowledgement = ack-nhfb,
}
@InProceedings{Barnes:2004:SAS,
author = "C. F. Barnes",
title = "Successive approximation source coding and image
enabled data mining",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281501",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281501",
acknowledgement = ack-nhfb,
}
@InProceedings{Becker:2004:FRI,
author = "A. Becker and W. Chan and D. Poulouin",
title = "Flicker reduction in intraframe codecs",
crossref = "Storer:2004:DCC",
pages = "252--261",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281470",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281470",
acknowledgement = ack-nhfb,
}
@InProceedings{Bellaachia:2004:FSC,
author = "A. Bellaachia and I. A. L. Rassan",
title = "Fast searching over compressed text using a new coding
technique: tagged sub-optimal code ({TSC})",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281502",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281502",
acknowledgement = ack-nhfb,
}
@Article{Bertram:2004:GBS,
author = "Martin Bertram and Mark A. Duchaineau and Bernd Hamann
and Kenneth I. Joy",
title = "Generalized {B}-Spline Subdivision-Surface Wavelets
for Geometry Compression",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "10",
number = "3",
pages = "326--338",
month = may # "\slash " # jun,
year = "2004",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/tvcg.2004.1272731",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Sat Dec 11 17:06:09 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
URL = "http://csdl.computer.org/comp/trans/tg/2004/03/v0326abs.htm;
http://csdl.computer.org/dl/trans/tg/2004/03/v0326.htm;
http://csdl.computer.org/dl/trans/tg/2004/03/v0326.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@InProceedings{Bilgin:2004:WCE,
author = "A. Bilgin and M. W. Marcellin and M. I. Altbach",
title = "Wavelet compression of {ECG} signals by {JPEG2000}",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281503",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281503",
acknowledgement = ack-nhfb,
}
@InProceedings{Boldi:2004:WFC,
author = "Paolo Boldi and Sebastiano Vigna",
booktitle = "Proceedings of the 13th International World Wide Web
Conference (WWW 2004)",
title = "The {WebGraph Framework}. {I}: Compression
Techniques",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "595--601",
year = "2004",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Boldi, Paolo and Sebastiano Vigna (2004a), ``The
WebGraph Framework I: Compression Techniques,'' in {\it
Proceedings of the 13th International World Wide Web
Conference (WWW 2004)}, pages 595--601, New York, ACM
Press.",
}
@InProceedings{Boldi:2004:WFI,
author = "Paolo Boldi and Sebastiano Vigna",
title = "The {WebGraph Framework}. {II}: Codes for the
{World-Wide Web}",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281504",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281504",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Boldi, Paolo and Sebastiano Vigna (2004b), ``The
WebGraph Framework II: Codes for the World-Wide Web,''
{\it Data Compression Conference, DCC 2004}.",
}
@Article{Boussakta:2004:FAD,
author = "Said Boussakta and Hamoud O. Alshibami",
title = "Fast Algorithm for the {$3$-D DCT-II}",
journal = j-IEEE-TRANS-SIG-PROC,
volume = "52",
number = "4",
pages = "??--??",
year = "2004",
CODEN = "ITPRED",
DOI = "https://doi.org/10.1109/tsp.2004.823472",
ISSN = "1053-587X (print), 1941-0476 (electronic)",
ISSN-L = "1053-587X",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Signal Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78",
rawdata = "Boussakta, Said, and Hamoud O. Alshibami (2004) ``Fast
Algorithm for the 3-D DCT-II,'' {\it IEEE Transactions
on Signal Processing}, {\bf52}(4).",
}
@Article{Bretz:2004:SDB,
author = "E. A. Bretz",
title = "Speedy data backups",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "1",
pages = "94--96",
month = jan,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1317898",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Data compression; Drives; Filling; Floppy disks; Giant
magnetoresistance; Hybrid electric vehicles; Layout;
Magnetic heads; Motion pictures; Portable computers",
}
@InProceedings{Chakareski:2004:CRD,
author = "J. Chakareski and B. Girod",
title = "Computing rate-distortion optimized policies for
streaming media with rich acknowledgments",
crossref = "Storer:2004:DCC",
pages = "202--211",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281465",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281465",
acknowledgement = ack-nhfb,
}
@InProceedings{Chan:2004:ERC,
author = "W. Chan and A. Becker",
title = "Efficient rate control for motion {JPEG2000}",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281505",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281505",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:2004:COE,
author = "S. Chang",
title = "Classification oriented embedded image coding",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281506",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281506",
acknowledgement = ack-nhfb,
}
@InProceedings{Chellappa:2004:DFM,
author = "Vijay Chellappa and P. C. Cosman and G. M. Voelker",
title = "Dual frame motion compensation with uneven quality
assignment",
crossref = "Storer:2004:DCC",
pages = "262--271",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281471",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281471",
acknowledgement = ack-nhfb,
}
@InProceedings{Cheng:2004:SRW,
author = "S. Cheng and Zixiang Xiong",
title = "Successive refinement for the {Wyner--Ziv} problem and
layered code design",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281507",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281507",
acknowledgement = ack-nhfb,
}
@InProceedings{Cho:2004:TSA,
author = "Chuan-Yu Cho and Shih-Yu Huang and Jia-Shung Wang",
title = "{A-TDB}: a self adaptive block-matching algorithm for
varying motion contents",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281508",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281508",
acknowledgement = ack-nhfb,
}
@InProceedings{Cinque:2004:SLC,
author = "L. Cinque and F. Liberati and S. {De Agostino}",
title = "A simple lossless compression heuristic for {RGB}
images",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281509",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281509",
acknowledgement = ack-nhfb,
}
@InProceedings{Coleman:2004:SNA,
author = "T. P. Coleman and A. H. Lee and M. Medard and M.
Effros",
title = "On some new approaches to practical {Slepian--Wolf}
compression inspired by channel coding",
crossref = "Storer:2004:DCC",
pages = "282--291",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281473",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281473",
acknowledgement = ack-nhfb,
}
@InProceedings{Costa:2004:ERL,
author = "M. H. M. Costa and H. S. Malvar",
title = "Efficient run-length encoding of binary sources with
unknown statistics",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281510",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281510",
acknowledgement = ack-nhfb,
}
@InProceedings{Daptardar:2004:AKM,
author = "A. Daptardar and D. Shapira",
title = "Adapting the {Knuth--Morris--Pratt} algorithm for
pattern matching in {Huffman} encoded texts",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281511",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281511",
acknowledgement = ack-nhfb,
}
@Article{Davidson:2004:FDC,
author = "Michael Davidson and Lucian Ilie",
title = "Fast Data Compression with Antidictionaries",
journal = j-FUND-INFO,
volume = "64",
number = "1--4",
pages = "119--134",
month = jul,
year = "2004",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Fundamenta Informaticae",
rawdata = "Davidson, Michael and Lucian Ilie (2004) ``Fast Data
Compression with Antidictionaries,'' {\it Fundamenta
Informaticae}, {\bf64}(1--4):119--134, July.",
}
@InProceedings{Dawy:2004:ICT,
author = "Z. Dawy and J. Hagenauer and A. Hoffmann",
title = "Implementing the context tree weighting method for
content recognition",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281512",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281512",
acknowledgement = ack-nhfb,
}
@InProceedings{Dumitrescu:2004:FAO,
author = "S. Dumitrescu and X. Wu and G. Bahl",
title = "Fast algorithms for optimal two-description scalar
quantizer design",
crossref = "Storer:2004:DCC",
pages = "42--51",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281449",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281449",
acknowledgement = ack-nhfb,
}
@InProceedings{Eriksson:2004:NMT,
author = "T. Eriksson and J. B. Anderson and M. Novak and N.
Goertz",
title = "New methods for trellis source coding at rates above
and below one",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281513",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281513",
acknowledgement = ack-nhfb,
}
@InProceedings{Faramarzpour:2004:LLC,
author = "N. Faramarzpour and S. Shirani",
title = "Lossless and lossy compression of {DNA} microarray
images",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281514",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281514",
acknowledgement = ack-nhfb,
}
@InProceedings{Finamore:2004:VPE,
author = "W. A. Finamore and S. V. B. Bruno and D. Silva",
title = "Vector permutation encoding for the uniform sources",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281515",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281515",
acknowledgement = ack-nhfb,
}
@InProceedings{Foschini:2004:FCS,
author = "L. Foschini and R. Grossi and A. Gupta and J. S.
Vitter",
title = "Fast compression with a static model in high-order
entropy",
crossref = "Storer:2004:DCC",
pages = "62--71",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281451",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281451",
acknowledgement = ack-nhfb,
}
@Article{Fredriksson:2004:ESM,
author = "Kimmo Fredriksson and Jorma Tarhio",
title = "Efficient String Matching in {Huffman} Compressed
Texts",
journal = j-FUND-INFO,
volume = "63",
number = "1",
pages = "1--16",
month = jan,
year = "2004",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:02:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Gagie:2004:DSC,
author = "T. Gagie",
title = "Dynamic {Shannon} coding",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281516",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281516",
acknowledgement = ack-nhfb,
}
@InProceedings{Ghido:2004:EAL,
author = "F. Ghido",
title = "An efficient algorithm for lossless compression of
{IEEE} float audio",
crossref = "Storer:2004:DCC",
pages = "429--438",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281488",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281488",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:2004:RCH,
author = "R. M. Gray and T. Linder",
title = "Results and conjectures on high rate quantization",
crossref = "Storer:2004:DCC",
pages = "3--12",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281445",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281445",
acknowledgement = ack-nhfb,
}
@InProceedings{Guionnet:2004:JSC,
author = "T. Guionnet and C. Guillemot",
title = "Joint source-channel decoding of quasiarithmetic
codes",
crossref = "Storer:2004:DCC",
pages = "272--281",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281472",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281472",
acknowledgement = ack-nhfb,
}
@InProceedings{Guleryuz:2004:PWC,
author = "O. G. Guleryuz",
title = "Predicting wavelet coefficients over edges using
estimates based on nonlinear approximants",
crossref = "Storer:2004:DCC",
pages = "162--171",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281461",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281461",
acknowledgement = ack-nhfb,
}
@InProceedings{Gyorgy:2004:FPL,
author = "A. Gyorgy and T. Linder and G. Lugosi",
title = "A ``follow the perturbed leader''-type algorithm for
zero-delay quantization of individual sequences",
crossref = "Storer:2004:DCC",
pages = "342--351",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281479",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281479",
acknowledgement = ack-nhfb,
}
@InProceedings{Halbach:2004:UEP,
author = "T. Halbach",
title = "Unequal error protection of {SNR}-scalable
{DPCM}-coded video",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281517",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281517",
acknowledgement = ack-nhfb,
}
@Book{Haralambous:2004:FCG,
author = "Yannis Haralambous",
title = "Fontes \& codages: Glyphes et caract{\`e}res {\`a}
l'{\`e}re du num{\'e}rique. ({French}) [{Fonts} and
Encodings: Glyphs and characters in the numerical
era]",
publisher = pub-ORA-FRANCE,
address = pub-ORA-FRANCE:adr,
pages = "xx + 990",
year = "2004",
ISBN = "2-84177-273-X",
ISBN-13 = "978-2-84177-273-5",
LCCN = "????",
bibdate = "Fri May 20 06:49:11 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/ora.bib",
URL = "http://www.oreilly.com/catalog/9782841772735",
acknowledgement = ack-nhfb,
language = "French",
}
@InProceedings{Hon:2004:CID,
author = "Wing-Kai Hon and Tak-Wah Lam and Kunihiko Sadakane and
Wing-king Sung and Siu-Ming Yiu",
title = "Compressed index for dynamic text",
crossref = "Storer:2004:DCC",
pages = "102--111",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281455",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281455",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:2004:CFI,
author = "Y.-Z. Huang and D. O'Brien and R. M. Gray",
title = "Classification of features and images using {Gauss}
mixtures with {VQ} clustering",
crossref = "Storer:2004:DCC",
pages = "13--21",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281446",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281446",
acknowledgement = ack-nhfb,
}
@InProceedings{Huo:2004:JCL,
author = "X. Huo and J. Chen and D. L. Donoho",
title = "{JBEAM}: coding lines and curves via digital
beamlets",
crossref = "Storer:2004:DCC",
pages = "449--458",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281490",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281490",
acknowledgement = ack-nhfb,
}
@Article{Huybrechs:2004:NWN,
author = "Daan Huybrechs and Jo Simoens and Stefan Vandewalle",
title = "A note on wave number dependence of wavelet matrix
compression for integral equations with oscillatory
kernel",
journal = j-J-COMPUT-APPL-MATH,
volume = "172",
number = "2",
pages = "233--246",
day = "1",
month = dec,
year = "2004",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2004.02.006",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:00:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042704001177",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@InProceedings{Jacquet:2004:EHM,
author = "P. Jacquet and G. Seroussi and W. Szpankowski",
title = "On the entropy of a hidden {Markov} process",
crossref = "Storer:2004:DCC",
pages = "362--371",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281481",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281481",
acknowledgement = ack-nhfb,
}
@InProceedings{Janson:2004:ASC,
author = "S. Janson and S. Lonardi and W. Szpankowski",
title = "On the average sequence complexity",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281518",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281518",
acknowledgement = ack-nhfb,
}
@InProceedings{Jin:2004:ESI,
author = "T. Jin and J. Vaisey",
title = "Efficient side-information context description for
context-based adaptive entropy coders",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281519",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281519",
acknowledgement = ack-nhfb,
}
@InProceedings{Kaufman:2004:STC,
author = "Y. Kaufman and S. T. Klein",
title = "Semilossless text compression",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281520",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281520",
acknowledgement = ack-nhfb,
}
@TechReport{Kiely:2004:SGP,
author = "A. Kiely",
title = "Selecting the {Golomb} Parameter in {Rice} Coding",
volume = "42--159",
type = "IPN (Interplanetary Network) Progress Report",
number = "",
institution = "????",
address = "????",
pages = "1--8",
day = "15",
month = nov,
year = "2004",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Kiely, A. (2004) ``Selecting the Golomb Parameter in
Rice Coding,'' IPN (Interplanetary Network) Progress
Report, {\bf42--159}:1--8, November 15.",
}
@InProceedings{Kirovski:2004:PCC,
author = "D. Kirovski",
title = "Point compression for certificates of authenticity",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281521",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281521",
acknowledgement = ack-nhfb,
}
@InProceedings{Koshelevat:2004:MOB,
author = "O. Koshelevat and B. Usevitch and S. Cabrera and E.
Vidal",
title = "{MSE} optimal bit rate allocation in the application
of {JPEG2000} part 2 to meteorological data",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281522",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281522",
acknowledgement = ack-nhfb,
}
@InProceedings{Krunz:2004:ARC,
author = "M. M. Krunz and M. Hassan",
title = "Adaptive rate control scheme for video streaming over
wireless channels",
crossref = "Storer:2004:DCC",
pages = "242--251",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281469",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281469",
acknowledgement = ack-nhfb,
}
@InProceedings{KumaraSwamy:2004:RBF,
author = "K. KumaraSwamy and C. Faloutsos and G. Shan and V.
Megalooikonomou",
title = "Relation between fractal dimension and performance of
vector quantization",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281523",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281523",
acknowledgement = ack-nhfb,
}
@InProceedings{Lakhani:2004:UPM,
author = "Gopal Lakhani and Radhakrishnan Sethurama",
title = "Using partial-matching approach with {Sequitur} for
contact-based coding",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281524",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281524",
acknowledgement = ack-nhfb,
}
@InProceedings{Lan:2004:SWC,
author = "C.-F. Lan and A. D. Liveris and K. Narayanan and
Zixiang Xiong and C. Georghiades",
title = "{Slepian--Wolf} coding of multiple {M}-ary sources
using {LDPC} codes",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281525",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281525",
acknowledgement = ack-nhfb,
}
@InProceedings{Leu:2004:CDM,
author = "Fang-Yie Leu and Yao-Chung Fan",
title = "Compressing a directed massive graph using small world
model",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281526",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281526",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2004:SWC,
author = "J. Li and Z. Tu and R. S. Blum",
title = "{Slepian--Wolf} coding for nonuniform sources using
turbo codes",
crossref = "Storer:2004:DCC",
pages = "312--321",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281476",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281476",
acknowledgement = ack-nhfb,
}
@InProceedings{Liebchen:2004:MES,
author = "T. Liebchen and Y. A. Reznik",
title = "{MPEG-4 ALS}: an emerging standard for lossless audio
coding",
crossref = "Storer:2004:DCC",
pages = "439--448",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281489",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281489",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2004:HSB,
author = "Yali Liu and J. Wen",
title = "Heuristic search based soft-input soft-output decoding
of arithmetic codes",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281527",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281527",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2004:SWC,
author = "Z. Liu and S. Cheng and A. D. Liveris and Zixiang
Xiong",
title = "{Slepian--Wolf} coded nested quantization ({SWC-NQ})
for {Wyner--Ziv} coding: performance analysis and code
design",
crossref = "Storer:2004:DCC",
pages = "322--331",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281477",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281477",
acknowledgement = ack-nhfb,
}
@Article{Logeswaran:2004:FTS,
author = "R. Logeswaran",
title = "Fast Two-Stage {Lempel--Ziv} Lossless Numeric
Telemetry Data Compression Using a Neural Network
Predictor",
journal = j-J-UCS,
volume = "10",
number = "9",
pages = "1199--1211",
day = "28",
month = sep,
year = "2004",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Wed Jul 6 08:14:47 MDT 2005",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_10_9/fast_two_stage_lempel",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Manzini:2004:SFD,
author = "Giovanni Manzini and Marcella Rastero",
title = "A simple and fast {DNA} compressor",
journal = j-SPE,
volume = "34",
number = "14",
pages = "1397--1411",
day = "25",
month = nov,
year = "2004",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.619",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Apr 16 07:26:34 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "In this paper we consider the problem of DNA
compression. It is well known that one of the main
features of DNA sequences is that they contain
substrings which are duplicated except for a few random
mutations. For this reason most DNA compressors work by
searching and encoding approximate repeats. We depart
from this strategy by searching and encoding only exact
repeats. However, we use an encoding designed to take
advantage of the possible presence of approximate
repeats. Our approach leads to an algorithm which is an
order of magnitude faster than any other algorithm and
achieves a compression ratio very close to the best DNA
compressors. Another important feature of our algorithm
is its small space occupancy which makes it possible to
compress sequences hundreds of megabytes long, well
beyond the range of any previous DNA compressor.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "25 Aug 2004",
}
@InProceedings{Martin:2004:LTU,
author = "A. Martin and G. Seroussi and M. J. Weinberger",
title = "Linear time universal coding of tree sources via {FSM}
closure",
crossref = "Storer:2004:DCC",
pages = "372--381",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281482",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281482",
acknowledgement = ack-nhfb,
}
@InProceedings{Martinian:2004:SCD,
author = "E. Martinian and G. W. Wornell and R. Zamir",
title = "Source coding with distortion side information at the
encoder",
crossref = "Storer:2004:DCC",
pages = "172--181",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281462",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281462",
acknowledgement = ack-nhfb,
}
@InProceedings{Masala:2004:RDO,
author = "E. Masala and H. Yang and K. Rose and J. C. {De
Martin}",
title = "Rate-distortion optimized slicing, packetization and
coding for error resilient video transmission",
crossref = "Storer:2004:DCC",
pages = "182--191",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281463",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281463",
acknowledgement = ack-nhfb,
}
@InProceedings{Mehrotra:2004:SAI,
author = "A. Mehrotra and R. Srikanth and A. G. Ramakrishnan",
title = "Shape adaptive integer wavelet transform based coding
scheme for {$2$-D\slash $3$-D MR} images",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281528",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281528",
acknowledgement = ack-nhfb,
}
@InProceedings{Meron:2004:OFS,
author = "E. Meron and M. Feder",
title = "Optimal finite state universal coding of individual
sequences",
crossref = "Storer:2004:DCC",
pages = "332--341",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281478",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281478",
acknowledgement = ack-nhfb,
}
@InProceedings{Miguel:2004:RCW,
author = "A. C. Miguel and A. R. Askew and A. Chang and S. Hauck
and R. E. Ladner and E. A. Riskin",
title = "Reduced complexity wavelet-based predictive coding of
hyperspectral images for {FPGA} implementation",
crossref = "Storer:2004:DCC",
pages = "469--478",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281492",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281492",
acknowledgement = ack-nhfb,
}
@Article{Milward:2004:DIL,
author = "Mark Milward and Jos{\'e} Luis N{\'u}{\~n}ez and David
Mulvaney",
title = "Design and Implementation of a Lossless Parallel
High-Speed Data Compression System",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "15",
number = "6",
pages = "481--490",
month = jun,
year = "2004",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2004.7",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Sat Dec 11 16:24:15 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://csdl.computer.org/dl/trans/td/2004/06/l0481.htm;
http://csdl.computer.org/dl/trans/td/2004/06/l0481.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Mock:2004:ME,
author = "T. Mock",
title = "Music everywhere",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "9",
pages = "42--47",
month = sep,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1330809",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "AAC files; advanced audio coding; audio coding; Audio
systems; compression algorithm; Compression algorithms;
Computer networks; data compression; data storage; data
transfer; Digital audio players; Digital recording;
electronic data interchange; human hearing; Humans;
Internet; Motion pictures; MP3 players; Multiple signal
classification; music files; pocket-size player; WAV
files; waveform audio format; Wireless personal area
networks",
}
@PhdThesis{Mohammed:2004:HDR,
author = "Falah H. M. Ahmad Mohammed",
title = "High Data Rate Pulse Compression Using Non-Linear
Transmission Line ({NLTL}) Technology",
type = "{Ph.D.} thesis",
school = "Queen's University of Belfast",
address = "Belfast, Northern Ireland",
pages = "249",
year = "2004",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305088588",
acknowledgement = ack-nhfb,
classification = "0544: Electrical engineering",
dissertation-thesis-number = "C819979",
subject = "Electrical engineering",
}
@InProceedings{Mukerjee:2004:DTL,
author = "K. Mukerjee",
title = "Decaying tree lossless coding for image and video",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281529",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281529",
acknowledgement = ack-nhfb,
}
@InProceedings{Nguyen:2004:RCV,
author = "H. Nguyen and P. Duhamel",
title = "Reduced complexity {VLC} sequence decoder",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281530",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281530",
acknowledgement = ack-nhfb,
}
@InProceedings{Nuallain:2004:OST,
author = "B. O. Nuallain and S. de Rooij",
title = "Online suffix trees with counts",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281531",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281531",
acknowledgement = ack-nhfb,
}
@InProceedings{Ordentlich:2004:DUF,
author = "E. Ordentlich and T. Weissman and M. J. Weinberger and
A. Somekh-Baruch and N. Merhav",
title = "Discrete universal filtering through incremental
parsing",
crossref = "Storer:2004:DCC",
pages = "352--361",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281480",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281480",
acknowledgement = ack-nhfb,
}
@InProceedings{Ozonat:2004:ICU,
author = "K. M. Ozonat and R. M. Gray",
title = "Image classification using adaptive-boosting and
tree-structured discriminant vector quantization",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281532",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281532",
acknowledgement = ack-nhfb,
}
@Article{Perkins:2004:RDC,
author = "S. Perkins and D. H. Smith and A. Ryley",
title = "Robust Data Compression: Consistency Checking in the
Synchronization of Variable Length Codes",
journal = j-COMP-J,
volume = "47",
number = "3",
pages = "309--319",
month = may,
year = "2004",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/47.3.309",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 8 12:55:15 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_03/",
URL = "",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Racz:2004:HDC,
author = "B. Racz and A. Lukacs",
title = "High density compression of log files",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281533",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281533",
acknowledgement = ack-nhfb,
}
@InProceedings{Rajpoot:2004:MBO,
author = "N. M. Rajpoot",
title = "Model based optimal bit allocation",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281534",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281534",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2004:CPR,
author = "Yuriy Reznik",
title = "Coding of Prediction Residual in {MPEG-4} Standard for
Lossless Audio Coding ({MPEG-4 ALS})",
crossref = "IEEE:2004:IIC",
volume = "3",
pages = "1024--1027",
month = may,
year = "2004",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Reznik, Yuriy (2004) ``Coding Of Prediction Residual
In MPEG-4 Standard For Lossless Audio Coding (MPEG-4
ALS),'' {\it Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal Processing,
2004}, (ICASSP apos;04), {\bf3}(17--21):1024--1027,
May.",
}
@InProceedings{Ringenburg:2004:GMI,
author = "M. F. Ringenburg and R. E. Ladner and E. A. Riskin",
title = "Global {MINMAX} interframe bit allocation for embedded
video coding",
crossref = "Storer:2004:DCC",
pages = "222--231",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281467",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281467",
acknowledgement = ack-nhfb,
}
@InProceedings{Rizzo:2004:HPC,
author = "F. Rizzo and B. Carpentieri and G. Motta and J. A.
Storer",
title = "High performance compression of hyperspectral imagery
with reduced search complexity in the compressed
domain",
crossref = "Storer:2004:DCC",
pages = "479--488",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281493",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281493",
acknowledgement = ack-nhfb,
}
@InProceedings{Roder:2004:CRD,
author = "M. Roder and J. Cardinal and R. Hamzaoui",
title = "On the complexity of rate-distortion optimal streaming
of packetized media",
crossref = "Storer:2004:DCC",
pages = "192--201",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281464",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281464",
acknowledgement = ack-nhfb,
}
@InProceedings{Ros:2004:CCB,
author = "M. Ros and P. Sutton",
title = "Code compression based on operand-factorization for
{VLIW} processors",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281535",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281535",
acknowledgement = ack-nhfb,
}
@InProceedings{Ryabko:2004:ACP,
author = "B. Ryabko and J. Astola",
title = "Adaptive coding and prediction of sources with large
and infinite alphabets",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281536",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281536",
acknowledgement = ack-nhfb,
}
@InProceedings{Ryabko:2004:UCF,
author = "B. Ryabko and J. Astola",
title = "Universal coding of function spaces as a model signal
compression",
crossref = "Storer:2004:DCC",
pages = "382--388",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281483",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281483",
acknowledgement = ack-nhfb,
}
@InProceedings{Ryabkot:2004:FCL,
author = "B. Ryabkot and J. Astola",
title = "Fast codes for large alphabet sources and its
application to block encoding",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281537",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281537",
acknowledgement = ack-nhfb,
}
@InProceedings{Said:2004:CAA,
author = "A. Said",
title = "Comparative analysis of arithmetic coding
computational complexity",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281538",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281538",
acknowledgement = ack-nhfb,
}
@InProceedings{Said:2004:CFA,
author = "A. Said and S. Yea and W. A. Pearlman",
title = "Coding for fast access to image regions defined by
pixel range",
crossref = "Storer:2004:DCC",
pages = "489--497",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281494",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281494",
acknowledgement = ack-nhfb,
}
@Book{Salomon:2004:DCC,
author = "David Salomon",
title = "Data Compression: The Complete Reference",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Third",
pages = "xx + 898",
year = "2004",
ISBN = "0-387-40697-2",
ISBN-13 = "978-0-387-40697-8",
LCCN = "QA76.9.D33 S25 2004",
bibdate = "Wed Apr 28 13:21:19 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
URL = "http://www.booksbydavidsalomon.com/;
http://www.ecs.csun.edu/~dsalomon/DC3advertis/DComp3Ad.html",
abstract = "This substantially enhanced reference is an essential
resource and companion for all computer scientists,
computer electrical, and signal image processing
engineers, and scientists needing a comprehensive
compilation of compression methods. It requires only a
minimum of mathematics and is well suited to
nonspecialists and general readers.",
acknowledgement = ack-ds # " and " # ack-nhfb,
tableofcontents = "1. Basic techniques \\
1.1 Intuitive compression \\
1.2 Run-length encoding \\
1.3 RLE text compression \\
1.4 RLE image compression \\
1.5 Move-to-front coding \\
1.6 Scalar quantization \\
2. Statistical methods \\
2.1 Information theory concepts \\
2.2 Variable-size codes \\
2.3 Prefix codes \\
2.4 The Golomb code \\
2.5 The Kraft--MacMillan inequality \\
2.6 The counting argument \\
2.7 Shannon--Fano coding \\
2.8 Huffman coding \\
2.9 Adaptive Huffman coding \\
2.10 MNP5 \\
2.11 MNP7 \\
2.12 Reliability \\
2.13 Facsimile compression \\
2.14 Arithmetic coding \\
2.16 The QM coder \\
2.17 Text compression \\
2.18 PPM \\
2.19 Context-tree weighting \\
3. Dictionary methods \\
3.1 String compression \\
3.2 Simple dictionary compression \\
3.3 LZ77 (sliding window) \\
3.4 LZSS \\
3.5 Repetition times \\
3.6 QIC-122 \\
3.7 LZX \\
3.8 File differencing: VCDIFF \\
3.9 LZ78 \\
3.10 LZFG \\
3.11 LZRW1 \\
3.12 LZRW4 \\
3.13 LZW \\
3.14 LZMW \\
3.15 LZAP \\
3.16 LZY \\
3.17 LZP \\
3.18 Repetition finder \\
3.19 UNIX compression \\
3.20 GIF images \\
3.21 The V.42vis protocol \\
3.22 Various LZ applications \\
3.23 Deflate: Zip and Gzip \\
3.24 PNG \\
3.25 XML compression: XMill \\
3.26 EXE compressors \\
3.27 CRC \\
3.28 Summary \\
3.29 Data compression patents \\
3.30 A unification \\
4. Image compression \\
4.1 Introduction \\
4.2 Approaches to image compression \\
4.3 Intuitive methods \\
4.4 Image transforms \\
4.5 Orthogonal transforms \\
4.6 The discrete cosine transform \\
4.7 Test images \\
4.8 JPEG \\
4.9 JPEG-LS \\
4.10 Progressive image compression \\
4.11 JBIG \\
4.12 JBIG2 \\
4.13 Simple images: EIDAC \\
4.14 Vector quantization \\
4.15 Adaptive vector quantization \\
4.16 Block matching \\
4.17 Block truncation coding \\
4.18 Context-based methods \\
4.19 FELICS \\
4.20 Progressive FELICS \\
4.21 MLP \\
4.22 Adaptive Golomb \\
4.23 PPPM \\
4.24 CALIC \\
4.25 Differential lossless compression \\
4.26 DPCM \\
4.27 Context-tree weighting \\
4.28 Block decomposition \\
4.29 Binary tree predictive coding \\
4.30 Quadtrees \\
4.31 Quadrisection \\
4.32 Space-filling curves \\
4.33 Hilbert scan and VQ \\
4.34 Finite automata methods \\
4.35 Iterated function systems \\
4.36 Cell encoding \\
5. Wavelet methods \\
5.1 Fourier transform \\
5.2 The frequency domain \\
5.3 The uncertainty principle \\
5.4 Fourier image compression \\
5.5 The CWT and its inverse \\
5.6 The Haar transform \\
5.7 Filter banks \\
5.8 The DWT \\
5.9 Multiresolution decomposition \\
5.10 Various image decompositions \\
5.11 The lifting scheme \\
5.12 The IWT \\
5.13 The Laplacian pyramid \\
5.14 SPIHT \\
5.15 CREW \\
5.16 EZW \\
5.17 DjVu \\
5.18 WSQ, fingerprint compression \\
5.19 JPEG 2000 \\
6. Video compression \\
6.1 Analog video \\
6.2 Composite and components video \\
6.3 Digital video \\
6.4 Video compression \\
6.5 MPEG \\
6.6 MPEG-4 \\
6.7 H.261 \\
7. Audio compression \\
7.1 Sound \\
7.2 Digital audio \\
7.3 The human auditory system \\
7.4 $\mu$-law and A-law companding \\
7.5 ADPCM audio compression \\
7.6 MLP audio \\
7.7 Speech compression \\
7.8 Shorten \\
7.9 MPEG-1 audio layers \\
8. Other methods \\
8.1 The Burrows--Wheeler method \\
8.2 Symbol ranking \\
8.3 ACB \\
8.4 Sort-based context similarity \\
8.5 Sparse strings \\
8.6 Word-based text compression \\
8.7 Textual image compression \\
8.8 Dynamic Markov coding \\
8.9 FHM curve compression \\
8.10 Sequitur \\
8.11 Triangle mesh compression: Edgebreaker \\
8.12 SCSU: Unicode compression \\
Bibliography \\
Glossary \\
Joining the Data Compression Community \\
Index",
}
@InProceedings{Sarshar:2004:MMS,
author = "N. Sarshar and X. Wu",
title = "Minimax multiresolution scalar quantization",
crossref = "Storer:2004:DCC",
pages = "52--61",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281450",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281450",
acknowledgement = ack-nhfb,
}
@InProceedings{Sarshar:2004:WCS,
author = "N. Sarshar and X. Wu",
title = "On wavelet compression of self-similar processes",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281539",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281539",
acknowledgement = ack-nhfb,
}
@InProceedings{Schonberg:2004:DCC,
author = "D. Schonberg and K. Ramchandran and S. S. Pradhan",
title = "Distributed code constructions for the entire
{Slepian--Wolf} rate region for arbitrarily correlated
sources",
crossref = "Storer:2004:DCC",
pages = "292--301",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281474",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281474",
acknowledgement = ack-nhfb,
}
@InProceedings{Schonberg:2004:ICC,
author = "D. Schonberg and D. Kirovski",
title = "{Iris} compression for cryptographically secure person
identification",
crossref = "Storer:2004:DCC",
pages = "459--468",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281491",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281491",
acknowledgement = ack-nhfb,
}
@InProceedings{Senecal:2004:LLV,
author = "J. Senecal and M. Duchaineau and K. I. Joy",
title = "Length-limited variable-to-variable length codes for
high-performance entropy coding",
crossref = "Storer:2004:DCC",
pages = "389--398",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281484",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281484",
acknowledgement = ack-nhfb,
}
@InProceedings{Senecal:2004:RBB,
author = "J. Senecal and M. Duchaineau and K. I. Joy",
title = "Reversible $n$-bit to $n$-bit integer {Haar}-like
transforms",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281540",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281540",
acknowledgement = ack-nhfb,
}
@InProceedings{Sermadevi:2004:EBA,
author = "Y. Sermadevi and S. S. Hemami",
title = "Efficient bit allocation for dependent video coding",
crossref = "Storer:2004:DCC",
pages = "232--241",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281468",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281468",
acknowledgement = ack-nhfb,
}
@InProceedings{Shamir:2004:SUL,
author = "G. I. Shamir",
title = "Sequential universal lossless techniques for
compression of patterns and their description length",
crossref = "Storer:2004:DCC",
pages = "419--428",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281487",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281487",
acknowledgement = ack-nhfb,
}
@InProceedings{Shapira:2004:PDF,
author = "D. Shapira and J. A. Storer",
title = "In-place differential file compression of nonaligned
files with applications to file distribution, backups,
and string similarity",
crossref = "Storer:2004:DCC",
pages = "82--91",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281453",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281453",
acknowledgement = ack-nhfb,
}
@InProceedings{Shavit:2004:GTV,
author = "G. Shavit and M. F. Ringenburg and J. West and R. E.
Ladner and E. A. Riskin",
title = "Group testing for video compression",
crossref = "Storer:2004:DCC",
pages = "212--221",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281466",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281466",
acknowledgement = ack-nhfb,
}
@InProceedings{Simard:2004:FBS,
author = "P. Y. Simard and H. S. Malvar and J. Rinker and E.
Renshaw",
title = "A foreground-background separation algorithm for image
compression",
crossref = "Storer:2004:DCC",
pages = "498--507",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281495",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281495",
acknowledgement = ack-nhfb,
}
@InProceedings{Skibinski:2004:VLC,
author = "P. Skibi{\'n}ski and S. Grabowski",
title = "Variable-length contexts for {PPM}",
crossref = "Storer:2004:DCC",
pages = "409--418",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281486",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281486",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Stankovic:2004:DSW,
author = "V. Stankovic and A. D. Liveris and Zixiang Xiong and
C. N. Georghiades",
title = "Design of {Slepian--Wolf} codes by channel code
partitioning",
crossref = "Storer:2004:DCC",
pages = "302--311",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281475",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281475",
acknowledgement = ack-nhfb,
}
@InProceedings{Stankovic:2004:PEP,
author = "V. Stankovic and Zixiang Xiong",
title = "Packet erasure protection for multicasting",
crossref = "Storer:2004:DCC",
pages = "142--151",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281459",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281459",
acknowledgement = ack-nhfb,
}
@InProceedings{Sun:2004:OBC,
author = "Fangting Sun and Wei Yu",
title = "Optimal buffer-constrained bit allocation using
marginal analysis",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281541",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281541",
acknowledgement = ack-nhfb,
}
@InProceedings{Swacha:2004:PSC,
author = "J. Swacha",
title = "The predictive-substitutional compression scheme and
its effective implementation",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281542",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281542",
acknowledgement = ack-nhfb,
}
@PhdThesis{Swacha:2004:PSM,
author = "Jakub Swacha",
title = "Predykcyjno-substytucyjna metoda bezstratnej kompresji
danych. ({Polish}) [{A} predictive-substitutional
lossless data compression method]",
type = "{Ph.D.} thesis",
school = "Politechnika Wroc{\l}awska",
address = "Wroc{\l}aw, Poland",
pages = "146",
year = "2004",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305039563",
acknowledgement = ack-nhfb,
alternate-title = "",
classification = "0984: Computer science",
dissertation-thesis-number = "C817872",
language = "Polish",
subject = "Computer science",
}
@InProceedings{Takamura:2004:MVC,
author = "S. Takamura and Y. Yashima",
title = "Multiband video coding using {H.264\slash AVC},
{MPEG-4} studio profile and {JPEG 2000}",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281543",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281543",
acknowledgement = ack-nhfb,
}
@InProceedings{Tao:2004:LBC,
author = "T. Tao and A. Mukherjee",
title = "{LZW} based compressed pattern matching",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281544",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281544",
acknowledgement = ack-nhfb,
}
@InProceedings{Teng:2004:IBP,
author = "C.-Y. Teng",
title = "An improved block prediction mode for {H.264\slash
AVC} intra-frame prediction",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281545",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281545",
acknowledgement = ack-nhfb,
}
@InProceedings{Terazono:2004:EDC,
author = "K. Terazono and Y. Okada",
title = "An extended delta compression algorithm and the
recovery of failed updating in embedded systems",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281546",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281546",
acknowledgement = ack-nhfb,
}
@InProceedings{Tian:2004:SDM,
author = "C. Tian and S. S. Hemami",
title = "Sequential design of multiple description scalar
quantizers",
crossref = "Storer:2004:DCC",
pages = "32--41",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281448",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281448",
acknowledgement = ack-nhfb,
}
@InProceedings{Tuncel:2004:OMS,
author = "E. Tuncel",
title = "On optimal multiresolution source-channel coding
across degraded broadcast channels",
crossref = "Storer:2004:DCC",
pages = "122--131",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281457",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281457",
acknowledgement = ack-nhfb,
}
@InProceedings{Vo:2004:UCD,
author = "B. D. Vo and K.-P. Vo",
title = "Using column dependency to compress tables",
crossref = "Storer:2004:DCC",
pages = "92--101",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281454",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281454",
acknowledgement = ack-nhfb,
}
@PhdThesis{Volkerink:2004:DTT,
author = "Erik H. Volkerink",
title = "Design-for-testability for test data compression",
type = "{Ph.D.} thesis",
school = "Stanford University",
address = "Stanford, CA, USA",
pages = "95",
year = "2004",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305130276",
acknowledgement = ack-nhfb,
advisor = "Edward J. McCluskey",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "3128489",
subject = "Electrical engineering",
}
@InProceedings{Vontobel:2004:FGA,
author = "P. O. Vontobel",
title = "A factor-graph approach to the context-tree weighting
method",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281547",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281547",
acknowledgement = ack-nhfb,
}
@Article{Wang:2004:DCS,
author = "Ze Wang and Chi-Sing Leung and Yi-Sheng Zhu and
Tien-Tsin Wong",
title = "Data compression with spherical wavelets and wavelets
for the image-based relighting",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "96",
number = "3",
pages = "327--344",
month = dec,
year = "2004",
CODEN = "CVIUF4",
DOI = "https://doi.org/10.1016/j.cviu.2004.03.017",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Thu Jul 14 17:29:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@InProceedings{Yang:2004:ACD,
author = "Y. Yang and V. Stankovic and Zixiang Xiong and W.
Zhao",
title = "Asymmetric code design for remote multiterminal source
coding",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281548",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281548",
acknowledgement = ack-nhfb,
}
@InProceedings{Yao:2004:HFV,
author = "Z. Yao and R. Wilson",
title = "Hybrid fractal video coding with neighbourhood vector
quantisation",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281549",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281549",
acknowledgement = ack-nhfb,
}
@InProceedings{Yoshida:2004:CCI,
author = "S. Yoshida and H. Yahagi and J. Odagiri",
title = "{CSV} compaction to improve data-processing
performance for large {XML} documents",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281550",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281550",
acknowledgement = ack-nhfb,
}
@InProceedings{Yousefizadeh:2004:DOT,
author = "H. Yousefi'zadeh and H. Jafarkhani and F. Etemadi",
title = "Distortion-optimal transmission of progressive images
over channels with random bit errors and packet
erasures",
crossref = "Storer:2004:DCC",
pages = "132--141",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281458",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281458",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:2004:IRC,
author = "W. Yu",
title = "Integrated rate control and entropy coding for {JPEG
2000}",
crossref = "Storer:2004:DCC",
pages = "152--161",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281460",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281460",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2004:OBA,
author = "J. Zhang and C. B. Owen",
title = "Octree-based animated geometry compression",
crossref = "Storer:2004:DCC",
pages = "508--517",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281496",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281496",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2004:FNL,
author = "R. Zhao and M. Gabriel and G. G. Belford",
title = "Fast near-lossless or lossless compression of large
{$3$D} neuro-anatomical images",
crossref = "Storer:2004:DCC",
pages = "??--??",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281551",
bibdate = "Tue Feb 5 14:07:23 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281551",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2004:MSC,
author = "Q. Zhao and H. Feng and M. Effros",
title = "Multiresolution source coding using entropy
constrained dithered scalar quantization",
crossref = "Storer:2004:DCC",
pages = "22--31",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281447",
bibdate = "Tue Feb 5 14:07:30 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281447",
acknowledgement = ack-nhfb,
}
@InProceedings{Abel:2005:FEP,
author = "J. Abel",
title = "A fast and efficient post {BWT}-stage for the
{Burrows--Wheeler} compression algorithm",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.3",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402206",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Article{Abel:2005:UTP,
author = "J. Abel and W. Teahan",
title = "Universal text preprocessing for data compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "5",
pages = "497--507",
month = may,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.85",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1407841",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anh:2005:IIC,
author = "Vo Ngoc Anh and Alistair Moffat",
title = "Inverted Index Compression Using Word-Aligned Binary
Codes",
journal = j-INF-RETR,
volume = "8",
pages = "151--166",
year = "2005",
CODEN = "IFRTFY",
DOI = "https://doi.org/10.1023/B:INRT.0000048490.99518.5c",
ISSN = "1386-4564 (print), 1573-7659 (electronic)",
ISSN-L = "1386-4564",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1023/B%3AINRT.0000048490.99518.5c",
acknowledgement = ack-ds,
fjournal = "Information Retrieval",
rawdata = "Anh, Vo Ngoc and Alistair Moffat (2005) ``Inverted
Index Compression Using Word-Aligned Binary Codes,''
{\it Information Retrieval}, {\bf8}:151--166.",
}
@InProceedings{Apostolico:2005:LCE,
author = "A. Apostolico and M. Comin and L. Parida",
title = "Off-line compression by extensible motifs",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.59",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402207",
acknowledgement = ack-nhfb,
}
@InProceedings{Apostolico:2005:LZW,
author = "A. Apostolico",
title = "Of {Lempel--Ziv--Welch} parses with refillable gaps",
crossref = "Storer:2005:DCC",
pages = "338--347",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.58",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402195",
acknowledgement = ack-nhfb,
}
@Article{Baby:2005:ULA,
author = "Thomas Baby and Youngmin Kim and Amitabh Varshney",
title = "Unsupervised learning applied to progressive
compression of time-dependent geometry",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "29",
number = "3",
pages = "451--461",
month = jun,
year = "2005",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2005.03.021",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Thu Jul 14 18:00:22 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00978493",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Bai:2005:IML,
author = "Yuhua Bai and T. Cooklev",
title = "An improved method for lossless data compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.14",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402208",
acknowledgement = ack-nhfb,
}
@Article{Baron:2005:ASS,
author = "D. Baron and Y. Bresler",
title = "Antisequential suffix sorting for {BWT}-based data
compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "4",
pages = "385--397",
month = apr,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.56",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1401858",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Barron:2005:DWP,
author = "David W. Barron",
title = "{David Wheeler}: a Personal Memoir",
journal = j-COMP-J,
volume = "48",
number = "6",
pages = "650--651",
month = nov,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh131",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/full/48/6/650;
http://comjnl.oxfordjournals.org/cgi/reprint/48/6/650",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Burrows--Wheeler transform (BWT); bzip; bzip2;
Cambridge CAP computer; Tiny Encryption Algorithm
(TEA)",
remark = "From the article: ``Anderson described the history of
the Tiny Encryption Algorithm, developed by Wheeler and
the late Roger Needham (a former Wheeler research
student, later head of the Laboratory and the first
managing director of Microsoft Research Ltd). The
algorithm was designed in part to `inject some sanity'
into the imposition of export controls on encryption
software by the US Government in the late 1980s.
Wheeler's solution was to devise an encryption
algorithm so short, simple and general that it could be
memorized and encoded in any language. It proved
impossible to put an embargo on what ended up as just
eight lines of code --- another masterpiece in
miniature.'' See \cite{Wheeler:1995:TTE} for the
algorithm.\par
``In an email collaboration, Wheeler and Burrows
devised a data compression technique based on BWT,
which was published as a research report in 1994. The
idea was picked up by Dr Dobb's Journal and soon
diffused into the commons of computing. Not long after,
Burrows received a call from Donald Knuth --- asking if
he was working with {\em the\/} David Wheeler! Today
the technique is the basis of the widely used open
source bzip and bzip2 file formats.''",
}
@InProceedings{Bauer:2005:UAM,
author = "M. Bauer and S. M. Schuster and K. Sayood",
title = "The use of average mutual information profile as a
species signature",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.88",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402209",
acknowledgement = ack-nhfb,
}
@InProceedings{Bergman:2005:FDP,
author = "E. Bergman and S. T. Klein",
title = "Fast decoding of prefix encoded texts",
crossref = "Storer:2005:DCC",
pages = "143--152",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.39",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402175",
acknowledgement = ack-nhfb,
}
@InProceedings{Bischoff:2005:TCB,
author = "U. Bischoff and J. Rossignac",
title = "{TetStreamer}: compressed back-to-front transmission
of {Delaunay} tetrahedra meshes",
crossref = "Storer:2005:DCC",
pages = "93--102",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.85",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402170",
acknowledgement = ack-nhfb,
}
@Article{Boldi:2005:CWW,
author = "Paolo Boldi and Sebastiano Vigna",
title = "Codes for the {World--Wide} {Web}",
journal = j-INTERNET-MATH,
volume = "2",
number = "4",
pages = "405--427",
year = "2005",
CODEN = "",
ISSN = "1542-7951 (print), 1944-9488 (electronic)",
ISSN-L = "1542-7951",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Internet Mathematics",
rawdata = "Boldi, Paolo and Sebastiano Vigna (2005), ``Codes for
the World-Wide Web,'' {\it Internet Mathematics},
{\bf2}(4):405--427.",
}
@InProceedings{Brittain:2005:GTD,
author = "Nathanael J. Brittain and Mahmoud R. El-Sakka",
booktitle = "{International Conference on Image Analysis and
Recognition, ICIAR'2005}",
title = "Grayscale Two-Dimensional {Lempel--Ziv} Encoding",
volume = "3656",
publisher = pub-SV,
address = pub-SV:adr,
pages = "328--334",
year = "2005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = ser-LNCS,
acknowledgement = ack-ds,
rawdata = "Brittain, Nathanael J. and Mahmoud R. El-Sakka (2005)
``Grayscale Two-Dimensional Lempel-Ziv Encoding,''{\it
International Conference on Image Analysis and
Recognition, ICIAR'2005}, LNCS 3656, pp. 328--334.",
}
@InProceedings{Chellappa:2005:ECD,
author = "V. Chellappa and P. C. Cosman and G. M. Voelker",
title = "Error concealment for dual frame video coding with
uneven quality",
crossref = "Storer:2005:DCC",
pages = "319--328",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.38",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402193",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2005:DJS,
author = "Qingyu Chen and K. P. Subbalakshmi",
title = "Distributed joint source-channel decoding for
correlated {Markov} sources",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.32",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402210",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2005:ESM,
author = "S. Chen and S. Diggavi and S. Dusad and S.
Muthukrishnan",
title = "Efficient string matching algorithms for combinatorial
universal denoising",
crossref = "Storer:2005:DCC",
pages = "153--162",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.37",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402176",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2005:OPG,
author = "Dan Chen and Yi-Jen Chiang and N. Memon and Xiaolin
Wu",
title = "Optimized prediction for geometry compression of
triangle meshes",
crossref = "Storer:2005:DCC",
pages = "83--92",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.68",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402169",
acknowledgement = ack-nhfb,
}
@MastersThesis{Chen:2005:RDC,
author = "Long Yan Chen",
title = "Research on Data Compression Algorithm for Isoline",
type = "{M.S.}",
school = "Dalian University of Technology",
address = "Dalian, Peoples Republic of China",
year = "2005",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024701902",
acknowledgement = ack-nhfb,
advisor = "Xiao Yuan Qian",
classification = "0364: Applied Mathematics",
dissertation-thesis-number = "H042590",
subject = "Applied Mathematics",
}
@Article{Chen:2005:TSC,
author = "Zhe Chen and David Dagan Feng and Weidong Cai",
title = "Temporal and Spatial Compression of Dynamic Positron
Emission Tomography in Sinogram Domain",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "4",
pages = "839--??",
month = oct,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1142/s0219467805002026",
ISSN = "0219-4678",
bibdate = "Wed Aug 23 08:55:54 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Cheng:2005:MEF,
author = "Jimming Cheng and M. Mitzenmacher",
title = "The {MARKOV EXPERT} for finding episodes in time
series",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.86",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402211",
acknowledgement = ack-nhfb,
}
@InProceedings{Cho:2005:CWS,
author = "Yushin Cho and A. Said and W. A. Pearlman",
title = "Coding the wavelet spatial orientation tree with low
computational complexity",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.25",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402212",
acknowledgement = ack-nhfb,
}
@Book{Choe:2005:CET,
author = "Geon Ho Choe",
title = "Computational ergodic theory",
volume = "13",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xix + 453",
year = "2005",
ISBN = "3-540-23121-8 (hardcover)",
ISBN-13 = "978-3-540-23121-9 (hardcover)",
ISSN = "1431-1550",
LCCN = "QA313 .C485 2005",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Algorithms and computation in mathematics",
abstract = "``Ergodic theory is hard to study because it is based
on measure theory, which is a technically difficult
subject to master for ordinary students, especially for
physics majors. Many of the examples are introduced
from a different perspective than in other books and
theoretical ideas can be gradually absorbed while doing
computer experiments. Theoretically less prepared
students can appreciate the deep theorems by doing
various simulations. The computer experiments are
simple but they have close ties with theoretical
implications. Even the researchers in the field can
benefit by checking their conjectures, which might have
ben regarded as unrealistic to be programmed easily,
against numerical output using some of the ideas in the
book. One last remark: the last chapter explains the
relation between entropy and data compression, which
belongs to information theory and not to ergodic
theory. It will help students to gain an understanding
of the digital technology that has shaped the modern
information society.''--BOOK JACKET.",
acknowledgement = ack-nhfb,
subject = "Ergodic theory; Data processing",
}
@Article{Cinque:2005:SLC,
author = "Luigi Cinque and Sergio {De Agostino} and Franco
Liberati and Bart Westgeest",
title = "A Simple Lossless Compression Heuristic for Grey Scale
Images",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "16",
number = "6",
pages = "1111--??",
month = dec,
year = "2005",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/s0129054105003686",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Wed Aug 23 09:03:17 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@InProceedings{Coleman:2005:TPM,
author = "T. P. Coleman and M. Medard and M. Effros",
title = "Towards practical minimum-entropy universal decoding",
crossref = "Storer:2005:DCC",
pages = "33--42",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.90",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402164",
acknowledgement = ack-nhfb,
}
@Article{Cook:2005:HCE,
author = "Robert P. Cook",
title = "Heuristic compression of an {English} word list",
journal = j-SPE,
volume = "35",
number = "6",
pages = "577--581",
month = may,
year = "2005",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.648",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Apr 16 07:26:39 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
https://www.math.utah.edu/pub/tex/bib/spell.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "The goal of the project was to design and implement an
English word-list representation suitable for
spell-checking in space-constrained environments. The
compression algorithm was derived by statistically
analyzing the word list. A compression ratio of 18\%
was achieved through a combination of prefix and suffix
encoding. The compressed file can be randomly accessed
by prefix marker positions. A simple spell-checker
based on the encoding was implemented and tested in
Java.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
keywords = "compression; English word list; spell checking",
onlinedate = "16 Feb 2005",
}
@Article{Corliss:2005:IED,
author = "Marc L. Corliss and E. Christopher Lewis and Amir
Roth",
title = "The implementation and evaluation of dynamic code
decompression using {DISE}",
journal = j-TECS,
volume = "4",
number = "1",
pages = "38--72",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Mar 24 15:48:07 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@InProceedings{Dai:2005:ABB,
author = "Wei Dai and Lijie Liu and T. D. Tran",
title = "Adaptive block-based image coding with pre-\slash
post-filtering",
crossref = "Storer:2005:DCC",
pages = "73--82",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.11",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402168",
acknowledgement = ack-nhfb,
}
@Article{Davidson:2005:FDC,
author = "Michael Davidson and Lucian Ilie",
title = "Fast Data Compression with Antidictionaries",
journal = j-FUND-INFO,
volume = "64",
number = "1--4",
pages = "119--134",
month = jul,
year = "2005",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:02:46 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{DeAgostino:2005:BSD,
author = "S. {De Agostino}",
title = "Bounded size dictionary compression: relaxing the
{LRU} deletion heuristic",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.23",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402213",
acknowledgement = ack-nhfb,
}
@Article{Diaz-Gutierrez:2005:GIH,
author = "Pablo Diaz-Gutierrez and M. Gopi and Renato Pajarola",
title = "Geometry {II}: Hierarchyless Simplification,
Stripification and Compression of Triangulated
Two-Manifolds",
journal = j-CGF,
volume = "24",
number = "3",
pages = "457--467",
month = sep,
year = "2005",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2005.00871.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:01 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "7 Oct 2005",
}
@InProceedings{Dumitrescu:2005:GOG,
author = "S. Dumitrescu and Xiaolin Wu",
title = "On global optimality of gradient descent algorithms
for fixed-rate scalar multiple description quantizer
design",
crossref = "Storer:2005:DCC",
pages = "388--397",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.60",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402200",
acknowledgement = ack-nhfb,
}
@InProceedings{Eriksson:2005:BST,
author = "T. Eriksson and S. Hellerbrand and J. B. Anderson and
M. Novak",
title = "On the block size of trellis quantizers",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.62",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402214",
acknowledgement = ack-nhfb,
}
@InProceedings{Eriksson:2005:SBV,
author = "T. Eriksson and M. Novak and J. B. Anderson",
title = "Short-block variable-rate trellis quantization",
crossref = "Storer:2005:DCC",
pages = "251--260",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.81",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402186",
acknowledgement = ack-nhfb,
}
@InProceedings{Farber:2005:QMS,
author = "B. Farber and K. Zeger",
title = "Quantization of multiple sources using integer bit
allocation",
crossref = "Storer:2005:DCC",
pages = "368--377",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.76",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402198",
acknowledgement = ack-nhfb,
}
@Article{Ferragina:2005:BTC,
author = "Paolo Ferragina and Raffaele Giancarlo and Giovanni
Manzini and Marinella Sciortino",
title = "Boosting textual compression in optimal linear time",
journal = j-J-ACM,
volume = "52",
number = "4",
pages = "688--713",
month = jul,
year = "2005",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1082036.1082043",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Wed Oct 5 07:28:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We provide a general boosting technique for Textual
Data Compression. Qualitatively, it takes a good
compression algorithm and turns it into an algorithm
with a better compression performance guarantee. It
displays the following remarkable properties: (a) it
can turn any memoryless compressor into a compression
algorithm that uses the `best possible' contexts; (b)
it is very simple and optimal in terms of time; and (c)
it admits a decompression algorithm again optimal in
time. To the best of our knowledge, this is the first
boosting technique displaying these
properties.Technically, our boosting technique builds
upon three main ingredients: the Burrows--Wheeler
Transform, the Suffix Tree data structure, and a greedy
algorithm to process them. Specifically, we show that
there exists a proper partition of the Burrows--Wheeler
Transform of a string $s$ that shows a deep
combinatorial relation with the $k$-th order entropy of
$s$. That partition can be identified via a greedy
processing of the suffix tree of $s$ with the aim of
minimizing a proper objective function over its nodes.
The final compressed string is then obtained by
compressing individually each substring of the
partition by means of the base compressor we wish to
boost.Our boosting technique is inherently
combinatorial because it does not need to assume any
prior probabilistic model about the source emitting
$s$, and it does not deploy any training, parameter
estimation and learning. Various corollaries are
derived from this main achievement. Among the others,
we show analytically that using our booster, we get
better compression algorithms than some of the best
existing ones, that is, LZ77, LZ78, PPMC and the ones
derived from the Burrows--Wheeler Transform. Further,
we settle analytically some long-standing open problems
about the algorithmic structure and the performance of
BWT-based compressors. Namely, we provide the first
family of BWT algorithms that do not use Move-To-Front
or Symbol Ranking as a part of the compression
process.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@InProceedings{Gasieniec:2005:RTT,
author = "L. Gasieniec and R. Kolpakov and I. Potapov and P.
Sant",
title = "Real-time traversal in grammar-based compressed
files",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.78",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402215",
acknowledgement = ack-nhfb,
}
@InProceedings{Gemelos:2005:ERP,
author = "G. M. Gemelos and T. Weissman",
title = "On the entropy rate of pattern processes",
crossref = "Storer:2005:DCC",
pages = "233--242",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.63",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402184",
acknowledgement = ack-nhfb,
}
@InProceedings{Ghido:2005:QCA,
author = "F. Ghido",
title = "{QLFC} --- a compression algorithm using the
{Burrows--Wheeler} transform",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.75",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402216",
acknowledgement = ack-nhfb,
}
@InProceedings{Gladkova:2005:CAI,
author = "I. Gladkova and L. Roytman and M. Goldberg",
title = "Compression algorithm for infrared hyperspectral
sounder data",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.27",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402217",
acknowledgement = ack-nhfb,
}
@Article{Glusker:2005:TCM,
author = "Mark Glusker and David M. Hogan and Pamela Vass",
title = "The Ternary Calculating Machine of {Thomas Fowler}",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "27",
number = "3",
pages = "4--22",
month = jul # "\slash " # sep,
year = "2005",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2005.49",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
abstract = "In 1840, Thomas Fowler, a self-taught English
mathematician and inventor, created a unique ternary
calculating machine. Until recently, all detail of this
machine was lost. A research project begun in 1997
uncovered sufficient information to enable the
recreation of a physical concept model of Fowler's
machine. The next step is to create a historically
accurate replica.",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
keywords = "19th century; Augustus De Morgan; balanced ternary;
base-3; calculating machine; historical reconstruction;
signed ternary; ternary; Thomas Fowler",
rawdata = "Glusker, Mark, David M. Hogan, and Pamela Vass (2005)
``The Ternary Calculating Machine of Thomas Fowler,''
{\it IEEE Annals of the History of Computing},
{\bf27}(3):4--22, July.",
}
@InProceedings{Golin:2005:GKM,
author = "M. J. Golin and Hyeon-Suk Na",
title = "Generalizing the {Kraft--McMillan} inequality to
restricted languages",
crossref = "Storer:2005:DCC",
pages = "163--172",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.42",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402177",
acknowledgement = ack-nhfb,
}
@InProceedings{Gray:2005:LFF,
author = "R. M. Gray",
title = "A {Lagrangian} formulation of fixed-rate
quantization",
crossref = "Storer:2005:DCC",
pages = "261--269",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.7",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402187",
acknowledgement = ack-nhfb,
}
@Article{Gu:2005:LAO,
author = "Hung-Yan Gu",
title = "A large-alphabet-oriented scheme for {Chinese} and
{English} text compression",
journal = j-SPE,
volume = "35",
number = "11",
pages = "1027--1039",
month = sep,
year = "2005",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.661",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Oct 4 05:39:38 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "26 Apr 2005",
}
@InProceedings{Gu:2005:SCM,
author = "Wei-Hsin Gu and M. Effros",
title = "Source coding for a multihop network",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.82",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402218",
acknowledgement = ack-nhfb,
}
@InProceedings{Gupta:2005:SWC,
author = "M. R. Gupta and A. Stroilov",
title = "Segmenting for wavelet compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.80",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402219",
acknowledgement = ack-nhfb,
}
@Article{Hashempour:2005:AAC,
author = "H. Hashempour and F. Lombardi",
title = "Application of arithmetic coding to compression of
{VLSI} test data",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "9",
pages = "1166--1177",
month = sep,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.136",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1471676",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Hekland:2005:USM,
author = "F. Hekland and G. E. Oien and T. A. Ramstad",
title = "Using $ 2 \colon 1 $ {Shannon} mapping for joint
source-channel coding",
crossref = "Storer:2005:DCC",
pages = "223--232",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.92",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402183",
acknowledgement = ack-nhfb,
}
@Article{Hoffman:2005:GHS,
author = "Dean Hoffman and Peter Johnson and Nadine Wilson",
title = "Generating {Huffman} sequences",
journal = j-J-ALG,
volume = "54",
number = "1",
pages = "115--121",
month = jan,
year = "2005",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/j.jalgor.2004.04.003",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:21:29 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677404000653",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
@InProceedings{Huang:2005:FPV,
author = "Bormin Huang and A. Ahuja and Hung-Lung Huang",
title = "Fast precomputed {VQ} with optimal bit allocation for
lossless compression of ultraspectral sounder data",
crossref = "Storer:2005:DCC",
pages = "408--417",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.41",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402202",
acknowledgement = ack-nhfb,
}
@InProceedings{Huo:2005:BAQ,
author = "Longshe Huo and Wen Gao and Qingming Huang",
title = "Bandwidth adaptive quality smoothing for unequal error
protected scalable video streaming",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.21",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402220",
acknowledgement = ack-nhfb,
}
@InProceedings{Jeong:2005:MDC,
author = "Sangoh Jeong and R. M. Gray",
title = "Minimum distortion color image retrieval based on
{Lloyd}-clustered {Gauss} mixtures",
crossref = "Storer:2005:DCC",
pages = "279--288",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.52",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402189",
acknowledgement = ack-nhfb,
}
@InProceedings{Karpinski:2005:ACO,
author = "M. Karpinski and Y. Nekricht",
title = "Algorithms for construction of optimal and
almost-optimal length-restricted codes",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.12",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402221",
acknowledgement = ack-nhfb,
}
@InProceedings{Kashyap:2005:DSC,
author = "A. Kashyap and L. A. Lastras-Montano and C. Xia and
Zhen Liu",
title = "Distributed source coding in dense sensor networks",
crossref = "Storer:2005:DCC",
pages = "13--22",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.33",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402162",
acknowledgement = ack-nhfb,
}
@InProceedings{Kirovski:2005:PAG,
author = "D. Kirovski and Z. Landau",
title = "Parameter analysis for the generalized {LZ}
compression of audio",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.70",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402222",
acknowledgement = ack-nhfb,
}
@InProceedings{Kirovski:2005:PSC,
author = "D. Kirovski",
title = "A point-set compression heuristic for fiber-based
certificates of authenticity",
crossref = "Storer:2005:DCC",
pages = "103--112",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.9",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402171",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2005:CPM,
author = "S. T. Klein and D. Shapira",
title = "Compressed pattern matching in {JPEG} images",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.26",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402223",
acknowledgement = ack-nhfb,
}
@InProceedings{Korodi:2005:LDC,
author = "G. Korodi and J. Rissanen and I. Tabus",
title = "Lossless data compression using optimal tree
machines",
crossref = "Storer:2005:DCC",
pages = "348--357",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.50",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402196",
acknowledgement = ack-nhfb,
}
@Article{Kum:2005:RTM,
author = "Sang-Uok Kum and Ketan Mayer-Patel",
title = "Real-time multidepth stream compression",
journal = j-TOMCCAP,
volume = "1",
number = "2",
pages = "128--150",
month = may,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1145/1062253.1062255",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Jul 7 13:52:13 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@InProceedings{Lastras-Montano:2005:NTG,
author = "L. A. Lastras-Montano and V. Castelli",
title = "Near tightness of the {El Gamal} and {Cover} region
for two descriptions",
crossref = "Storer:2005:DCC",
pages = "3--12",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.57",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402161",
acknowledgement = ack-nhfb,
}
@Article{Latendresse:2005:GFI,
author = "Mario Latendresse and Marc Feeley",
title = "Generation of fast interpreters for {Huffman}
compressed bytecode",
journal = j-SCI-COMPUT-PROGRAM,
volume = "57",
number = "3",
pages = "295--317",
month = sep,
year = "2005",
CODEN = "SCPGD4",
DOI = "https://doi.org/10.1016/j.scico.2004.07.005",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Fri Apr 1 18:38:50 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
}
@Article{Lee:2005:IEC,
author = "B. K. Lee and L. K. John",
title = "Implications of executing compression and encryption
applications on general purpose processors",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "7",
pages = "917--922",
month = jul,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.121",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1432674",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Leighton:2005:AGB,
author = "G. Leighton and J. Diamond and T. Muldner",
title = "{AXECHOP}: a grammar-based compressor for {XML}",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.20",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402224",
acknowledgement = ack-nhfb,
}
@InProceedings{Liebchen:2005:MAL,
author = "Tilman Liebchen and others",
booktitle = "{AES 119th Convention, New York, October 7--10,
2005}",
title = "The {MPEG-4 Audio Lossless Coding (ALS) Standard} ---
Technology and Applications",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??--??",
year = "2005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Available at
\path|http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html|.",
URL = "http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html",
acknowledgement = ack-ds,
rawdata = "Liebchen, Tilman et al. (2005) ``The MPEG-4 Audio
Lossless Coding (ALS) Standard - Technology and
Applications,'' AES 119th Convention, New York, October
7--10, 2005. Available at URL\hfil\break
|http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html|.
Liefke, Hartmut and Dan Suciu (1999) ``XMill: an
Efficient Compressor for XML Data,'' {\it Proceedings
of the ACM SIGMOD Symposium on the Management of Data,
2000}, pp. 153--164. Available at
|http://citeseer.ist.psu.edu/327443.html|.",
}
@InProceedings{Lin:2005:ALT,
author = "Song Lin and D. Gunopulos and S. Lonardi and V.
Kalogeraki",
title = "Applying {LVQ} techniques to compress historical
information in sensor networks",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.16",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402225",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2005:JSC,
author = "Zihuai Lin and Tor Aulin",
title = "Joint source and channel coding using trellis coded
{CPM}: soft decoding",
crossref = "Storer:2005:DCC",
pages = "213--222",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.46",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402182",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2005:PCP,
author = "Yongjing Lin and Youtao Zhang",
title = "Performance comparison of path matching algorithms
over compressed control flow traces",
crossref = "Storer:2005:DCC",
pages = "113--122",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.72",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402172",
acknowledgement = ack-nhfb,
}
@Article{Liu:2005:DBV,
author = "Hongmei Liu and Jiwu Huang and Yun Q. Shi",
title = "{DWT}-Based Video Data Hiding Robust to {MPEG}
Compression and Frame Loss",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "111--??",
month = jan,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1142/s0219467805001689",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Lopez-Ortiz:2005:FSS,
author = "Alejandro L{\'o}pez-Ortiz and Mehdi Mirzazadeh and
Mohammad Ali Safari and Hossein Sheikhattar",
title = "Fast string sorting using order-preserving
compression",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "10",
pages = "1.4:1--1.4:??",
month = "????",
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1145/1064546.1180611",
ISSN = "1084-6654",
ISSN-L = "1084-6654",
bibdate = "Mon Oct 6 16:05:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "We give experimental evidence for the benefits of
order-preserving compression in sorting algorithms.
While, in general, any algorithm might benefit from
compressed data because of reduced paging requirements,
we identified two natural candidates that would further
benefit from order-preserving compression, namely
string-oriented sorting algorithms and word-RAM
algorithms for keys of bounded length. The word-RAM
model has some of the fastest known sorting algorithms
in practice. These algorithms are designed for keys of
bounded length, usually 32 or 64 bits, which limits
their direct applicability for strings. One possibility
is to use an order-preserving compression scheme, so
that a bounded-key-length algorithm can be applied. For
the case of standard algorithms, we took what is
considered to be the among the fastest nonword RAM
string sorting algorithms, Fast MKQSort, and measured
its performance on compressed data. The Fast MKQSort
algorithm of Bentley and Sedgewick is optimized to
handle text strings. Our experiments show that
order-compression techniques results in savings of
approximately 15\% over the same algorithm on
noncompressed data. For the word-RAM, we modified
Andersson's sorting algorithm to handle variable-length
keys. The resulting algorithm is faster than the
standard Unix sort by a factor of 1.5 $X$. Last, we
used an order-preserving scheme that is within a
constant additive term of the optimal Hu--Tucker, but
requires linear time rather than $ O(m \log m)$, where
$ m = | \Sigma |$ is the size of the alphabet.",
acknowledgement = ack-nhfb,
articleno = "1.4",
fjournal = "Journal of Experimental Algorithmics (JEA)",
keywords = "order-preserving compression; sorting; unit-cost RAM;
word-RAM",
}
@InProceedings{Magnani:2005:OOB,
author = "A. Magnani and A. Ghosh and R. M. Gray",
title = "Optimal one-bit quantization",
crossref = "Storer:2005:DCC",
pages = "270--278",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.66",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402188",
acknowledgement = ack-nhfb,
}
@InProceedings{Mantaci:2005:EBW,
author = "S. Mantaci and A. Restivo and M. Sciortino",
title = "An extension of the {Burrows--Wheeler} transform to
$k$ words",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.13",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402226",
acknowledgement = ack-nhfb,
}
@InProceedings{Matloub:2005:OQP,
author = "S. Matloub and D. B. O'Brien and R. M. Gray",
title = "Optimal quantizer performance and the {Wasserstein}
distortion",
crossref = "Storer:2005:DCC",
pages = "243--250",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.67",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402185",
acknowledgement = ack-nhfb,
}
@InProceedings{Menon:2005:ISA,
author = "S. K. Menon and P. Shankar",
title = "An instruction set architecture based code compression
scheme for embedded processors",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.15",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402227",
acknowledgement = ack-nhfb,
}
@InProceedings{Moffat:2005:BCN,
author = "A. Moffat and V. N. Anh",
title = "Binary codes for non-uniform sources",
crossref = "Storer:2005:DCC",
pages = "133--142",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.22",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402174",
acknowledgement = ack-nhfb,
}
@Article{Morhac:2005:MNS,
author = "M. Morh{\'a}c and V. Matousek",
title = "Multidimensional nuclear spectra compression using
fast adaptive {Fourier}-based transforms",
journal = j-COMP-PHYS-COMM,
volume = "165",
number = "2",
pages = "127--138",
day = "15",
month = jan,
year = "2005",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/j.cpc.2004.10.002",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Mon Feb 13 23:41:50 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0010465504004965",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@Article{Navarro:2005:LBM,
author = "Gonzalo Navarro and Jorma Tarhio",
title = "{LZgrep}: a {Boyer--Moore} string matching tool for
{Ziv--Lempel} compressed text",
journal = j-SPE,
volume = "35",
number = "12",
pages = "1107--1130",
month = oct,
year = "2005",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.663",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Oct 4 05:39:38 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www.dcc.uchile.cl/~gnavarro/pubcode/",
abstract = "We present a Boyer--Moore (BM) approach to string
matching over LZ78 and LZW compressed text. The idea is
to search the text directly in compressed form instead
of decompressing and then searching it. We modify the
BM approach so as to skip text using the characters
explicitly represented in the LZ78\slash LZW formats,
modifying the basic technique where the algorithm can
choose which characters to inspect. We present and
compare several solutions for single and multipattern
searches. We show that our algorithms obtain speedups
of up to 50\% compared to the simple
decompress-then-search approach. Finally, we present a
public tool, LZgrep, which uses our algorithms to offer
grep-like capabilities directly searching files
compressed using Unix's Compress, an LZW compressor.
LZgrep can also search files compressed with Unix gzip,
using new decompress-then-search techniques we develop,
which are faster than the current tools. This way,
users can always keep their files in compressed form
and still search them, uncompressing only when they
want to see them.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
keywords = "compressed pattern matching; direct search on
compressed text; text searching; Ziv--Lempel format",
onlinedate = "6 May 2005",
}
@Article{Norcen:2005:HPJ,
author = "Roland Norcen and Andreas Uhl",
title = "High performance {JPEG 2000} and {MPEG-4 VTC} on
{SMPs} using {OpenMP}",
journal = j-PARALLEL-COMPUTING,
volume = "31",
number = "10--12",
pages = "1082--1098",
month = oct # "\slash " # dec,
year = "2005",
CODEN = "PACOEJ",
DOI = "https://doi.org/10.1016/j.parco.2005.03.013",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Thu Sep 2 17:51:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib;
http://www.sciencedirect.com/science/journal/01678191",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191",
}
@Article{Nourani:2005:RHE,
author = "Mehrdad Nourani and Mohammad H. Tehranipour",
title = "{RL-Huffman} encoding for test compression and power
reduction in scan applications",
journal = j-TODAES,
volume = "10",
number = "1",
pages = "91--115",
month = jan,
year = "2005",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1044111.1044117",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Thu Apr 14 10:34:36 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Nunez-Yanez:2005:CSL,
author = "J. L. Nunez-Yanez and V. A. Chouliaras",
title = "A configurable statistical lossless compression core
based on variable order {Markov} modeling and
arithmetic coding",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "11",
pages = "1345--1359",
month = nov,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.171",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:19 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1514415",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Okanohara:2005:PDC,
author = "D. Okanohara",
title = "Partially decodable compression with static {PPM}",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.71",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402228",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Ostergaard:2005:CSM,
author = "J. {\O}stergaard and J. Jensen and R. Heusdens",
title = "$n$-channel symmetric multiple-description lattice
vector quantization",
crossref = "Storer:2005:DCC",
pages = "378--387",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.56",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402199",
acknowledgement = ack-nhfb,
}
@InProceedings{Ozonat:2005:VQC,
author = "K. M. Ozonat and R. M. Gray",
title = "Vector quantization for classification in a simple
network",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.93",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402229",
acknowledgement = ack-nhfb,
}
@InProceedings{Pan:2005:FTB,
author = "Xiang Pan and A. H. Banihashemi and A. Cuhadar",
title = "A fast trellis-based rate-allocation algorithm for
robust transmission of progressively coded images over
noisy channels",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.4",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402230",
acknowledgement = ack-nhfb,
}
@Article{Pennec:2005:BIA,
author = "E. Le Pennec and S. Mallat",
title = "Bandelet Image Approximation and Compression",
journal = j-MULTISCALE-MODELING-SIMUL,
volume = "4",
number = "3",
pages = "992--1039",
year = "2005",
CODEN = "MMSUBT",
DOI = "https://doi.org/10.1137/040619454",
ISSN = "1540-3459 (print), 1540-3467 (electronic)",
ISSN-L = "1540-3459",
bibdate = "Thu Dec 29 09:04:37 MST 2005",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/MMS/4/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siammms.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/61945",
acknowledgement = ack-nhfb,
fjournal = "Multiscale Modeling and Simulation",
journal-URL = "http://epubs.siam.org/mms",
}
@Misc{Percival:2005:BDP,
author = "Colin Percival",
key = "{BSDiff}",
title = "Binary diff/patch utility",
pages = "??",
year = "2005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.daemonology.net/bsdiff/bsdiff-4.3.tar.gz",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "BSDiff (2005) is
|http://www.daemonology.net/bsdiff/bsdiff-4.3.tar.gz|",
}
@Article{Perkins:2005:RDC,
author = "S. Perkins and D. H. Smith",
title = "Robust Data Compression: Variable Length Codes and
Burst Errors",
journal = j-COMP-J,
volume = "48",
number = "3",
pages = "315--322",
month = may,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh079",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue3/index.dtl;
https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/48/3/315;
http://comjnl.oxfordjournals.org/cgi/reprint/48/3/315",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Popa:2005:KTD,
author = "Ionu{\c{t}} Popa",
title = "{KDS}-transformation for Data Compression",
journal = j-FUND-INFO,
volume = "67",
number = "4",
pages = "371--375",
month = mar,
year = "2005",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:03:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Puglisi:2005:PLT,
author = "S. J. Puglisi and W. F. Smyth and A. Turpin",
title = "The performance of linear time suffix sorting
algorithms",
crossref = "Storer:2005:DCC",
pages = "358--367",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.87",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402197",
acknowledgement = ack-nhfb,
}
@InProceedings{Puschel:2005:RTF,
author = "M. Puschel and J. Kovacevic",
title = "Real, tight frames with maximal robustness to
erasures",
crossref = "Storer:2005:DCC",
pages = "63--72",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.77",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402167",
acknowledgement = ack-nhfb,
}
@InProceedings{Radulovic:2005:FIA,
author = "I. Radulovic and P. Frossard",
title = "Fast index assignment for balanced {N}-description
scalar quantization",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.40",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402231",
acknowledgement = ack-nhfb,
}
@InProceedings{Rebollo-Monedero:2005:GRD,
author = "D. Rebollo-Monedero and B. Girod",
title = "Generalization of the rate-distortion function for
{Wyner--Ziv} coding of noisy sources in the
quadratic-{Gaussian} case",
crossref = "Storer:2005:DCC",
pages = "23--32",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.6",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402163",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2005:APS,
author = "Y. A. Reznik",
title = "Asymptotic properties of sample-based entropy,
information divergence, and related metrics",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.17",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402232",
acknowledgement = ack-nhfb,
}
@InProceedings{Said:2005:EAP,
author = "A. Said",
title = "Efficient alphabet partitioning algorithms for
low-complexity entropy coding",
crossref = "Storer:2005:DCC",
pages = "183--192",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.35",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402179",
acknowledgement = ack-nhfb,
}
@InProceedings{Said:2005:IGR,
author = "A. Said",
title = "On the inadequacy of {Golomb--Rice} codes for adaptive
coding",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.64",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402233",
acknowledgement = ack-nhfb,
}
@Book{Salomon:2005:CDC,
author = "David Salomon",
title = "Coding for data and computer communications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 548",
year = "2005",
ISBN = "0-387-21245-0",
ISBN-13 = "978-0-387-21245-6",
LCCN = "TK5102.94 .S35 2005",
bibdate = "Mon Apr 25 16:21:05 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.DavidSalomon.name/Codes/Codes.html;
http://www.ecs.csun.edu/~dsalomon/",
acknowledgement = ack-nhfb,
subject = "Telecommunication systems; Coding theory;
Cryptography",
tableofcontents = "Preface vii \\
\\
Part I: Channel Coding 1 \\
\\
1 Error-Control Codes 3 \\
2 Check Digits for Error Detection 35 \\
\\
Part II: Source Codes 59 \\
\\
3 Statistical Methods 67 \\
4 Dictionary Methods 111 \\
5 Image Compression 133 \\
\\
Part III: Secure Codes 197 \\
\\
6 Basic Concepts 199 \\
7 Monoalphabetic Substitution Ciphers 213 \\
8 Transposition Ciphers 227 \\
9 Polyalphabetic Substitution Ciphers 243 \\
10 Stream Ciphers 269 \\
11 Block Ciphers 289 \\
12 Public-Key Cryptography 311 \\
13 Data Hiding 341 \\
14 Data Hiding in Images 365 \\
15 Data Hiding: Other Methods 417 \\
\\
Part IV: Essential Resources 445 \\
\\
Appendixes \\
\\
A Symmetry Groups 447 \\
B Galois Fields 451 \\
B.1 Field Definitions and Operations 451 \\
B.2 Polynomial Arithmetic 459 \\
C Cyclic Redundancy Codes 461 \\
D Projects 465 \\
\\
Answers to Exercises 471 \\
\\
Glossary 503 \\
\\
Bibliography 523 \\
\\
Index 533",
}
@InProceedings{Sartipi:2005:DSC,
author = "M. Sartipi and F. Fekri",
title = "Distributed source coding in wireless sensor networks
using {LDPC} codes: a non-uniform framework",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.34",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402234",
acknowledgement = ack-nhfb,
}
@Book{Sayood:2005:IDC,
author = "Khalid Sayood",
title = "Introduction to data compression",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
edition = "Third",
pages = "xxii + 680",
year = "2005",
ISBN = "0-12-620862-X",
ISBN-13 = "978-0-12-620862-7",
LCCN = "TK5102.92 .S39 2005",
bibdate = "Wed Oct 26 16:49:48 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
libnote = "Not yet in my library.",
subject = "Data compression (Telecommunication); Coding theory",
}
@InProceedings{Schmalz:2005:RAO,
author = "M. S. Schmalz",
title = "Recent advances in object-based image compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.79",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402235",
acknowledgement = ack-nhfb,
}
@Article{Seidel:2005:TAP,
author = "Raimund Seidel and Micha Sharir",
title = "Top-Down Analysis of Path Compression",
journal = j-SIAM-J-COMPUT,
volume = "34",
number = "3",
pages = "515--525",
month = jun,
year = "2005",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539703439088",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Fri Dec 30 06:20:28 MST 2005",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/34/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/43908",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Senecal:2005:ILI,
author = "J. G. Senecal and P. Lindstrom and M. A. Duchaineau
and K. I. Joy",
title = "Investigating lossy image coding using the {PLHaar}
transform",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.45",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402236",
acknowledgement = ack-nhfb,
}
@InProceedings{Sermadevi:2005:WBA,
author = "Y. Sermadevi and Jun Chen and S. S. Hemami and T.
Berger",
title = "When is bit allocation for predictive video coding
easy?",
crossref = "Storer:2005:DCC",
pages = "289--298",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.96",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402190",
acknowledgement = ack-nhfb,
}
@Article{Shapira:2005:PDF,
author = "Dana Shapira and James A. Storer",
title = "In Place Differential File Compression",
journal = j-COMP-J,
volume = "48",
number = "6",
pages = "677--691",
month = nov,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh128",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/48/6/677;
http://comjnl.oxfordjournals.org/cgi/content/full/48/6/677;
http://comjnl.oxfordjournals.org/cgi/reprint/48/6/677",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Shavit:2005:MBA,
author = "G. Shavit and R. E. Ladner and E. A. Riskin",
title = "{MINMAX} bit allocation for quantization-based video
coders",
crossref = "Storer:2005:DCC",
pages = "299--308",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.53",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402191",
acknowledgement = ack-nhfb,
}
@InProceedings{Shen:2005:VCT,
author = "Yushi Shen and P. C. Cosman and L. B. Milstein",
title = "Video coding for a time varying tandem channel with
feedback",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.95",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402237",
acknowledgement = ack-nhfb,
}
@Article{Skibinski:2005:RDB,
author = "Przemys{\l}aw Skibi{\'n}ski and Szymon Grabowski and
Sebastian Deorowicz",
title = "Revisiting dictionary-based compression",
journal = j-SPE,
volume = "35",
number = "15",
pages = "1455--1476",
month = dec,
year = "2005",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.678",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Mar 14 11:54:24 MST 2006",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "An attractive way to increase text compression is to
replace words with references to a text dictionary
given in advance. Although there exist a few works in
this area, they do not fully exploit the compression
possibilities or consider alternative preprocessing
variants for various compressors in the latter phase.
In this paper, we discuss several aspects of
dictionary-based compression, including compact
dictionary representation, and present a
PPM/BWCA-oriented scheme, word replacing
transformation, achieving compression ratios higher by
2-6\% than the state-of-the-art StarNT (2003) text
preprocessor, working at a greater speed. We also
present an alternative scheme designed for LZ77
compressors, with the advantage over StarNT of reaching
up to 14\% in combination with gzip.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
keywords = "dictionary compression; GNU gzip; lossless data
compression; preprocessing; text compression",
onlinedate = "29 Jul 2005",
}
@InProceedings{Skibinski:2005:TLD,
author = "P. Skibi{\'n}ski",
title = "Two-level directory based compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.91",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402238",
acknowledgement = ack-nhfb,
}
@InProceedings{Slyz:2005:BBI,
author = "M. Slyz and Lei Zhang",
title = "A block-based inter-band lossless hyperspectral image
compressor",
crossref = "Storer:2005:DCC",
pages = "427--436",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.1",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402204",
acknowledgement = ack-nhfb,
}
@Article{Sofokleous:2005:RBM,
author = "Anastasis Sofokleous",
title = "Review: {{\booktitle{H.264 and MPEG-4 Video
Compression: Video Coding for Next-generation
Multimedia}}}",
journal = j-COMP-J,
volume = "48",
number = "5",
pages = "563",
month = sep,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh117",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue5/index.dtl;
https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/reprint/48/5/563",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Srinivasan:2005:CET,
author = "Sridhar Srinivasan and Shankar Regunathan",
title = "Computationally Efficient Transforms for Video
Coding",
crossref = "IEEE:2005:ICI",
volume = "2",
pages = "325--328",
year = "2005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Srinivasan, Sridhar and Shankar Regunathan (2005)
``Computationally Efficient Transforms for Video
Coding,'' {\it IEEE International Conference on Image
Processing, ICIP 2005}, {\bf2}:325--328, 11--14 Sept.",
}
@InProceedings{Tabesh:2005:JMJ,
author = "A. Tabesh and A. Bilgin and K. Krishnan and M. W.
Marcellin",
title = "{JPEG2000} and {Motion JPEG2000} content analysis
using codestream length information",
crossref = "Storer:2005:DCC",
pages = "329--337",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.48",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402194",
acknowledgement = ack-nhfb,
}
@InProceedings{Tang:2005:EIB,
author = "Caimu Tang and Ngai-Man Cheung and A. Ortega and C. S.
Raghavendra",
title = "Efficient inter-band prediction and wavelet based
compression for hyperspectral imagery: a distributed
source coding approach",
crossref = "Storer:2005:DCC",
pages = "437--446",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.36",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402205",
acknowledgement = ack-nhfb,
}
@InProceedings{Tao:2005:MPM,
author = "Tao Tao and A. Mukherjee",
title = "Multiple-pattern matching in {LZW} compressed files
using {Aho--Corasick} algorithm",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.55",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402239",
acknowledgement = ack-nhfb,
}
@Article{Tao:2005:PML,
author = "T. Tao and Amar Mukherjee",
title = "Pattern matching in {LZW} compressed files",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "8",
pages = "929--938",
month = aug,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.133",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1453495",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Tian:2005:SLM,
author = "Chao Tian and S. S. Hemami",
title = "Staggered lattices in multiple description
quantization",
crossref = "Storer:2005:DCC",
pages = "398--407",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.83",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402201",
acknowledgement = ack-nhfb,
}
@InProceedings{Tjalkens:2005:ICH,
author = "T. Tjalkens",
title = "Implementation cost of the {Huffman--Shannon--Fano}
code",
crossref = "Storer:2005:DCC",
pages = "123--132",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.44",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402173",
acknowledgement = ack-nhfb,
}
@InProceedings{Tosic:2005:PLB,
author = "I. Tosic and P. Frossard and P. Vandergheynst",
title = "Progressive low bit rate coding of simple {$3$D}
objects with matching pursuit",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.74",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402240",
acknowledgement = ack-nhfb,
}
@Article{Tsekouras:2005:FVQ,
author = "George E. Tsekouras",
title = "A fuzzy vector quantization approach to image
compression",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "539--560",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2004.07.019",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300304005120",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Usevitch:2005:JCL,
author = "B. Usevitch",
title = "{JPEG2000} compliant lossless coding of floating point
data",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.49",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402241",
acknowledgement = ack-nhfb,
}
@InProceedings{Vucetic:2005:AOQ,
author = "S. Vucetic",
title = "Accuracy-optimized quantization for high-dimensional
data fusion",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.10",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402242",
acknowledgement = ack-nhfb,
}
@InProceedings{Wakatani:2005:PVC,
author = "A. Wakatani",
title = "Parallelization of {VQ} codebook generation by two
algorithms: parallel {LBG} and aggressive {PNN} [image
compression applications]",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.69",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402243",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:BBU,
author = "Li Wang and G. I. Shamir",
title = "{BWT} based universal lossless source controlled
channel decoding with low density parity check codes",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.24",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402244",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@InProceedings{Wang:2005:DVB,
author = "Yadong Wang and F. Alajaji and T. Linder",
title = "Design of {VQ}-based hybrid digital-analog joint
source-channel codes for image communication",
crossref = "Storer:2005:DCC",
pages = "193--202",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.30",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402180",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:LHI,
author = "Hongqiang Wang and S. D. Babacan and K. Sayood",
title = "Lossless hyperspectral image compression using
context-based conditional averages",
crossref = "Storer:2005:DCC",
pages = "418--426",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.51",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402203",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:VLF,
author = "Jue Wang and Cohen MF",
title = "Very low frame-rate video streaming for face-to-face
teleconference",
crossref = "Storer:2005:DCC",
pages = "309--318",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.94",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402192",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2005:JSC,
author = "Zhenyu Wu and R. Jandhyala and A. Bilgin and M. W.
Marcellin",
title = "Joint source\slash channel coding for multiple video
sequences with {JPEG2000}",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.47",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402246",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2005:MCT,
author = "Peiliang Wu and W. J. Teahan",
title = "Modelling {Chinese} for text compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.54",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402245",
acknowledgement = ack-nhfb,
}
@InProceedings{Xie:2005:DNS,
author = "Kai Xie and G. I. Shamir",
title = "Decoding of non-systematic turbo codes for stationary
memoryless and piecewise stationary memoryless
sequences",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.29",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402247",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2005:DJS,
author = "Qian Xu and V. Stankovic and Zixiang Xiong",
title = "Distributed joint source-channel coding of video using
{Raptor} codes",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.31",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402248",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2005:HDI,
author = "Lifeng Xu and M. W. Hoffman and K. Sayood",
title = "Hard decision and iterative joint source channel
coding using arithmetic codes",
crossref = "Storer:2005:DCC",
pages = "203--212",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.43",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402181",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2005:CBT,
author = "Qiaofeng Yang and S. Lonardi",
title = "A compression-boosting transform for {$2$D} data",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.2",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402249",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2005:MSC,
author = "Yang Yang and V. Stankovic and Zixiang Xiong and Wei
Zhao",
title = "On multiterminal source code design",
crossref = "Storer:2005:DCC",
pages = "43--52",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.61",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402165",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2005:PLS,
author = "Shengtian Yang and Peiliang Qiu",
title = "On the performance of linear {Slepian--Wolf} codes for
correlated stationary memoryless sources",
crossref = "Storer:2005:DCC",
pages = "53--62",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.65",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402166",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2005:FCT,
author = "Nan Zhang and Tao Tao and R. V. Satya and A.
Mukherjee",
title = "A flexible compressed text retrieval system using a
modified {LZW} algorithm",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.5",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402250",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2005:PPA,
author = "Yong Zhang and D. Adjeroh",
title = "Prediction by partial approximate matching for
lossless image compression",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.73",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402251",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2005:NAD,
author = "Bo Zhao and K. Iwata and S. Itoh and T. Kato",
title = "A new approach of {DCA} by using {BWT}",
crossref = "Storer:2005:DCC",
pages = "??--??",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.8",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402252",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@InProceedings{Zuk:2005:AER,
author = "O. Zuk and I. Kanter and E. Domany",
title = "Asymptotics of the entropy rate for a hidden {Markov}
process",
crossref = "Storer:2005:DCC",
pages = "173--182",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.18",
bibdate = "Tue Feb 5 08:48:53 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402178",
acknowledgement = ack-nhfb,
}
@InProceedings{Abousleman:2006:CHI,
author = "Glen P. Abousleman",
editor = "G. Motta and F. Rizzo and J. A. Storer",
booktitle = "Hyperspectral Data Compression",
title = "Coding of Hyperspectral Imagery with Trellis-Coded
Quantization",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Abousleman, Glen P. (2006) ``Coding of Hyperspectral
Imagery with Trellis-Coded Quantization,'' in G. Motta,
F. Rizzo, and J. A. Storer, editors, {\it Hyperspectral
Data Compression}, New York, Springer Verlag.",
}
@InProceedings{Adiego:2006:UWS,
author = "J. Adiego and P. de la Fuente",
title = "On the use of words as source alphabet symbols in
{PPM}",
crossref = "Storer:2006:DPD",
pages = "435--435",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.60",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607278",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Adjeroh:2006:CPS,
author = "D. Adjeroh and Fei Nan",
title = "On compressibility of protein sequences",
crossref = "Storer:2006:DPD",
pages = "434--434",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.56",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607277",
acknowledgement = ack-nhfb,
}
@InProceedings{Adjeroh:2006:OCR,
author = "D. A. Adjeroh",
title = "Optimal coding rate selection for {$3$D} video using
{RCPC} codes",
crossref = "Storer:2006:DPD",
pages = "436",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.62",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607279",
acknowledgement = ack-nhfb,
}
@Misc{Adobe:2006:AAF,
author = "{Adobe Systems Incorporated}",
key = "adobepdf",
title = "{Adobe Acrobat} Family / About {Adobe PDF}",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.adobe.com/products/acrobat/adobepdf.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "adobepdf (2006)
|http://www.adobe.com/products/acrobat/adobepdf.html|.",
}
@Misc{AFB:2006:DBT,
author = "{American Foundation for the Blind}",
key = "afb",
title = "{Duxbury Braille Translator}",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.afb.org/prodProfile.asp?ProdID=42",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "afb (2006)
|http://www.afb.org/prodProfile.asp?ProdID=42|.",
}
@Article{Agarwal:2006:AGA,
author = "R. C. Agarwal and K. Gupta and S. Jain and S.
Amalapurapu",
title = "An approximation to the greedy algorithm for
differential compression",
journal = j-IBM-JRD,
volume = "50",
number = "1",
pages = "149--166",
month = jan,
year = "2006",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.501.0149",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Feb 9 20:16:31 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/501/agarwal.html",
abstract = "We present a new differential compression algorithm
that combines the hash value techniques and suffix
array techniques of previous work. The term
``differential compression'' refers to encoding a file
(a version file) as a set of changes with respect to
another file (a reference file). Previous differential
compression algorithms can be shown empirically to run
in linear time, but they have certain drawbacks;
namely, they do not find the best matches for every
offset of the version file. Our algorithm, hsadelta
(hash suffix array delta), finds the best matches for
every offset of the version file, with respect to a
certain granularity and above a certain length
threshold. The algorithm has two variations depending
on how we choose the block size. We show that if the
block size is kept fixed, the compression performance
of the algorithm is similar to that of the greedy
algorithm, without the associated expensive space and
time requirements. If the block size is varied linearly
with the reference file size, the algorithm can run in
linear time and constant space. We also show
empirically that the algorithm performs better than
other state-of-the-art differential compression
algorithms in terms of compression and is comparable in
speed.",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
ordernumber = "G322-0246-00",
}
@InProceedings{Akimov:2006:LCC,
author = "A. Akimov and A. Kolesnikov and P. Franti",
title = "Lossless compression of color map images by context
tree modeling",
crossref = "Storer:2006:DPD",
pages = "10 pp.-421",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.42",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607276",
acknowledgement = ack-nhfb,
}
@Misc{amu:2006:U,
author = "amu",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ifa.amu.edu.pl/~kprzemek",
acknowledgement = ack-ds,
rawdata = "amu (2006) |http://ifa.amu.edu.pl/~kprzemek|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:DCAa,
author = "Anonymous",
key = "wiki. audio",
title = "Data compression: audio",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Audio_data_compression",
acknowledgement = ack-ds,
rawdata = "wiki.audio (2006)
|http://en.wikipedia.org/wiki/Audio_data_compression|.",
}
@Misc{Anonymous:2006:DCAb,
author = "Anonymous",
key = "windots",
title = "Data compression: audio",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.uiciechi.it/vecchio/cnt/schede/windots-eng.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "windots (2006)
|http://www.uiciechi.it/vecchio/cnt/schede/windots-eng.html|.",
}
@Book{Anonymous:2006:DCF,
editor = "Anonymous",
title = "Data compression in financial telecommunications:
{American National Standard for Financial Services:
ANSI X9.32-2006}",
publisher = "Accredited Standards Committee X9, Inc., Financial
Industry Standards",
address = "Annapolis, MD, USA",
pages = "x + 30 leaves",
year = "2006",
LCCN = "HG4515.5 .D38 2006",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
note = "Revision of X9.32-1998. Date approved: July 6, 2006.",
acknowledgement = ack-nhfb,
subject = "Financial services industry; Data processing;
Standards; Data compression (Telecommunication); Data
encryption (Computer science)",
}
@Misc{Anonymous:2006:DHP,
author = "Anonymous",
key = "donationcoder",
title = "{DonationCoder} home page",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.donationcoder.com/Reviews/Archive/ArchiveTools/index.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "donationcoder (2006) is\hfil\break
|http://www.donationcoder.com/Reviews/Archive/ArchiveTools/index.html|.",
}
@Misc{Anonymous:2006:FDT,
author = "Anonymous",
key = "adaptiv9",
title = "Filter Design Toolbox: Examples of Adaptive Filters
That Use {LMS} Algorithms",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Weizmann Institute of Science, 234 Herzl Street,
Rehovot 76100, Israel.",
URL = "http://www.weizmann.ac.il/matlab/toolbox/filterdesign/adaptiv9.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "adaptiv9 (2006)
|http://www.weizmann.ac.il/matlab/toolbox/filterdesign/|
file\hfil\break |adaptiv9.html|.",
}
@Misc{Anonymous:2006:HDS,
author = "Anonymous",
key = "H.264Draft",
title = "{H.264} draft standard",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://standards.polycom.com/JVT_Site/draft_standard/JVT-G050r1.zip",
acknowledgement = ack-ds,
rawdata = "H.264Draft (2006) is
|ftp://standards.polycom.com/JVT_Site/draft_standard/|
file\hfil\break |JVT-G050r1.zip|. This is the H.264
draft standardq.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:HIT,
author = "Anonymous",
key = "H.264Transform",
title = "The {H.264} integer transform",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://standards.polycom.com/JVT_Site/2002_01_Geneva/JVT-B038r2.doc;
ftp://standards.polycom.com/JVT_Site/2002_01_Geneva/JVT-B039r2.doc",
acknowledgement = ack-ds,
rawdata = "H.264Transform (2006)
|ftp://standards.polycom.com/JVT_Site/2002_01_Geneva/|
files |JVT-B038r2.doc| and |JVT-B039r2.doc| (the H.264
integer transform).",
remark = "URL no longer accessible on 27 January 2013; it
requires username and password.",
}
@Misc{Anonymous:2006:HSR,
author = "Anonymous",
key = "H.264Standards",
title = "The {H.264} standards repository",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://standards.polycom.com/JVT_Site/",
acknowledgement = ack-ds,
rawdata = "H.264Standards (2006) is
|ftp://standards.polycom.com/JVT_Site/| (the H.264
standards repository).",
remark = "URL no longer accessible on 27 January 2013; it
requires username and password.",
}
@Misc{Anonymous:2006:IBG,
author = "Anonymous",
key = "IA-32",
title = "{IA-32} (32-bit generation of {Intel} microprocessor
architecture)",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/IA-32",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "IA-32 (2006) |http://en.wikipedia.org/wiki/IA-32|.",
}
@Misc{Anonymous:2006:JCI,
author = "Anonymous",
key = "JBIG2",
title = "{{\tt JBIG2.com}}: An Introduction to {JBIG2}: {JBIG2}
Primer",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://jbig2.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "JBIG2 (2006) |http://jbig2.com/|.",
}
@Misc{Anonymous:2006:KBS,
author = "Anonymous",
key = "h2g2",
title = "{Karlheinz Brandenburg} and The Secret History of
{MP3}",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.bbc.co.uk/dna/h2g2/A406973",
acknowledgement = ack-ds,
rawdata = "h2g2 (2006) |http://www.bbc.co.uk/dna/h2g2/A406973|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:LCK,
author = "Anonymous",
key = "Levenstein",
title = "{Levenstein} coding [also known as {Levenshtein}
coding]",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Levenstein_coding",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Levenstein (2006)
|http://en.wikipedia.org/wiki/Levenstein_coding|.",
}
@Misc{Anonymous:2006:Ma,
author = "Anonymous",
title = "{{\tt mpeg-4.als}}",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html",
acknowledgement = ack-ds,
rawdata = "mpeg-4.als (2006) is\hfil\break
|http://www.nue.tu-berlin.de/forschung/projekte/lossless/mp4als.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:MAF,
author = "Anonymous",
key = "monkeyaudio",
title = "{Monkey's Audio}: a fast and powerful lossless audio
compressor",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.monkeysaudio.com/index.html",
acknowledgement = ack-ds,
rawdata = "monkeyaudio (2006)
|http://www.monkeysaudio.com/index.html|.",
}
@Misc{Anonymous:2006:MMG,
author = "Anonymous",
key = "pass",
title = "Mathematical mysteries: the {Goldbach} conjecture",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://pass.maths.org/issue2/xfile/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "pass (2006) |http://pass.maths.org/issue2/xfile/|.",
}
@Misc{Anonymous:2006:MT,
author = "Anonymous",
key = "morse-tape",
title = "{Morse} tape",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://memory.loc.gov/mss/mmorse/071/071009/0001d.jpg",
acknowledgement = ack-ds,
rawdata = "morse-tape (2006)
|http://memory.loc.gov/mss/mmorse/071/071009/0001d.jpg|.",
}
@Misc{Anonymous:2006:OS,
author = "Anonymous",
title = "{Ogg} squish",
howpublished = "Web page",
year = "2006",
bibdate = "Sun Jan 27 15:49:47 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.xiph.org/ogg/flac.html",
acknowledgement = ack-nhfb,
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Anonymous:2006:PAa,
author = "Anonymous",
title = "Proceedings Available",
crossref = "Storer:2006:DPD",
pages = "??--??",
year = "2006",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2006:RSA,
author = "Anonymous",
key = "softexperience",
title = "{Rarissimo} software: Automatically compress\slash
uncompress files preserving streams and {Macintosh}
files integrity",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://peccatte.karefil.com/software/Rarissimo/RarissimoEN.htm",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "softexperience (2006) is\hfil\break
|http://peccatte.karefil.com/software/Rarissimo/RarissimoEN.htm|.",
}
@Misc{Anonymous:2006:Ua,
author = "Anonymous",
key = "3R",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://f-cpu.seul.org/whygee/ddj-3r/ddj-3R.html",
acknowledgement = ack-ds,
rawdata = "3R (2006)
|http://f-cpu.seul.org/whygee/ddj-3r/ddj-3R.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:Ub,
author = "Anonymous",
key = "seul.org",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://f-cpu.seul.org/whygee/phasing-in_codes/PhasingInCodes.nb",
acknowledgement = ack-ds,
rawdata = "seul.org (2006) is\hfil\break
|http://f-cpu.seul.org/whygee/phasing-in_codes/PhasingInCodes.nb|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2006:UBU,
author = "Anonymous",
key = "UTF16",
title = "{UTF-16 (16-bit Unicode Transformation Format)}",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unicode.bib",
URL = "http://en.wikipedia.org/wiki/UTF-16",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "UTF16 (2006) |http://en.wikipedia.org/wiki/UTF-16|.",
}
@Misc{Anonymous:2006:USC,
author = "Anonymous",
key = "unrarsrc",
title = "[{UNRAR} source code]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.rarlab.com/rar/unrarsrc-3.5.4.tar.gz",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "unrarsrc (2006)
|http://www.rarlab.com/rar/unrarsrc-3.5.4.tar.gz|.",
}
@InProceedings{Apostolico:2006:TCC,
author = "A. Apostolico and Yong Wook Choi",
title = "Textual compression by collapsible tries",
crossref = "Storer:2006:DPD",
pages = "437",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.75",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607280",
acknowledgement = ack-nhfb,
}
@Misc{Apple:2006:U,
author = "{Apple Computer}",
key = "quicktimeAAC",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.apple.com/quicktime/technologies/aac/",
acknowledgement = ack-ds,
rawdata = "quicktimeAAC (2006)
|http://www.apple.com/quicktime/technologies/aac/|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Arpe:2006:COG,
author = "J. Arpe and R. Reischuk",
title = "On the complexity of optimal grammar-based
compression",
crossref = "Storer:2006:DPD",
pages = "173--182",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.59",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607252",
acknowledgement = ack-nhfb,
}
@Misc{ATSC:2006:U,
author = "ATSC",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.atsc.org/standards/a_52b.pdf",
acknowledgement = ack-ds,
rawdata = "ATSC (2006)
|http://www.atsc.org/standards/a_52b.pdf|.",
remark = "URL no longer accessible on 27 January 2013. There are
numerous standards listed at the top-level page,
including A/52:2012.",
}
@InProceedings{Auli-Llinas:2006:ERC,
author = "F. Aul{\'\i}-Llin{\'a}s and J. Serra-Sagrist{\`a} and
J. L. Monteagudo-Pereira and J. Bartrina-R",
title = "Efficient rate control for {JPEG2000} coder and
decoder",
crossref = "Storer:2006:DPD",
pages = "282--291",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.30",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607263",
acknowledgement = ack-nhfb,
}
@InProceedings{Ba:2006:NTC,
author = "D. E. Ba and V. K. Goyal",
title = "Nonlinear transform coding: polar coordinates
revisited",
crossref = "Storer:2006:DPD",
pages = "438",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.55",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607281",
acknowledgement = ack-nhfb,
}
@Article{Barr:2006:EAL,
author = "Kenneth C. Barr and Krste Asanovi{\'c}",
title = "Energy-aware lossless data compression",
journal = j-TOCS,
volume = "24",
number = "3",
pages = "250--291",
month = aug,
year = "2006",
CODEN = "ACSYEC",
DOI = "https://doi.org/10.1145/1151690.1151692",
ISSN = "0734-2071 (print), 1557-7333 (electronic)",
ISSN-L = "0734-2071",
bibdate = "Tue Aug 29 05:29:09 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tocs/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tocs.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Computer Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774",
}
@InProceedings{Bassino:2006:OPC,
author = "F. Bassino and J. Clement and G. Seroussi and A.
Viola",
title = "Optimal prefix codes for some families of
two-dimensional geometric distributions",
crossref = "Storer:2006:DPD",
pages = "113--122",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.64",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607246",
acknowledgement = ack-nhfb,
}
@InProceedings{Behroozi:2006:SIA,
author = "H. Behroozi and M. R. Soleymani",
title = "Side information aware coding strategy in the
quadratic {Gaussian} {CEO} problem",
crossref = "Storer:2006:DPD",
pages = "439",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.72",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607282",
acknowledgement = ack-nhfb,
}
@Misc{Bell:2006:CC,
author = "Timothy Bell and Matt Powell and Joffre Horlor and
Ross Arnold",
key = "Canterbury",
title = "The {Canterbury Corpus}",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://corpus.canterbury.ac.nz",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Canterbury (2006) |http://corpus.canterbury.ac.nz|.",
}
@Misc{Bellis:2006:HMF,
author = "Mary Bellis",
key = "MPThree",
title = "The History of {MP3}: {Fraunhofer Gesellschaft} and
{MP3}",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://inventors.about.com/od/mstartinventions/a/;
http://inventors.about.com/od/mstartinventions/a/MPThree.htm",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "MPThree (2006)
|http://inventors.about.com/od/mstartinventions/a/|,
file\hfil\break |MPThree.htm|.",
}
@InProceedings{Bernardini:2006:DCF,
author = "R. Bernardini and R. Rinaldo",
title = "Distributed coding via folding functions",
crossref = "Storer:2006:DPD",
pages = "440",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.26",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607283",
acknowledgement = ack-nhfb,
}
@InProceedings{Bi:2006:SMI,
author = "Dongsheng Bi and M. W. Hoffman and K. Sayood",
title = "State machine interpretation of arithmetic codes for
joint source and channel coding",
crossref = "Storer:2006:DPD",
pages = "143--152",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.73",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607249",
acknowledgement = ack-nhfb,
}
@InProceedings{Biswas:2006:QTP,
author = "A. Biswas and A. C. den Brinker",
title = "Quantization of transmission parameters in stereo
linear predictive systems",
crossref = "Storer:2006:DPD",
pages = "262--271",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.67",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607261",
acknowledgement = ack-nhfb,
}
@Article{Bouras:2006:IMS,
author = "Christos J. Bouras and Alexandros Panagopoulos and
Thrasyvoulos Tsiatsos",
title = "Implementation of {$3$D} mesh streaming and
compression techniques in {NVEs}",
journal = j-COMPUT-ANIM-VIRTUAL-WORLDS,
volume = "17",
number = "2",
pages = "127--140",
month = may,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1002/cav.112",
ISSN = "1546-427X",
ISSN-L = "1546-4261",
bibdate = "Tue Sep 7 10:29:09 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computanimvirtualworlds.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.interscience.wiley.com/cgi-bin/jhome/106562739;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Computer Animation and Virtual Worlds",
journal-URL = "http://www3.interscience.wiley.com/cgi-bin/jhome/106562739",
onlinedate = "8 Feb 2006",
}
@InProceedings{Bras-Amoros:2006:SIC,
author = "M. Bras-Amoros and J. Gonzalez-Conjero and P.
Guitart-Colom and J. Serra-Sagrist{\`a} and F.
Garcia-Vilchez",
title = "Still image compression through exhaustive two-valued
shape-adaptive searches",
crossref = "Storer:2006:DPD",
pages = "441",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.74",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607284",
acknowledgement = ack-nhfb,
}
@Book{Britanak:2006:DCS,
author = "Vladimir Britanak and Patrick C. Yip and Kamisetty
Ramamohan Rao",
title = "Discrete Cosine and Sine Transforms: General
Properties, Fast Algorithms and Integer
Approximations",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Britanak, Vladimir, Patrick C. Yip, and Kamisetty
Ramamohan Rao (2006) {\it Discrete Cosine and Sine
Transforms: General Properties, Fast Algorithms and
Integer Approximations}, St. Louis, MO, Academic Press,
2006",
}
@Article{Cai:2006:DIW,
author = "Weiting Cai and Malek Adjouadi",
title = "Design and Implementation of Wavelet-Domain Video
Compression Using Multiresolution Motion Estimation and
Compensation",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "6",
number = "4",
pages = "533--549",
month = oct,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467806002471",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:01 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Misc{Caldwell:2006:PCO,
author = "Chris K. Caldwell",
key = "utm",
title = "Prime Conjectures and Open Questions",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://primes.utm.edu/notes/conjectures/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "utm (2006)
|http://primes.utm.edu/notes/conjectures/|.",
}
@Misc{Calgary:2006:U,
author = "Calgary",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.cpsc.ucalgary.ca/pub/projects/text.compression.corpus",
acknowledgement = ack-ds,
rawdata = "Calgary (2006)
|ftp://ftp.cpsc.ucalgary.ca/pub/projects/|\hfil\break
directory |text.compression.corpus|.",
}
@Misc{Campos:2006:RC,
author = "Arturo San Emeterio Campos",
title = "Range coder",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.arturocampos.com/ac_range.html",
acknowledgement = ack-ds,
lastaccess = "28 January 2013",
rawdata = "Campos, Arturo San Emeterio (2006) {\it Range coder},
in\hfil\break
|http://www.arturocampos.com/ac_range.html|.",
}
@InProceedings{Candes:2006:EBL,
author = "E. Candes and J. Romberg",
title = "Encoding the $ l_p $ ball from limited measurements",
crossref = "Storer:2006:DPD",
pages = "33--42",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.86",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607238",
acknowledgement = ack-nhfb,
}
@Article{Chaitin:2006:LR,
author = "Gregory Chaitin",
title = "The Limits of Reason",
journal = j-SCI-AMER,
volume = "294",
number = "3",
pages = "74--81",
month = mar,
year = "2006",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0306-74",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer3.html;
http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer3.pdf;
http://www.sciam.com/sciammag/?contents=2006-03;
http://www.scientificamerican.com/article.cfm?id=the-limits-of-reason",
acknowledgement = ack-ds,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
lastaccess = "27 January 2013",
rawdata = "Chaitin (2007)
|http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer3.html|.",
}
@Article{Chen:2006:GCD,
author = "Chih-Chun Chen and Jung-Hong Chuang",
title = "Geometry Compression and Decompression: Texture
Adaptation for Progressive Meshes",
journal = j-CGF,
volume = "25",
number = "3",
pages = "343--350",
month = sep,
year = "2006",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2006.00953.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "7 Dec 2006",
}
@InProceedings{Cheney:2006:TXD,
author = "J. Cheney",
title = "Tradeoffs in {XML} database compression",
crossref = "Storer:2006:DPD",
pages = "392--401",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.79",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607274",
acknowledgement = ack-nhfb,
}
@InProceedings{Cheng:2006:NLU,
author = "J. Cheng and Tien-Ke Huang",
title = "New lower and upper bounds on the expected length of
optimal one-to-one codes",
crossref = "Storer:2006:DPD",
pages = "43--52",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.52",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607239",
acknowledgement = ack-nhfb,
}
@InProceedings{Cherniavsky:2006:PLD,
author = "N. Cherniavsky and R. E. Ladner",
title = "Practical low delay broadcast of compressed variable
bit rate movies",
crossref = "Storer:2006:DPD",
pages = "362--371",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.66",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607271",
acknowledgement = ack-nhfb,
}
@Article{Chuang:2006:USF,
author = "J.-C. Chuang and C.-C. Chang",
title = "Using A Simple and Fast Image Compression Algorithm To
Hide Secret Information",
journal = j-INT-J-COMPUT-APPL,
volume = "28",
number = "4",
pages = "329--333",
year = "2006",
DOI = "https://doi.org/10.1080/1206212X.2006.11441818",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:23:29 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2006.11441818",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Misc{Coalson:2006:FFLa,
author = "Josh Coalson",
key = "flacID",
title = "{{\tt flac}}: free lossless audio codec",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://flac.sourceforge.net/id.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "flacID (2006) |http://flac.sourceforge.net/id.html|.",
}
@Misc{Coalson:2006:FFLb,
author = "Josh Coalson",
key = "sourceforge.flac",
title = "{FLAC}-Free Lossless Audio Codec",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://sourceforge.net/projects/flac",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "sourceforge.flac (2006)
|http://sourceforge.net/projects/flac|.",
}
@InProceedings{Coleman:2006:TSV,
author = "T. P. Coleman and M. Medard and M. Effros",
title = "Time-sharing vs. source-splitting in the
{Slepian--Wolf} problem: error exponents analysis",
crossref = "Storer:2006:DPD",
pages = "53--62",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.77",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607240",
acknowledgement = ack-nhfb,
}
@InProceedings{Conley:2006:CMA,
author = "E. S. Conley and S. T. Klein",
title = "Compression of multilingual aligned texts",
crossref = "Storer:2006:DPD",
pages = "442",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.15",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607285",
acknowledgement = ack-nhfb,
}
@Book{Cover:2006:EIT,
author = "Thomas M. Cover and Joy A. Thomas",
title = "Elements of Information Theory",
publisher = pub-WILEY-INTERSCIENCE,
address = pub-WILEY-INTERSCIENCE:adr,
edition = "Second",
pages = "xxiii + 748",
year = "2006",
ISBN = "0-471-74881-1 (e-book), 0-471-24195-4 (print),
0-471-74882-X",
ISBN-13 = "978-0-471-74881-6 (e-book), 978-0-471-24195-9 (print),
978-0-471-74882-3",
LCCN = "Q360 .C68 2006",
bibdate = "Sat Mar 23 16:03:48 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/amermathmonthly2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0624/2005047799-d.html;
http://www.loc.gov/catdir/enhancements/fy0624/2005047799-t.html;
http://www.loc.gov/catdir/enhancements/fy0826/2005047799-b.html",
acknowledgement = ack-nhfb,
author-dates = "1938--2012",
remark = "Contents v \\
Preface to the Second Edition xv \\
Preface to the First Edition xvii \\
Acknowledgments for the Second Edition xxi \\
Acknowledgments for the First Edition xxiii \\
1 Introduction and Preview 1 \\
1.1 Preview of the Book 5 \\
2 Entropy, Relative Entropy, and Mutual Information 13
\\
2.1 Entropy 13 \\
2.2 Joint Entropy and Conditional Entropy 16 \\
2.3 Relative Entropy and Mutual Information 19 \\
2.4 Relationship Between Entropy and Mutual Information
20 \\
2.5 Chain Rules for Entropy, Relative Entropy, and
Mutual Information 22 \\
2.6 Jensen's Inequality and Its Consequences 25 \\
2.7 Log Sum Inequality and Its Applications 30 \\
2.8 Data-Processing Inequality 34 \\
2.9 Sufficient Statistics 35 \\
2.10 Fano's Inequality 37 \\
Summary 41 \\
Problems 43 \\
Historical Notes 54 \\
3 Asymptotic Equipartition Property 57 \\ \\
3.1 Asymptotic Equipartition Property Theorem 58 \\
3.2 Consequences of the AEP: Data Compression 60 \\
3.3 High-Probability Sets and the Typical Set 62 \\
Summary 64 \\
Problems 64 \\
Historical Notes 69 \\
4 Entropy Rates of a \\
Stochastic Process 71 \\
4.1 Markov Chains 71 \\
4.2 Entropy Rate 74 \\
4.3 Example: Entropy Rate of a Random Walk on a
Weighted Graph 78 \\
4.4 Second Law of Thermodynamics 81 \\
4.5 Functions of Markov Chains 84 \\
Summary 87 \\
Problems 88 \\
Historical Notes 100 \\
5 Data Compression 103 \\
5.1 Examples of Codes 103 \\
5.2 Kraft Inequality 107 \\
5.3 Optimal Codes 110 \\
5.4 Bounds on the Optimal Code Length 112 \\
5.5 Kraft Inequality for Uniquely Decodable Codes 115
\\
5.6 Huffman Codes 118 \\
5.7 Some Comments on Huffman Codes 120 \\
5.8 Optimality of Huffman Codes 123 \\
5.9 Shannon-Fano-Elias Coding 127 \\
5.10 Competitive Optimality of the Shannon Code 130 \\
5.11 Generation of Discrete Distributions from Fair
Coins 134 \\
Summary 141 \\
Problems 142 \\
Historical Notes 157 \\
6 Gambling and Data Compression 159 \\
6.1 The Horse Race 159 \\
6.2 Gambling and Side Information 164 \\
6.3 Dependent Horse Races and Entropy Rate 166 \\
6.4 The Entropy of English 168 \\
6.5 Data Compression and Gambling 171.. \\
6.6 Gambling Estimate of the Entropy of English 173 \\
Summary 175 \\
Problems 176 \\
Historical Notes 182 \\
7 Channel Capacity 183 \\
7.1 Examples of Channel Capacity 184 \\
7.1.1 Noiseless Binary Channel 184 \\
7.1.2 Noisy Channel with Nonoverlapping Outputs 185 \\
7.1.3 Noisy Typewriter 186 \\
7.1.4 Binary Symmetric Channel 187 \\
7.1.5 Binary Erasure Channel 188 \\
7.2 Symmetric Channels 189 \\
7.3 Properties of Channel Capacity 191 \\
7.4 Preview of the Channel Coding Theorem 191 \\
7.5 Definitions 192 \\
7.6 Jointly Typical Sequences 195 \\
7.7 Channel Coding Theorem 199 \\
7.8 Zero-Error Codes 205 \\
7.9 Fano's Inequality and the Converse to the Coding
Theorem 206 \\
7.10 Equality in the Converse to the Channel Coding
Theorem 208 \\
7.11 Hamming Codes 210 \\
7.12 Feedback Capacity 216 \\
7.13 Source-Channel Separation Theorem 218 \\
Summary 222 \\
Problems 223 \\
Historical Notes 240 \\
8 Differential Entropy 243 \\
8.1 Definitions 243 \\
8.2 AEP for Continuous Random Variables 245 \\
8.3 Relation of Differential Entropy to Discrete
Entropy 247 \\
8.4 Joint and Conditional Differential Entropy 249 \\
8.5 Relative Entropy and Mutual Information 250 \\
8.6 Properties of Differential Entropy, Relative
Entropy, and Mutual Information 252 \\
Summary 256 \\
Problems 256 \\
Historical Notes 259 \\
9 Gaussian Channel 261 \\
9.1 Gaussian Channel: Definitions 263 \\
9.2 Converse to the Coding Theorem for Gaussian
Channels 268 \\
9.3 Bandlimited Channels 270 \\
9.4 Parallel Gaussian Channels 274 \\
9.5 Channels with Colored Gaussian Noise 277 \\
9.6 Gaussian Channels with Feedback 280 \\
Summary 289 \\
Problems 290 \\
Historical Notes 299 \\
10 Rate Distortion Theory 301 \\
10.1 Quantization 301 \\
10.2 Definitions 303 \\
10.3 Calculation of the Rate Distortion Function 307
\\
10.3.1 Binary Source 307 \\
10.3.2 Gaussian Source 310 \\
10.3.3 Simultaneous Description of Independent Gaussian
Random Variables 312 \\
10.4 Converse to the Rate Distortion Theorem 315 \\
10.5 Achievability of the Rate Distortion Function 318
\\
10.6 Strongly Typical Sequences and Rate Distortion
325.. \\
10.7 Characterization of the Rate Distortion Function
329 \\
10.8 Computation of Channel Capacity and the Rate
Distortion Function 332 \\
Summary 335 \\
Problems 336 \\
Historical Notes 345 \\
11 Information Theory and Statistics 347 \\
11.1 Method of Types 347 \\
11.2 Law of Large Numbers 355 \\
11.3 Universal Source Coding 357 \\
11.4 Large Deviation Theory 360 \\
11.5 Examples of Sanov's Theorem 364 \\
11.6 Conditional Limit Theorem 366 \\
11.7 Hypothesis Testing 375 \\
11.8 Chernoff-Stein Lemma 380 \\
11.9 Chernoff Information 384 \\
11.10 Fisher Information and the Cram{\'e}r-Rao
Inequality 392 \\
Summary 397 \\
Problems 399 \\
Historical Notes 408 \\
12 Maximum Entropy 409 \\
12.1 Maximum Entropy Distributions 409 \\
12.2 Examples 411 \\
12.3 Anomalous Maximum Entropy Problem 413 \\
12.4 Spectrum Estimation 415 \\
12.5 Entropy Rates of a Gaussian Process 416 \\
12.6 Burg's Maximum Entropy Theorem 417 \\
Summary 420 \\
Problems 421 \\
Historical Notes 425 \\
13 Universal Source Coding 427 \\
13.1 Universal Codes and Channel Capacity 428 \\
13.2 Universal Coding for Binary Sequences 433 \\
13.3 Arithmetic Coding 436 \\
13.4 Lempel--Ziv Coding 440 \\
13.4.1 Sliding Window Lempel--Ziv Algorithm 441 \\
13.4.2 Tree-Structured Lempel--Ziv Algorithms 442 \\
13.5 Optimality of Lempel--Ziv Algorithms 443 \\
13.5.1 Sliding Window Lempel--Ziv Algorithms 443 \\
13.5.2 Optimality of Tree-Structured Lempel--Ziv
Compression 448 \\
Summary 456 \\
Problems 457 \\
Historical Notes 461 \\
14 Kolmogorov Complexity 463 \\
14.1 Models of Computation 464 \\
14.2 Kolmogorov Complexity: Definitions and Examples
466 \\
14.3 Kolmogorov Complexity and Entropy 473 \\
14.4 Kolmogorov Complexity of Integers 475 \\
14.5 Algorithmically Random and Incompressible
Sequences 476 \\
14.6 Universal Probability 480 \\
14.7 Kolmogorov complexity 482 \\
14.8 Omega 484 \\
14.9 Universal Gambling 487 \\
14.10 Occam's Razor 488 \\
14.11 Kolmogorov Complexity and Universal Probability
490 \\
14.12 Kolmogorov Sufficient Statistic 496 \\
14.13 Minimum Description Length Principle 500 \\
Summary 501 \\
Problems 503 \\
Historical Notes 507 \\
15 Network Information Theory 509 \\
15.1 Gaussian Multiple-User Channels 513 \\
15.1.1 Single-User Gaussian Channel 513 \\
15.1.2 Gaussian Multiple-Access Channel with m Users
514 \\
15.1.3 Gaussian Broadcast Channel 515 \\
15.1.4 Gaussian Relay Channel 516 \\
15.1.5 Gaussian Interference Channel 518 \\
15.1.6 Gaussian Two-Way Channel 519 \\
15.2 Jointly Typical Sequences 520 \\
15.3 Multiple-Access Channel 524 \\
15.3.1 Achievability of the Capacity Region for the
Multiple-Access Channel 530 \\
15.3.2 Comments on the Capacity Region for the
Multiple-Access Channel 532 \\
15.3.3 Convexity of the Capacity Region of the
Multiple-Access Channel 534 \\
15.3.4 Converse for the Multiple-Access Channel 538 \\
15.3.5 m-User Multiple-Access Channels 543 \\
15.3.6 Gaussian Multiple-Access Channels 544 \\
15.4 Encoding of Correlated Sources 549 \\
15.4.1 Achievability of the Slepian-Wolf Theorem 551
\\
15.4.2 Converse for the Slepian-Wolf Theorem 555 \\
15.4.3 Slepian-Wolf Theorem for Many Sources 556 \\
15.4.4 Interpretation of Slepian-Wolf Coding 557 \\
15.5 Duality Between Slepian-Wolf Encoding and
Multiple-Access Channels 558 \\
15.6 Broadcast Channel 560 \\
15.6.1 Definitions for a Broadcast Channel 563 \\
15.6.2 Degraded Broadcast Channels 564 \\
15.6.3 Capacity Region for the Degraded Broadcast
Channel 565 \\
15.7 Relay Channel 571 \\
15.8 Source Coding with Side Information 575 \\
15.9 Rate Distortion with Side Information 580 \\
15.10 General Multiterminal Networks 587 \\
Summary 594 \\
Problems 596 \\
Historical Notes 509 \\
16 Information Theory and Portfolio Theory 613 \\
16.1 The Stock Market: Some Definitions 613 \\
16.2 Kuhn-Tucker Characterization of the Log-Optimal
Portfolio 617 \\
16.3 Asymptotic Optimality of the Log-Optimal Portfolio
619 \\
16.4 Side Information and the Growth Rate 621 \\
16.5 Investment in Stationary Markets 623 \\
16.6 Competitive Optimality of the Log-Optimal
Portfolio 627 \\
16.7 Universal Portfolios 629.. \\
16.7.1 Finite-Horizon Universal Portfolios 631 \\
16.7.2 Horizon-Free Universal Portfolios 638 \\
16.8 Shannon-McMillan-Breiman Theorem (General AEP) 644
\\
Summary 650 \\
Problems 652 \\
Historical Notes 656 \\
17 Inequalities in Information Theory 657 \\
17.1 Basic Inequalities of Information Theory 657 \\
17.2 Differential Entropy 660 \\
17.3 Bounds on Entropy and Relative Entropy 663 \\
17.4 Inequalities for Types 665 \\
17.5 Combinatorial Bounds on Entropy 666 \\
17.6 Entropy Rates of Subsets 667 \\
17.7 Entropy and Fisher Information 671 \\
17.8 Entropy Power Inequality and Brunn-Minkowski
Inequality 674 \\
17.9 Inequalities for Determinants 679 \\
17.10 Inequalities for Ratios of Determinants 683 \\
Summary 686 \\
Problems 686 \\
Historical Notes 687 \\
Bibliography 689 \\
List of Symbols 723 \\
Index 727",
shorttableofcontents = "Entropy, relative entropy, and mutual
information \\
Asymptotic equipartition property \\
Entropy rates of a stochastic process \\
Data compression \\
Gambling and data compression \\
Channel capacity \\
Differential entropy \\
Gaussian channel \\
Rate distortion theory \\
Information theory and statistics \\
Maximum entropy \\
Universal source coding \\
Kolmogorov complexity \\
Network information theory \\
Information theory and portfolio theory \\
Inequalities in information theory",
subject = "Information theory",
}
@InProceedings{Daptardar:2006:RCC,
author = "A. H. Daptardar and J. A. Storer",
title = "Reduced complexity content-based image retrieval using
vector quantization",
crossref = "Storer:2006:DPD",
pages = "342--351",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.71",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607269",
acknowledgement = ack-nhfb,
}
@Article{Daubechies:2006:DCI,
author = "Ingrid Daubechies and Ronald A. DeVore and C. Sinan
G{\"u}nt{\"u}rk and Vinay A. Vaishampayan",
title = "{A/D} conversion with imperfect quantizers",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "52",
number = "3",
pages = "874--885",
month = mar,
year = "2006",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.2005.864430",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A14 (94A20)",
MRnumber = "2238058",
MRreviewer = "David J. Santos",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE International Symposium on Circuits and Systems,
Phoenix, AZ, May 26--29, 2002.",
ZMnumber = "1231.94036",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
keywords = "Analog-digital conversion; Analog-to-digital (A/D)
conversion; analog-to-digital converter; beta
expansion; Bit rate; circuit implementation; coarse
quantization; Delta-sigma modulation; encoder;
encoding; Modulation coding; oversampling; PCM; Phase
change materials; Pulse circuits; pulse code
modulation; Pulse modulation; Pulse width modulation
converters; quantisation (signal); Quantization;
quantization; Rate-distortion; rate-distortion sense;
robustness; self-correction property; sigma--delta
modulation; signal sampling",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056; Vaishampayan,
Vinay/0000-0001-7781-0990",
researcherid-numbers = "Daubechies, Ingrid/B-5886-2012",
unique-id = "ISI:000236126000007",
}
@InProceedings{DeAgostino:2006:LIC,
author = "S. {De Agostino}",
title = "Lossless image compression by block matching on a mesh
of trees",
crossref = "Storer:2006:DPD",
pages = "443",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.43",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607286",
acknowledgement = ack-nhfb,
}
@Misc{devices:2006:FFH,
author = "flac. devices",
title = "{FLAC} format hardware",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://flac.sourceforge.net/links.html#hardware",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "flac.devices (2006)
|http://flac.sourceforge.net/links.html#hardware|.",
}
@Misc{Dolby:2006:DLH,
author = "{Dolby}",
title = "{Dolby Laboratories} home page",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.dolby.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Dolby (2006) |http://www.dolby.com/|.",
}
@Misc{Dolby:2006:TDH,
author = "Thomas Dolby",
title = "{Thomas Dolby} home page",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.thomasdolby.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Thomas Dolby (2006) |http://www.thomasdolby.com/|.",
}
@InProceedings{Dumitrescu:2006:FAD,
author = "S. Dumitrescu",
title = "Faster algorithm for designing optimal prefix-free
codes with unequal letter costs",
crossref = "Storer:2006:DPD",
pages = "444",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.36",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607287",
acknowledgement = ack-nhfb,
}
@InProceedings{Duni:2006:HRT,
author = "E. R. Duni and B. D. Rao",
title = "High-rate training of {Gaussian} mixture vector
quantizers",
crossref = "Storer:2006:DPD",
pages = "445",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.39",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607288",
acknowledgement = ack-nhfb,
}
@Misc{DVB:2006:DVB,
author = "{DVB}",
key = "DVB",
title = "{Digital Video Broadcasting Project (DVB)} home page",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.dvb.org/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "DVB (2006) |http://www.dvb.org/|.",
}
@InProceedings{Eriksson:2006:TBV,
author = "T. Eriksson and N. Goertz and M. Novak and J. B.
Anderson",
title = "{Trellis} based variable rate residual image coding
over noisy channels",
crossref = "Storer:2006:DPD",
pages = "252--261",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.80",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607260",
acknowledgement = ack-nhfb,
}
@InProceedings{Faridi:2006:DCQ,
author = "A. Faridi and A. Ephremides",
title = "Distortion control for queues with deadlines",
crossref = "Storer:2006:DPD",
pages = "312--321",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.24",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607266",
acknowledgement = ack-nhfb,
}
@InProceedings{Floor:2006:NIM,
author = "P. A. Floor and T. A. Ramstad",
title = "Noise immunity for 1:{N} and {M}:1 nonlinear mappings
for source-channel coding",
crossref = "Storer:2006:DPD",
pages = "446",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.53",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607289",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:2006:ARW,
author = "J. E. Fowler",
title = "Analysis of redundant-wavelet multihypothesis for
motion compensation",
crossref = "Storer:2006:DPD",
pages = "352--361",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.7",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607270",
acknowledgement = ack-nhfb,
}
@InProceedings{Franaszek:2006:DCR,
author = "P. A. Franaszek and L. A. Lastras-Montano and Song
Peng and J. T. Robinson",
title = "Data compression with restricted parsings",
crossref = "Storer:2006:DPD",
pages = "203--212",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.22",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607255",
acknowledgement = ack-nhfb,
}
@Article{Fraser:2006:IDI,
author = "Christopher W. Fraser",
title = "An instruction for direct interpretation of
{LZ77}-compressed programs",
journal = j-SPE,
volume = "36",
number = "4",
pages = "397--411",
month = "????",
year = "2006",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.702",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Mar 14 11:39:21 MST 2006",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "A new instruction adapts LZ77 compression for use
inside running programs. The instruction economically
references and reuses code fragments that are too small
to package as conventional subroutines. The compressed
code is interpreted directly, with neither prior nor
on-the-fly decompression. Hardware implementations seem
plausible and could benefit both memory-constrained and
more conventional systems. The method is extremely
simple. It has been added to a pre-existing, bytecoded
instruction set, and it added only 10 lines of C to the
bytecode interpreter. It typically cuts code size by a
third; that is, typical compression ratios are roughly
0.67$ \times $. More ambitious compressors are
available, but they are more complex, which retards
adoption. The current method offers a useful trade-off
to these more complex systems.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
keywords = "bytecode; compression; interpreters",
onlinedate = "13 Dec 2005",
}
@Misc{G131:2006:TEC,
author = "{ITU}",
title = "{ITU-T} Recommendation {G.131}: Talker echo and its
control",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.itu.int/rec/T-REC-G.131/en",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "G131 (2006) ITU-T Recommendation G.131, {\it Talker
echo and its control}.",
}
@InProceedings{Gagie:2006:DAC,
author = "T. Gagie",
title = "Dynamic asymmetric communication",
crossref = "Storer:2006:DPD",
pages = "447",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.29",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607290",
acknowledgement = ack-nhfb,
}
@InProceedings{Gehrig:2006:DSC,
author = "N. Gehrig and P. L. Dragotti",
title = "Distributed sampling and compression of scenes with
finite rate of innovation in camera sensor networks",
crossref = "Storer:2006:DPD",
pages = "83--92",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.27",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607243",
acknowledgement = ack-nhfb,
}
@InProceedings{Gergel:2006:UFL,
author = "B. Gergel and H. Cheng and Xiaobo Li",
title = "A unified framework for lossless image set
compression",
crossref = "Storer:2006:DPD",
pages = "448",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.4",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607291",
acknowledgement = ack-nhfb,
}
@InProceedings{Ghido:2006:CPR,
author = "F. Ghido",
title = "Combined prediction and residual coding for lossless
audio compression",
crossref = "Storer:2006:DPD",
pages = "449",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.10",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607292",
acknowledgement = ack-nhfb,
}
@InProceedings{Gillibert:2006:NLI,
author = "L. Gillibert and A. Bretto",
title = "Near-lossless {$3$D}-image compression using
hypergraphs",
crossref = "Storer:2006:DPD",
pages = "450",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.51",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607293",
acknowledgement = ack-nhfb,
}
@Article{Gobbetti:2006:GCD,
author = "E. Gobbetti and F. Marton and P. Cignoni and M. {Di
Benedetto} and F. Ganovelli",
title = "Geometry Compression and Decompression: {C-BDAM} ---
Compressed Batched Dynamic Adaptive Meshes for Terrain
Rendering",
journal = j-CGF,
volume = "25",
number = "3",
pages = "333--342",
month = sep,
year = "2006",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2006.00952.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "7 Dec 2006",
}
@Misc{Goldbach:2006:LXG,
author = "Ch. Goldbach",
key = "dartmouth",
title = "Lettre {XLIII}: {Goldbach} {\`a} {Euler}: {Moscau d. 7
Juni 1742}",
pages = "3",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.math.dartmouth.edu/~euler/correspondence/letters/OO0765.pdf",
acknowledgement = ack-ds,
rawdata = "dartmouth (2006) is\hfil\break
|http://www.math.dartmouth.edu/~euler/correspondence/letters/OO0765.pdf|.",
}
@InProceedings{Gray:2006:QJE,
author = "R. M. Gray and J. T. {Gill III}",
title = "Quantization with joint entropy\slash memory
constraints",
crossref = "Storer:2006:DPD",
pages = "223--235",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.69",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607257",
acknowledgement = ack-nhfb,
}
@InProceedings{Gu:2006:MRC,
author = "Wei-Hsin Gu and M. Effros",
title = "On multi-resolution coding and a two-hop network",
crossref = "Storer:2006:DPD",
pages = "451",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.58",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607294",
acknowledgement = ack-nhfb,
}
@InProceedings{Guo:2006:FLC,
author = "Jiangling Guo and S. Mitra and B. Nutter and T. Karp",
title = "A fast and low complexity image codec based on
backward coding of wavelet trees",
crossref = "Storer:2006:DPD",
pages = "292--301",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.2",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607264",
acknowledgement = ack-nhfb,
}
@InProceedings{Gupta:2006:CDS,
author = "A. Gupta and Wing-Kai Hon and R. Shah and J. S.
Vitter",
title = "Compressed data structures: dictionaries and
data-aware measures",
crossref = "Storer:2006:DPD",
pages = "213--222",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.12",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607256",
acknowledgement = ack-nhfb,
}
@InProceedings{Hakonsen:2006:ITF,
author = "G. Hakonsen and T. A. Ramstad",
title = "Image transmission over flat fading channels using
joint source channel coding",
crossref = "Storer:2006:DPD",
pages = "452",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.40",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607295",
acknowledgement = ack-nhfb,
}
@InProceedings{Hariharan:2006:ERC,
author = "S. Hariharan and P. Shankar",
title = "Evaluating the role of context in syntax directed
compression of {XML} documents",
crossref = "Storer:2006:DPD",
pages = "453",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.34",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607296",
acknowledgement = ack-nhfb,
}
@InProceedings{Harrusi:2006:XSC,
author = "S. Harrusi and A. Averbuch and A. Yehudai",
title = "{XML} syntax conscious compression",
crossref = "Storer:2006:DPD",
pages = "10 pp.-411",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.85",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607275",
acknowledgement = ack-nhfb,
}
@InProceedings{Hassan:2006:EVB,
author = "M. Hassan and M. Krunz and S. Ahuja",
title = "Efficient video broadcast over wireless channels using
adaptive playback",
crossref = "Storer:2006:DPD",
pages = "454",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.31",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607297",
acknowledgement = ack-nhfb,
}
@InProceedings{Hekland:2006:DSM,
author = "F. Hekland and T. A. Ramstad",
title = "Digitising the 2:1 {Shannon} mappings for transport
over heterogeneous networks",
crossref = "Storer:2006:DPD",
pages = "455",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.23",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607298",
acknowledgement = ack-nhfb,
}
@Article{Hitchcock:2006:DER,
author = "John M. Hitchcock and N. V. Vinodchandran",
title = "Dimension, entropy rates, and compression",
journal = j-J-COMP-SYS-SCI,
volume = "72",
number = "4",
pages = "760--782",
month = jun,
year = "2006",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2005.10.002",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000005001248",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Misc{Horstmann:2006:WST,
author = "Cay S. Horstmann",
title = "{Windows} Shell Tutorial",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.horstmann.com/bigj/help/windows/tutorial.html",
acknowledgement = ack-ds,
rawdata = "Horstmann (2006)
|http://www.horstmann.com/bigj/help/windows/tutorial.html|.",
}
@Article{Hu:2006:ITS,
author = "Yu-Chen Hu and Chin-Chen Chang",
title = "An Improved Tree-Structured Codebook Search Algorithm
for Grayscale Image Compression",
journal = j-FUND-INFO,
volume = "70",
number = "3",
pages = "251--260",
month = may,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:08 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Huang:2006:OIA,
author = "Xiang Huang and Xiaolin Wu",
title = "Optimal index assignment for multiple description
lattice vector quantization",
crossref = "Storer:2006:DPD",
pages = "272--281",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.63",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607262",
acknowledgement = ack-nhfb,
}
@Article{Huybrechs:2006:TDW,
author = "Daan Huybrechs and Stefan Vandewalle",
title = "A two-dimensional wavelet-packet transform for matrix
compression of integral equations with highly
oscillatory kernel",
journal = j-J-COMPUT-APPL-MATH,
volume = "197",
number = "1",
pages = "218--232",
day = "1",
month = dec,
year = "2006",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2005.11.001",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:12:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042705006552",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Misc{hydrogenaudio:2006:HAT,
author = "hydrogenaudio",
title = "hydrogenaudio: the audio technology enthusiast's
resource",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.hydrogenaudio.org/forums/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "hydrogenaudio (2006)
|www.hydrogenaudio.org/forums/|.",
}
@Article{Ilie:2006:SCS,
author = "Lucian Ilie and Cristian Popescu",
title = "The Shortest Common Superstring Problem and Viral
Genome Compression",
journal = j-FUND-INFO,
volume = "73",
number = "1--2",
pages = "153--164",
month = oct,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:36 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Misc{IMA:2006:IIM,
author = "IMA",
title = "{IMA}: The {Institute for the Musical Arts} home
pages",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ima.org/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "IMA (2006) |www.ima.org/|.",
}
@InProceedings{Ingber:2006:NAD,
author = "A. Ingber and M. Feder",
title = "Non-asymptotic design of finite state universal
predictors for individual sequences",
crossref = "Storer:2006:DPD",
pages = "3--12",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.54",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607235",
acknowledgement = ack-nhfb,
}
@Misc{ITU:2006:AMS,
author = "{ITU}",
key = "T-REC-h",
title = "Audiovisual and multimedia systems [list of
standards]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.itu.int/rec/T-REC-h",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "T-REC-h (2006) |http://www.itu.int/rec/T-REC-h|.",
}
@InProceedings{Kandadai:2006:PWA,
author = "S. Kandadai and C. D. Creusere",
title = "Perceptually-weighted audio coding that scales to
extremely low bitrates",
crossref = "Storer:2006:DPD",
pages = "382--391",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.65",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607273",
acknowledgement = ack-nhfb,
}
@InProceedings{Kelly:2006:BCI,
author = "B. Kelly and D. Brailsford",
title = "The {B}-coder: an improved binary arithmetic coder and
probability estimator",
crossref = "Storer:2006:DPD",
pages = "456",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.76",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607299",
acknowledgement = ack-nhfb,
}
@Article{Kim:2006:GCD,
author = "Junho Kim and Sungyul Choe and Seungyong Lee",
title = "Geometry Compression and Decompression:
Multiresolution Random Accessible Mesh Compression",
journal = j-CGF,
volume = "25",
number = "3",
pages = "323--331",
month = sep,
year = "2006",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2006.00951.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "7 Dec 2006",
}
@Article{Klein:2006:CPM,
author = "Shmuel T. Klein and Dana Shapira",
title = "Compressed Pattern Matching in {JPEG} Images",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "17",
number = "6",
pages = "1297--1306",
month = dec,
year = "2006",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S012905410600442X",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@InProceedings{Klein:2006:MDE,
author = "S. T. Klein and T. C. Serebro and D. Shapira",
title = "Modeling delta encoding of compressed files",
crossref = "Storer:2006:DPD",
pages = "457",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.47",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607300",
acknowledgement = ack-nhfb,
}
@Article{Koyuturk:2006:NDB,
author = "Mehmet Koyut{\"u}rk and Ananth Grama and Naren
Ramakrishnan",
title = "Nonorthogonal decomposition of binary matrices for
bounded-error data compression and analysis",
journal = j-TOMS,
volume = "32",
number = "1",
pages = "33--69",
month = mar,
year = "2006",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/1132973.1132976",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Fri May 26 06:32:19 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
abstract = "This article presents the design and implementation of
a software tool, PROXIMUS, for error-bounded
approximation of high-dimensional binary attributed
datasets based on nonorthogonal decomposition of binary
matrices. This tool can be used for analyzing data
arising in a variety of domains ranging from commercial
to scientific applications. Using a combination of
innovative algorithms, novel data structures, and
efficient implementation, PROXIMUS demonstrates
excellent accuracy, performance, and scalability to
large datasets. We experimentally demonstrate these on
diverse applications in association rule mining and DNA
microarray analysis. In limited beta release, PROXIMUS
currently has over 300 installations in over 10
countries.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://portal.acm.org/toc.cfm?idx=J782",
}
@Article{Krintz:2006:AFC,
author = "Chandra Krintz and Sezgin Sucu",
title = "Adaptive On-the-Fly Compression",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "17",
number = "1",
pages = "15--24",
month = jan,
year = "2006",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2006.3",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jul 3 14:26:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@InProceedings{Lansky:2006:CST,
author = "J. Lansky and M. Zemlicka",
title = "Compression of small text files using syllables",
crossref = "Storer:2006:DPD",
pages = "458",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.16",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607301",
acknowledgement = ack-nhfb,
}
@Article{Logeswaran:2006:FTN,
author = "R. Logeswaran",
title = "Fault Tolerant Neural Predictors for Compression of
Sensor Telemetry Data",
journal = j-J-UCS,
volume = "12",
number = "10",
pages = "1439--1454",
month = "????",
year = "2006",
CODEN = "????",
ISSN = "0948-695X (print), 0948-6968 (electronic)",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:40 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jucs.bib",
URL = "http://www.jucs.org/jucs_12_10/fault_tolerant_neural_predictors",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@InProceedings{Mahdian:2006:WGC,
author = "A. Mahdian and H. Khalili and E. Nourbakhsh and M.
Ghodsi",
title = "{Web} graph compression by edge elimination",
crossref = "Storer:2006:DPD",
pages = "459",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.84",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607302",
acknowledgement = ack-nhfb,
}
@InProceedings{Malvar:2006:ARL,
author = "H. S. Malvar",
title = "Adaptive run-length\slash {Golomb--Rice} encoding of
quantized generalized {Gaussian} sources with unknown
statistics",
crossref = "Storer:2006:DPD",
pages = "23--32",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.5",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607237",
acknowledgement = ack-nhfb,
}
@Misc{Malvar:2006:LCT,
author = "H. S. Malvar and A. Hallapuro and M. Karczewicz and L.
Kerofsky",
key = "H.264PaperRM",
title = "Low-Complexity Transform and Quantization in
{H.264\slash AVC}",
pages = "6",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "See original paper \cite{Malvar:2003:LCT}.",
URL = "http://research.microsoft.com/apps/pubs/default.aspx?id=77882;
http://research.microsoft.com/pubs/77882/MalvarCSVTJuly03.pdf",
acknowledgement = ack-ds,
rawdata = "H.264PaperRM (2006) is
|http://research.microsoft.com/apps/pubs/|,
file\hfil\break |default.aspx?id=77882| (a paper by
Rico Malvar).",
}
@Article{Mamou:2006:SAD,
author = "Khaled Mamou and Titus Zaharia and Fran{\c{c}}oise
Pr{\^e}teux",
title = "A skinning approach for dynamic {$3$D} mesh
compression",
journal = j-COMPUT-ANIM-VIRTUAL-WORLDS,
volume = "17",
number = "3--4",
pages = "337--346",
month = "????",
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1002/cav.137",
ISSN = "1546-427X",
ISSN-L = "1546-4261",
bibdate = "Tue Sep 7 10:29:09 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computanimvirtualworlds.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www3.interscience.wiley.com/cgi-bin/jhome/106562739;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Computer Animation and Virtual Worlds",
journal-URL = "http://www3.interscience.wiley.com/cgi-bin/jhome/106562739",
onlinedate = "14 Jun 2006",
}
@Article{Mantiuk:2006:BCH,
author = "Rafa{\l} Mantiuk and Alexander Efremov and Karol
Myszkowski and Hans-Peter Seidel",
title = "Backward compatible high dynamic range {MPEG} video
compression",
journal = j-TOG,
volume = "25",
number = "3",
pages = "713--723",
month = jul,
year = "2006",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/1141911.1141946",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Wed Aug 23 10:02:03 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@InProceedings{Martinian:2006:LDC,
author = "E. Martinian and M. Wainwright",
title = "Low density codes achieve the rate-distortion bound",
crossref = "Storer:2006:DPD",
pages = "153--162",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.44",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607250",
acknowledgement = ack-nhfb,
}
@InProceedings{Miguel:2006:CLM,
author = "A. C. Miguel and J. F. Keane and J. Whiteaker and H.
Zhang and A. Paulovich",
title = "Compression of {LC\slash MS} proteomic data",
crossref = "Storer:2006:DPD",
pages = "460",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.14",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607303",
acknowledgement = ack-nhfb,
}
@InProceedings{Milidiu:2006:CCP,
author = "R. L. Milidiu and C. G. Mello",
title = "Crypto-compression prefix coding",
crossref = "Storer:2006:DPD",
pages = "461",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.17",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607304",
acknowledgement = ack-nhfb,
}
@Article{Mitra:2006:XET,
author = "S. Mitra and K. S. Kim",
title = "{XPAND}: an efficient test stimulus compression
technique",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "2",
pages = "163--173",
month = feb,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.31",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:52 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1566577",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Modha:2006:MCM,
author = "D. S. Modha and N. P. Santhanam",
title = "Making the correct mistakes",
crossref = "Storer:2006:DPD",
pages = "302--311",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.46",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607265",
acknowledgement = ack-nhfb,
}
@Article{Moffat:2006:BCL,
author = "Alistair Moffat and Vo Ngoc Anh",
title = "Binary Codes for Locally Homogeneous Sequences",
journal = j-INFO-PROC-LETT,
volume = "99",
number = "5",
pages = "175--180",
day = "15",
month = sep,
year = "2006",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2006.04.014",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2000.bib",
acknowledgement = ack-ds # " and " # ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
rawdata = "Moffat, Alistair and Vo Ngoc Anh (2006) ``Binary Codes
for Locally Homogeneous Sequences,'' {\it Information
Processing Letters}, {\bf99}(5):175--180, September.",
}
@InProceedings{Mondal:2006:QCP,
author = "B. Mondal and S. Dutta and R. W. {Heath, Jr.}",
title = "Quantization on the complex projective space",
crossref = "Storer:2006:DPD",
pages = "242--251",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.68",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607259",
acknowledgement = ack-nhfb,
}
@Book{Motta:2006:HDC,
editor = "Giovanni Motta and Francesco Rizzo and James A. (James
Andrew) Storer",
title = "Hyperspectral Data Compression",
publisher = "Springer Science+Business Media, Inc.",
address = "Boston, MA, USA",
pages = "xi + 417",
year = "2006",
ISBN = "0-387-28579-2 , 0-387-28600-4 (e-book)",
ISBN-13 = "978-0-387-28579-5, 978-0-387-28600-6 (e-book)",
LCCN = "TA1632 .H97 2006",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0663/2005051678-d.html;
http://www.loc.gov/catdir/enhancements/fy0824/2005051678-b.html;
http://www.loc.gov/catdir/enhancements/fy0824/2005051678-t.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Motta, G., F. Rizzo, and J. A. Storer, eds. (2006)
{\it Hyperspectral Data Compression}, New York,
Springer Verlag.",
subject = "Remote sensing; Computer science; Image Processing;
Image compression; Multispectral photography; Data
Storage Representation; Information Storage and
Retrieval; Information storage and retrieval systems;
Computer Imaging, Graphics and Computer Vision",
xxaddress = "New York, NY, USA",
xxeditor = "Giovanni Motta and James A Storer and Francesco
Rizzo",
}
@InProceedings{Murthy:2006:HRA,
author = "C. R. Murthy and B. D. Rao",
title = "High-rate analysis of source coding for symmetric
error channels",
crossref = "Storer:2006:DPD",
pages = "163--172",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.38",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607251",
acknowledgement = ack-nhfb,
}
@Book{Myers:2006:PBC,
author = "Wayne L. Myers and Ganapati P. Patil",
title = "Pattern-Based Compression of Multi-Band Image Data for
Landscape Analysis",
volume = "2",
publisher = "Springer Science+Business Media, LLC",
address = "Boston, MA, USA",
pages = "xiii + 186",
year = "2006",
ISBN = "0-387-44434-3, 0-387-44439-4",
ISBN-13 = "978-0-387-44434-5, 978-0-387-44439-0",
LCCN = "QH541.15 L35 M94 2006",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
series = "Environmental and Ecological Statistics",
acknowledgement = ack-nhfb,
subject = "Statistics; Environment; Remote sensing; Landscape
ecology; Environment, general; Environmental sciences;
Remote Sensing/Photogrammetry; Statistics for Life
Sciences, Medicine, Health Sciences",
}
@InProceedings{Ndzana:2006:BWT,
author = "B. N. Ndzana and A. Shokrollahi and J. Abel",
title = "{Burrows--Wheeler} text compression with fountain
codes",
crossref = "Storer:2006:DPD",
pages = "462",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.9",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607305",
acknowledgement = ack-nhfb,
}
@Misc{NHK:2006:NOE,
author = "{NHK}",
key = "NHK",
title = "{NHK Online English}",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.nhk.or.jp/english/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "NHK (2006) |http://www.nhk.or.jp/english/|.",
}
@InProceedings{Nielsen:2006:MLC,
author = "C. Nielsen and Xiobo Li",
title = "{MST} for lossy compression of image sets",
crossref = "Storer:2006:DPD",
pages = "463--463",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.48",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607306",
acknowledgement = ack-nhfb,
}
@InProceedings{Nong:2006:UBW,
author = "Ge Nong and Sen Zhang",
title = "Unifying the {Burrows--Wheeler} and the {Schindler}
transforms",
crossref = "Storer:2006:DPD",
pages = "464",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.81",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607307",
acknowledgement = ack-nhfb,
}
@Misc{NTFS:2006:NCH,
author = "{NTFS}",
key = "ntfs",
title = "{NTFS.com} home page: Complete info source: {NTFS} \&
{FAT} file systems and data recovery",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ntfs.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "ntfs (2006) |http://www.ntfs.com/|.",
}
@Article{Ong:2006:BPA,
author = "Ghim Hwee Ong and Kai Yang",
title = "A binary partitioning approach to image compression
using weighted finite automata for large images",
journal = j-COMPUT-MATH-APPL,
volume = "51",
number = "11",
pages = "1705--1714",
month = jun,
year = "2006",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2006.05.008",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:49 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122106001374",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Ozonat:2006:GMM,
author = "K. Ozonat and R. M. Gray",
title = "{Gauss} mixture model-based classification for sensor
networks",
crossref = "Storer:2006:DPD",
pages = "322--331",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.37",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607267",
acknowledgement = ack-nhfb,
}
@Misc{Pavlev:2006:LSS,
author = "Igor Pavlev",
key = "{7z}",
title = "{LZMA SDK} (Software Development Kit) home page",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.7-zip.org/sdk.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "7z (2006) |http://www.7-zip.org/sdk.html|.",
}
@PhdThesis{Percival:2006:MMA,
author = "Colin Percival",
title = "Matching with Mismatches and Assorted Applications",
type = "{Ph.D.} Thesis",
school = "????",
address = "????",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.daemonology.net/papers/thesis.pdf",
acknowledgement = ack-ds,
rawdata = "Percival, Colin (2006) ``Matching with Mismatches and
Assorted Applications,'' Ph.D. Thesis (pending
paperwork). Available at URL\hfil\break
|http://www.daemonology.net/papers/thesis.pdf|.",
remark = "Not in Proquest Dissertations \& Theses (PQDT)
database.",
}
@Article{Prasad:2006:PID,
author = "M. V. N. K. Prasad and K. K. Shukla",
title = "Parallel Implementation of Domain Decomposition Based
Image Compression Algorithm",
journal = j-INT-J-COMPUT-APPL,
volume = "28",
number = "4",
pages = "334--341",
year = "2006",
DOI = "https://doi.org/10.1080/1206212X.2006.11441819",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:23:29 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2006.11441819",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Price:2006:CCT,
author = "G. Price and M. Vachharajani",
title = "A Case for Compressing Traces with {BDDs}",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "5",
number = "2",
pages = "18--18",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/L-CA.2006.17",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Fri Jun 21 05:49:19 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Instruction-level traces are widely used for program
and hardware analysis. However, program traces for just
a few seconds of execution are enormous, up to several
terabytes in size, uncompressed. Specialized
compression can shrink traces to a few gigabytes, but
trace analyzers typically stream the decompressed trace
through the analysis engine. Thus, the complexity of
analysis depends on the decompressed trace size (even
though the decompressed trace is never stored to disk).
This makes many global or interactive analyses
infeasible. This paper presents a method to compress
program traces using binary decision diagrams (BDDs).
BDDs intrinsically support operations common to many
desirable program analyses and these analyses operate
directly on the BDD. Thus, they are often polynomial in
the size of the compressed representation. The paper
presents mechanisms to represent a variety of trace
data using BDDs and shows that BDDs can store, in 1 GB
of RAM, the entire data-dependence graph of traces with
over 1 billion instructions. This allows rapid
computation of global analyses such as heap-object
liveness and dynamic slicing",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Architecture Letters",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "binary decision diagrams; Binary decision diagrams;
Boolean functions; Data analysis; Data structures;
data-dependence graph; dynamic slicing; Engines; global
analyses; Hardware; hardware analysis; heap-object
liveness; instruction-level traces; Performance
analysis; Polynomials; program analysis; program
slicing; program traces; rapid computation; Read-write
memory; Software Engineering; Software Processor
validation Engineering; Software/Program Verification;
Software/Software; Software/Software Engineering;
specialized compression; Testing and Debugging; trace
analyzers; traces compression; Tracing; Validation;
Visualization",
}
@Book{Pu:2006:FDC,
author = "Ida Mengyi Pu",
title = "Fundamental data compression",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xxi + 246",
year = "2006",
ISBN = "0-7506-6310-3 (paperback)",
ISBN-13 = "978-0-7506-6310-6 (paperback)",
LCCN = "QA76.9 .D33 P8 2006",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
URL = "http://site.ebrary.com/lib/ucalgary/Doc?id=10190890",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Algorithms;
Computer algorithms",
}
@InProceedings{Ratanaworabhan:2006:FLC,
author = "P. Ratanaworabhan and Jian Ke and M. Burtscher",
title = "Fast lossless compression of scientific floating-point
data",
crossref = "Storer:2006:DPD",
pages = "133--142",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.35",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607248",
acknowledgement = ack-nhfb,
}
@InProceedings{Rein:2006:LCC,
author = "S. Rein and C. Guhmann and F. H. P. Fitzek",
title = "Low-complexity compression of short messages",
crossref = "Storer:2006:DPD",
pages = "123--132",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.45",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607247",
acknowledgement = ack-nhfb,
}
@Misc{Richardson:2006:HAV,
author = "Iain Richardson",
key = "H.264PaperIR",
title = "{H.264 Advanced Video Coding}",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.vcodex.com/h264.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "H.264PaperIR (2006) |http://www.vcodex.com/h264.html|
(papers by Iain Richardson).",
}
@Misc{Roshal:2006:RHP,
author = "Alexander Roshal",
key = "rarlab",
title = "{RARLAB} home page:Welcome to {RARLAB}, home of
{WinRAR} and {RAR} archivers",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.rarlab.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "rarlab (2006) |http://www.rarlab.com/|.",
}
@Book{Salomon:2006:CSC,
author = "David Salomon",
title = "Curves and Surfaces for Computer Graphics",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 460",
year = "2006",
ISBN = "0-387-24196-5, 0-387-28452-4 (e-book)",
ISBN-13 = "978-0-387-24196-8, 978-0-387-28452-1 (e-book)",
LCCN = "T385 .S2434 2005",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Salomon, David (2006) {\it Curves and Surfaces for
Computer Graphics}, New York, Springer.",
subject = "Computer graphics; Mathematical models",
tableofcontents = "1. Basic theory \\
2. Linear interpolation \\
3. Polynomial interpolation \\
4. Hermite interpolation \\
5. Spline interpolation \\
6. B{\'e}zier approximation \\
7. B-spline approximation \\
8. Subdivision methods \\
9. Sweep surfaces \\
A. Conic sections \\
B. Approximate circles \\
C. Graphics gallery \\
D. Mathematica notes",
}
@InProceedings{Sarshar:2006:PAJ,
author = "N. Sarshar and Xiaolin Wu",
title = "A practical approach to joint network-source coding",
crossref = "Storer:2006:DPD",
pages = "93--102",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.3",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607244",
acknowledgement = ack-nhfb,
}
@InProceedings{Saxena:2006:EQD,
author = "A. Saxena and J. Nayak and K. Rose",
title = "On efficient quantizer design for robust distributed
source coding",
crossref = "Storer:2006:DPD",
pages = "63--72",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.57",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607241",
acknowledgement = ack-nhfb,
}
@Book{Sayood:2006:IDC,
author = "Khalid Sayood",
title = "Introduction to Data Compression",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
edition = "Third",
pages = "xxii + 680",
year = "2006",
ISBN = "0-12-620862-X",
ISBN-13 = "978-0-12-620862-7",
LCCN = "TK5102.92 .S39 2006",
bibdate = "Mon Jan 28 06:43:18 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Morgan Kaufmann series in multimedia information and
systems",
URL = "http://www.loc.gov/catdir/enhancements/fy0625/2005052759-d.html;
http://www.loc.gov/catdir/enhancements/fy0625/2005052759-t.html",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Sayood, Khalid (2005) {\it Introduction to Data
Compression}, 3rd Ed., San Francisco, CA, Morgan
Kaufmann.",
subject = "Data compression (Telecommunication); Coding theory",
tableofcontents = "1: Introduction \\
2: Lossless Compression \\
3: Huffman Coding \\
4: Arithmetic Coding \\
5: Dictionary Techniques \\
6: Context Based Compression \\
7: Lossless Image Compression \\
8: Lossy Coding \\
9: Scalar Quantization \\
10: Vector Quantization \\
11: Differential Encoding \\
12: Transforms, Subbands, and Wavelets \\
13: Transform Coding \\
14: Subband Coding \\
15: Wavelet-Based Compression \\
16: Audio Coding \\
17: Analysis/Synthesis and Analysis by Synthesis
Schemes \\
18: Video Compression \\
Appendix A: Probability and Random Processes \\
Appendix B: A Brief Review of Matrix Concepts \\
Appendix C: The Root Lattices \\
Bibliography.",
}
@TechReport{Scherer:2006:PDU,
author = "Markus W. Scherer and Mark Davis",
title = "Proposed Draft {Unicode} Technical Standard \#40:
{BOCU-1}: {MIME}-Compatible {Unicode} Compression",
type = "Technical report",
institution = pub-UNICODE,
address = pub-UNICODE-SAN-JOSE:adr,
day = "3",
month = feb,
year = "2006",
bibdate = "Sat Mar 18 06:06:04 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unicode.bib",
URL = "http://www.unicode.org/reports/tr40/tr40-1.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Schmalz:2006:MMM,
author = "M. S. Schmalz",
title = "Multi-modal, multi-fractal boundary encoding in
object-based image compression",
crossref = "Storer:2006:DPD",
pages = "465",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.49",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607308",
acknowledgement = ack-nhfb,
}
@Article{Schmiedekamp:2006:CCS,
author = "Mendel Schmiedekamp and Aparna Subbu and Shashi
Phoha",
title = "The Clustered Causal State Algorithm: Efficient
Pattern Discovery for Lossy Data-Compression
Applications",
journal = j-COMPUT-SCI-ENG,
volume = "8",
number = "5",
pages = "59--67",
month = sep # "\slash " # oct,
year = "2006",
CODEN = "CSENFA",
DOI = "https://doi.org/10.1109/MCSE.2006.98",
ISSN = "1521-9615 (print), 1558-366X (electronic)",
ISSN-L = "1521-9615",
bibdate = "Thu Jul 3 11:16:38 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computscieng.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing in Science and Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
}
@InProceedings{Sculley:2006:CML,
author = "D. Sculley and C. E. Brodley",
title = "Compression and machine learning: a new perspective on
feature space vectors",
crossref = "Storer:2006:DPD",
pages = "332--341",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.13",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607268",
acknowledgement = ack-nhfb,
}
@InProceedings{Senft:2006:CST,
author = "M. Senft",
title = "Compressed by the suffix tree",
crossref = "Storer:2006:DPD",
pages = "183--192",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.11",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607253",
acknowledgement = ack-nhfb,
}
@Article{Shalinie:2006:MPF,
author = "S. Mercy Shalinie",
title = "Modeling parallel feed-forward based compression
network",
journal = j-INT-J-PAR-EMER-DIST-SYS,
volume = "21",
number = "4",
pages = "227--237",
month = "????",
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1080/17445760600567859",
ISSN = "1744-5760 (print), 1744-5779 (electronic)",
ISSN-L = "1744-5760",
bibdate = "Thu Jul 10 22:10:57 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib",
URL = "http://www.informaworld.com/smpp/content~content=a747880320",
acknowledgement = ack-nhfb,
journal-URL = "http://www.tandfonline.com/loi/gpaa20",
}
@InProceedings{Shoa:2006:DMP,
author = "A. Shoa and S. Shirani",
title = "Distortion of matching pursuit: modeling and
optimization",
crossref = "Storer:2006:DPD",
pages = "466",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.25",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607309",
acknowledgement = ack-nhfb,
}
@Misc{Sloane:2006:LEI,
author = "Neil J. A. Sloane",
title = "The On-Line Encyclopedia of Integer Sequences",
year = "2006",
bibdate = "Wed Jan 30 09:51:41 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://oeis.org/",
acknowledgement = ack-ds,
rawdata = "Sloane, Neil J. A. (2006) ``The On-Line Encyclopedia
of Integer Sequences,'' at\hfil\break
|www.research.att.com/~njas/sequences/|.",
url-old = "http://www.research.att.com/~njas/sequences/",
}
@Article{Stevenson:2006:PPP,
author = "Daniel E. Stevenson",
title = "{PNG} palette permuter",
journal = j-SIGCSE,
volume = "38",
number = "3",
pages = "143--147",
month = sep,
year = "2006",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1140123.1140164",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "Developing sophomore-level programming assignments
that are both interesting to students and that have a
good balance between low-level and high-level concepts
is a difficult thing to do. The PNG Palette Permuter is
a large assignment that does achieve this balance while
still being based on topics such as encryption and
image processing which students find interesting and
relevant. Specifically, the Permuter involves
compression, encryption, and steganography. This paper
presents this project and discusses the interesting
high and low-level issues that occur.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Misc{suzannevega:2006:U,
author = "suzannevega",
title = "[unknown]",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.suzannevega.com/suzanne/funfacts/music.aspx",
acknowledgement = ack-ds,
rawdata = "suzannevega (2006)
|http://www.suzannevega.com/suzanne/funfacts/music.aspx|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{TFD:2006:FDR,
author = "{TFD}",
key = "acronyms",
title = "The {Free Dictionary}: {RAR}",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://acronyms.thefreedictionary.com/Refund-Anticipated+Return",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "acronyms (2006) is\hfil\break
|http://acronyms.thefreedictionary.com/Refund-Anticipated+Return|.",
}
@InProceedings{Thiebaut:2006:BCA,
author = "C. Thiebaut and D. Lebedeff and C. Latry and Y.
Bobichon",
title = "On-board compression algorithm for satellite
multispectral images",
crossref = "Storer:2006:DPD",
pages = "467",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.61",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607310",
acknowledgement = ack-nhfb,
}
@InProceedings{Tiwari:2006:DFV,
author = "M. Tiwari and P. Cosman",
title = "Dual frame video coding with pulsed quality and a
lookahead window",
crossref = "Storer:2006:DPD",
pages = "372--381",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.28",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607272",
acknowledgement = ack-nhfb,
}
@InProceedings{Tomic:2006:QIB,
author = "R. V. Tomic",
title = "Quantized indexing: beyond arithmetic coding",
crossref = "Storer:2006:DPD",
pages = "468",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.70",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607311",
acknowledgement = ack-nhfb,
}
@Article{Toussaint:2006:CRS,
author = "Marc Toussaint",
title = "Compact representations as a search strategy:
{Compression} {EDAs}",
journal = j-THEOR-COMP-SCI,
volume = "361",
number = "1",
pages = "57--71",
day = "28",
month = aug,
year = "2006",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2006.04.005",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:15 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2005.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Tseng:2006:ERL,
author = "Hsien-Wen Tseng and Chin-Chen Chang",
title = "Error resilient locally adaptive data compression",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "8",
pages = "1156--1160",
month = aug,
year = "2006",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2006.01.004",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Varshney:2006:TSC,
author = "L. R. Varshney and V. K. Goyal",
title = "Toward a source coding theory for sets",
crossref = "Storer:2006:DPD",
pages = "13--22",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.78",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607236",
acknowledgement = ack-nhfb,
}
@PhdThesis{Vosoughi:2006:TEC,
author = "Azadeh Vosoughi",
title = "Tracking and equalizing channels in communication
systems and in data compression",
type = "{Ph.D.} thesis",
school = "Cornell University",
address = "Ithaca, NY, USA",
pages = "172",
year = "2006",
ISBN = "0-542-78862-4",
ISBN-13 = "978-0-542-78862-8",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/305322063",
acknowledgement = ack-nhfb,
advisor = "Anna Scaglione",
classification = "0544: Electrical engineering",
dissertation-thesis-number = "3227243",
subject = "Electrical engineering",
}
@Article{Vovk:2006:WCP,
author = "Vladimir Vovk",
title = "Well-calibrated predictions from on-line compression
models",
journal = j-THEOR-COMP-SCI,
volume = "364",
number = "1",
pages = "10--26",
day = "2",
month = nov,
year = "2006",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2006.07.038",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2005.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Vucetic:2006:FAL,
author = "S. Vucetic",
title = "A fast algorithm for lossless compression of data
tables by reordering",
crossref = "Storer:2006:DPD",
pages = "469",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.1",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607312",
acknowledgement = ack-nhfb,
}
@InProceedings{Wakatani:2006:VCA,
author = "A. Wakatani",
title = "{VQ} compression algorithms on a shared-memory
multiprocessor system",
crossref = "Storer:2006:DPD",
pages = "470",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.83",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607313",
acknowledgement = ack-nhfb,
}
@Article{Wang:2006:APH,
author = "Meiqing Wang and Rong Liu and Choi-Hong Lai",
title = "Adaptive partition and hybrid method in fractal video
compression",
journal = j-COMPUT-MATH-APPL,
volume = "51",
number = "11",
pages = "1715--1726",
month = jun,
year = "2006",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2006.05.009",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:49 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122106001386",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@MastersThesis{Wang:2006:RIC,
author = "Qing Wang",
title = "Research of image compression using vector
quantization applied in the domain of data security",
type = "{M.S.}",
school = "Tsinghua University",
address = "Tsinghua, Peoples Republic of China",
year = "2006",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1026939692",
acknowledgement = ack-nhfb,
advisor = "Xing Liang Lin",
classification = "0984: Computer science",
dissertation-thesis-number = "H433733",
language = "Chinese",
subject = "Computer science",
}
@Misc{WavPack:2006:WHP,
author = "WavPack",
title = "{WavPack} home page: Hybrid Lossless Audio
Compression",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.wavpack.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "WavPack (2006) |http://www.wavpack.com/|.",
}
@Misc{Weisstein:2006:US,
author = "Eric W. Weisstein",
key = "Ulam",
title = "{Ulam} Sequence",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "From MathWorld --- a Wolfram Web resource.",
URL = "http://mathworld.wolfram.com/UlamSequence.html",
acknowledgement = ack-ds,
rawdata = "Ulam (2006) is Weisstein, Eric W. ``Ulam Sequence.''
From MathWorld--A Wolfram Web Resource.
|http://mathworld.wolfram.com/UlamSequence.html|.",
}
@InProceedings{Wernersson:2006:MDC,
author = "N. Wernersson and M. Skoglund",
title = "Multiple description coding using rotated permutation
codes",
crossref = "Storer:2006:DPD",
pages = "471",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.50",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607314",
acknowledgement = ack-nhfb,
}
@Misc{Whittle:2006:RCA,
author = "Robin Whittle",
key = "firstpr",
title = "{Rice} Coding, {AKA} {Rice} Packing, {Elias Gamma}
codes and other approaches",
pages = "??",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.firstpr.com.au/audiocomp/lossless/#rice",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "firstpr (2006)
|http://www.firstpr.com.au/audiocomp/lossless/#rice|.",
}
@Misc{Williams:2006:CP,
author = "Ross N. Williams",
key = "patents",
title = "Compression Patents",
year = "2006",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ross.net/compression/patents.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "patents (2006)
|www.ross.net/compression/patents.html|.",
}
@Article{Wintner:2006:BBS,
author = "R. Wintner",
title = "Bits on the Big Screen",
journal = j-IEEE-SPECTRUM,
volume = "43",
number = "12",
pages = "42--48",
month = dec,
year = "2006",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2006.253397",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "cinematography; cost savings; data compression;
digital cinema system; Disney studios; Fox studios;
History; Imaging phantoms; MGM studios; Motion
pictures; movie industry; Paramount studios; Radio
access networks; Sony Pictures Entertainment; Spinning;
Storms; Universal studios; video coding; video
compression technology; virtual print fee; Warner
Brothers studios",
}
@InProceedings{Wu:2006:ERL,
author = "Yonghui Wu and S. Lonardi and W. Szpankowski",
title = "Error-resilient {LZW} data compression",
crossref = "Storer:2006:DPD",
pages = "193--202",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.33",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607254",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2006:JSC,
author = "Xiaolin Wu and Xiaohan Wang and Jia Wang",
title = "Joint source-channel decoding of multiple description
quantized {Markov} sequences",
crossref = "Storer:2006:DPD",
pages = "103--112",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.41",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607245",
acknowledgement = ack-nhfb,
}
@Article{Wu:2006:OBI,
author = "Kesheng Wu and Ekow J. Otoo and Arie Shoshani",
title = "Optimizing bitmap indices with efficient compression",
journal = j-TODS,
volume = "31",
number = "1",
pages = "1--38",
month = mar,
year = "2006",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1132863.1132864",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@InProceedings{Xiao:2006:ERT,
author = "Song Xiao and Chengke Wu and Jianchao Du and Yadong
Yang",
title = "Error resilient transmission of {H.264} video over
wireless network",
crossref = "Storer:2006:DPD",
pages = "472",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.32",
bibdate = "Tue Feb 5 14:07:38 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607315",
acknowledgement = ack-nhfb,
}
@MastersThesis{Xu:2006:RDC,
author = "Feng Rong Xu",
title = "The Research of Data Compression on {Abis} Interface
of {GSM} Network",
type = "{M.S.}",
school = "Huazhong (Central China) University of Science and
Technology",
address = "Huazhong, Peoples Republic of China",
year = "2006",
bibdate = "Fri Feb 1 09:20:36 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1026570127",
acknowledgement = ack-nhfb,
advisor = "Guang Xi Zhu",
classification = "0489: Information Technology",
dissertation-thesis-number = "H252017",
language = "Chinese",
subject = "Information Technology",
}
@InProceedings{Yoon:2006:VQM,
author = "Sangho Yoon",
title = "Vector quantization with model selection",
crossref = "Storer:2006:DPD",
pages = "233--241",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.82",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607258",
acknowledgement = ack-nhfb,
}
@InProceedings{Zheng:2006:AMA,
author = "J. Zheng and E. Duni and B. D. Rao",
title = "Analysis of multiple antenna systems with finite-rate
feedback using high resolution quantization theory",
crossref = "Storer:2006:DPD",
pages = "73--82",
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.6",
bibdate = "Tue Feb 5 14:07:32 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607242",
acknowledgement = ack-nhfb,
}
@Article{Zheng:2006:IFI,
author = "Yang Zheng and Guanrong Liu and Xiaoxiao Niu",
title = "An improved fractal image compression approach by
using iterated function system and genetic algorithm",
journal = j-COMPUT-MATH-APPL,
volume = "51",
number = "11",
pages = "1727--1740",
month = jun,
year = "2006",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2006.05.010",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:49 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122106001398",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Abel:2007:IFC,
author = "J{\"u}rgen Abel",
title = "Incremental frequency count --- a post {BWT}-stage for
the {Burrows--Wheeler} compression algorithm",
journal = j-SPE,
volume = "37",
number = "3",
pages = "247--265",
month = mar,
year = "2007",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.763",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Oct 17 18:33:14 MDT 2007",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "The stage after the Burrows--Wheeler transform (BWT)
has a key function inside the Burrows--Wheeler
compression algorithm as it transforms the BWT output
from a local context into a global context. This paper
presents the Incremental Frequency Count stage, a
post-BWT stage. The new stage is paired with a run
length encoding stage between the BWT and the entropy
coding stage of the algorithm. It offers high
throughput similar to a Move To Front stage, and at the
same time good compression rates like the strong but
slow Weighted Frequency Count stage. The properties of
the Incremental Frequency Count stage are compared to
the Move To Front and Weighted Frequency Count stages
by their compression rates and speeds on the Calgary
and large Canterbury corpora.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "26 Sep 2006",
}
@Misc{Abel:2007:U,
author = "J{\"u}rgen Abel",
key = "JuergenAbel",
title = "[unknown]",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.data-compression.info/JuergenAbel/Preprints/;
http://www.data-compression.info/JuergenAbel/Preprints/Preprint_After_BWT_Stages.pdf",
acknowledgement = ack-ds,
rawdata = "JuergenAbel (2007) is file
|Preprint_After_BWT_Stages.pdf| in\hfil\break
|http://www.data-compression.info/JuergenAbel/Preprints/|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Article{Adiego:2007:LZC,
author = "Joaqu{\'\i}n Adiego and Gonzalo Navarro and Pablo de
la Fuente",
title = "{Lempel--Ziv} compression of highly structured
documents",
journal = j-J-AM-SOC-INF-SCI-TECHNOL,
volume = "58",
number = "4",
pages = "461--478",
day = "15",
month = feb,
year = "2007",
CODEN = "JASIEF",
DOI = "https://doi.org/10.1002/asi.20496",
ISSN = "1532-2882 (print), 1532-2890 (electronic)",
ISSN-L = "1532-2882",
bibdate = "Fri Sep 11 10:42:40 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jasist.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science and Technology: JASIST",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1532-2890",
onlinedate = "25 Jan 2007",
}
@Article{Anderson:2007:RVJ,
author = "M. Anderson",
title = "Resources: Virtual Jamming",
journal = j-IEEE-SPECTRUM,
volume = "44",
number = "7",
pages = "53--56",
month = jul,
year = "2007",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2007.376609",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "data compression; ejamming; groupware; Jamming; lag
problem; music; music players; Musigy invitation-only
beta version; virtual jamming; virtual performance
room",
}
@InProceedings{Andriani:2007:LCC,
author = "S. Andriani and G. Calvagno",
title = "Lossless Compression of Colour Video Sequence using
Optimal Prediction Theory --- {Octopus}",
crossref = "Storer:2007:DPD",
pages = "375--375",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.52",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148776",
acknowledgement = ack-nhfb,
}
@InProceedings{Anonymous:2007:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2007:DPD",
pages = "xiii--xiii",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.75",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148738",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2007:DI,
author = "Anonymous",
key = "incredible",
title = "Datacompression.info",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://datacompression.info/IncredibleClaims.shtml",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "incredible (2007)
|http://datacompression.info/IncredibleClaims.shtml|.",
}
@Misc{Anonymous:2007:FSH,
author = "Anonymous",
key = "hffax",
title = "Facsimile \& {SSTV} History",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.hffax.de/html/hauptteil_faxhistory.htm",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "hffax (2007)
|http://www.hffax.de/html/hauptteil_faxhistory.htm|.",
}
@InProceedings{Anonymous:2007:PC,
author = "Anonymous",
title = "Program Committee",
crossref = "Storer:2007:DPD",
pages = "xii--xii",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.67",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148737",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2007:T,
author = "Anonymous",
key = "technikum29",
title = "Telegraphy",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.technikum29.de/en/communication/fax.shtm",
acknowledgement = ack-ds,
rawdata = "technikum29 (2007)
|http://www.technikum29.de/en/communication/fax.shtm|.",
}
@Misc{Anonymous:2007:Ua,
author = "Anonymous",
key = "codethatword",
title = "[unknown]",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.codethatword.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013. However, the Web site appears to be
unrelated to data compression.",
rawdata = "codethatword (2007) |http://www.codethatword.com/|.",
}
@Misc{Anonymous:2007:Ub,
author = "Anonymous",
key = "patents",
title = "[unknown]",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.datacompression.info/patents.shtml",
acknowledgement = ack-ds,
rawdata = "patents (2007)
|http://www.datacompression.info/patents.shtml|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Anonymous:2007:Uc,
author = "Anonymous",
title = "[unknown]",
year = "2007",
bibdate = "Sun Jan 27 10:51:45 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.gemstartvguide.com",
acknowledgement = ack-nhfb,
keywords = "Gemstar",
remark = "URL no longer accessible on 27 January 2013; URL
redirects to \path=http://www.rovicorp.com/=",
}
@Misc{Anonymous:2007:ZL,
author = "Anonymous",
key = "Zipf's Law",
title = "{Zipf}'s law",
year = "2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Zipf's_law",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Zipf's Law (2007)
|http://en.wikipedia.org/wiki/Zipf's_law|",
}
@Article{Bakulina:2007:AZL,
author = "M. P. Bakulina",
title = "Application of {Zipf}'s law for text compression",
journal = "Diskretn. Anal. Issled. Oper. Ser. 2",
volume = "14",
number = "2",
pages = "3--13",
year = "2007",
CODEN = "????",
ISSN = "1560-9901",
MRclass = "94A15",
MRnumber = "2542308 (2010i:94076)",
MRreviewer = "I. Vajda",
bibdate = "Sat Nov 12 09:13:23 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Diskretny{\u\i} Analiz i Issledovanie Operatsi{\u\i}.
Seriya 2",
}
@InProceedings{Banihashemi:2007:DOR,
author = "A. H. Banihashemi and A. Hatam",
title = "A Distortion Optimal Rate Allocation Algorithm for
Transmission of Embedded Bitstreams over Noisy
Channels",
crossref = "Storer:2007:DPD",
pages = "376--376",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.2",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148777",
acknowledgement = ack-nhfb,
}
@InProceedings{Boettcher:2007:MBA,
author = "J. B. Boettcher and J. E. Fowler",
title = "A Modified {BISK} Algorithm for {$3$D}
Dual-TreeWavelet Transform Coding",
crossref = "Storer:2007:DPD",
pages = "377--377",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.4",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148778",
acknowledgement = ack-nhfb,
}
@InProceedings{Boufounos:2007:QSR,
author = "P. Boufounos and R. Baraniuk",
title = "Quantization of Sparse Representations",
crossref = "Storer:2007:DPD",
pages = "378--378",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.68",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148779",
acknowledgement = ack-nhfb,
}
@Article{Brittain:2007:GTT,
author = "Nathanael Brittain and Mahmoud R. El-Sakka",
title = "Grayscale True Two-Dimensional Dictionary-Based Image
Compression",
journal = j-J-VIS-COMMUN-IMAGE-REPRESENT,
volume = "18",
number = "1",
pages = "35--44",
month = feb,
year = "2007",
CODEN = "JVCRE7",
DOI = "https://doi.org/10.1016/j.jvcir.2006.09.001",
ISSN = "1047-3203 (print), 1095-9076 (electronic)",
ISSN-L = "1047-3203",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "Journal of Visual Communication and Image
Representation",
rawdata = "Brittain, Nathanael and Mahmoud R. El-Sakka (2007)
``Grayscale True Two-Dimensional Dictionary-Based Image
Compression,'' {\it Journal of Visual Communication and
Image Representation}, {\bf18}(1):35--44, February.",
}
@Misc{brucelindbloom:2007:I,
author = "brucelindbloom",
title = "info",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.brucelindbloom.com/",
acknowledgement = ack-ds,
rawdata = "brucelindbloom (2007) |http://www.brucelindbloom.com/|
(click on ``info'').",
}
@InProceedings{Burtscher:2007:HTC,
author = "M. Burtscher and P. Ratanaworabhan",
title = "High Throughput Compression of Double-Precision
Floating-Point Data",
crossref = "Storer:2007:DPD",
pages = "293--302",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.44",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148768",
acknowledgement = ack-nhfb,
}
@Article{Cameron:2007:CCS,
author = "Michael Cameron and Hugh Williams",
title = "Comparing Compressed Sequences for Faster Nucleotide
{BLAST} Searches",
journal = j-TCBB,
volume = "4",
number = "3",
pages = "349--364",
month = jul,
year = "2007",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/tcbb.2007.1029",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Jun 12 16:58:24 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Molecular biologists, geneticists, and other life
scientists use the BLAST homology search package as
their first step for discovery of information about
unknown or poorly annotated genomic sequences. There
are two main variants of BLAST: BLASTP for searching
protein collections and BLASTN for nucleotide
collections. Surprisingly, BLASTN has had very little
attention; for example, the algorithms it uses do not
follow those described in the 1997 BLAST paper [1] and
no exact description has been published. It is
important that BLASTN is state-of-the-art: Nucleotide
collections such as GenBank dwarf the protein
collections in size, they double in size almost yearly,
and they take many minutes to search on modern general
purpose workstations. This paper proposes significant
improvements to the BLASTN algorithms. Each of our
schemes is based on compressed bytepacked formats that
allow queries and collection sequences to be compared
four bases at a time, permitting very fast query
evaluation using lookup tables and numeric comparisons.
Our most significant innovations are two new, fast
gapped alignment schemes that allow accurate sequence
alignment without decompression of the collection
sequences. Overall, our innovations more than double
the speed of BLASTN with no effect on accuracy and have
been integrated into our new version of BLAST that is
freely available for download from
\path=http://www.fsa-blast.org/=.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
keywords = "BLAST; compression; Four Russians algorithm; homology
search; sequence alignment",
}
@InProceedings{Cao:2007:SSA,
author = "Minh Duc Cao and T. I. Dix and L. Allison and C.
Mears",
title = "A Simple Statistical Algorithm for Biological Sequence
Compression",
crossref = "Storer:2007:DPD",
pages = "43--52",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.7",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148743",
acknowledgement = ack-nhfb,
}
@Misc{Chaitin:2007:LR,
author = "Gregory Chaitin",
title = "The Limits of Reason",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer3.html",
acknowledgement = ack-ds,
rawdata = "Chaitin (2007)
|http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer3.html|.",
}
@InProceedings{Chen:2007:MDC,
author = "Jun Chen and Chao Tian and S. Diggavi",
title = "Multiple Description Coding for Stationary and Ergodic
Sources",
crossref = "Storer:2007:DPD",
pages = "73--82",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.56",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148746",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2007:NCD,
author = "S. Chen and A. Nucci",
title = "Nonuniform Compression in Databases with {Haar}
Wavelet",
crossref = "Storer:2007:DPD",
pages = "223--232",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.59",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148761",
acknowledgement = ack-nhfb,
}
@InProceedings{Cinque:2007:PDL,
author = "L. Cinque and S. {De Agostino}",
title = "A Parallel Decoder for Lossless Image Compression by
Block Matching",
crossref = "Storer:2007:DPD",
pages = "183--192",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.6",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148757",
acknowledgement = ack-nhfb,
}
@TechReport{Consortium:2007:GC,
author = "{Unicode Consortium}",
key = "Greek-Unicode",
title = "{Greek} and {Coptic}",
institution = pub-UNICODE,
address = pub-UNICODE:adr,
pages = "5",
year = "2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "From The Unicode Standard, Version 6.2.",
URL = "http://www.unicode.org/charts/PDF/U0370.pdf",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Greek-Unicode (2007)
|http://www.unicode.org/charts/PDF/U0370.pdf|.",
}
@Article{Constantinescu:2007:LZC,
author = "Sorin Constantinescu and Lucian Ilie",
title = "The {Lempel--Ziv} Complexity of Fixed Points of
Morphisms",
journal = j-SIAM-J-DISCR-MATH,
volume = "21",
number = "2",
pages = "466--481",
month = "????",
year = "2007",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/050646846",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Tue May 18 21:37:00 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/21/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@Article{Cooprider:2007:OCC,
author = "Nathan Dean Cooprider and John David Regehr",
title = "Offline compression for on-chip {RAM}",
journal = j-SIGPLAN,
volume = "42",
number = "6",
pages = "363--372",
month = jun,
year = "2007",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1250734.1250776",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:55:30 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
abstract = "We present offline RAM compression, an automated
source-to-source transformation that reduces a
program's data size. Statically allocated scalars,
pointers, structures, and arrays are encoded and packed
based on the results of a whole-program analysis in the
value set and pointer set domains. We target embedded
software written in C that relies heavily on static
memory allocation and runs on Harvard-architecture
microcontrollers supporting just a few KB of on-chip
RAM. On a collection of embedded applications for AVR
microcontrollers, our transformation reduces RAM usage
by an average of 12\%, in addition to a 10\% reduction
through a dead-data elimination pass that is also
driven by our whole-program analysis, for a total RAM
savings of 22\%. We also developed a technique for
giving developers access to a flexible spectrum of
tradeoffs between RAM consumption, ROM consumption, and
CPU efficiency. This technique is based on a model for
estimating the cost/benefit ratio of compressing each
variable and then selectively compressing only those
variables that present a good value proposition in
terms of the desired tradeoffs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "data compression; embedded software; memory
optimization; sensor networks; static analysis;
TinyOS",
}
@Article{Cvetkovic:2007:SBO,
author = "Zoran Cvetkovi{\'c} and Ingrid Daubechies and Benjamin
F. {Logan, Jr.}",
title = "Single-bit oversampled {A/D} conversion with
exponential accuracy in the bit rate",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "53",
number = "11",
pages = "3979--3989",
month = nov,
year = "2007",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.2007.907508",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A20 (94A34)",
MRnumber = "2446550",
MRreviewer = "David J. Santos",
bibdate = "Wed Mar 7 10:19:22 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Data Compression Conference (DCC 2002), Snowbird, UT,
April 02--04, 2002.",
ZMnumber = "1231.94041",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18",
keywords = "Analog-to-digital (A/D) conversion; analogue-digital
conversion; Bit rate; Costs; Data compression;
Distortion; distortion-rate characteristic; dither;
Helium; input band-limited signal; interpolation;
Interpolation; Mathematics; oversampling factor;
quantisation (signal); Quantization; quantization;
sampling; Sampling methods; signal reconstruction;
Signal resolution; signal sampling; single bit;
single-bit oversampled A/D conversion; single-bit
quantization; zero-crossings",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
researcherid-numbers = "Daubechies, Ingrid/B-5886-2012",
unique-id = "ISI:000250448800010",
}
@InProceedings{daCunha:2007:SMV,
author = "A. L. da Cunha and Minh Do and M. Vetterli",
title = "A Stochastic Model for Video and its Information
Rates",
crossref = "Storer:2007:DPD",
pages = "3--12",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.8",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148739",
acknowledgement = ack-nhfb,
}
@InProceedings{DiLillo:2007:TCU,
author = "A. {Di Lillo} and J. A. Storer and G. Motta",
title = "Texture Classification Using {VQ} with Feature
Extraction based on Transforms Motivated by the Human
Visual System",
crossref = "Storer:2007:DPD",
pages = "392--392",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.74",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148793",
acknowledgement = ack-nhfb,
}
@InProceedings{Doshi:2007:DFC,
author = "V. Doshi and D. Shah and M. Medard and S. Jaggi",
title = "Distributed Functional Compression through Graph
Coloring",
crossref = "Storer:2007:DPD",
pages = "93--102",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.34",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148748",
acknowledgement = ack-nhfb,
}
@Article{Drinic:2007:PPC,
author = "Milenko Drini{\'c} and Darko Kirovski and Hoi Vo",
title = "{PPMexe}: {Program} compression",
journal = j-TOPLAS,
volume = "29",
number = "1",
pages = "3:1--3:31",
month = jan,
year = "2007",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/1180475.1180478",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Sat Apr 14 11:13:22 MDT 2007",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toplas.bib",
abstract = "With the emergence of software delivery platforms,
code compression has become an important system
component that strongly affects performance. This
article presents PPMexe, a compression mechanism for
program binaries that analyzes their syntax and
semantics to achieve superior compression ratios. We
use the generic paradigm of prediction by partial
matching (PPM) as the foundation of our compression
codec. PPMexe combines PPM with two preprocessing
steps: (i) instruction rescheduling to improve
prediction rates and (ii) heuristic partitioning of a
program binary into streams with high autocorrelation.
We improve the traditional PPM algorithm by (iii) using
an additional alphabet of frequent variable-length
supersymbols extracted from the input stream of
fixed-length symbols. In addition, PPMexe features (iv)
a low-overhead mechanism that enables decompression
starting from an arbitrary instruction of the
executable, a property pivotal for runtime software
delivery. We implemented PPMexe for x86 binaries and
tested it on several large applications. Binaries
compressed using PPMexe were 18--24\% smaller than
files created using off-the-shelf PPMD, one of the best
available compressors.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
}
@InProceedings{Dube:2007:BRP,
author = "D. Dube and V. Beaudoin",
title = "Bit Recycling with Prefix Codes",
crossref = "Storer:2007:DPD",
pages = "379--379",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.18",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148780",
acknowledgement = ack-nhfb,
}
@InProceedings{Ekbatani:2007:TSF,
author = "S. Ekbatani and F. Etemadi and H. Jafarkhani",
title = "Transmission Over Slowly Fading Channels Using
Unreliable Quantized Feedback",
crossref = "Storer:2007:DPD",
pages = "353--362",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.78",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148774",
acknowledgement = ack-nhfb,
}
@InProceedings{Etemadi:2007:ORP,
author = "F. Etemadi and H. Jafarkhani",
title = "Optimal Rate and Power Allocation for Layered
Transmission with Superposition Coding",
crossref = "Storer:2007:DPD",
pages = "380--380",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.63",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148781",
acknowledgement = ack-nhfb,
}
@InProceedings{Fang:2007:VBO,
author = "Yong Fang and Jechang Jeong",
title = "{VLR}-Based Optimal Positioning of Resynchronization
Markers",
crossref = "Storer:2007:DPD",
pages = "381--381",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.80",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148782",
acknowledgement = ack-nhfb,
}
@Article{Ferragina:2007:CRS,
author = "Paolo Ferragina and Giovanni Manzini and Veli
M{\"a}kinen and Gonzalo Navarro",
title = "Compressed representations of sequences and full-text
indexes",
journal = j-TALG,
volume = "3",
number = "2",
pages = "20:1--20:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1240233.1240243",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Mon Jun 16 11:54:42 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "Given a sequence $ S = s_1 s_2 \ldots s_n $ of
integers smaller than $ r = O(\polylog (n)) $, we show
how $S$ can be represented using $ n H_0 (S) + o(n)$
bits, so that we can know any $ s_q$, as well as answer
rank and select queries on $S$, in constant time. $ H_0
(S)$ is the zero-order empirical entropy of $S$ and $ n
H_0 (S)$ provides an information-theoretic lower bound
to the bit storage of any sequence $S$ via a fixed
encoding of its symbols. This extends previous results
on binary sequences, and improves previous results on
general sequences where those queries are answered in $
O(\log r)$ time. For larger $r$, we can still represent
$S$ in $ n H_0 (S) + o(n \log r)$ bits and answer
queries in $ O(\log r / \log \log n)$ time.\par
Another contribution of this article is to show how to
combine our compressed representation of integer
sequences with a compression boosting technique to
design compressed full-text indexes that scale well
with the size of the input alphabet $ \Sigma $.
Specifically, we design a variant of the FM-index that
indexes a string $ T[1, n]$ within $ n H_k(T) + o(n)$
bits of storage, where $ H_k(T)$ is the $k$ th-order
empirical entropy of $T$. This space bound holds
simultaneously for all $ k \leq \alpha \log | \Sigma |
n$, constant $ 0 < \alpha < 1$, and $ | \Sigma | =
O(\polylog (n))$. This index counts the occurrences of
an arbitrary pattern $ P[1, p]$ as a substring of $T$
in $ O(p)$ time; it locates each pattern occurrence in
$ O(\log 1 + \varepsilon n)$ time for any constant $ 0
< \varepsilon < 1$; and reports a text substring of
length $ \ell $ in $ O(\ell + \log 1 + \varepsilon n)$
time.\par
Compared to all previous works, our index is the first
that removes the alphabet-size dependance from all
query times, in particular, counting time is linear in
the pattern length. Still, our index uses essentially
the same space of the $k$ th-order entropy of the text
$T$, which is the best space obtained in previous work.
We can also handle larger alphabets of size $ | \Sigma
| = O(n \beta)$, for any $ 0 < \beta < 1$, by paying $
o(n \log | \Sigma |)$ extra space and multiplying all
query times by $ O(\log | \Sigma | / \log \log n)$.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Algorithms (TALG)",
keywords = "Burrows--Wheeler transform; compression boosting;
entropy; rank and select; text compression; Text
indexing; wavelet tree",
}
@InProceedings{Flierl:2007:HPA,
author = "M. Flierl and B. Girod",
title = "Half-Pel Accurate Motion-Compensated Orthogonal Video
Transforms",
crossref = "Storer:2007:DPD",
pages = "13--22",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.43",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148740",
acknowledgement = ack-nhfb,
}
@InProceedings{Garcia-Frias:2007:EPK,
author = "J. Garcia-Frias and I. Esnaola",
title = "Exploiting Prior Knowledge in The Recovery of Signals
from Noisy Random Projections",
crossref = "Storer:2007:DPD",
pages = "333--342",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.37",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148772",
acknowledgement = ack-nhfb,
}
@InProceedings{Gueguen:2007:MBS,
author = "L. Gueguen and M. Datcu",
title = "The Model based Similarity Metric",
crossref = "Storer:2007:DPD",
pages = "382--382",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.76",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148783",
acknowledgement = ack-nhfb,
}
@InProceedings{Gunduz:2007:LTC,
author = "D. Gunduz and E. Erkip",
title = "Lossless Transmission of Correlated Sources over a
Multiple Access Channel with Side Information",
crossref = "Storer:2007:DPD",
pages = "83--92",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.53",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148747",
acknowledgement = ack-nhfb,
}
@PhdThesis{Haghighat:2007:DCU,
author = "Javad Haghighat",
title = "Data compression using error correcting codes",
type = "{Ph.D.} thesis",
school = "Department of Electrical and Computer Engineering,
Concordia University",
address = "Montr{\'e}al, QC, Canada",
pages = "xiii + 86",
month = mar,
year = "2007",
ISBN = "0-494-30135-X",
ISBN-13 = "978-0-494-30135-7",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "2 microfiches.",
series = "Canadian theses = Th{\`e}ses canadiennes.",
URL = "http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/002/NR30135.PDF",
acknowledgement = ack-nhfb,
pagecount = "100",
}
@InProceedings{Haleem:2007:OSC,
author = "M. A. Haleem and K. P. Subbalakshmi",
title = "Optimal Source-Channel Decoder for Correlated {Markov}
Sources over Additive {Markov} Channels",
crossref = "Storer:2007:DPD",
pages = "383--383",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.64",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148784",
acknowledgement = ack-nhfb,
}
@Book{Haralambous:2007:FE,
author = "Yannis Haralambous",
title = "Fonts and Encodings",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xx + 1016",
year = "2007",
ISBN = "0-596-10242-9",
ISBN-13 = "978-0-596-10242-5",
LCCN = "Z250",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
melvyl.cdlib.org:210/CDL90",
note = "Translation of \cite{Haralambous:2004:FCG} from French
by P. Scott Horne.",
URL = "http://www.oreilly.com/catalog/9780596102425",
acknowledgement = ack-ds # " and " # ack-nhfb,
rawdata = "Haralambous, Yannis (2007) {\it Fonts and Encodings},
(Translated by P. Scott Horne), Sebastopol, CA,
O'Reilly Associates.",
remark = "Translation of: Fontes and codages. ``From Unicode to
advanced typography and everything in between. ``Covers
PostScript, TrueType, OpenType, AAT, Metafont, and
more.",
subject = "Computer fonts; Type and type-founding; Digital
techniques; Web typography; Character sets (Data
processing); Unicode (Computer character set)",
}
@Article{Hoang:2007:CBC,
author = "Anh Tuan Hoang and Mehul Motani",
title = "Collaborative broadcasting and compression in
cluster-based wireless sensor networks",
journal = j-TOSN,
volume = "3",
number = "3",
pages = "17:1--17:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1267060.1267065",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jun 16 17:50:25 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Achieving energy efficiency to prolong the network
lifetime is an important design criterion for wireless
sensor networks. In this article, we propose a novel
approach that exploits the broadcast nature of the
wireless medium for energy conservation in spatially
correlated wireless sensor networks. Since wireless
transmission is inherently broadcast, when one sensor
node transmits, other nodes in its coverage area can
receive the transmitted data. When data collected by
different sensors are correlated, each sensor can
utilize the data it overhears from other sensors to
compress its own data and conserve energy in its own
transmissions. We apply this idea to a class of
cluster-based wireless sensor networks in which each
sensing node transmits collected data directly to its
cluster head using time division multiple access
(TDMA). We formulate the problem in which sensors in
each cluster collaborate their transmitting, receiving,
and compressing activities to optimize their lifetimes.
We show that this lifetime optimization problem can be
solved by a sequence of linear programming problems. We
also propose a heuristic scheme which has low
complexity and achieves near optimal performance.
Important characteristics of wireless sensor networks
such as node startup cost and packet loss due to
transmission errors are also considered. Numerical
results show that by exploiting the broadcast nature of
the wireless medium, our control schemes achieve
significant improvement in the sensors' lifetimes.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "broadcast communications; clustering; data
compression; data gathering; lifetime optimization;
sensor networks; spatial correlation",
}
@InProceedings{Hong:2007:ATC,
author = "E. S. Hong and S.-F. Newman",
title = "Applying {Tunstall} Coding in the existing {SEED}
format for Seismographic Data",
crossref = "Storer:2007:DPD",
pages = "384--384",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.14",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148785",
acknowledgement = ack-nhfb,
}
@Article{Hu:2007:BPV,
author = "Yu-Chen Hu and Chia-Chen Lin and Kang-Liang Chi",
title = "Block Prediction Vector Quantization for Grayscale
Image Compression",
journal = j-FUND-INFO,
volume = "78",
number = "2",
pages = "257--270",
month = oct,
year = "2007",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:05:40 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Hua:2007:SSI,
author = "Gang Hua and O. G. Guleryuz",
title = "Spatial Sparsity Induced Temporal Prediction for
Hybrid Video Compression",
crossref = "Storer:2007:DPD",
pages = "23--32",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.71",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148741",
acknowledgement = ack-nhfb,
}
@InProceedings{Ibarria:2007:SP,
author = "L. Ibarria and P. Lindstrom and J. Rossignac",
title = "Spectral Predictors",
crossref = "Storer:2007:DPD",
pages = "163--172",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.72",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148755",
acknowledgement = ack-nhfb,
}
@InProceedings{Ingber:2007:PPB,
author = "A. Ingber and M. Feder",
title = "Power Preserving $ 2 \colon 1 $ Bandwidth Reduction
Mappings",
crossref = "Storer:2007:DPD",
pages = "385--385",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.65",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148786",
acknowledgement = ack-nhfb,
}
@InProceedings{Jain:2007:EBP,
author = "S. K. Jain and D. A. Adjeroh",
title = "Edge-Based Prediction for Lossless Compression of
Hyperspectral Images",
crossref = "Storer:2007:DPD",
pages = "153--162",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.36",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148754",
acknowledgement = ack-nhfb,
}
@Article{Janowska:2007:PCT,
author = "Agata Janowska and Wojciech Penczek",
title = "Path Compression in Timed Automata",
journal = j-FUND-INFO,
volume = "79",
number = "3--4",
pages = "379--399",
month = feb,
year = "2007",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:05:58 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Kaplan:2007:SAB,
author = "Haim Kaplan and Shir Landau and Elad Verbin",
title = "A simpler analysis of {Burrows--Wheeler}-based
compression",
journal = j-THEOR-COMP-SCI,
volume = "387",
number = "3",
pages = "220--235",
day = "22",
month = nov,
year = "2007",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2007.07.020",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 22:11:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2005.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Kato:2007:CLP,
author = "M. Kato and Chia-Tien Dan Lo",
title = "Compression for Low Power Consumption in
Battery-powered Handsets",
crossref = "Storer:2007:DPD",
pages = "386--386",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.24",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148787",
acknowledgement = ack-nhfb,
}
@Article{Kavousianos:2007:OSH,
author = "X. Kavousianos and E. Kalligeros and D. Nikolos",
title = "Optimal Selective {Huffman} Coding for Test-Data
Compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "56",
number = "8",
pages = "1146--1152",
month = aug,
year = "2007",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.1057",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:03:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4264327",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Kim:2007:NAD,
author = "Il Ho Kim and H. J. Ko",
title = "A New Approach to Decoding of {BCH} and
{Reed--Solomon} Codes Using Syzygy",
crossref = "Storer:2007:DPD",
pages = "387--387",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.5",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148788",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2007:CDE,
author = "S. T. Klein and D. Shapira",
title = "Compressed Delta Encoding for {LZSS} Encoded Files",
crossref = "Storer:2007:DPD",
pages = "113--122",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.22",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148750",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2007:FDF,
author = "S. T. Klein",
title = "Fast Decoding of {Fibonacci} Encoded Texts",
crossref = "Storer:2007:DPD",
pages = "388--388",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.38",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148789",
acknowledgement = ack-nhfb,
}
@Article{Korodi:2007:CAN,
author = "Gergely Korodi and Ioan Tabus",
title = "Compression of Annotated Nucleotide Sequences",
journal = j-TCBB,
volume = "4",
number = "3",
pages = "447--457",
month = jul,
year = "2007",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/tcbb.2007.1017",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Jun 12 16:58:24 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "This article introduces an algorithm for the lossless
compression of DNA files, which contain annotation text
besides the nucleotide sequence. First a grammar is
specifically designed to capture the regularities of
the annotation text. A revertible transformation uses
the grammar rules in order to equivalently represent
the original file as a collection of parsed segments
and a sequence of decisions made by the grammar parser.
This decomposition enables the efficient use of
state-of-the-art encoders for processing the parsed
segments. The output size of the decision-making
process of the grammar is optimized by extending the
states to account for high-order Markovian
dependencies. The practical implementation of the
algorithm achieves a significant improvement when
compared to the general-purpose methods currently used
for DNA files.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
keywords = "4 [Data]: Coding and Information Theory | Data
compaction and compression; Annotation; Compression;
F.4 [Theory of Computation]: Mathematical Logic and
Formal Languages | Formal languages; Formal Grammars;
G.3 [Mathematics of Computing]: Probability and
Statistics | Markov processes; J.3 [Computer
Applications]: Life and Medical Sciences | Biology and
genetics; nucleotide sequences",
}
@InProceedings{Korodi:2007:NML,
author = "G. Korodi and I. Tabus",
title = "Normalized maximum likelihood model of order-1 for the
compression of {DNA} sequences",
crossref = "Storer:2007:DPD",
pages = "33--42",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.60",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148742",
acknowledgement = ack-nhfb,
}
@InProceedings{Lansky:2007:CSS,
author = "J. Lansky and M. Zemlicka",
title = "Compression of a Set of Strings",
crossref = "Storer:2007:DPD",
pages = "390--390",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.25",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148791",
acknowledgement = ack-nhfb,
}
@InProceedings{Lansky:2007:CTM,
author = "J. Lansky and K. Chernik and Z. Vlckova",
title = "Comparison of Text Models for {BWT}",
crossref = "Storer:2007:DPD",
pages = "389--389",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.21",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148790",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Misc{LBE:2007:U,
author = "LBE",
title = "[unknown]",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://in.geocities.com/iamthebiggestone/how_lbe_works.htm",
acknowledgement = ack-ds,
rawdata = "LBE (2007)
|http://in.geocities.com/iamthebiggestone/how_lbe_works.htm|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{League:2007:TBC,
author = "C. League and K. Eng",
title = "Type-Based Compression of {XML} Data",
crossref = "Storer:2007:DPD",
pages = "273--282",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.79",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148766",
acknowledgement = ack-nhfb,
}
@InProceedings{Lexa:2007:JOD,
author = "M. A. Lexa and D. H. Johnson",
title = "Joint Optimization of Distributed Broadcast
Quantization Systems for Classification",
crossref = "Storer:2007:DPD",
pages = "363--374",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.50",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148775",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2007:DHB,
author = "Hui Li and P. Agarwal and B. Prabhakaran",
title = "Data Hiding based Compression Mechanism for {$3$D}
Models",
crossref = "Storer:2007:DPD",
pages = "391--391",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.30",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148792",
acknowledgement = ack-nhfb,
}
@InProceedings{Lima:2007:NFS,
author = "L. Lima and D. Alfonso and L. Pezzoni and R.
Leonardi",
title = "New fast search algorithm for base layer of {H.264}
scalable video coding extension",
crossref = "Storer:2007:DPD",
pages = "393--393",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.58",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148794",
acknowledgement = ack-nhfb,
}
@Article{Lin:2007:TED,
author = "Chin-Feng Lin and Yeh-Ching Chung and Don-Lin Yang",
title = "{TRLE} --- an efficient data compression scheme for
image composition of volume rendering on distributed
memory multicomputers",
journal = j-J-SUPERCOMPUTING,
volume = "39",
number = "3",
pages = "321--345",
month = mar,
year = "2007",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-006-0012-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 9 17:32:30 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=39&issue=3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=39&issue=3&spage=321",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
keywords = "Bounding rectangle; Image composition; Parallel volume
rendering; Run-length encoding; Template run-length
encoding",
}
@InProceedings{Liu:2007:FDW,
author = "Ying Liu and W. A. Pearlman",
title = "Four-Dimensional Wavelet Compression of {$4$-D}
Medical Images Using Scalable {$4$-D} {SBHP}",
crossref = "Storer:2007:DPD",
pages = "233--242",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.39",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148762",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2007:GQR,
author = "Xiteng Liu",
title = "Guided Quaternary Reaching Method for Wavelet-based
Image Compression",
crossref = "Storer:2007:DPD",
pages = "394--394",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.42",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148795",
acknowledgement = ack-nhfb,
}
@InProceedings{Ma:2007:IMI,
author = "Jing Ma and Chengke Wu and Dong Chen and Jie Guo",
title = "Interference Multispectral Image Compression with
Adaptive Distortion Control in {Fourier} Domain",
crossref = "Storer:2007:DPD",
pages = "395--395",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.49",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148796",
acknowledgement = ack-nhfb,
}
@InProceedings{Malvar:2007:LNL,
author = "H. S. Malvar",
title = "Lossless and Near-Lossless Audio Compression Using
Integer-Reversible Modulated Lapped Transforms",
crossref = "Storer:2007:DPD",
pages = "323--332",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.51",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148771",
acknowledgement = ack-nhfb,
}
@InProceedings{Milenkovic:2007:AHS,
author = "M. Milenkovic and A. Milenkovic and M. Burtscher",
title = "Algorithms and Hardware Structures for Unobtrusive
Real-Time Compression of Instruction and Data Address
Traces",
crossref = "Storer:2007:DPD",
pages = "283--292",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.10",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148767",
acknowledgement = ack-nhfb,
}
@MastersThesis{Miu:2007:RDD,
author = "Hong Zhi Miu",
title = "The Research and Design on Data Compression
Algorithm",
type = "[unknown]",
school = "Zhejiang University",
address = "Zhejiang, Peoples Republic of China",
year = "2007",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1024942932",
acknowledgement = ack-nhfb,
advisor = "Hai Bin Shen",
classification = "0544: Electrical engineering",
subject = "Electrical engineering",
}
@InProceedings{Mohammed:2007:BAB,
author = "H. M. Mohammed and N. Farber and H. Thoma",
title = "Bit Allocation Based on Motion Vector Analysis for
{H.264\slash AVC}",
crossref = "Storer:2007:DPD",
pages = "313--322",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.17",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148770",
acknowledgement = ack-nhfb,
}
@Misc{Motil:2007:PC,
author = "John Motil",
title = "Private communication",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Motil, John (2007) Private communication.",
}
@InProceedings{Motta:2007:DCE,
author = "G. Motta and J. Gustafson and S. Chen",
title = "Differential Compression of Executable Code",
crossref = "Storer:2007:DPD",
pages = "103--112",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.32",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148749",
acknowledgement = ack-nhfb,
}
@InProceedings{Nakamura:2007:SLT,
author = "R. Nakamura and H. Bannai and S. Inenaga and M.
Takeda",
title = "Simple Linear-Time Off-Line Text Compression by
Longest-First Substitution",
crossref = "Storer:2007:DPD",
pages = "123--132",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.70",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148751",
acknowledgement = ack-nhfb,
}
@Article{Navarro:2007:CFT,
author = "Gonzalo Navarro and Veli M{\"a}kinen",
title = "Compressed full-text indexes",
journal = j-COMP-SURV,
volume = "39",
number = "1",
pages = "2:1--2:61",
month = apr,
year = "2007",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1216370.1216372",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:21:11 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Full-text indexes provide fast substring search over
large text collections. A serious problem of these
indexes has traditionally been their space consumption.
A recent trend is to develop indexes that exploit the
compressibility of the text, so that their size is a
function of the compressed text length. This concept
has evolved into self-indexes, which in addition
contain enough information to reproduce any text
portion, so they replace the text. The exciting
possibility of an index that takes space close to that
of the compressed text, replaces it, and in addition
provides fast search over it, has triggered a wealth of
activity and produced surprising results in a very
short time, which radically changed the status of this
area in less than 5 years. The most successful indexes
nowadays are able to obtain almost optimal space and
search time simultaneously.\par
In this article we present the main concepts underlying
(compressed) self-indexes. We explain the relationship
between text entropy and regularities that show up in
index structures and permit compressing them. Then we
cover the most relevant self-indexes, focusing on how
they exploit text compressibility to achieve compact
structures that can efficiently solve various search
problems. Our aim is to give the background to
understand and follow the developments in this area.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "entropy; text compression; Text indexing",
}
@InProceedings{Nekrich:2007:EIA,
author = "Y. Nekrich",
title = "An Efficient Implementation of Adaptive Prefix
Coding",
crossref = "Storer:2007:DPD",
pages = "396--396",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.12",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148797",
acknowledgement = ack-nhfb,
}
@InProceedings{Nong:2007:EAI,
author = "Ge Nong and Sen Zhang",
title = "An Efficient Algorithm For The Inverse {ST} Problem",
crossref = "Storer:2007:DPD",
pages = "397--397",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.11",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148798",
acknowledgement = ack-nhfb,
}
@InProceedings{Ostergaard:2007:MDC,
author = "J. {\O}stergaard and R. Zamir",
title = "Multiple-Description Coding by Dithered Delta-Sigma
Quantization",
crossref = "Storer:2007:DPD",
pages = "63--72",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.57",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148745",
acknowledgement = ack-nhfb,
}
@Article{Ota:2007:CAB,
author = "Takahiro Ota and Hiroyoshi Morita",
title = "On the Construction of an Antidictionary of a Binary
String with Linear Complexity",
journal = j-IEICE-TRANS-FUND-ELECT,
volume = "E90-A",
number = "11",
pages = "2533--2539",
month = nov,
year = "2007",
CODEN = "IFESEX",
ISSN = "0916-8508 (print), 1745-1337 (electronic)",
ISSN-L = "0916-8508",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEICE Transactions on Fundamentals of Electronics
Communications and Computer Sciences",
rawdata = "Ota, Takahiro and Hiroyoshi Morita (2007) ``On the
Construction of an Antidictionary of a Binary String
with Linear Complexity,'' {\it IEICE Transactions on
Fundamentals of Electronics, Communications and
Computer Sciences}, {\bf E90-A}(11):2533--2539,
November.",
}
@Article{Payan:2007:TWB,
author = "Fr{\'e}d{\'e}ric Payan and Marc Antonini",
title = "Temporal wavelet-based compression for {$3$D} animated
models",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "31",
number = "1",
pages = "77--88",
month = jan,
year = "2007",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2006.09.009",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:41:55 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849306001774",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Peshkin:2007:SIL,
author = "L. Peshkin",
title = "Structure induction by lossless graph compression",
crossref = "Storer:2007:DPD",
pages = "53--62",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.73",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148744",
acknowledgement = ack-nhfb,
}
@Book{Peterson:2007:CNS,
author = "Larry L. Peterson and Bruce S. Davie",
title = "Computer networks: a systems approach",
publisher = "Morgan Kaufmann",
address = "Amsterdam, The Netherlands",
edition = "Fourth",
pages = "xxvii + 806",
year = "2007",
ISBN = "0-12-370548-7 (hardcover), 0-12-374013-4 (paperback)",
ISBN-13 = "978-0-12-370548-8 (hardcover), 978-0-12-374013-7
(paperback)",
LCCN = "TK5105.5 .P479 2007",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
URL = "http://www.loc.gov/catdir/enhancements/fy0704/2006102454-d.html",
acknowledgement = ack-nhfb,
remark = "International student edition.",
subject = "Computer networks",
}
@InProceedings{Raguram:2007:IRS,
author = "R. Raguram and M. W. Marcellin and A. Bilgin",
title = "Improved Resolution Scalability for Bi-Level Image
Data in {JPEG2000}",
crossref = "Storer:2007:DPD",
pages = "203--212",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.48",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148759",
acknowledgement = ack-nhfb,
}
@InProceedings{Rane:2007:HRA,
author = "S. Rane and D. Rebollo-Monedero and B. Girod",
title = "High-Rate Analysis of Systematic Lossy Error
Protection of a Predictively Encoded Source",
crossref = "Storer:2007:DPD",
pages = "263--272",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.45",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148765",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2007:MED,
author = "Y. A. Reznik",
title = "Memory-Efficient Decoding of Variable Length Codes for
Monotonic Sources",
crossref = "Storer:2007:DPD",
pages = "398--398",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.54",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148799",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2007:PBA,
author = "Y. A. Reznik",
title = "Practical Binary Adaptive Block Coder",
crossref = "Storer:2007:DPD",
pages = "399--399",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.66",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148800",
acknowledgement = ack-nhfb,
}
@InProceedings{Romines:2007:HIC,
author = "K. Romines and E. S. Hong",
title = "Hyperspectral Image Compression with Optimization for
Spectral Analysis",
crossref = "Storer:2007:DPD",
pages = "400--400",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.46",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148801",
acknowledgement = ack-nhfb,
}
@Book{Salomon:2007:DCC,
author = "David Salomon",
title = "Data Compression: The Complete Reference",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Fourth",
pages = "xxv + 1092",
year = "2007",
ISBN = "1-84628-602-6, 1-84628-603-4 (e-book)",
ISBN-13 = "978-1-84628-602-5, 978-1-84628-603-2 (e-book)",
LCCN = "QA76.9.D33 S25 2007",
bibdate = "Tue Jan 23 14:16:11 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib;
prodorbis.library.yale.edu:7090/voyager;
z3950.loc.gov:7090/Voyager",
note = "With contributions by Giovanni Motta and David
Bryant.",
acknowledgement = ack-nhfb,
rawdata = "Salomon, D. (2007) {\it Data Compression: The Complete
Reference}, London, Springer Verlag.",
subject = "Coding theory; Computer vision; Data Encryption;
Computer science; Data Storage Representation; Coding
and Information Theory; Data encryption (Computer
science); Signal, Image and Speech Processing; Image
Processing and Computer Vision",
}
@Book{Salomon:2007:VLC,
author = "David Salomon",
title = "Variable-length Codes for Data Compression",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 191",
year = "2007",
ISBN = "1-84628-958-0 (paperback), 1-84628-959-9 (ebook)",
ISBN-13 = "978-1-84628-958-3 (paperback), 978-1-84628-959-0
(ebook)",
LCCN = "QA76.9.D33 S25 2007",
bibdate = "Wed Oct 17 14:22:23 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
prodorbis.library.yale.edu:7090/voyager;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Coding theory; Computer Science; Coding and
Information Theory",
}
@InProceedings{Schonberg:2007:CEV,
author = "D. Schonberg and Chuohao Yeo and S. C. Draper and K.
Ramchandran",
title = "On Compression of Encrypted Video",
crossref = "Storer:2007:DPD",
pages = "173--182",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.61",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148756",
acknowledgement = ack-nhfb,
}
@Article{Schwarz:2007:OSV,
author = "Heiko Schwarz and Detlev Marpe and Thomas Wiegand",
title = "Overview of the Scalable Video Coding Extension of the
{H.264\slash AVC} Standard",
journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH,
volume = "17",
number = "9",
pages = "1103--1120",
month = sep,
year = "2007",
CODEN = "ITCTEM",
ISSN = "1051-8215 (print), 1558-2205 (electronic)",
ISSN-L = "1051-8215",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Circuits and Systems for Video
Technology",
rawdata = "Schwarz, Heiko, Detlev Marpe, and Thomas Wiegand
(2007) ``Overview of the Scalable Video Coding
Extension of the H.264/AVC Standard,'' {\it IEEE
Transaction on Circuits and Systems for Video
Technology}, {\bf17}(9):1103--1120, September.",
}
@Article{Segall:2007:SSW,
author = "C. Andrew Segall and Gary J. Sullivan",
title = "Spatial Scalability Within the {H.264\slash AVC}
Scalable Video Coding Extension",
journal = j-IEEE-TRANS-CIRCUITS-SYST-VIDEO-TECH,
volume = "17",
number = "9",
pages = "1121--1135",
month = sep,
year = "2007",
CODEN = "ITCTEM",
DOI = "https://doi.org/10.1109/tcsvt.2007.906824",
ISSN = "1051-8215 (print), 1558-2205 (electronic)",
ISSN-L = "1051-8215",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
fjournal = "IEEE Transactions on Circuits and Systems for Video
Technology",
rawdata = "Segall, C. Andrew and Gary J. Sullivan (2007)
``Spatial Scalability Within the H.264/AVC Scalable
Video Coding Extension,'' {\it IEEE Transaction on
Circuits and Systems for Video Technology},
{\bf17}(9):1121--1135, September.",
}
@InProceedings{Shayevitz:2007:BRC,
author = "O. Shayevitz and E. Meron and M. Feder and R. Zamir",
title = "Bounds on Redundancy in Constrained Delay Arithmetic
Coding",
crossref = "Storer:2007:DPD",
pages = "133--142",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.19",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148752",
acknowledgement = ack-nhfb,
}
@Article{Starosolski:2007:SFA,
author = "Roman Starosolski",
title = "Simple fast and adaptive lossless image compression
algorithm",
journal = j-SPE,
volume = "37",
number = "1",
pages = "65--91",
month = jan,
year = "2007",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.746",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Oct 17 18:33:14 MDT 2007",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "In this paper we present a new lossless image
compression algorithm. To achieve the high compression
speed we use a linear prediction, modified Golomb-Rice
code family, and a very fast prediction error modeling
method. We compare the algorithm experimentally with
others for medical and natural continuous tone
grayscale images of depths of up to 16 bits. Its
results are especially good for large images, for
natural images of high bit depths, and for noisy
images. The average compression speed on Intel Xeon
3.06 GHz CPU is 47 MB/s. For large images the speed is
over 60 MB/s, i.e. the algorithm needs less than 50 CPU
cycles per byte of image.",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "8 Aug 2006",
}
@InProceedings{Takamura:2007:GGC,
author = "S. Takamura and Y. Yashima",
title = "{Gaussian Golomb} Codes",
crossref = "Storer:2007:DPD",
pages = "401--401",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.40",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148802",
acknowledgement = ack-nhfb,
}
@Article{Tanaka:2007:LER,
author = "Kiyofumi Tanaka and Takahiro Kawahara",
title = "Leakage energy reduction in cache memory by data
compression",
journal = j-COMP-ARCH-NEWS,
volume = "35",
number = "5",
pages = "17--24",
month = dec,
year = "2007",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/1360464.1360472",
ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)",
ISSN-L = "0163-5964",
bibdate = "Tue Jun 17 11:51:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Cache memory is effective in bridging a growing speed
gap between a processor and relatively slow external
main memory. Almost all of today's commercial
processors, not only high-performance microprocessors
but embedded ones, have on-chip cache memories.
However, energy consumption in the cache memory would
approach or exceed 50\% of the total consumption by the
processors, which leads to a serious problem in terms
of allowable temperature and performance improvement.
An important point to note is that, in the near future,
static (leakage) energy will dominate the energy
consumption in deep sub-micron processes. In this
paper, we propose cache memory architecture that
exploits gated-Vdd control per cache block and a
dynamic data compression scheme in the secondary cache,
and achieves efficient reduction of static energy
consumed by the secondary cache memory. In the
simulation using SPEC95 integer benchmarks, our
technique reduced about 45\% of leakage energy in the
cache at maximum, and about 28\% on average.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
keywords = "cache memory; data compression; gated-Vdd; leakage
energy",
}
@InProceedings{Tay:2007:BDB,
author = "Wee-Peng Tay and J. N. Tsitsiklis and M. Z. Win",
title = "{Bayesian} Detection in Bounded Height Tree Networks",
crossref = "Storer:2007:DPD",
pages = "243--252",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.16",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148763",
acknowledgement = ack-nhfb,
}
@Misc{Tetrachromat:2007:T,
author = "Tetrachromat",
title = "Telegraphy",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Tetrachromat",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Tetrachromat (2007)
|http://en.wikipedia.org/wiki/Tetrachromat|.",
}
@Misc{uklinux:2007:U,
author = "uklinux",
title = "[unknown]",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.bckelk.uklinux.net/menu.html",
acknowledgement = ack-ds,
rawdata = "uklinux (2007)
|http://www.bckelk.uklinux.net/menu.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Vanam:2007:DCO,
author = "R. Vanam and E. A. Riskin and S. S. Hemami and R. E.
Ladner",
title = "Distortion-Complexity Optimization of the {H.264\slash
MPEG-4 AVC} Encoder using the {GBFOS} Algorithm",
crossref = "Storer:2007:DPD",
pages = "303--312",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.33",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148769",
acknowledgement = ack-nhfb,
}
@InProceedings{Varodayan:2007:DGS,
author = "D. Varodayan and A. Mavlankar and M. Flierl and B.
Girod",
title = "Distributed Grayscale Stereo Image Coding with
Unsupervised Learning of Disparity",
crossref = "Storer:2007:DPD",
pages = "143--152",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.35",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148753",
acknowledgement = ack-nhfb,
}
@InProceedings{Vasudevan:2007:BRD,
author = "D. Vasudevan",
title = "Bounds to the Rate Distortion Tradeoff of the Binary
{Markov} Source",
crossref = "Storer:2007:DPD",
pages = "343--352",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.20",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148773",
acknowledgement = ack-nhfb,
}
@InProceedings{Venkatesan:2007:GSF,
author = "R. C. Venkatesan",
title = "Generalized Statistics Framework for Rate Distortion
Theory",
crossref = "Storer:2007:DPD",
pages = "402--402",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.41",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148803",
acknowledgement = ack-nhfb,
}
@InProceedings{Vo:2007:CDT,
author = "Kiem-Phong Vo",
title = "Compression as Data Transformation",
crossref = "Storer:2007:DPD",
pages = "403--403",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.23",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148804",
acknowledgement = ack-nhfb,
}
@InProceedings{Wakatani:2007:AOV,
author = "A. Wakatani",
title = "Advanced Optimizations for {VQ} Compression on
Parallel Systems",
crossref = "Storer:2007:DPD",
pages = "404--404",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.9",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148805",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2007:ERE,
author = "Qiang Wang and Debin Zhao and Siwei Ma and Wen Gao",
title = "An Enhanced Robust Entropy Coder for Video Codecs
Based on Context-Adaptive Reversible {VLC}",
crossref = "Storer:2007:DPD",
pages = "406--406",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.13",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148807",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2007:MSS,
author = "Jia Wang and Xiaolin Wu and Jun Sun and Songyu Yu",
title = "On Multi-Stage Sequential Coding of Correlated
Sources",
crossref = "Storer:2007:DPD",
pages = "253--262",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.62",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148764",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2007:WZR,
author = "Peng Wang and Jia Wang and Songyu Yu and Erkang Chen
and Xiaokang Yang",
title = "The {Wyner--Ziv} Rate-Distortion Function of
Multivariate {Gaussian} Sources and Its Application in
Distributed Video Coding",
crossref = "Storer:2007:DPD",
pages = "405--405",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.77",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148806",
acknowledgement = ack-nhfb,
}
@InProceedings{Wegener:2007:SRT,
author = "A. Wegener",
title = "Samplify: Real-time Compression for Electronic
Measurements",
crossref = "Storer:2007:DPD",
pages = "407--407",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.69",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148808",
acknowledgement = ack-nhfb,
}
@Misc{Weisstein:2007:RNP,
author = "Eric W. Weisstein",
key = "Weisstein-pickin",
title = "Real Number Picking",
pages = "??",
year = "2007",
bibdate = "Sat Jan 26 12:46:12 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "From MathWorld --- a Wolfram Web resource.",
URL = "http://mathworld.wolfram.com/RealNumberPicking.html",
acknowledgement = ack-ds,
rawdata = "Weisstein-pickin (2007) is Weisstein, Eric W. ``Real
Number Picking.'' From MathWorld, A Wolfram web
resource.
|http://mathworld.wolfram.com/RealNumberPicking.html|.",
}
@InProceedings{Xu:2007:CBR,
author = "Jin Xu and Limin Sun and Zhimei Wu",
title = "A Content-based Robust Mode Decision Scheme for
{Internet} Videophone Applications",
crossref = "Storer:2007:DPD",
pages = "408--408",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.1",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148809",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2007:DBE,
author = "Jeehong Yang and S. A. Savari",
title = "Dictionary-based {English} text compression using word
endings",
crossref = "Storer:2007:DPD",
pages = "410--410",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.31",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148811",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2007:FLC,
author = "Chun Yang and Yan Niu and Yubin Xia and Xu Cheng",
title = "A Fast Lossless Codec of Continuous-Tone Images for
Thin Client Computing",
crossref = "Storer:2007:DPD",
pages = "409--409",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.3",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148810",
acknowledgement = ack-nhfb,
}
@InProceedings{Ye:2007:MEI,
author = "Linning Ye and Jiangling Guo and B. Nutter and S.
Mitra",
title = "Memory-Efficient Image Codec Using Line-based Backward
Coding of Wavelet Trees",
crossref = "Storer:2007:DPD",
pages = "213--222",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.55",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148760",
acknowledgement = ack-nhfb,
}
@Article{Yiannis:2007:CTF,
author = "John Yiannis and Justin Zobel",
title = "Compression techniques for fast external sorting",
journal = j-VLDB-J,
volume = "16",
number = "2",
pages = "269--291",
month = apr,
year = "2007",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-006-0005-2",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Jun 23 10:51:23 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "External sorting of large files of records involves
use of disk space to store temporary files, processing
time for sorting, and transfer time between CPU, cache,
memory, and disk. Compression can reduce disk and
transfer costs, and, in the case of external sorts, cut
merge costs by reducing the number of runs. It is
therefore plausible that overall costs of external
sorting could be reduced through use of compression. In
this paper, we propose new compression techniques for
data consisting of sets of records. The best of these
techniques, based on building a trie of variable-length
common strings, provides fast compression and
decompression and allows random access to individual
records. We show experimentally that our trie-based
compression leads to significant reduction in sorting
costs; that is, it is faster to compress the data, sort
it, and then decompress it than to sort the
uncompressed data. While the degree of compression is
not quite as great as can be obtained with adaptive
techniques such as Lempel--Ziv methods, these cannot be
applied to sorting. Our experiments show that, in
comparison to approaches such as Huffman coding of
fixed-length substrings, our novel trie-based method is
faster and provides greater size reductions.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "external sorting; query evaluation; semi-static
compression; sorting",
}
@InProceedings{Zhang:2007:ICQ,
author = "Xiangjun Zhang and Xiaolin Wu",
title = "Image Coding on Quincunx Lattice with Adaptive Lifting
and Interpolation",
crossref = "Storer:2007:DPD",
pages = "193--202",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.47",
bibdate = "Tue Feb 5 08:56:13 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4148758",
acknowledgement = ack-nhfb,
}
@Article{Zirkind:2007:ADC,
author = "Givon Zirkind",
title = "{AFIS} data compression: an example of how domain
specific compression algorithms can produce very high
compression ratios",
journal = j-COMP-GRAPHICS,
volume = "41",
number = "4",
pages = "1--36",
month = nov,
year = "2007",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/1331098.1331103",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Wed Jun 18 10:13:23 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This article describes the development and
implementation of a data compression algorithm designed
specifically for fingerprints, referred to as GBP
compression. The algorithm is herein discussed. Data
Compression algorithms can be designed for general
applications, meaning the input data is unknown. This
is more commonly referred to as generic data. [LI01]
Or, data compression algorithms can be designed for
specific applications. E.g. AFIS [Automated Fingerprint
Identification Systems] 'When the input is known,
higher compression ratios can be achieved with the
knowledge of the input data stream.' To-date, the
highest compression ratio for an unknown input data
stream, for all data compression algorithms, is JPEG
with an average compression ratio range of 1:17 ---
1:23. [PEN03] The algorithm herein discussed, has a
compression ratio range of 1:68 --- 1:92. There is a
value, time and place for each design method ---
generic or specific --- depending upon a variety of
factors. Due to the nature of the use of AFIS for law
enforcement and incrimination as well as criminal
conviction, there are social issues that make data
integrity of paramount concern. This factor influences
algorithm selection and design. A lossless algorithm is
a must! Also, the nature of AFIS is such that it
operates across borders and between states,
municipalities and jurisdictions. In addition to the
usual issues and resistance to accepting new
technology, including software [e.g. resistance to
change, fear of system failure, etc.], there are the
issues of changing engineering standards [hardware and
software] which are governmentally determined as well
as governmental policy decisions. Likewise, the
portability required in implementing a new algorithm,
will have to deal with a variety of hardware and
software; as well as be designed to integrate into
existing systems. This integration must include the
ability to incorporate existing JPEG data files, from
existing police databases. This requires a handshaking
of standards and conversion programs that maintain data
integrity. In addition, there is an in depth discussion
of the limits of compression with a novel
perspective.",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "AFIS; automated fingerprint identification systems;
compatibility; compression; data compression; data
encryption; data integrity; double compression;
fingerprinting; graphics; image compression; image
quality; limits of compression; portability;
retrofitting; serial compression; software
engineering",
}
@InProceedings{Acevedo:2008:LWB,
author = "D. Acevedo and A. Ruedin",
title = "A Lossless Wavelet-Based Predictive Multispectral
Image Compressor",
crossref = "Storer:2008:DDC",
pages = "501--501",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.55",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483328",
acknowledgement = ack-nhfb,
}
@Book{Adjeroh:2008:BWT,
author = "Donald Adjeroh and Tim Bell and Amar Mukherjee",
title = "The {Burrows--Wheeler} Transform: Data Compression,
Suffix Arrays, and Pattern Matching",
publisher = "Springer Science+Business Media, LLC",
address = "Boston, MA, USA",
pages = "300",
year = "2008",
ISBN = "0-387-78908-1, 0-387-78909-X (e-book)",
ISBN-13 = "978-0-387-78908-8, 978-0-387-78909-5 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
subject = "Data Structures; Computer Science; Database
management; Information Storage and Retrieval; Data
structures (Computer science); Information storage and
retrieval systems; Data Structures, Cryptology and
Information Theory; datakomprimering",
}
@InProceedings{Adjeroh:2008:SSS,
author = "D. Adjeroh and Fei Nan",
title = "Suffix Sorting via {Shannon--Fano--Elias} Codes",
crossref = "Storer:2008:DDC",
pages = "502--502",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.99",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483329",
acknowledgement = ack-nhfb,
}
@InProceedings{Agnihotri:2008:IDS,
author = "S. Agnihotri and H. S. Jamadagni and P. Nuggehalli",
title = "Interactive Distributed Source Coding in Asymmetric
Communication Scenarios",
crossref = "Storer:2008:DDC",
pages = "503--503",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.77",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483330",
acknowledgement = ack-nhfb,
}
@InProceedings{Ahuja:2008:SPM,
author = "S. Ahuja and M. Krunz",
title = "Server Placement in Multiple-Description-Based Media
Streaming",
crossref = "Storer:2008:DDC",
pages = "372--381",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.63",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483315",
acknowledgement = ack-nhfb,
}
@Article{Al-Bahadili:2008:ACW,
author = "Hussein Al-Bahadili and Shakir M. Hussain",
title = "An adaptive character wordlength algorithm for data
compression",
journal = j-COMPUT-MATH-APPL,
volume = "55",
number = "6",
pages = "1250--1256",
month = mar,
year = "2008",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2007.05.014",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:10 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122107005925",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Al-Bahadili:2008:NLD,
author = "Hussein Al-Bahadili",
title = "A novel lossless data compression scheme based on the
error correcting {Hamming} codes",
journal = j-COMPUT-MATH-APPL,
volume = "56",
number = "1",
pages = "143--150",
month = jul,
year = "2008",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2007.11.043",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122107008334",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Altingovde:2008:ICB,
author = "Ismail Sengor Altingovde and Engin Demir and Fazli Can
and {\"O}zg{\"u}r Ulusoy",
title = "Incremental cluster-based retrieval using compressed
cluster-skipping inverted files",
journal = j-TOIS,
volume = "26",
number = "3",
pages = "15:1--15:??",
month = jun,
year = "2008",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/1361684.1361688",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Thu Jun 19 08:32:17 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tois/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "We propose a unique cluster-based retrieval (CBR)
strategy using a new cluster-skipping inverted file for
improving query processing efficiency. The new inverted
file incorporates cluster membership and centroid
information along with the usual document information
into a single structure. In our incremental-CBR
strategy, during query evaluation, both best(-matching)
clusters and the best(-matching) documents of such
clusters are computed together with a single
posting-list access per query term. As we switch from
term to term, the best clusters are recomputed and can
dynamically change. During query-document matching,
only relevant portions of the posting lists
corresponding to the best clusters are considered and
the rest are skipped. The proposed approach is
essentially tailored for environments where inverted
files are compressed, and provides substantial
efficiency improvement while yielding comparable, or
sometimes better, effectiveness figures. Our
experiments with various collections show that the
incremental-CBR strategy using a compressed
cluster-skipping inverted file significantly improves
CPU time efficiency, regardless of query length. The
new compressed inverted file imposes an acceptable
storage overhead in comparison to a typical inverted
file. We also show that our approach scales well with
the collection size.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "Best match; cluster-based retrieval (CBR);
cluster-skipping inverted index structure (CS-IIS);
full search (FS); index compression; inverted index
structure (IIS); query processing",
}
@Article{Amjad:2008:DCP,
author = "Hasan Amjad",
title = "Data Compression for Proof Replay",
journal = j-J-AUTOM-REASON,
volume = "41",
number = "3--4",
pages = "193--218",
month = nov,
year = "2008",
CODEN = "JAREEW",
DOI = "https://doi.org/10.1007/s10817-008-9109-2",
ISSN = "0168-7433 (print), 1573-0670 (electronic)",
ISSN-L = "0168-7433",
bibdate = "Sat Apr 2 10:50:44 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
URL = "http://link.springer.com/article/10.1007/s10817-008-9109-2",
acknowledgement = ack-nhfb,
ajournal = "J. Autom. Reason.",
fjournal = "Journal of Automated Reasoning",
journal-URL = "http://link.springer.com/journal/10817",
}
@Misc{Anonymous:2008:CC,
author = "Anonymous",
key = "curiosities",
title = "Compression curiosities",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.maximumcompression.com/compression_fun.php",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "curiosities (2008)
|http://www.maximumcompression.com/compression_fun.php|.",
}
@InProceedings{Anonymous:2008:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2008:DDC",
pages = "vi--vi",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.4",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483276",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2008:HP,
author = "Anonymous",
key = "wikiHutter",
title = "Hutter Prize",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Hutter_Prize",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "wikiHutter (2008)
|http://en.wikipedia.org/wiki/Hutter_Prize|.",
}
@Misc{Anonymous:2008:KNH,
author = "Anonymous",
key = "KGB",
title = "{{\tt kgbarchiver.net}} home page",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://kgbarchiver.net/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "KGB (2008) |http://kgbarchiver.net/|.",
}
@Misc{Anonymous:2008:MCL,
author = "Anonymous",
key = "Bergmans",
title = "Maximum Compression: Lossless data compression
software benchmarks / comparisons",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.maximumcompression.com",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Bergmans (2008) |http://www.maximumcompression.com|.",
}
@Misc{Anonymous:2008:PSL,
author = "Anonymous",
key = "wikiPAQ",
title = "{PAQ} [a series of lossless data compression
archivers]",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/PAQ",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "wikiPAQ (2008) |http://en.wikipedia.org/wiki/PAQ|.",
}
@Misc{Anonymous:2008:SR,
author = "Anonymous",
key = "curio.strange",
title = "{{\tt strange.rar}}",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.maximumcompression.com/strange.rar",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "curio.strange (2008)
|http://www.maximumcompression.com/strange.rar|.",
}
@Misc{Anonymous:2008:TR,
author = "Anonymous",
key = "curio. test",
title = "{{\tt test.rar}}",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.maximumcompression.com/test.rar",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "curio.test (2008)
|http://www.maximumcompression.com/test.rar|.",
}
@Misc{Anonymous:2008:VSV,
author = "Anonymous",
key = "WikiVC-1",
title = "{VC-1 [SMPTE 421M video codec standard]}",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/VC-1",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "WikiVC-1 (2008) |http://en.wikipedia.org/wiki/VC-1|.",
}
@Misc{Anonymous:2008:WMC,
author = "Anonymous",
key = "WMV",
title = "Windows Media Codecs",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.microsoft.com/windows/windowsmedia/forpros/codecs/video.aspx",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "WMV (2008) is\hfil\break
|http://www.microsoft.com/windows/windowsmedia/forpros/codecs/video.aspx|.",
}
@InProceedings{Apostolico:2008:TCR,
author = "A. Apostolico and F. Cunial and V. Kaul",
title = "Table Compression by Record Intersections",
crossref = "Storer:2008:DDC",
pages = "13--22",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.105",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483279",
acknowledgement = ack-nhfb,
}
@InProceedings{Bai:2008:PET,
author = "Huihui Bai and Yao Zhao and Ce Zhu",
title = "Priority Encoding Transmission Based Multiple
Description Video Coding over Packet Loss Network",
crossref = "Storer:2008:DDC",
pages = "504--504",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.7",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483331",
acknowledgement = ack-nhfb,
}
@InProceedings{Balachandran:2008:SHC,
author = "S. Balachandran and C. Constantinescu",
title = "Sequence of Hashes Compression in Data
De-duplication",
crossref = "Storer:2008:DDC",
pages = "505--505",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.80",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483332",
acknowledgement = ack-nhfb,
}
@InProceedings{Bartrina-Rapesta:2008:JAR,
author = "J. Bartrina-Rapesta and F. Aul{\'\i}-Llin{\'a}s and J.
Serra-Sagrist{\`a} and J. L. Monteagudo-Pereira",
title = "{JPEG2000} Arbitrary {ROI} Coding through
Rate-Distortion Optimization Techniques",
crossref = "Storer:2008:DDC",
pages = "292--301",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.70",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483307",
acknowledgement = ack-nhfb,
}
@InProceedings{Batista:2008:TPP,
author = "L. Batista and L. A. Alexandre",
title = "Text Pre-processing for Lossless Compression",
crossref = "Storer:2008:DDC",
pages = "506--506",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.78",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483333",
acknowledgement = ack-nhfb,
}
@InProceedings{Beheshti:2008:DCL,
author = "S. Beheshti",
title = "Data Compression and Linear Modeling",
crossref = "Storer:2008:DDC",
pages = "507--507",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.66",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483334",
acknowledgement = ack-nhfb,
}
@InProceedings{Belloulata:2008:NOB,
author = "K. Belloulata and Shiping Zhu",
title = "A New Object-Based System for Fractal Video Sequences
Compression",
crossref = "Storer:2008:DDC",
pages = "508--508",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.34",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483335",
acknowledgement = ack-nhfb,
}
@InProceedings{Bernardini:2008:RCP,
author = "R. Bernardini and R. Rinaldo and A. Vitali",
title = "A Reliable Chunkless Peer-to-Peer Architecture for
Multimedia Streaming",
crossref = "Storer:2008:DDC",
pages = "242--251",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.8",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483302",
acknowledgement = ack-nhfb,
}
@PhdThesis{Bi:2008:RDC,
author = "Qiu Yan Bi",
title = "Research on Data Compression Algorithm and
Communication Network Simulation in Power System",
type = "{Ph.D.} thesis",
school = "Shandong University",
address = "Shandong, Peoples Republic of China",
year = "2008",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1026704409",
acknowledgement = ack-nhfb,
advisor = "Jian Guo Zhao",
classification = "0544: Electrical engineering",
subject = "Electrical engineering",
}
@Book{Biggs:2008:CII,
author = "Norman Biggs",
title = "Codes: an Introduction to Information Communication
and Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 273",
year = "2008",
ISBN = "1-84800-272-6 (paperback)",
ISBN-13 = "978-1-84800-272-2 (paperback)",
LCCN = "QA268 .B54 2008",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Springer undergraduate mathematics series.",
abstract = "This book is an integrated introduction to the
mathematics of coding, that is, replacing information
expressed in symbols, such as a natural language or a
sequence of bits, by another message using (possibly)
different symbols. There are three main reasons for
doing this: economy, reliability, and security, and
each is covered in detail. Only a modest mathematical
background is assumed, the mathematical theory being
introduced at a level that enables the basic problems
to be stated carefully, but without unnecessary
abstraction.",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography",
}
@InProceedings{Biskup:2008:GSH,
author = "M. T. Biskup",
title = "Guaranteed Synchronization of {Huffman} Codes",
crossref = "Storer:2008:DDC",
pages = "462--471",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.23",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483324",
acknowledgement = ack-nhfb,
}
@Misc{Bowery:2008:HPC,
author = "Jim Bowery and Matt Mahoney and Marcus Hutter",
key = "Hutter",
title = "Hutter Prize for Compressing Human Knowledge",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://prize.hutter1.net",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Hutter (2008) |http://prize.hutter1.net|.",
}
@InProceedings{Bresolin:2008:EAA,
author = "A. de Andrade Bresolin and D. da Silva Freitas and A.
D. D. Neto and P. J. Alsina",
title = "{European} and {American} Audio-Visual Speech
Recognition, Using {SVM} in {Portuguese} Language",
crossref = "Storer:2008:DDC",
pages = "511--511",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.32",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483338",
acknowledgement = ack-nhfb,
}
@Misc{Broukhis:2008:CCC,
author = "Leonid A. Broukhis",
key = "Calgary challenge",
title = "The {Calgary corpus Compression \& SHA-1 crack
Challenge}",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "On July 2, 2010, the challenge was accepted by
Alexander Rhatushnyak who sent me an entry of size
580170 (payout of \$121.17 received).",
URL = "http://mailcom.com/challenge",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Calgary challenge (2008)
|http://mailcom.com/challenge|.",
}
@InProceedings{Cerra:2008:MCD,
author = "D. Cerra and M. Datcu",
title = "A Model Conditioned Data Compression Based Similarity
Measure",
crossref = "Storer:2008:DDC",
pages = "509--509",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.46",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483336",
acknowledgement = ack-nhfb,
}
@InProceedings{Channappayya:2008:RBS,
author = "S. S. Channappayya and A. C. Bovik and R. W. Heath and
C. Caramanis",
title = "Rate Bounds on {SSIM} Index of Quantized Image {DCT}
Coefficients",
crossref = "Storer:2008:DDC",
pages = "352--361",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.91",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483313",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2008:DIH,
author = "Xi Chen and Lei Yang and H. Lekatsas and R. P. Dick
and Li Shang",
title = "Design and Implementation of a High-Performance
Microprocessor Cache Compression Algorithm",
crossref = "Storer:2008:DDC",
pages = "43--52",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.90",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483282",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2008:ISA,
author = "Su Chen and S. Ranjan and A. Nucci",
title = "{IPzip}: a Stream-Aware {IP} Compression Algorithm",
crossref = "Storer:2008:DDC",
pages = "182--191",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.58",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483296",
acknowledgement = ack-nhfb,
}
@Article{Chen:2008:LZF,
author = "Gang Chen and Simon J. Puglisi and W. F. Smyth",
title = "{Lempel--Ziv} Factorization Using Less Time {\&}
Space",
journal = j-MATH-COMPUT-SCI,
volume = "1",
number = "4",
pages = "605--623",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-007-0024-4",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Thu Jul 9 15:43:59 MDT 2009",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=1&issue=4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=1&issue=4&spage=605",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
keywords = "68W05; Mathematics Subject Classification (2000)",
}
@InProceedings{Chien:2008:GBW,
author = "Yu-Feng Chien and Wing-Kai Hon and R. Shah and J.
{Scott Vitter}",
title = "Geometric {Burrows--Wheeler} Transform: Linking Range
Searching and Text Indexing",
crossref = "Storer:2008:DDC",
pages = "252--261",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.67",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483303",
acknowledgement = ack-nhfb,
}
@InProceedings{Coleman:2008:RDF,
author = "T. P. Coleman and N. Kiyavash and V. G. Subramanian",
title = "The Rate-Distortion Function of a {Poisson} Process
with a Queueing Distortion Measure",
crossref = "Storer:2008:DDC",
pages = "63--72",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.92",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483284",
acknowledgement = ack-nhfb,
}
@InProceedings{Crochemore:2008:SAC,
author = "M. Crochemore and L. Ilie and W. F. Smyth",
title = "A Simple Algorithm for Computing the {Lempel--Ziv}
Factorization",
crossref = "Storer:2008:DDC",
pages = "482--488",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.36",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483326",
acknowledgement = ack-nhfb,
}
@InProceedings{Dai:2008:NSC,
author = "Wenrui Dai and Hongkai Xiong and Li Song",
title = "On Non-sequential Context Modeling with Application to
Executable Data Compression",
crossref = "Storer:2008:DDC",
pages = "172--181",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.6",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483295",
acknowledgement = ack-nhfb,
}
@InProceedings{Dai:2008:TDC,
author = "Lu Dai and Li Zhang and Xiaolin Zhao",
title = "A Three Dimensional Combinative Lifting Algorithm for
Wavelet Transform Using $ 9 / 7 $ Filter",
crossref = "Storer:2008:DDC",
pages = "510--510",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.20",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483337",
acknowledgement = ack-nhfb,
}
@InProceedings{Daptardar:2008:VBI,
author = "A. H. Daptardar and J. A. Storer",
title = "{VQ} Based Image Retrieval Using Color and Position
Features",
crossref = "Storer:2008:DDC",
pages = "432--441",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.106",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483321",
acknowledgement = ack-nhfb,
}
@InProceedings{Derpich:2008:QGR,
author = "M. S. Derpich and J. {\O}stergaard and G. C. Goodwin",
title = "The Quadratic {Gaussian} Rate-Distortion Function for
Source Uncorrelated Distortions",
crossref = "Storer:2008:DDC",
pages = "73--82",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.102",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483285",
acknowledgement = ack-nhfb,
}
@Misc{Destasio:2008:EU,
author = "B. Destasio",
key = "Emilcont",
title = "EmilCont Ultracompression",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.freewebs.com/emilcont/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Emilcont (2008) |http://www.freewebs.com/emilcont/|.",
}
@InProceedings{DiLillo:2008:MRI,
author = "A. {Di Lillo} and G. Motta and J. A. Storer",
title = "Multiresolution Rotation-Invariant Texture
Classification Using Feature Extraction in the
Frequency Domain and Vector Quantization",
crossref = "Storer:2008:DDC",
pages = "452--461",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.108",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483323",
acknowledgement = ack-nhfb,
}
@InProceedings{Dorrigiv:2008:LUA,
author = "R. Dorrigiv and A. Lopez-Ortiz and J. I. Munro",
title = "List Update Algorithms for Data Compression",
crossref = "Storer:2008:DDC",
pages = "512--512",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.25",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483339",
acknowledgement = ack-nhfb,
}
@Article{Du:2008:LCP,
author = "Qian Du and James E. Fowler",
title = "Low-Complexity Principal Component Analysis for
Hyperspectral Image Compression",
journal = j-IJHPCA,
volume = "22",
number = "4",
pages = "438--448",
month = nov,
year = "2008",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342007088380",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Tue Aug 31 09:59:45 MDT 2010",
bibsource = "http://hpc.sagepub.com/content/22/4.toc;
http://hpc.sagepub.com/content/by/year;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "http://hpc.sagepub.com/content/22/4/438.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "http://hpc.sagepub.com/content/by/year",
}
@InProceedings{Dube:2008:AML,
author = "D. Dube and V. Beaudoin",
title = "All-Match {LZ77} Bit Recycling",
crossref = "Storer:2008:DDC",
pages = "513--513",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.101",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483340",
acknowledgement = ack-nhfb,
}
@InProceedings{Dumitrescu:2008:IMD,
author = "S. Dumitrescu and Ting Zheng",
title = "Improved Multiple Description Framework Based on
Successively Refinable Quantization and Uneven Erasure
Protection",
crossref = "Storer:2008:DDC",
pages = "514--514",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.38",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483341",
acknowledgement = ack-nhfb,
}
@InProceedings{Dumitrescu:2008:SEO,
author = "S. Dumitrescu",
title = "Speed-Up of Encoder Optimization Step in Multiple
Description Scalar Quantizer Design",
crossref = "Storer:2008:DDC",
pages = "382--391",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.37",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483316",
acknowledgement = ack-nhfb,
}
@InProceedings{Dutra:2008:CHI,
author = "A. J. S. Dutra and W. A. Pearlman and E. A. B. da
Silva",
title = "Compression of Hyperspectral Images with {LVQ-SPECK}",
crossref = "Storer:2008:DDC",
pages = "93--102",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.88",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483287",
acknowledgement = ack-nhfb,
}
@InProceedings{Esnaola:2008:DCC,
author = "I. Esnaola and J. Garcia-Frias",
title = "Distributed Compression of Correlated Signals Using
Random Projections",
crossref = "Storer:2008:DDC",
pages = "322--331",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.60",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483310",
acknowledgement = ack-nhfb,
}
@InProceedings{Fan:2008:NMD,
author = "Yuhua Fan and Jia Wang and Jun Sun and Peng Wang and
Songyu Yu",
title = "A Novel Multiple Description Video Codec Based on
{Slepian--Wolf} Coding",
crossref = "Storer:2008:DDC",
pages = "515--515",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.11",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483342",
acknowledgement = ack-nhfb,
}
@InProceedings{Farina:2008:WBS,
author = "A. Farina and G. Navarro and J. R. Parama",
title = "Word-Based Statistical Compressors as Natural Language
Compression Boosters",
crossref = "Storer:2008:DDC",
pages = "162--171",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.14",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483294",
acknowledgement = ack-nhfb,
}
@InProceedings{Ferragina:2008:SCS,
author = "Paolo Ferragina and Roberto Grossi and Ankur Gupta and
Rahul Shah and Jeffrey Scott Vitter",
title = "On searching compressed string collections
cache-obliviously",
crossref = "Lenzerini:2008:PTS",
pages = "181--190",
year = "2008",
DOI = "https://doi.org/10.1145/1376916.1376943",
bibdate = "Fri Jun 20 14:17:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib",
abstract = "Current data structures for searching large string
collections either fail to achieve minimum space or
cause too many cache misses. In this paper we discuss
some edge linearizations of the classic trie data
structure that are simultaneously cache-friendly and
compressed. We provide new insights on front coding
[24], introduce other novel linearizations, and study
how close their space occupancy is to the
information-theoretic minimum. The moral is that they
are not just heuristics. Our second contribution is a
novel dictionary encoding scheme that builds upon such
linearizations and achieves nearly optimal space,
offers competitive I/O-search time, and is also
conscious of the query distribution. Finally, we
combine those data structures with cache-oblivious
tries [2, 5] and obtain a succinct variant whose space
is close to the information-theoretic minimum.",
acknowledgement = ack-nhfb,
keywords = "B-tree; cache efficiency; data compression; front
coding; string searching",
}
@InProceedings{Fiala:2008:DUS,
author = "M. Fiala and J. Holub",
title = "{DCA} Using Suffix Arrays",
crossref = "Storer:2008:DDC",
pages = "516--516",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.95",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483343",
acknowledgement = ack-nhfb,
}
@InProceedings{Fischer:2008:PEB,
author = "J. Fischer and V. Heun and H. M. Stiihler",
title = "Practical Entropy-Bounded Schemes for {$ O(1) $}-Range
Minimum Queries",
crossref = "Storer:2008:DDC",
pages = "272--281",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.45",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483305",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:2008:CPP,
author = "J. E. Fowler",
title = "Compressive-Projection Principal Component Analysis
for the Compression of Hyperspectral Signatures",
crossref = "Storer:2008:DDC",
pages = "83--92",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.26",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483286",
acknowledgement = ack-nhfb,
}
@InProceedings{Fresia:2008:DSC,
author = "M. Fresia and L. Vandendorpe and H. V. Poor",
title = "Distributed Source Coding Using {Raptor} Codes for
Hidden {Markov} Sources",
crossref = "Storer:2008:DDC",
pages = "517--517",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.89",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483344",
acknowledgement = ack-nhfb,
}
@InProceedings{Fu:2008:SIR,
author = "Jingjing Fu and Feng Wu and Bing Zeng",
title = "Spectral Information Recovery for Compressed Image
Restoration",
crossref = "Storer:2008:DDC",
pages = "518--518",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.59",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483345",
acknowledgement = ack-nhfb,
}
@InProceedings{Garcia-Vilchez:2008:HIC,
author = "F. Garcia-Vilchez and J. Serra-Sagrist{\`a} and J.
Bartrina-Rapesta and F. Aul{\'\i}-Llin{\'a}s",
title = "Hyperspectral Image Coding Using {$3$D} Transform and
the Recommendation {CCSDS-122-B-1}",
crossref = "Storer:2008:DDC",
pages = "103--112",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.68",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483288",
acknowledgement = ack-nhfb,
}
@InProceedings{Gilbert:2008:ACG,
author = "J. Gilbert and D. M. Abrahamson",
title = "Adaptive Compression of Graph Structured Text",
crossref = "Storer:2008:DDC",
pages = "519--519",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.42",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483346",
acknowledgement = ack-nhfb,
}
@Misc{Gilchrist:2008:JGC,
author = "Jeff Gilchrist",
title = "{Jeff Gilchrist}'s Compression Archive Comparison
Test",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://compression.ca/act/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Gilchrist (2008) |http://compression.ca/act/|.",
}
@Article{Gorjiara:2008:MDC,
author = "Bita Gorjiara and Mehrdad Reshadi and Daniel Gajski",
title = "Merged Dictionary Code Compression for {FPGA}
Implementation of Custom Microcoded {PEs}",
journal = j-TRETS,
volume = "1",
number = "2",
pages = "11:1--11:??",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1371579.1371583",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Nov 4 17:12:42 MST 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "Horizontal Microcoded Architecture (HMA) is a paradigm
for designing programmable high-performance processing
elements (PEs). However, it suffers from large code
size, which can be addressed by compression. In this
article, we study the code size of one of the new
HMA-based technologies called No-Instruction-Set
Computer (NISC). We show that NISC code size can be
several times larger than a typical RISC processor, and
we propose several low-overhead dictionary-based code
compression techniques to reduce its code size. Our
compression algorithm leverages the knowledge of
``don't care'' values in the control words and can
reduce the code size by 3.3 times, on average. Despite
such good results, as shown in this article, these
compression techniques lead to poor FPGA
implementations because they require many on-chip RAMs.
To address this issue, we introduce an FPGA-aware
dictionary-based technique that uses the dual-port
feature of on-chip RAMs to reduce the number of
utilized block RAMs by half. Additionally, we propose
cascading two-levels of dictionaries for code size and
block RAM reduction of large programs. For an MP3
application, a merged, cascaded, three-dictionary
implementation reduces the number of utilized block
RAMs by 4.3 times (76\%) compared to a NISC without
compression. This corresponds to 20\% additional
savings over the best single level dictionary-based
compression.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "dictionary based compression; FPGA; memory
optimization; microcoded architectures;
no-instruction-set computer",
}
@InProceedings{Gray:2008:RDF,
author = "R. M. Gray and T. Hashimoto",
title = "Rate-Distortion Functions for Nonstationary {Gaussian}
Autoregressive Processes",
crossref = "Storer:2008:DDC",
pages = "53--62",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.107",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483283",
acknowledgement = ack-nhfb,
}
@InProceedings{Han:2008:OBR,
author = "Sunhyoung Han and N. Vasconcelos",
title = "Object-Based Regions of Interest for Image
Compression",
crossref = "Storer:2008:DDC",
pages = "132--141",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.94",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483291",
acknowledgement = ack-nhfb,
}
@Article{Herzog:2008:PRA,
author = "Robert Herzog and Shinichi Kinuwaki and Karol
Myszkowski and Hans-Peter Seidel",
title = "Perception for Rendering and Animation: {Render2MPEG}:
a Perception-based Framework Towards Integrating
Rendering and Video Compression",
journal = j-CGF,
volume = "27",
number = "2",
pages = "183--192",
month = apr,
year = "2008",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2008.01115.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:43 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "24 Apr 2008",
}
@MastersThesis{Heshmati:2008:DCT,
author = "Ashkan Heshmati",
title = "Data compression and transmission in wireless sensor
networks",
type = "{Master of Applied Science (Electrical Engineering)}",
school = "Department of Electrical and Computer Engineering,
Concordia University",
address = "Montr{\'e}al, QC, Canada",
pages = "xii + 84",
year = "2008",
ISBN = "0-494-28915-5",
ISBN-13 = "978-0-494-28915-0",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "1 microfiche.",
series = "Canadian theses = Th{\`e}ses canadiennes.",
URL = "http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/002/MR28915.PDF",
acknowledgement = ack-nhfb,
}
@InProceedings{Hirschberg:2008:ECM,
author = "D. S. Hirschberg and P. Baldi",
title = "Effective Compression of Monotone and Quasi-Monotone
Sequences of Integers",
crossref = "Storer:2008:DDC",
pages = "520--520",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.9",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483347",
acknowledgement = ack-nhfb,
}
@InProceedings{Hon:2008:CID,
author = "Wing-Kai Hon and R. Shah and J. S. Vitter and Tak-Wah
Lam and Siu-Lung Tarn",
title = "Compressed Index for Dictionary Matching",
crossref = "Storer:2008:DDC",
pages = "23--32",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.62",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483280",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:2008:TBJ,
author = "Yuh-Ming Huang and Y. S. Han",
title = "Trellis-Based Joint {Huffman} and Convolutional
Soft-Decision Priority-First Decoding",
crossref = "Storer:2008:DDC",
pages = "521--521",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.40",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483348",
acknowledgement = ack-nhfb,
}
@InProceedings{Ingber:2008:SJS,
author = "A. Ingber",
title = "Simple Joint Source-Channel Coding Schemes for Colored
{Gaussian} Sources",
crossref = "Storer:2008:DDC",
pages = "522--522",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.83",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483349",
acknowledgement = ack-nhfb,
}
@InProceedings{Jin:2008:FPD,
author = "Soonjong Jin and Hyuk Lee and Jechang Jeong",
title = "Fast Partial Distortion Elimination Algorithm for
Lossless and Lossy Motion Estimation Using {Hadamard}
Transform and Probability Model",
crossref = "Storer:2008:DDC",
pages = "523--523",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.13",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483350",
acknowledgement = ack-nhfb,
}
@Article{Joo:2008:ECP,
author = "Yongsoo Joo and Youngjin Cho and Donghwa Shin and
Jaehyun Park and Naehyuck Chang",
title = "An energy characterization platform for memory devices
and energy-aware data compression for multilevel-cell
flash memory",
journal = j-TODAES,
volume = "13",
number = "3",
pages = "43:1--43:??",
month = jul,
year = "2008",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1367045.1367052",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Tue Aug 5 18:41:27 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Memory devices often consume more energy than
microprocessors in current portable embedded systems,
but their energy consumption changes significantly with
the type of transaction, data values, and access
timing, as well as depending on the total number of
transactions. These variabilities mean that an
innovative tool and framework are required to
characterize modern memory devices running in embedded
system architectures.\par
We introduce an energy measurement and characterization
platform for memory devices, and demonstrate an
application to multilevel-cell (MLC) flash memories, in
which we discover significant value-dependent
programming energy variations. We introduce an
energy-aware data compression method that minimizes the
flash programming energy, rather than the size of the
compressed data, which is formulated as an entropy
coding with unequal bit-pattern costs. Deploying a
probabilistic approach, we derive energy-optimal
bit-pattern probabilities and expected values of the
bit-pattern costs which are applicable to the large
amounts of compressed data typically found in
multimedia applications. Then we develop an
energy-optimal prefix coding that uses integer linear
programming, and construct a prefix-code table. From a
consideration of Pareto-optimal energy consumption, we
can make tradeoffs between data size and programming
energy, such as a 41\% energy savings for a 52\% area
overhead.",
acknowledgement = ack-nhfb,
articleno = "43",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
keywords = "compression; flash memory; MLC",
}
@InProceedings{Kammerl:2008:TAD,
author = "J. Kammerl and P. Hinterseer and S. Chaudhuri and E.
Steinbach",
title = "A Theoretical Analysis of Data Reduction Using the
{Weber} Quantizer",
crossref = "Storer:2008:DDC",
pages = "524--524",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.71",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483351",
acknowledgement = ack-nhfb,
}
@InProceedings{Khalifeh:2008:OAT,
author = "A. Khalifeh and H. Yousefi'zadeh",
title = "Optimal Audio Transmission over Wireless Tandem
Channels",
crossref = "Storer:2008:DDC",
pages = "525--525",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.30",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483352",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2008:DRE,
author = "A. N. Kim and F. Hekland",
title = "Dimension Reduction and Expansion: Distributed Source
Coding in a Noisy Environment",
crossref = "Storer:2008:DDC",
pages = "332--341",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.41",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483311",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2008:HCN,
author = "S. T. Klein and D. Shapira",
title = "{Huffman} Coding with Non-sorted Frequencies",
crossref = "Storer:2008:DDC",
pages = "526--526",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.73",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483353",
acknowledgement = ack-nhfb,
}
@InProceedings{Klein:2008:UFC,
author = "S. T. Klein and M. K. Ben-Nissan",
title = "Using {Fibonacci} Compression Codes as Alternatives to
Dense Codes",
crossref = "Storer:2008:DDC",
pages = "472--481",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.54",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483325",
acknowledgement = ack-nhfb,
}
@InProceedings{Kochanek:2008:MC,
author = "J. Kochanek and J. Lansky and P. Uzel and M.
Zemlicka",
title = "Multistream Compression",
crossref = "Storer:2008:DDC",
pages = "527--527",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.21",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483354",
acknowledgement = ack-nhfb,
}
@InProceedings{Kochman:2008:NSP,
author = "Y. Kochman and J. {\O}stergaard and R. Zamir",
title = "Noise-Shaped Predictive Coding for Multiple
Descriptions of a Colored {Gaussian} Source",
crossref = "Storer:2008:DDC",
pages = "362--371",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.76",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483314",
acknowledgement = ack-nhfb,
}
@Article{Komogortsev:2008:PRT,
author = "Oleg V. Komogortsev and Javed I. Khan",
title = "Predictive real-time perceptual compression based on
eye-gaze-position analysis",
journal = j-TOMCCAP,
volume = "4",
number = "3",
pages = "23:1--23:??",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1386109.1386116",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:51:12 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "This article designs a real-time perceptual
compression system (RTPCS) based on eye-gaze-position
analysis. Our results indicate that the
eye-gaze-position containment metric provides more
efficient and effective evaluation of an RTPCS than the
eye fixation containment. The presented RTPCS is
designed for a network communication scenario with a
feedback loop delay. The proposed RTPCS uses human
visual system properties to compensate for the delay
and to provide high ratios of multimedia compression.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "human visual system; Real-time multimedia
compression",
}
@Article{Kumar:2008:IMC,
author = "V. Santhosh Kumar and R. Nanjundiah and M. J.
Thazhuthaveetil and R. Govindarajan",
title = "Impact of message compression on the scalability of an
atmospheric modeling application on clusters",
journal = j-PARALLEL-COMPUTING,
volume = "34",
number = "1",
pages = "1--16",
month = jan,
year = "2008",
CODEN = "PACOEJ",
DOI = "https://doi.org/10.1016/j.parco.2007.10.002",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Thu Sep 2 17:51:08 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib;
http://www.sciencedirect.com/science/journal/01678191",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191",
}
@InProceedings{Lalgudi:2008:LBV,
author = "H. G. Lalgudi and M. W. Marcellin and A. Bilgin and M.
S. Nadar",
title = "Lifting-Based View Compensated Compression of Volume
Rendered Images for Efficient Remote Visualization",
crossref = "Storer:2008:DDC",
pages = "442--451",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.29",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483322",
acknowledgement = ack-nhfb,
}
@InProceedings{Lalgudi:2008:MDC,
author = "H. G. Lalgudi and A. Bilgin and M. W. Marcellin and M.
S. Nadar",
title = "Multi-dimensional Compression Using {JPEG2000}",
crossref = "Storer:2008:DDC",
pages = "528--528",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.27",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483355",
acknowledgement = ack-nhfb,
}
@InProceedings{Lan:2008:PPA,
author = "Xuguang Lan and Nanning Zheng and Jianru Xue and Weike
Chen and Bin Wang and Wen Ma and Songlin Zhao",
title = "A Peer-to-Peer Architecture Based on Scalable Video
Coding",
crossref = "Storer:2008:DDC",
pages = "529--529",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.10",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483356",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:2008:IWB,
author = "Jungwon Lee and Teahyung Lee and D. V. Anderson",
title = "Improved Wavelet-Based Embedded Image Coding Using a
Dynamic Index Reordering Vector Quantizer",
crossref = "Storer:2008:DDC",
pages = "530--530",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.97",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483357",
acknowledgement = ack-nhfb,
}
@Book{Lee:2008:VHV,
author = "J. B. Lee and H. Kalva",
title = "The {VC-1} and {H.264} Video Compression Standards for
Broadband Video Services",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Lee, J. B. and H. Kalva (2008) {\it The VC-1 and H.264
Video Compression Standards for Broadband Video
Services}, New York, Springer Verlag.",
}
@InProceedings{Leontaris:2008:DCI,
author = "A. Leontaris and A. M. Tourapis",
title = "Drift Characterization of Intra Prediction and
Quantization in {H.264}",
crossref = "Storer:2008:DDC",
pages = "212--221",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.53",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483299",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2008:ETI,
author = "Zhen Li and A. M. Tourapis",
title = "An Estimation-Theoretic Interpretation of Video Rate
Distortion Optimization with {Lagrangian} Formulation",
crossref = "Storer:2008:DDC",
pages = "222--231",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.50",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483300",
acknowledgement = ack-nhfb,
}
@Book{Li:2008:IKC,
author = "Ming Li and P. M. B. (Paul Michael B{\'e}la)
Vit{\'a}nyi",
title = "An Introduction to {Kolmogorov} Complexity and Its
Applications",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Third",
pages = "xxiii + 790",
year = "2008",
DOI = "https://doi.org/10.1007/978-0-387-49820-1",
ISBN = "0-387-33998-1 (hardcover), 0-387-49820-6 (e-book)",
ISBN-13 = "978-0-387-33998-6 (hardcover), 978-0-387-49820-1
(e-book)",
LCCN = "QA267.7 .L5 2008",
bibdate = "Mon Apr 29 06:11:10 MDT 2019",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
series = "Texts in computer science",
URL = "http://link.springer.com/10.1007/978-0-387-49820-1",
abstract = "This ongoing bestseller, now in its third edition, is
considered the standard reference on Kolmogorov
complexity, a modern theory of information that is
concerned with information in individual objects. New
key features and topics in the 3rd edition: * New
results on randomness * Kolmogorov's structure
function, model selection, and MDL * Incompressibility
method: counting unlabeled graphs, Shellsort,
communication complexity * Derandomization * Kolmogorov
complexity versus Shannon information, rate distortion,
lossy compression, denoising * Theoretical results on
information distance * The similarity metric with
applications to genomics, phylogeny, clustering,
classification, semantic meaning, question-answer
systems *Quantum Kolmogorov complexity Written by two
experts in the field, this book is ideal for advanced
undergraduate students, graduate students, and
researchers in all fields of science. It is
self-contained: it contains the basic requirements from
mathematics, probability theory, statistics,
information theory, and computer science. Included are
history, theory, new developments, a wide range of
applications, numerous (new) problem sets, comments,
source references, and hints to solutions of problems.
This is the only comprehensive treatment of the central
ideas of Kolmogorov complexity and their applications.
``Li and Vit{\'a}nyi have provided an ideal book for
the exploration of a deep, beautiful and important part
of computer science.'' -- Juris Hartmanis, Turing Award
Winner 1993, Cornell University, Ithaca, NY. ``The book
is likely to remain the standard treatment of
Kolmogorov complexity for a long time.'' -- Jorma J.
Rissanen, IBM Research, California. ``The book of Li
and Vit{\'a}nyi is unexcelled.'' -- Ray J. Solomonoff,
Oxbridge Research, Cambridge, Massachusetts ``The book
is outstanding\ldots{} the authors did their job
unbelievably well\ldots{} necessary reading for all
kinds of readers from undergraduate students to top
authorities in the field.'' -- Vladimir A. Uspensky and
Alexander K. Shen, Journal of Symbolic Logic [Review]
``Careful and clear introduction to a subtle and deep
field.'' --David G. Stork, Ricoh Innovations,
California, Amazon [Review] ``THE book on Kolmogorov
Complexity.'' --Lance Fortnow, University of Chicago,
IL, Amazon [Review].",
acknowledgement = ack-nhfb,
remark = "See also first \cite{Li:1993:IKC} and second
\cite{Li:1997:IKC} editions.",
shorttableofcontents = "Preliminaries \\
Algorithmic Complexity \\
Algorithmic Prefix Complexity \\
Algorithmic Probability \\
Inductive Reasoning \\
The Incompressibility Method \\
Resource-Bounded Complexity \\
Physics, Information, and Computation",
subject = "Kolmogorov complexity; Kolmogorov complexity;
Informatique; Kolmogorov complexity;
Kolmogorov-integralen; Complexiteit; Informatietheorie;
Mathematics; Applications of Mathematics; Coding and
Information Theory; Theory of Computation; Algorithms;
Statistical Theory and Methods; Pattern Recognition",
tableofcontents = "Preface to the First Edition / vii \\
Preface to the Second Edition / xi \\
Preface to the Third Edition / xii \\
How to Use This Book / xii \\
Outlines of One-Semester Courses / xv \\
List of Figures / xxi \\
Preliminaries / 1 \\
1.1 A Brief Introduction / 1 \\
1.2 Prerequisites and Notation / 7 \\
1.3 Numbers and Combinatorics / 8 \\
1.4 Binary Strings / 12 \\
1.5 Asymptotic Notation / 15 \\
1.6 Basics of Probability Theory / 18 \\
1.7 Basics of Computability Theory / 24 \\
1.8 The Roots of Kolmogorov Complexity / 47 \\
1.9 Randomness / 49 \\
1.10 Prediction and Probability / 59 \\
1.11 Information Theory and Coding / 65 \\
1.12 State x Symbol Complexity / 90 \\
1.13 History and References / 92 \\
2 Algorithmic Complexity / 101 \\
2.1 The Invariance Theorem / 104 \\
2.2 Incompressibility / 116 \\
2.3 C as an Integer Function / 126 \\
2.4 Random Finite Sequences / 133 \\
2.5 *Random Infinite Sequences / 143 \\
2.6 Statistical Properties of Finite Sequences / 165
\\
2.7 Algorithmic Properties of C / 174 \\
2.8 Algorithmic Information Theory / 186 \\
2.9 History and References / 192 \\
3 Algorithmic Prefix Complexity / 197 \\
3.1 The Invariance Theorem / 200 \\
3.2 *Sizes of the Constants / 206 \\
3.3 Incompressibility / 211 \\
3.4 K as an Integer Function / 216 \\
3.5 Random Finite Sequences / 218 \\
3.6 ^Random Infinite Sequences / 220 \\
3.7 Algorithmic Properties of K / 239 \\
3.8 *Complexity of Complexity / 241 \\
3.9 *Symmetry of Algorithmic Information / 244 \\
3.10 History and References 197 / 255 \\
4 Algorithmic Probability / 259 \\
4.1 Semicomputable Functions Revisited / 260 \\
4.2 Measure Theory / 262 \\
4.3 Discrete Sample Space / 265 \\
4.4 Universal Average-Case Complexity / 290 \\
4.5 Continuous Sample Space / 294 \\
4.6 Universal Average-Case Complexity; Continued / 330
\\
4.7 History and References / 331 \\
5 Inductive Reasoning / 339 \\
5.1 Introduction / 339 \\
5.2 Solomonoff's Theory of Prediction / 348 \\
5.3 Simple Pac-Learning / 370 \\
5.4 Hypothesis Identification by MDL / 382 \\
5.5 Nonprobabilistic Statistics / 401 \\
5.6 History and References / 431 \\
6 The Incompressibility Method / 441 \\
6.1 Three Examples / 442 \\
6.2 High-Probability Properties / 448 \\
6.3 Combinatorics / 451 \\
6.4 Kolmogorov Random Graphs / 461 \\
6.5 Compact Routing / 469 \\
6.6 Average-Case Analysis of Sorting / 476 \\
6.7 Longest Common Subsequence / 486 \\
6.8 Formal Language Theory / 490 \\
6.9 Online CFL Recognition / 497 \\
6.10 Turing Machine Time Complexity / 502 \\
6.11 Communication Complexity / 516 \\
6.12 Circuit Complexity / 521 \\
6.13 History and References / 524 \\
7 Resource-Bounded Complexity / 531 \\
7.1 Mathematical Theory / 532 \\
7.2 Language Compression / 550 \\
7.3 Computational Complexity / 562 \\
7.4 Instance Complexity / 571 \\
7.5 Kt and Universal Search / 577 \\
7.6 Time-Limited Universal Distributions / 582 \\
7.7 Logical Depth / 589 \\
7.8 History and References / 596 \\
Physics, Information, and Computation / 601 \\
8.1 Information Theory / 602 \\
8.2 Reversible Computation / 629 \\
8.3 Information Distance / 641 \\
8.4 Normalized Information Distance / 660 \\
8.5 Thermodynamics / 674 \\
8.6 Entropy Revisited / 686 \\
8.7 Quantum Kolmogorov Complexity / 696 \\
8.8 Compression in Nature / 711 \\
8.9 History and References / 714 \\
References / 723 \\
Index / 765",
}
@InProceedings{Lindstrom:2008:LCH,
author = "P. Lindstrom and M. Isenburg",
title = "Lossless Compression of Hexahedral Meshes",
crossref = "Storer:2008:DDC",
pages = "192--201",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.12",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483297",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2008:CDW,
author = "Xiteng Liu",
title = "Composition of {DCT} and Wavelet Transform for Image
Compression",
crossref = "Storer:2008:DDC",
pages = "532--532",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.15",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483359",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2008:IPE,
author = "Dong Liu and Xiaoyan Sun and Feng Wu",
title = "Intra Prediction via Edge-Based Inpainting",
crossref = "Storer:2008:DDC",
pages = "282--291",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.18",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483306",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2008:MRR,
author = "Xiteng Liu",
title = "Maximally Robust Redundant System with Minimal
Coherence",
crossref = "Storer:2008:DDC",
pages = "533--533",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.16",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483360",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2008:PAD,
author = "Da Liu and Xiangyang Ji and Debin Zhao and Xiaobin Zhu
and Zhi Bian and Wen Gao",
title = "Performance Analysis of Dual Frame Motion
Compensation",
crossref = "Storer:2008:DDC",
pages = "531--531",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.31",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483358",
acknowledgement = ack-nhfb,
}
@Article{Liu:2008:RDO,
author = "Hui Liu and Siliang Ma",
title = "{R--D} optimized tree-structured compression
algorithms with discrete directional wavelet
transform",
journal = j-J-COMPUT-APPL-MATH,
volume = "219",
number = "1",
pages = "302--311",
day = "15",
month = sep,
year = "2008",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2007.07.027",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:13:25 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042707004116",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Misc{Loomis:2008:VTO,
author = "Jay Loomis and Mike Wasson",
key = "WMV review",
title = "{VC-1} Technical Overview",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "VC-1 is a video codec specification that has been
standardized by the Society of Motion Picture and
Television Engineers (SMPTE) and implemented by
Microsoft as Microsoft Windows Media Video (WMV) 9.",
URL = "http://www.microsoft.com/windows/windowsmedia/howto/articles/vc1techoverview.aspx",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "WMV review (2008)
|http://www.microsoft.com/windows/windowsmedia/howto/|
|articles/vc1techoverview.aspx|.",
}
@Article{Lu:2008:LCE,
author = "Qin Lu and Wusheng Luo and Jidong Wang and Bo Chen",
title = "Low-complexity and energy efficient image compression
scheme for wireless sensor networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "52",
number = "13",
pages = "2594--2603",
day = "17",
month = sep,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.comnet.2008.05.006",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Misc{Mahoney:2008:BAR,
author = "Matt Mahoney",
key = "Barf",
title = "{Better Archiver with Recursive Functionality
(BARF)}",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.cs.fit.edu/~mmahoney/compression/barf.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Barf (2008)
|http://www.cs.fit.edu/~mmahoney/compression/barf.html|.",
}
@Misc{Mahoney:2008:DCP,
author = "Matt Mahoney",
title = "Data Compression Programs",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "As of July 23, 2009, this page is no longer
maintained. The newest version can be found at
\path=http://mattmahoney.net/dc/=",
URL = "http://www.cs.fit.edu/~mmahoney/compression",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Mahoney (2008)
|http://www.cs.fit.edu/~mmahoney/compression|.",
}
@Article{Makinen:2008:DEC,
author = "Veli M{\"a}kinen and Gonzalo Navarro",
title = "Dynamic entropy-compressed sequences and full-text
indexes",
journal = j-TALG,
volume = "4",
number = "3",
pages = "32:1--32:??",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1367064.1367072",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Tue Jul 14 19:03:06 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "We give new solutions to the Searchable Partial Sums
with Indels problem. Given a sequence of $n$ $k$-bit
numbers, we present a structure taking $ k n + o(k n)$
bits of space, able of performing operations {\em sum},
{\em search}, {\em insert}, and {\em delete}, all in $
O(\log n)$ worst-case time, for any $ k = O(\log n)$.
This extends previous results by Hon et al. [2003c]
achieving the same space and $ O (\log n / \log \log
n)$ time complexities for the queries, yet offering
complexities for {\em insert\/} and {\em delete\/} that
are amortized and worse than ours, and supported only
for $ k = O(1)$. Our result matches an existing lower
bound for large values of $k$.\par
We also give new solutions to the Dynamic Sequence
problem. Given a sequence of $n$ symbols in the range $
[1, \sigma]$ with binary zero-order entropy $ H_0$, we
present a dynamic data structure that requires $ n_0 +
o(n \log \sigma)$ bits of space, which is able of
performing {\em rank\/} and {\em select}, as well as
inserting and deleting symbols at arbitrary positions,
in $ O(\log n \log \sigma)$ time. Our result is the
{\em first\/} entropy-bound dynamic data structure for
{\em rank\/} and {\em select\/} over general
sequences.\par
In the case $ \sigma = 2$, where both previous problems
coincide, we improve the dynamic solution of Hon et al.
[2003c] in that we compress the sequence. The only
previous result with entropy-bound space for dynamic
binary sequences is by Blandford and Blelloch [2004],
which has the same complexities as our structure, but
does not achieve constant 1 multiplying the entropy
term in the space complexity.\par
Finally, we present a new dynamic compressed full-text
self-index, for a collection of texts over an alphabet
of size $ \sigma $, of overall length $n$ and $h$ th
order empirical entropy $ H_h$. The index requires $ n
H_h + o(n \log \sigma)$ bits of space, for any $ h \leq
\alpha \log_\sigma n$ and constant $0$.\par
An important result we prove in this paper is that the
wavelet tree of the Burrows--Wheeler transform of a
text, if compressed with a technique that achieves
zero-order compression locally (e.g., Raman et al.
[2002]), automatically achieves $h$ th order entropy
space for any $h$. This unforeseen relation is
essential for the results of the previous paragraph,
but it also derives into significant simplifications on
many existing static compressed full-text self-indexes
that build on wavelet trees.",
acknowledgement = ack-nhfb,
articleno = "32",
fjournal = "ACM Transactions on Algorithms (TALG)",
keywords = "Compressed dynamic data structures; compressed text
databases; entropy; partial sums; sequences",
}
@InProceedings{Makinen:2008:SII,
author = "V. Makinen and G. Navarro",
title = "On Self-Indexing Images --- Image Compression with
Added Value",
crossref = "Storer:2008:DDC",
pages = "422--431",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.47",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483320",
acknowledgement = ack-nhfb,
}
@InProceedings{Maleh:2008:SRS,
author = "R. Maleh and A. C. Gilbert",
title = "Sublinear Recovery of Sparse Wavelet Signals",
crossref = "Storer:2008:DDC",
pages = "342--351",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.86",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483312",
acknowledgement = ack-nhfb,
}
@InProceedings{Mallet:2008:CBI,
author = "A. Mallet and L. Gueguen and M. Datcu",
title = "Complexity Based Image Artifact Detection",
crossref = "Storer:2008:DDC",
pages = "534--534",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.33",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483361",
acknowledgement = ack-nhfb,
}
@Article{Menconi:2008:DCG,
author = "Giulia Menconi and Vieri Benci and Marcello Buiatti",
title = "Data compression and genomes: a two-dimensional life
domain map",
journal = j-J-THEOR-BIOL,
volume = "253",
number = "2",
pages = "281--288",
day = "21",
month = jul,
year = "2008",
CODEN = "JTBIAP",
DOI = "https://doi.org/10.1016/j.jtbi.2008.03.011",
ISSN = "0022-5193 (print), 1095-8541 (electronic)",
ISSN-L = "0022-5193",
bibdate = "Sat Jun 1 15:27:19 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jtheorbiol2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022519308001252",
acknowledgement = ack-nhfb,
fjournal = "Journal of Theoretical Biology",
journal-URL = "http://www.sciencedirect.com/science/journal/00225193",
}
@InProceedings{Meron:2008:LBR,
author = "E. Meron and O. Shayevitz and M. Feder and R. Zamir",
title = "A Lower Bound on the Redundancy of Arithmetic-Type
Delay Constrained Coding",
crossref = "Storer:2008:DDC",
pages = "489--498",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.84",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483327",
acknowledgement = ack-nhfb,
}
@InProceedings{Minoo:2008:MLR,
author = "K. Minoo and Truong Nguyen",
title = "Maximum Likelihood Rate Estimation: With Applications
in Image and Video Compression",
crossref = "Storer:2008:DDC",
pages = "535--535",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.98",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483362",
acknowledgement = ack-nhfb,
}
@InProceedings{Misra:2008:HRF,
author = "V. Misra and V. K. Goyal and L. R. Varshney",
title = "High-Resolution Functional Quantization",
crossref = "Storer:2008:DDC",
pages = "113--122",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.100",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483289",
acknowledgement = ack-nhfb,
}
@Article{Mitra:2008:NPA,
author = "Suman K. Mitra and Malay K. Kundu and C. A. Murthy and
Bhargab B. Bhattacharya and Tinku Acharya",
title = "A New Probabilistic Approach for Fractal Based Image
Compression",
journal = j-FUND-INFO,
volume = "87",
number = "3--4",
pages = "417--433",
month = nov,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:07:35 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Mohajer:2008:AML,
author = "S. Mohajer and Chao Tian and S. N. Diggavi",
title = "Asymmetric Multi-level Diversity Coding",
crossref = "Storer:2008:DDC",
pages = "412--421",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.82",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483319",
acknowledgement = ack-nhfb,
}
@InProceedings{Motta:2008:DLC,
author = "G. Motta and E. Ordentlich and M. J. Weinberger",
title = "Defect List Compression",
crossref = "Storer:2008:DDC",
pages = "3--12",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.96",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483278",
acknowledgement = ack-nhfb,
}
@Article{Munkberg:2008:PHT,
author = "J. Munkberg and P. Clarberg and J. Hasselgren and T.
Akenine-M{\"o}ller",
title = "Practical {HDR} Texture Compression",
journal = j-CGF,
volume = "27",
number = "6",
pages = "1664--1676",
month = sep,
year = "2008",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2008.01174.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:02 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "20 Sep 2008",
}
@InProceedings{Munoz-Jimenez:2008:NBM,
author = "V. Munoz-Jimenez and A. Zergainoh-Mokraoui and J.-P.
Astruc",
title = "New Bidirectional Motion Estimation Using Mesh-Based
Frame Interpolation for Videoconferencing
Applications",
crossref = "Storer:2008:DDC",
pages = "536--536",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.104",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483363",
acknowledgement = ack-nhfb,
}
@Book{Nait-Ali:2008:CIS,
editor = "Amine Nait-Ali and Christine Cavaro-Menard",
title = "Compression des images et des signaux medicaux.
({French}) [{Compression} of biomedical images and
signals]",
publisher = "ISTE",
address = "London, UK",
pages = "????",
year = "2008",
ISBN = "1-84821-028-0",
ISBN-13 = "978-1-84821-028-8",
LCCN = "RC78.7.D35 C63813 2008",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0808/2008003130-b.html;
http://www.loc.gov/catdir/enhancements/fy0808/2008003130-d.html;
http://www.loc.gov/catdir/enhancements/fy0808/2008003130-t.html",
acknowledgement = ack-nhfb,
language = "French",
subject = "Diagnosis; Data processing; Data compression (Computer
science); Medical informatics; Data Compression;
Diagnostic Imaging",
tableofcontents = "Relevance of biomedical data compression \\
State-of-the-art of compression methods \\
Specificities of physiological signals and medical
images \\
Standards in medical image compression \\
Quality assessment of lossy compressed medical images
\\
Compression of physiological signals \\
Compression of 2-D biomedical images \\
Compression of dynamic and volumetric medical sequences
\\
Compression of static and dynamic 3D surface meshes \\
Hybrid coding: encryption-watermarking-compression for
medical information security",
}
@InProceedings{Navarro:2008:RPA,
author = "G. Navarro and L. Russo",
title = "Re-pair Achieves High-Order Entropy",
crossref = "Storer:2008:DDC",
pages = "537--537",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.79",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483364",
acknowledgement = ack-nhfb,
}
@InProceedings{Nejati:2008:WVT,
author = "N. Nejati and H. Yousefi'zadeh and H. Jafarkhani",
title = "Wireless Video Transmission: a Distortion-Optimal
Approach",
crossref = "Storer:2008:DDC",
pages = "202--211",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.49",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483298",
acknowledgement = ack-nhfb,
}
@Article{Ou:2008:LIT,
author = "Chien-Min Ou and Hui-Ya Li and Wen-Jyi Hwang and
Mei-Hwa Liu",
title = "Layered Image Transmission with Quality
Pre-Specifiable {JPEG2000}",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "8",
number = "4",
pages = "629--641",
month = oct,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467808003271",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Pattem:2008:ISC,
author = "Sundeep Pattem and Bhaskar Krishnamachari and Ramesh
Govindan",
title = "The impact of spatial correlation on routing with
compression in wireless sensor networks",
journal = j-TOSN,
volume = "4",
number = "4",
pages = "24:1--24:??",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1387663.1387670",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:22:19 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "The efficacy of data aggregation in sensor networks is
a function of the degree of spatial correlation in the
sensed phenomenon. The recent literature has examined a
variety of schemes that achieve greater data
aggregation by routing data with regard to the
underlying spatial correlation. A well known conclusion
from these papers is that the nature of optimal routing
with compression depends on the correlation level. In
this article we show the existence of a simple,
practical, and static correlation-unaware clustering
scheme that satisfies a min-max near-optimality
condition. The implication for system design is that a
static correlation-unaware scheme can perform as well
as sophisticated adaptive schemes for joint routing and
compression.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "analytical modeling; correlated data gathering; Sensor
networks",
}
@InProceedings{Pigeon:2008:VLC,
author = "S. Pigeon and S. Coulombe",
title = "Very Low Cost Algorithms for Predicting the File Size
of {JPEG} Images Subject to Changes of Quality Factor
and Scaling",
crossref = "Storer:2008:DDC",
pages = "538--538",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.85",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483365",
acknowledgement = ack-nhfb,
}
@Misc{Poynton:2008:CSN,
author = "Charles Poynton",
title = "Chroma subsampling notation",
pages = "3",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.poynton.com/PDFs/Chroma_subsampling_notation.pdf",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Poynton (2008)
|http://www.poynton.com/PDFs/Chroma_subsampling_notation.pdf|.",
}
@InProceedings{Ramaswamy:2008:SDF,
author = "S. Ramaswamy and K. Rose",
title = "Shared Descriptions Fusion Coding for Storage and
Selective Retrieval of Correlated Sources",
crossref = "Storer:2008:DDC",
pages = "262--271",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.56",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483304",
acknowledgement = ack-nhfb,
}
@Misc{Ratushnyak:2008:U,
author = "Ratushnyak",
title = "[unknown]",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.geocities.com/SiliconValley/Bay/1995/texts22.html",
acknowledgement = ack-ds,
rawdata = "Ratushnyak (2008)
|http://www.geocities.com/SiliconValley/Bay/1995/|\hfil\break
|texts22.html|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@InProceedings{Reznik:2008:PRR,
author = "Y. A. Reznik",
title = "On Precision-Redundancy Relation in the Design of
Source Coding Algorithms",
crossref = "Storer:2008:DDC",
pages = "539--539",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.103",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483366",
acknowledgement = ack-nhfb,
}
@InProceedings{Richter:2008:EVM,
author = "T. Richter",
title = "Effective Visual Masking Techniques in {JPEG2000}",
crossref = "Storer:2008:DDC",
pages = "540--540",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.43",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483367",
acknowledgement = ack-nhfb,
}
@InProceedings{Richter:2008:SOA,
author = "T. Richter and C. Larabi",
title = "Subjective and Objective Assessment of Visual Image
Quality Metrics and Still Image Codecs",
crossref = "Storer:2008:DDC",
pages = "541--541",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.44",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483368",
acknowledgement = ack-nhfb,
}
@InProceedings{Sairam:2008:NPP,
author = "Y. N. Sairam and Nan Ma and N. Sinha",
title = "A Novel Partial Prediction Algorithm for Fast $ 4
\times 4 $ Intra Prediction Mode Decision in
{H.264\slash AVC}",
crossref = "Storer:2008:DDC",
pages = "232--241",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.93",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483301",
acknowledgement = ack-nhfb,
}
@Book{Salomon:2008:CID,
author = "David Salomon",
title = "A Concise Introduction to Data Compression",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 310",
year = "2008",
ISBN = "1-84800-071-5 (paperback)",
ISBN-13 = "978-1-84800-071-1 (paperback)",
LCCN = "QA76.9.D33 S34 2008",
bibdate = "Thu Feb 21 12:37:12 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.gbv.de:20011/gvk; z3950.loc.gov:7090/Voyager",
price = "EUR 32",
series = "Undergraduate topics in computer science",
abstract = "Compressing data is an option naturally selected when
faced with problems of high costs or restricted space.
Written by a renowned expert in the field, this book
offers readers a succinct, reader-friendly foundation
to the chief approaches, methods and techniques
currently employed in the field of data compression.
Part I presents the basic approaches to data
compression and describes a few popular techniques and
methods commonly used to compress data. The reader
discovers essential concepts, such as variable-length
and prefix codes, statistical distributions and
run-length encoding. Part II then concentrates on
advanced techniques, such as arithmetic coding,
orthogonal transforms, subband transforms and the
Burrows--Wheeler transform.",
acknowledgement = ack-nhfb,
subject = "computer science; data structures (computer science);
data structures; cryptology and information theory;
data compression (computer science)",
tableofcontents = "Pt. I. Basic Concepts \\
1. Approaches to Compression \\
2. Huffman Coding \\
3. Dictionary Methods \\
Pt. II. Advanced Techniques \\
4. Arithmetic Coding \\
5. Image Compression \\
6. Audio Compression \\
7. Other Methods",
}
@InProceedings{Samarawickrama:2008:MCM,
author = "U. Samarawickrama and Jie Liang",
title = "{M}-Channel Multiple Description Coding with Two-Rate
Predictive Coding and Staggered Quantization",
crossref = "Storer:2008:DDC",
pages = "542--542",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.57",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483369",
acknowledgement = ack-nhfb,
}
@InProceedings{Saxena:2008:DMS,
author = "A. Saxena and K. Rose",
title = "Distributed Multi-stage Coding of Correlated Sources",
crossref = "Storer:2008:DDC",
pages = "312--321",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.64",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483309",
acknowledgement = ack-nhfb,
}
@InProceedings{Sestak:2008:SAL,
author = "R. Sestak and J. Lansky and M. Zemlicka",
title = "Suffix Array for Large Alphabet",
crossref = "Storer:2008:DDC",
pages = "543--543",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.22",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483370",
acknowledgement = ack-nhfb,
}
@InProceedings{Shoa:2008:VLC,
author = "A. Shoa",
title = "Variable Length Coding for Fixed Rate, Low Latency,
Low Complexity Compression Applications",
crossref = "Storer:2008:DDC",
pages = "544--544",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.51",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483371",
acknowledgement = ack-nhfb,
}
@InProceedings{Skibinski:2008:IHC,
author = "P. Skibi{\'n}ski",
title = "Improving {HTML} Compression",
crossref = "Storer:2008:DDC",
pages = "545--545",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.74",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483372",
acknowledgement = ack-nhfb,
}
@Misc{SMPTE-421M:2008:SFI,
author = "{Society of Motion Picture and Television Engineers
(SMPTE)}",
key = "SMPTE-421M",
title = "Standards Facilitate Interoperability",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.smpte.org/standards",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "SMPTE-421M (2008) |http://www.smpte.org/standards|.",
}
@Misc{SMPTE:2008:SHP,
author = "{Society of Motion Picture and Television Engineers
(SMPTE)}",
key = "SMPTE",
title = "{SMPTE} home page",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.smpte.org/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "SMPTE (2008) |http://www.smpte.org/|.",
}
@InProceedings{Sun:2008:MLR,
author = "Chang Sun and Hong-jun Wang and Hua Li",
title = "Macroblock-Level Rate-Distortion Optimization with
Perceptual Adjustment for Video Coding",
crossref = "Storer:2008:DDC",
pages = "546--546",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.75",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483373",
acknowledgement = ack-nhfb,
}
@InProceedings{Swacha:2008:CST,
author = "J. Swacha",
title = "{CoTe}: a Software Tool for Compression Benchmarking",
crossref = "Storer:2008:DDC",
pages = "547--547",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.17",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483374",
acknowledgement = ack-nhfb,
}
@Article{Tahoces:2008:ICM,
author = "Pablo G. Tahoces and J. Ram{\'o}n Varela and
Mar{\'\i}a J. Lado and Miguel Souto",
title = "Image compression: {Maxshift} {ROI} encoding options
in {JPEG2000}",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "109",
number = "2",
pages = "139--145",
month = feb,
year = "2008",
CODEN = "CVIUF4",
DOI = "https://doi.org/10.1016/j.cviu.2007.07.001",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@InProceedings{Takamura:2008:PEP,
author = "S. Takamura and Y. Yashima",
title = "On Performance Evaluation of Predictive Coding Using a
Residue-Free Approach",
crossref = "Storer:2008:DDC",
pages = "548--548",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.19",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483375",
acknowledgement = ack-nhfb,
}
@Misc{Tani:2008:PHP,
author = "Giorgio Tani",
key = "PeaZip",
title = "{PeaZip} home page",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://sourceforge.net/projects/peazip/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "PeaZip (2008)
|http://sourceforge.net/projects/peazip/|.",
}
@InProceedings{Tian:2008:SGM,
author = "Chao Tian and S. Mohajer and S. Diggavi",
title = "On the Symmetric {Gaussian} Multiple Description
Rate-Distortion Function",
crossref = "Storer:2008:DDC",
pages = "402--411",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.48",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483318",
acknowledgement = ack-nhfb,
}
@InProceedings{Tischler:2008:CCI,
author = "G. Tischler and M. Ebner and J. Albert",
title = "Color Constancy from Image Transformations in {JPEG}
and {JPEG2000}",
crossref = "Storer:2008:DDC",
pages = "549--549",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.52",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483376",
acknowledgement = ack-nhfb,
}
@Misc{UCLC:2008:U,
author = "UCLC",
title = "[unknown]",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://uclc.info",
acknowledgement = ack-ds,
rawdata = "UCLC (2008) |http://uclc.info|.",
remark = "URL accessible on 27 January 2013, but brings up
Japanese Web site.",
}
@Misc{UDA:2008:U,
author = "UDA",
title = "[unknown]",
pages = "??",
year = "2008",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://wex.cn/dwing/mycomp.htm",
acknowledgement = ack-ds,
rawdata = "UDA (2008) |http://wex.cn/dwing/mycomp.htm|.",
}
@Article{Varpaaniemi:2008:MSQ,
author = "Kimmo Varpaaniemi and Leo Ojala",
title = "Modelling and Simulation of Quantum Teleportation and
Dense Coding Using Predicate\slash Transition-Nets",
journal = j-FUND-INFO,
volume = "85",
number = "1--4",
pages = "465--479",
month = sep,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:07:07 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Verlani:2008:PPB,
author = "P. Verlani and P. J. Narayanan",
title = "A Parametric Proxy-Based Compression of Depth Movies",
crossref = "Storer:2008:DDC",
pages = "550--550",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.72",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483377",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2008:FBP,
author = "Jing Wang and Jie Liang",
title = "Filter Banks for Prediction-Compensated Multiple
Description Coding",
crossref = "Storer:2008:DDC",
pages = "392--401",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.39",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483317",
acknowledgement = ack-nhfb,
}
@MastersThesis{Wang:2008:TSN,
author = "Bin Wang",
title = "Taxation System Network Construction and Data
Compression Technology Research",
type = "{M.Eng.}",
school = "Tianjin University",
address = "Tianjin, Peoples Republic of China",
pages = "142",
year = "2008",
ISBN = "90-71382-20-6",
ISBN-13 = "978-90-71382-20-8",
LCCN = "????",
bibdate = "Fri Feb 1 09:20:32 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/1027902661",
acknowledgement = ack-nhfb,
advisor = "Lin Ying Xu",
classification = "0984: Computer science",
subject = "Computer science",
}
@InProceedings{Wharton:2008:SEC,
author = "E. Wharton and K. Panetta and S. Agaian",
title = "Simultaneous Encryption\slash Compression of Images
Using Alpha Rooting",
crossref = "Storer:2008:DDC",
pages = "551--551",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.87",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483378",
acknowledgement = ack-nhfb,
}
@InProceedings{Witzgall:2008:PMA,
author = "H. E. Witzgall",
title = "A Parametric Modeling Approach to Image Compression",
crossref = "Storer:2008:DDC",
pages = "552--552",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.24",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483379",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2008:ICV,
author = "Feng Wu and Xiaoyan Sun",
title = "Image Compression by {Visual Pattern Vector
Quantization (VPVQ)}",
crossref = "Storer:2008:DDC",
pages = "123--131",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.35",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483290",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2008:DLT,
author = "Jizheng Xu and Feng Wu and Jie Liang and Wenjun
Zhang",
title = "Directional Lapped Transforms for Image Coding",
crossref = "Storer:2008:DDC",
pages = "142--151",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.69",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483292",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2008:AGN,
author = "Jeehong Yang and S. A. Savari and O. Mencer",
title = "An Approach to Graph and Netlist Compression",
crossref = "Storer:2008:DDC",
pages = "33--42",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.65",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483281",
acknowledgement = ack-nhfb,
}
@Article{Yang:2008:RF,
author = "L. Yang and R. P. Dick and H. Lekatsas and S.
Chakradhar",
title = "{RAM} for free",
journal = j-IEEE-SPECTRUM,
volume = "45",
number = "8",
pages = "38--43",
month = aug,
year = "2008",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2008.4586286",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Control systems; CRAMES; data compression; Data
compression; data compression; Delay; Embedded
computing; Embedded software; Embedded system; embedded
systems; memory compression; portable systems; RAM;
Random access memory; random-access storage; Read-write
memory; Software performance",
}
@Article{Yang:2008:USN,
author = "Allen Y. Yang and John Wright and Yi Ma and S. Shankar
Sastry",
title = "Unsupervised segmentation of natural images via lossy
data compression",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "110",
number = "2",
pages = "212--225",
month = may,
year = "2008",
CODEN = "CVIUF4",
DOI = "https://doi.org/10.1016/j.cviu.2007.07.005",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:55 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cvgip.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@InProceedings{Yoon:2008:COR,
author = "Byung-Jun Yoon and H. S. Malvar",
title = "Coding Overcomplete Representations of Audio Using the
{MCLT}",
crossref = "Storer:2008:DDC",
pages = "152--161",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.28",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483293",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2008:CLR,
author = "Xiangjun Zhang and Xiaolin Wu",
title = "Can Lower Resolution Be Better?",
crossref = "Storer:2008:DDC",
pages = "302--311",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.81",
bibdate = "Tue Feb 5 12:38:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483308",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2008:FSE,
author = "Sen Zhang and Ge Nong",
title = "Fast and Space Efficient Linear Suffix Array
Construction",
crossref = "Storer:2008:DDC",
pages = "553--553",
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.61",
bibdate = "Tue Feb 5 12:38:48 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483380",
acknowledgement = ack-nhfb,
}
@InProceedings{Adiego:2009:HPW,
author = "J. Adiego and M. A. Martinez-Prieto and P. Fuente",
title = "High Performance Word-Codeword Mapping Algorithm on
{PPM}",
crossref = "Storer:2009:DPD",
pages = "23--32",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.40",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976446",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Agrawal:2009:DDM,
author = "N. Agrawal and A. Gupta",
title = "{DCT} Domain Message Embedding in Spread-Spectrum
Steganography System",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "433--433",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.86",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976487",
acknowledgement = ack-nhfb,
}
@InProceedings{Agulhari:2009:ZPS,
author = "C. M. Agulhari and I. S. Bonatti and P. L. D. Peres",
title = "A Zero Padding {SVD} Encoder to Compress
Electrocardiogram",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "434--434",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.48",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976488",
acknowledgement = ack-nhfb,
}
@InProceedings{Akyol:2009:NDQ,
author = "E. Akyol and K. Rose",
title = "Nonuniform Dithered Quantization",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "435--435",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.78",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976489",
acknowledgement = ack-nhfb,
}
@InProceedings{Akyol:2009:TCD,
author = "E. Akyol and K. Rose",
title = "On Transform Coding with Dithered Quantizers",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "243--251",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.76",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976468",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2009:AAS,
author = "Anonymous",
key = "ascii-wiki",
title = "{ASCII [American Standard Code for Information
Interchange]}",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/ASCII",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "ascii-wiki (2009)
|http://en.wikipedia.org/wiki/ASCII|.",
}
@InProceedings{Anonymous:2009:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2009:DPD",
pages = "vi--vi",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.89",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976441",
acknowledgement = ack-nhfb,
}
@Misc{Anonymous:2009:HSA,
author = "Anonymous",
key = "haiku-usa",
title = "The {Haiku Society of America}",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.hsa-haiku.org/index.htm",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "haiku-usa (2009)
|http://www.hsa-haiku.org/index.htm|.",
}
@Misc{Anonymous:2009:LEW,
author = "Anonymous",
key = "PQ-wiki",
title = "List of {English} words containing {{\em Q}} not
followed by {{\em U}}",
pages = "??",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/List_of_English_words_containing_Q_not_followed_by_U",
acknowledgement = ack-ds,
rawdata = "PQ-wiki (2009)
|http://en.wikipedia.org/wiki/|\hfil\break
|List_of_English_words_containing_Q_not_followed_by_U|.",
}
@Misc{Anonymous:2009:LMP,
author = "Anonymous",
key = "LZX",
title = "{LZX}: The most powerful archiver available for the
{Amiga}",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://xavprods.free.fr/lzx/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "LZX (2009) |http://xavprods.free.fr/lzx/|.",
}
@Misc{Anonymous:2009:SFC,
author = "Anonymous",
key = "stuffit-wiki",
title = "{StuffIt} [a family of computer software utilities for
archiving and compressing files on the {Macintosh} and
{Microsoft Windows} platforms]",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://en.wikipedia.org/wiki/Stuffit",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "stuffit-wiki (2009)
|http://en.wikipedia.org/wiki/Stuffit|.",
}
@Article{Apostolico:2009:GCB,
author = "Alberto Apostolico and Guido Drovandi",
title = "Graph Compression by {BFS}",
journal = j-ALGORITHMS-BASEL,
volume = "2",
number = "3",
pages = "1031--1044",
month = sep,
year = "2009",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a2031031",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/2/3/1031",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 30 June 2009 / Revised: 20 August 2009 /
Accepted: 21 August 2009 / Published: 25 August 2009",
}
@InProceedings{Apostolico:2009:PRP,
author = "A. Apostolico and F. Cunial",
title = "Probing the Randomness of Proteins by Their
Subsequence Composition",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "173--182",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.60",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976461",
acknowledgement = ack-nhfb,
}
@InProceedings{Auli-Llinas:2009:HAD,
author = "F. Aul{\'\i}-Llin{\'a}s and M. W. Marcellin and J.
Serra-Sagrist{\`a}",
title = "Highly Accurate Distortion Estimation for {JPEG2000}
through {PDF}-Based Estimators",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "391--400",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.20",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976483",
acknowledgement = ack-nhfb,
}
@InProceedings{Banikazemi:2009:LDC,
author = "M. Banikazemi",
title = "{LZB}: Data Compression with Bounded References",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "436--436",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.70",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976490",
acknowledgement = ack-nhfb,
}
@InProceedings{Barret:2009:LHI,
author = "M. Barret and J.-L. Gutzwiller and I. P. A. Bita and
F. D. Vedova",
title = "Lossy Hyperspectral Images Coding with Exogenous Quasi
Optimal Transforms",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "411--419",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.8",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976485",
acknowledgement = ack-nhfb,
}
@InProceedings{Beery:2009:MLM,
author = "T. A. Beery and R. Zamir",
title = "Multi Level Multiple Descriptions",
crossref = "Storer:2009:DPD",
pages = "63--72",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.49",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976450",
acknowledgement = ack-nhfb,
}
@Article{Benoit:2009:MCS,
author = "Anne Benoit and Harald Kosch and Veronika Rehn-Sonigo
and Yves Robert",
title = "Multi-Criteria Scheduling of Pipeline Workflows (and
Application To the {JPEG} Encoder)",
journal = j-IJHPCA,
volume = "23",
number = "2",
pages = "171--187",
month = may,
year = "2009",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342009104009",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Tue Aug 31 09:59:45 MDT 2010",
bibsource = "http://hpc.sagepub.com/content/23/2.toc;
http://hpc.sagepub.com/content/by/year;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "http://hpc.sagepub.com/content/23/2/171.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "http://hpc.sagepub.com/content/by/year",
}
@Article{Bille:2009:IAS,
author = "Philip Bille and Rolf Fagerberg and Inge Li G{\o}rtz",
title = "Improved approximate string matching and regular
expression matching on {Ziv--Lempel} compressed texts",
journal = j-TALG,
volume = "6",
number = "1",
pages = "3:1--3:??",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1644015.1644018",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Sat Dec 8 09:35:31 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "We study the approximate string matching and regular
expression matching problem for the case when the text
to be searched is compressed with the Ziv--Lempel
adaptive dictionary compression schemes. We present a
time-space trade-off that leads to algorithms improving
the previously known complexities for both problems. In
particular, we significantly improve the space bounds,
which in practical applications are likely to be a
bottleneck.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Algorithms (TALG)",
}
@InProceedings{Biskup:2009:GSH,
author = "M. T. Biskup and W. Plandowski",
title = "Guaranteed Synchronization of {Huffman} Codes with
Known Position of Decoder",
crossref = "Storer:2009:DPD",
pages = "33--42",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.18",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976447",
acknowledgement = ack-nhfb,
}
@Article{Blanchette:2009:PPM,
author = "Jasmin Christian Blanchette",
title = "Proof Pearl: Mechanizing the Textbook Proof of
{Huffman}'s Algorithm",
journal = j-J-AUTOM-REASON,
volume = "43",
number = "1",
pages = "1--18",
month = jun,
year = "2009",
CODEN = "JAREEW",
DOI = "https://doi.org/10.1007/s10817-009-9116-y",
ISSN = "0168-7433 (print), 1573-0670 (electronic)",
ISSN-L = "0168-7433",
bibdate = "Sat Apr 2 11:10:15 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
URL = "http://link.springer.com/article/10.1007/s10817-009-9116-y",
acknowledgement = ack-nhfb,
ajournal = "J. Autom. Reason.",
fjournal = "Journal of Automated Reasoning",
journal-URL = "http://link.springer.com/journal/10817",
}
@InProceedings{Blanes:2009:CRK,
author = "I. Blanes and J. Serra-Sagrist{\`a}",
title = "Clustered Reversible-{KLT} for Progressive
Lossy-to-Lossless {$3$ d} Image Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "233--242",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.7",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976467",
acknowledgement = ack-nhfb,
}
@InProceedings{Bursalioglu:2009:JSC,
author = "O. Y. Bursalioglu and M. Fresia and G. Caire and H. V.
Poor",
title = "Joint Source-Channel Coding at the Application Layer",
crossref = "Storer:2009:DPD",
pages = "93--102",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.10",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976453",
acknowledgement = ack-nhfb,
}
@Article{Burtscher:2009:FHS,
author = "M. Burtscher and P. Ratanaworabhan",
title = "{FPC}: a High-Speed Compressor for Double-Precision
Floating-Point Data",
journal = j-IEEE-TRANS-COMPUT,
volume = "58",
number = "1",
pages = "18--31",
month = jan,
year = "2009",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.131",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 11:37:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4589203",
abstract = "Many scientific programs exchange large quantities of
double-precision data between processing nodes and with
mass storage devices. Data compression can reduce the
number of bytes that need to be transferred and stored.
However, data compression is only likely to be employed
in high-end computing environments if it does not
impede the throughput. This paper describes and
evaluates FPC, a fast lossless compression algorithm
for linear streams of 64-bit floating-point data. FPC
works well on hard-to-compress scientific data sets and
meets the throughput demands of high-performance
systems. A comparison with five lossless compression
schemes, BZIP2, DFCM, FSD, GZIP, and PLMI, on 4
architectures and 13 data sets shows that FPC
compresses and decompresses one to two orders of
magnitude faster than the other algorithms at the same
geometric-mean compression ratio. Moreover, FPC
provides a guaranteed throughput as long as the
prediction tables fit into the L1 data cache. For
example, on a 1.6-GHz Itanium 2 server, the throughput
is 670 Mbytes/s regardless of what data are being
compressed.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "BZIP2; data compression; DFCM; double-precision
floating-point data; floating point compression; FSD;
geometric-mean compression ratio; GZIP; linear streams;
lossless compression algorithm; PLMI; scientific data
sets compression; scientific programs",
}
@InProceedings{Burtscher:2009:PPC,
author = "M. Burtscher and P. Ratanaworabhan",
title = "{pFPC}: a Parallel Compressor for Floating-Point
Data",
crossref = "Storer:2009:DPD",
pages = "43--52",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.43",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976448",
acknowledgement = ack-nhfb,
}
@Misc{Busch:2009:SCH,
author = "Stephan Busch",
key = "squeezemark",
title = "{Squeeze Chart 2013} home page",
pages = "??",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.squeezechart.com/",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "squeezemark (2009) |http://www.squeezechart.com/|.",
}
@InProceedings{Cappellari:2009:LLS,
author = "L. Cappellari and C. Cruz-Reyes and G. Calvagno and J.
Kari",
title = "Lossy to Lossless Spatially Scalable Depth Map Coding
with Cellular Automata",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "332--341",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.41",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976477",
acknowledgement = ack-nhfb,
}
@InProceedings{Celikcan:2009:OSC,
author = "U. Celikcan and E. Tuncel",
title = "Optimized Source-Channel Coding of Video Signals in
Packet Loss Environments",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "437--437",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.67",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976491",
acknowledgement = ack-nhfb,
}
@InProceedings{Cen:2009:DPL,
author = "Feng Cen",
title = "Design of Punctured {LDPC} Codes for Rate-Compatible
Asymmetric {Slepian--Wolf} Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "438--438",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.25",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976492",
acknowledgement = ack-nhfb,
}
@InProceedings{Cerra:2009:ACC,
author = "D. Cerra and M. Datcu",
title = "Algorithmic Cross-Complexity and Relative Complexity",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "342--351",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.6",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976478",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:2009:BLC,
author = "Wei-ling Chang and Xiao-chun Yun and Bin-xing Fang and
Shu-peng Wang",
title = "The Block {LZSS} Compression Algorithm",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "439--439",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.9",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976493",
acknowledgement = ack-nhfb,
}
@Article{Chang:2009:TIC,
author = "Chin-Chen Chang and Ching-Lin Kuo and Chang-Chu Chen",
title = "Three Improved Codebook Searching Algorithms for Image
Compression Using Vector Quantizer",
journal = j-INT-J-COMPUT-APPL,
volume = "31",
number = "1",
pages = "16--22",
year = "2009",
DOI = "https://doi.org/10.1080/1206212X.2009.11441919",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:25:30 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2009.11441919",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@InProceedings{Chen:2009:SWC,
author = "Chao Chen and Xiangyang Ji and Qionghai Dai and
Xiaodong Liu",
title = "{Slepian--Wolf} Coding of Binary Finite Memory Source
Using {Burrows--Wheeler} Transform",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "440--440",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.54",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976494",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2009:THC,
author = "D. M. Chen and S. S. Tsai and V. Chandrasekhar and G.
Takacs and J. Singh and B. Girod",
title = "Tree Histogram Coding for Mobile Image Matching",
crossref = "Storer:2009:DPD",
pages = "143--152",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.33",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976458",
acknowledgement = ack-nhfb,
}
@InProceedings{Cinque:2009:PPA,
author = "L. Cinque and S. {De Agostino} and L. Lombardi",
title = "Practical Parallel Algorithms for Dictionary Data
Compression",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "441--441",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.84",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976495",
acknowledgement = ack-nhfb,
}
@InProceedings{Constantinescu:2009:BSO,
author = "C. Constantinescu and J. Pieper and Tiancheng Li",
title = "Block Size Optimization in Deduplication Systems",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "442--442",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.51",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976496",
acknowledgement = ack-nhfb,
}
@Article{Courbet:2009:HCR,
author = "Clement Courbet and Celine Hudelot",
title = "Hierarchies and Compression: Random Accessible
Hierarchical Mesh Compression for Interactive
Visualization",
journal = j-CGF,
volume = "28",
number = "5",
pages = "1311--1318",
month = jul,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01508.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:31 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "31 Aug 2009",
}
@InProceedings{Dahl:2009:CIS,
author = "J. Dahl and J. {\O}stergaard and T. L. Jensen and S.
H. Jensen",
title = "$ l_1 $ Compression of Image Sequences Using the
Structural Similarity Index Measure",
crossref = "Storer:2009:DPD",
pages = "133--142",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.28",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976457",
acknowledgement = ack-nhfb,
}
@TechReport{Dechevsky:2009:WCD,
author = "Lubomir T. Dechevsky and Niklas Grip and Joakim
Gundersen",
title = "Wavelet compression, data fitting and approximation
based on adaptive composition of {Lorentz}-type
tresholding and {Besov}-type non-treshold shrinkage",
type = "{R\&D} report",
number = "5/2009",
institution = "Narvik University College",
address = "Narvik, Norway",
pages = "9",
year = "2009",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
}
@InProceedings{Deligiannis:2009:MCN,
author = "N. Deligiannis and A. Munteanu and T. Clerckx and P.
Schelkens and J. Cornelis",
title = "Modeling the Correlation Noise in Spatial Domain
Distributed Video Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "443--443",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.37",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976497",
acknowledgement = ack-nhfb,
}
@InProceedings{Du:2009:CPL,
author = "Zhiyan Du and P. Jaromersky and Yi-Jen Chiang and N.
Memon",
title = "Out-of-Core Progressive Lossless Compression and
Selective Decompression of Large Triangle Meshes",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "420--429",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.73",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976486",
acknowledgement = ack-nhfb,
}
@InProceedings{Esmaili:2009:LCS,
author = "G. Esmaili and P. Cosman",
title = "Low Complexity Spatio-Temporal Key Frame Encoding for
{Wyner--Ziv} Video Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "382--390",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.57",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976482",
acknowledgement = ack-nhfb,
}
@InProceedings{Fan:2009:OTF,
author = "Zihong Fan and A. Ortega and Cheng-hao Chien",
title = "Overlapped Tiling for Fast Random Oblique Plane Access
of {$3$D} Object Datasets",
crossref = "Storer:2009:DPD",
pages = "163--172",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.83",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976460",
acknowledgement = ack-nhfb,
}
@Article{Ferragina:2009:CIL,
author = "Paolo Ferragina and Fabrizio Luccio and Giovanni
Manzini and S. Muthukrishnan",
title = "Compressing and indexing labeled trees, with
applications",
journal = j-J-ACM,
volume = "57",
number = "1",
pages = "4:1--4:33",
month = nov,
year = "2009",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1613676.1613680",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Mar 15 11:20:08 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Consider an ordered, static tree $T$ where each node
has a label from alphabet $ \Sigma $. Tree $T$ may be
of arbitrary degree and shape. Our goal is designing a
compressed storage scheme of $T$ that supports basic
{\em navigational\/} operations among the immediate
neighbors of a node (i.e. parent, {\em i\/} th child,
or any child with some label,\ldots{}) as well as more
sophisticated {\em path\/}-based search operations over
its labeled structure.\par
We present a novel approach to this problem by
designing what we call the XBW-transform of the tree in
the spirit of the well-known Burrows--Wheeler transform
for strings [1994]. The XBW-transform uses path-sorting
to linearize the labeled tree $T$ into {\em two\/}
coordinated arrays, one capturing the structure and the
other the labels. For the first time, by using the
properties of the XBW-transform, our compressed indexes
go beyond the information-theoretic lower bound, and
support navigational and path-search operations over
labeled trees within (near-)optimal time bounds and
entropy-bounded space.\par
Our XBW-transform is simple and likely to spur new
results in the theory of tree compression and indexing,
as well as interesting application contexts. As an
example, we use the XBW-transform to design and
implement a compressed index for XML documents whose
compression ratio is significantly better than the one
achievable by state-of-the-art tools, and its query
time performance is order of magnitudes faster.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "Burrows--Wheeler transform; labeled tree compression;
labeled tree indexing; path searching; tree navigation;
XML compression; XML indexing",
}
@InProceedings{Ferreira:2009:USA,
author = "A. Ferreira and A. Oliveira and M. Figueiredo",
title = "On the Use of Suffix Arrays for Memory-Efficient
{Lempel--Ziv} Data Compression",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "444--444",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.50",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976498",
acknowledgement = ack-nhfb,
}
@InProceedings{Fowler:2009:CPP,
author = "J. E. Fowler",
title = "Compressive-Projection Principal Component Analysis
and the First Eigenvector",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "223--232",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.44",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976466",
acknowledgement = ack-nhfb,
}
@Article{Fredriksson:2009:SRA,
author = "Kimmo Fredriksson and Fedor Nikitin",
title = "Simple Random Access Compression",
journal = j-FUND-INFO,
volume = "92",
number = "1--2",
pages = "63--81",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0066",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Freedman:2009:FDR,
author = "D. Freedman and P. Kisilev",
title = "Fast Data Reduction via {KDE} Approximation",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "445--445",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.47",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976499",
acknowledgement = ack-nhfb,
}
@InProceedings{Gagie:2009:LMA,
author = "T. Gagie and M. Karpinski and Y. Nekrich",
title = "Low-Memory Adaptive Prefix Coding",
crossref = "Storer:2009:DPD",
pages = "13--22",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.61",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976445",
acknowledgement = ack-nhfb,
}
@Article{Geelen:2009:SLE,
author = "Bert Geelen and Vissarion Ferentinos and Francky
Catthoor and Gauthier Lafruit and Diederik Verkest and
Rudy Lauwereins and Thanos Stouraitis",
title = "Spatial locality exploitation for runtime reordering
of {JPEG2000} wavelet data layouts",
journal = j-TODAES,
volume = "15",
number = "1",
pages = "8:1--8:??",
month = dec,
year = "2009",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1640457.1640465",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Mon Mar 15 11:18:31 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Exploitation of spatial locality is essential for
memories to increase the access bandwidth and to reduce
the access-related latency and energy per word. Spatial
locality exploitation of a kernel can be improved by
modifying placement of data in memory, but this may be
felt not only by the kernel itself, but also in other
application components accessing the same data. Thus
care is needed to avoid global miss-rate improvements
are thwarted by miss-rate increases in other
application components. This article examines
application-level miss-rate increases due to handling
modified Wavelet Transform data layouts by explicitly
reordering at runtime, exploiting the execution order
freedom within a reordering buffer when the layout of
surrounding components is known. For the JPEG2000
application, taking into account the reordering costs
still results in 80\% net WT miss-rate gains.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
keywords = "Layout transformations; spatial locality; wavelet
transform",
}
@Article{Gillibert:2009:HGL,
author = "Luc Gillibert and Alain Bretto",
title = "Hypergraphs for Generic Lossless Image Compression",
journal = j-FUND-INFO,
volume = "91",
number = "3--4",
pages = "533--546",
month = aug,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0056",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:21 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Gray:2009:BAO,
author = "R. M. Gray and T. Linder",
title = "Bits in Asymptotically Optimal Lossy Source Codes Are
Asymptotically {Bernoulli}",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "272--281",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.21",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976471",
acknowledgement = ack-nhfb,
}
@InProceedings{Grbovic:2009:DEU,
author = "M. Grbovic and S. Vucetic",
title = "Decentralized Estimation Using Learning Vector
Quantization",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "446--446",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.77",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976500",
acknowledgement = ack-nhfb,
}
@InProceedings{Grossberg:2009:CSL,
author = "M. Grossberg and I. Gladkova and S. Gottipati and M.
Rabinowitz and P. Alabi and T. George and A. Pacheco",
title = "A Comparative Study of Lossless Compression Algorithms
on Multi-spectral Imager Data",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "447--447",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.68",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976501",
acknowledgement = ack-nhfb,
}
@Article{Gu:2009:HBJ,
author = "Xiaozhuo Gu and Jianzu Yang and Julong Lan and
Zhenhuan Cao",
title = "{Huffman}-based join-exit-tree scheme for contributory
key management",
journal = j-COMPUT-SECUR,
volume = "28",
number = "1--2",
pages = "29--39",
month = feb # "\slash " # mar,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000680",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Guthe:2009:BCP,
author = "Michael Guthe and Gero M{\"u}ller and Martin Schneider
and Reinhard Klein",
title = "{BTF-CIELab}: a Perceptual Difference Measure for
Quality Assessment and Compression of {BTFs}",
journal = j-CGF,
volume = "28",
number = "1",
pages = "101--113",
month = mar,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2008.01299.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:13 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bibo",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "23 Feb 2009",
}
@InProceedings{Hanus:2009:SCS,
author = "P. Hanus and J. Dingel and G. Chalkidis and J.
Hagenauer",
title = "Source Coding Scheme for Multiple Sequence
Alignments",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "183--192",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.64",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976462",
acknowledgement = ack-nhfb,
}
@InProceedings{Hatam:2009:ARA,
author = "A. Hatam and A. H. Banihashemi",
title = "Adaptive Rate Allocation Algorithm for Transmission of
Multiple Embedded Bit Streams over Time-Varying Noisy
Channels",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "448--448",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.11",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976502",
acknowledgement = ack-nhfb,
}
@Book{Hopkins:2009:RTD,
editor = "Brian Hopkins",
title = "Resources for teaching discrete mathematics: classroom
projects, history modules, and articles",
volume = "74",
publisher = pub-MATH-ASSOC-AMER,
address = pub-MATH-ASSOC-AMER:adr,
pages = "xiv + 323",
year = "2009",
ISBN = "0-88385-184-9",
ISBN-13 = "978-0-88385-184-5 (paperback)",
LCCN = "QA13 .R4675 2009",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "MAA notes",
acknowledgement = ack-nhfb,
subject = "Mathematics; Study and teaching (Higher); United
States; Computer science",
tableofcontents = "Part 1. Classroom-tested projects. The game of
``Take Away'' / Mark MacLean \\
Pile splitting problem: introducing strong induction /
Bill Marion \\
Generalizing Pascal: the Euler Triangles / Sandy Norman
and Betty Travis \\
Coloring and counting rectangles on the board / Michael
A. Jones and Mika Munakata \\
Fun and games with squares and planes / Maureen T.
Carroll and Steven T. Dougherty \\
Exploring recursion with the Josephus Problem: (or how
to play ``One Potato, Two Potato'' for keeps) / Douglas
E. Ensley and James E. Hamblin \\
Using trains to model recurrence relations / Benjamin
Sinwell \\
Codon classes / Brian Hopkins \\
How to change coins, M and M's, or chicken nuggets: the
linear Diophantine problem of Frobenius / Matthias Beck
\\
Calculator activities for a discrete mathematics course
/ Jean M. Horn and Toni T. Robertson \\
Bulgarian solitaire / Suzanne Dor\'ee \\
Can you make the geodesic dome? / Andrew Felt and Linda
Lesniak \\
Exploring polyhedra and discovering Euler's Formula /
Leah Wrenn Berman and Gordon Williams \\
Further explorations with the Towers of Hanoi / John
Stadler \\
The two color theorem / David Hunter \\
Counting perfect matchings and benzenoids / Fred J.
Rispoli \\
Exploring data compression via binary trees / Mark
Daniel Ward \\
A problem in typography / Larry E. Thomas \\
Graph complexity / Michael Orrison \\
Part 2. Historical projects in discrete mathematics and
computer science. Introduction / Janet Barnett \ldots{}
[et al.] \\
Binary arithmetic: from Leibniz to von Neumann / Jerry
M. Lodder \\
Arithmetic backwards from Shannon to the Chinese abacus
/ Jerry M. Lodder \\
Pascal's treatise on the arithmetical triangle:
mathematical induction, combinations, the binomial
theorem and Fermat's theorem / David Pengelley \\
Early writings on graph theory: Euler circuits and the
K{\"o}nigsberg bridge problem / Janet Heine Barnett \\
Counting triangulations of a convex polygon / Desh
Ranjan \\
Early writings on graph theory: Hamiltonian circuits
and the Icosian Game / Janet Heine Barnett \\
Are all infinities created equal? / Guram Bezhanishvili
\\
Early writings on graph theory: topological connections
/ Janet Heine Barnett \\
A study of logic and programming via Turing machines /
Jerry M. Lodder \\
Church's thesis / Guram Bezhanishvili \\
Two-way deterministic finite automata / Hing Leung \\
Part 3. Articles extending discrete mathematics
content. A rabbi, three sums, and three problems / Shai
Simonson \\
Storing graphs in computer memory / Larry E. Thomas \\
Inclusion-exclusion and the topology of partially
ordered sets / Eric Gottlieb \\
Part 4. Articles on discrete mathematics pedagogy.
Guided group discovery in a discrete mathematics course
for mathematics majors / Mary E. Flahive \\
The use of logic in teaching proof / Susanna S. Epp",
}
@InProceedings{Hu:2009:AJS,
author = "Yichuan Hu and J. Garcia-Frias and M. Lamarca",
title = "Analog Joint Source Channel Coding Using Space-Filling
Curves and {MMSE} Decoding",
crossref = "Storer:2009:DPD",
pages = "103--112",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.45",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976454",
acknowledgement = ack-nhfb,
}
@Book{ISO:2009:IID,
author = "{ISO}",
title = "{ISO 28500:2009}: Information and documentation ---
{WARC} file format",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "??",
month = may,
year = "2009",
bibdate = "Fri Jun 29 11:30:27 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
URL = "https://www.iso.org/standard/68004.html",
abstract = "ISO 28500:2009 specifies the WARC file format:\par
- to store both the payload content and control
information from mainstream Internet application layer
protocols, such as the Hypertext Transfer Protocol
(HTTP), Domain Name System (DNS), and File Transfer
Protocol (FTP);\par
- to store arbitrary metadata linked to other stored
data (e.g. subject classifier, discovered language,
encoding);\par
- to support data compression and maintain data record
integrity;\par
- to store all control information from the harvesting
protocol (e.g. request headers), not just response
information;\par
- to store the results of data transformations linked
to other stored data;\par
- to store a duplicate detection event linked to other
stored data (to reduce storage in the presence of
identical or substantially similar resources);\par
- to be extended without disruption to existing
functionality;\par
- to support handling of overly long records by
truncation or segmentation, where desired.",
acknowledgement = ack-nhfb,
keywords = "WARC (Web ARChive)",
remark = "Withdrawn and superseded by ISO 28500:2017
\cite{ISO:2017:IID}.",
}
@InProceedings{Jalali:2009:ISU,
author = "S. Jalali and A. Montanari and T. Weissman",
title = "An Implementable Scheme for Universal Lossy
Compression of Discrete {Markov} Sources",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "292--301",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.72",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976473",
acknowledgement = ack-nhfb,
}
@InProceedings{Kida:2009:STB,
author = "T. Kida",
title = "Suffix Tree Based {VF}-Coding for Compressed Pattern
Matching",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "449--449",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.58",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976503",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2009:FIP,
author = "Chanyul Kim and N. E. O'Connor and YunJe Oh",
title = "Fast Intra Prediction in the Transform Domain",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "450--450",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.26",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976504",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2009:FPD,
author = "Jong-Nam Kim and Tae-Kyung Ryu and Won-Hee Kim",
title = "A Fast Partial Distortion Elimination Algorithm Using
Dithering Matching Pattern",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "451--451",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.82",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976505",
acknowledgement = ack-nhfb,
}
@InProceedings{Kitakami:2009:LIC,
author = "M. Kitakami and K. Tai",
title = "Lossless Image Compression by {PPM}-Based Prediction
Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "452--452",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.34",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976506",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Klinc:2009:CDE,
author = "D. Klinc and C. Hazay and A. Jagmohan and H. Krawczyk
and T. Rabin",
title = "On Compression of Data Encrypted with Block Ciphers",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "213--222",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.71",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976465",
acknowledgement = ack-nhfb,
}
@InProceedings{Lai:2009:PRM,
author = "Zhongyuan Lai and Wenyu Liu and Yuan Zhang",
title = "Perceptual Relevance Measure for Generic Shape
Coding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "453--453",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.14",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976507",
acknowledgement = ack-nhfb,
}
@InProceedings{Lan:2009:JNS,
author = "Xuguang Lan and Nanning Zheng and Jianru Xue and Ce Li
and Songlin Zhao",
title = "Joint Network-Source Video Coding Based on
{Lagrangian} Rate Allocation",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "454--454",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.5",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976508",
acknowledgement = ack-nhfb,
}
@Misc{Lansky:2009:U,
author = "Lansky",
title = "[unknown]",
pages = "??",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.ksi.mff.cuni.cz/~lansky/SC/",
acknowledgement = ack-ds,
rawdata = "Lansky (2009)
|http://www.ksi.mff.cuni.cz/~lansky/SC/|.",
remark = "URL no longer accessible on 27 January 2013.",
}
@Misc{Lau:2009:RLH,
author = "Raymond Lau",
title = "{Raymond Lau} home page",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.raylau.com/biography.html",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Lau (2009) |http://www.raylau.com/biography.html|.",
}
@InProceedings{Liu:2009:CIR,
author = "Yanwei Liu and Siwei Ma and Qingming Huang and Debin
Zhao and Wen Gao and Nan Zhang",
title = "Compression-Induced Rendering Distortion Analysis for
Texture\slash Depth Rate Allocation in {$3$D} Video
Compression",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "352--361",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.27",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976479",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2009:IIW,
author = "Dong Liu and Xiaoyan Sun and Feng Wu",
title = "Improving Inverse Wavelet Transform by Compressive
Sensing Decoding with Deconvolution",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "455--455",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.19",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976509",
acknowledgement = ack-nhfb,
}
@InProceedings{Lowell:2009:NFN,
author = "D. Lowell and D. E. Tamir",
title = "New Families and New Members of Integer Sequence Based
Coding Methods",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "456--456",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.87",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976510",
acknowledgement = ack-nhfb,
}
@InProceedings{Luneau:2009:CWM,
author = "J.-M. Luneau and J. Lebrun and S. H. Jensen",
title = "Complex Wavelet Modulation Subbands for Speech
Compression",
crossref = "Storer:2009:DPD",
pages = "457--457",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.52",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976511",
acknowledgement = ack-nhfb,
}
@Misc{Lyon:2009:BHP,
author = "Richard F. Lyon",
title = "A Brief History of Pixel",
pages = "??",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.foveon.com/files/ABriefHistoryofPixel2.pdf",
acknowledgement = ack-ds,
rawdata = "Lyon, Richard F. (2009) ``A Brief History of Pixel,''
available online from\hfil\break
|http://www.foveon.com/files/ABriefHistoryofPixel2.pdf|.",
}
@InProceedings{Ma:2009:DDP,
author = "Jing Ma and Chengke Wu and Yunsong Li and Keyan Wang",
title = "Dual-Direction Prediction Vector Quantization for
Lossless Compression of {LASIS} Data",
crossref = "Storer:2009:DPD",
pages = "458--458",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.13",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976512",
acknowledgement = ack-nhfb,
}
@InProceedings{Markham:2009:IIM,
author = "T. S. Markham and S. C. Evans and J. Impson and E.
Steinbrecher",
title = "Implementation of an Incremental {MDL}-Based Two Part
Compression Algorithm for Model Inference",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "322--331",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.66",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976476",
acknowledgement = ack-nhfb,
}
@InProceedings{Martinez-Prieto:2009:UWA,
author = "M. A. Martinez-Prieto and J. Adiego and F.
Sanchez-Martinez and P. Fuente and R. C. Carrasco",
title = "On the Use of Word Alignments to Enhance Bitext
Compression",
crossref = "Storer:2009:DPD",
pages = "459--459",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.22",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976513",
acknowledgement = ack-nhfb,
}
@Book{Martinez:2009:DAC,
author = "V. J. (Vicent J.) Martinez and others",
title = "Data analysis in cosmology",
volume = "665",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 636",
year = "2009",
ISBN = "3-540-23972-3, 3-540-44767-9 (e-)",
ISBN-13 = "978-3-540-23972-7 (hardcover), 978-3-540-44767-2
(eISBN)",
ISSN = "0075-8450 (print), 1616-6361 (electronic)",
LCCN = "QB981 .D38 2009",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Lecture notes in physics",
acknowledgement = ack-nhfb,
subject = "Cosmology; Data processing",
}
@InProceedings{Milani:2009:BIS,
author = "S. Milani and C. Cruz-Reyes and J. Kari and G.
Calvagno",
title = "A Binary Image Scalable Coder Based on Reversible
Cellular Automata Transform and Arithmetic Coding",
crossref = "Storer:2009:DPD",
pages = "460--460",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.59",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976514",
acknowledgement = ack-nhfb,
}
@InProceedings{Minoo:2009:ECP,
author = "K. Minoo and Truong Nguyen",
title = "Entropy Coding via Parametric Source Model with
Applications in Fast and Efficient Compression of Image
and Video Data",
crossref = "Storer:2009:DPD",
pages = "461--461",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.80",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976515",
acknowledgement = ack-nhfb,
}
@InProceedings{Miranda:2009:PVQ,
author = "E. Miranda and Guoqiang Shan and V. Megalooikonomou",
title = "Performing Vector Quantization Using Reduced Data
Representation",
crossref = "Storer:2009:DPD",
pages = "462--462",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.74",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976516",
acknowledgement = ack-nhfb,
}
@Article{Muller:2009:JVL,
author = "Daniel Muller and Bernhard Fleck and George Dimitoglou
and Benjamin W. Caplins and Desmond E. Amadigwe and
Juan Pablo Garcia Ortiz and Benjamin Wamsler and Alen
Alexanderian and V. Keith Hughitt and Jack Ireland",
title = "{JHelioviewer}: Visualizing Large Sets of Solar Images
Using {JPEG 2000}",
journal = j-COMPUT-SCI-ENG,
volume = "11",
number = "5",
pages = "38--47",
month = sep # "\slash " # oct,
year = "2009",
CODEN = "CSENFA",
DOI = "https://doi.org/10.1109/MCSE.2009.142",
ISSN = "0740-7475 (print), 1558-1918 (electronic)",
ISSN-L = "1521-9615",
bibdate = "Thu May 13 11:08:14 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computscieng.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing in Science and Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
}
@Article{Nakamura:2009:LTT,
author = "Ryosuke Nakamura and Shunsuke Inenaga and Hideo Bannai
and Takashi Funamoto and Masayuki Takeda and Ayumi
Shinohara",
title = "Linear-Time Text Compression by Longest-First
Substitution",
journal = j-ALGORITHMS-BASEL,
volume = "2",
number = "4",
pages = "1429--1448",
month = dec,
year = "2009",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a2041429",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/2/4/1429",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 30 September 2009 / Accepted: 20 November
2009 / Published: 25 November 2009",
}
@InProceedings{Nejati:2009:WVT,
author = "N. Nejati and H. Yousefi'zadeh and H. Jafarkhani",
title = "Wireless Video Transmission: a Single Layer Distortion
Optimal Approach",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "362--371",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.29",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976480",
acknowledgement = ack-nhfb,
}
@InProceedings{Nong:2009:LSA,
author = "Ge Nong and Sen Zhang and Wai Hong Chan",
title = "Linear Suffix Array Construction by Almost Pure
Induced-Sorting",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "193--202",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.42",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976463",
acknowledgement = ack-nhfb,
}
@InProceedings{Ochoa:2009:SPH,
author = "H. Ochoa and O. Vergara and V. Cruz-Sanchez and G.
Rosiles and J. Vega-Pineda",
title = "{Set Partitioning in Hierarchical Frequency Bands
(SPHFB)}",
crossref = "Storer:2009:DPD",
pages = "463--463",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.63",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976517",
acknowledgement = ack-nhfb,
}
@InProceedings{Qiu:2009:PAT,
author = "Jinshi Qiu and A. H. Banihashemi",
title = "Policy Allocation for Transmission of Embedded Bit
Streams over Noisy Channels with Feedback",
crossref = "Storer:2009:DPD",
pages = "464--464",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.12",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976518",
acknowledgement = ack-nhfb,
}
@InProceedings{Rein:2009:WIT,
author = "S. Rein and S. Lehmann and C. Guhmann",
title = "Wavelet Image Two-Line Coder for Wireless Sensor Node
with Extremely Little {RAM}",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "252--261",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.30",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976469",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2009:FTI,
author = "Y. A. Reznik and R. K. Chivukula",
title = "Fast $ 15 \times 15 $ Transform for Image and Video
Coding Applications",
crossref = "Storer:2009:DPD",
pages = "465--465",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.81",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976519",
acknowledgement = ack-nhfb,
}
@InProceedings{Richter:2009:MSO,
author = "T. Richter and Kil Joong Kim",
title = "A {MS-SSIM} Optimal {JPEG 2000} Encoder",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "401--410",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.15",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976484",
acknowledgement = ack-nhfb,
}
@Article{Rossling:2009:VCA,
author = "Guido R{\"o}{\ss}ling and Florian Lindner",
title = "Visualizing compression algorithms on-the-fly",
journal = j-SIGCSE,
volume = "41",
number = "3",
pages = "376--376",
month = sep,
year = "2009",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1595496.1563018",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 15:44:23 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
note = "Proceedings of ITiCSE '09.",
abstract = "This paper presents a set of generators for
visualizing common compression algorithms on-the-fly
using the established and freely available Animal
algorithm animation system.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Rubinstein:2009:SOI,
author = "Benjamin I. P. Rubinstein and Peter L. Bartlett and J.
Hyam Rubinstein",
title = "Shifting: One-inclusion mistake bounds and sample
compression",
journal = j-J-COMP-SYS-SCI,
volume = "75",
number = "1",
pages = "37--59",
month = jan,
year = "2009",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2008.07.005",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:09 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
note = "See corrigendum \cite{Rubinstein:2010:CSO}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000008000676",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@InBook{Ruch:2009:DDT,
author = "David K. Ruch and Patrick J. {Van Fleet}",
booktitle = "Wavelet Theory",
title = "The Discrete {Daubechies} Transformation and
Applications",
chapter = "7",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "277--323",
year = "2009",
DOI = "https://doi.org/10.1002/9781118165652.ch7",
ISBN = "1-118-16565-9",
ISBN-13 = "978-1-118-16565-2",
bibdate = "Thu Mar 8 17:08:20 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
keywords = "discrete Daubechies transformation, wavelet transform,
image compression, signal compression, naive image
segmentation",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{Ruiters:2009:AMR,
author = "Roland Ruiters and Reinhard Klein",
title = "Appearance Measurement and Rendering: {BTF}
Compression via Sparse Tensor Decomposition",
journal = j-CGF,
volume = "28",
number = "4",
pages = "1181--1188",
month = jun,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01495.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "17 Aug 2009",
}
@Article{Russo:2009:ASM,
author = "Lu{\'\i}s M. S. Russo and Gonzalo Navarro and Arlindo
L. Oliveira and Pedro Morales",
title = "Approximate String Matching with Compressed Indexes",
journal = j-ALGORITHMS-BASEL,
volume = "2",
number = "3",
pages = "1105--1136",
month = sep,
year = "2009",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a2031105",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://www.mdpi.com/1999-4893/2/3/1105",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 9 July 2009 / Revised: 8 September 2009 /
Accepted: 9 September 2009 / Published: 10 September
2009",
}
@InProceedings{Savari:2009:MRF,
author = "S. A. Savari",
title = "On Minimum-Redundancy Fix-Free Codes",
crossref = "Storer:2009:DPD",
pages = "3--12",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.39",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976444",
acknowledgement = ack-nhfb,
}
@Book{Self:2009:AE,
author = "Douglas Self and others",
title = "Audio engineering",
publisher = "Newnes/Elsevier",
address = "Amsterdam, The Netherlands",
pages = "xvii + 907",
year = "2009",
ISBN = "1-85617-526-X",
ISBN-13 = "978-1-85617-526-5",
LCCN = "TK7881.4 .A9235 2009",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "The Newnes know it all series.",
acknowledgement = ack-nhfb,
subject = "Sound; Recording and reproducing; Handbooks, manuals,
etc; Digital techniques",
}
@InProceedings{Seraco:2009:AMC,
author = "E. P. Seraco and J. G. R. C. Gomes",
title = "Affine Modeling for the Complexity of Vector
Quantizers",
crossref = "Storer:2009:DPD",
pages = "466--466",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.55",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976520",
acknowledgement = ack-nhfb,
}
@InProceedings{Shapira:2009:CTD,
author = "D. Shapira",
title = "Compressed Transitive Delta Encoding",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "203--212",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.46",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976464",
acknowledgement = ack-nhfb,
}
@InProceedings{Shayevitz:2009:PMF,
author = "O. Shayevitz and M. Feder",
title = "The Posterior Matching Feedback Scheme for Joint
Source-Channel Coding with Bandwidth Expansion",
crossref = "Storer:2009:DPD",
pages = "83--92",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.79",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976452",
acknowledgement = ack-nhfb,
}
@Article{Singh:2009:IIC,
author = "Satish Kumar Singh and Shishir Kumar",
title = "Improved Image Compression Based on Feed-Forward
Adaptive Downsampling Algorithm",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "9",
number = "4",
pages = "575--589",
month = oct,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467809003605",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Singh:2009:OCS,
author = "J. Singh and A. Saxena and K. Rose and U. Madhow",
title = "Optimization of Correlated Source Coding for
Event-Based Monitoring in Sensor Networks",
crossref = "Storer:2009:DPD",
pages = "73--82",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.56",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976451",
acknowledgement = ack-nhfb,
}
@Misc{Smith:2009:PLS,
author = "Alvy Ray Smith",
title = "A Pixel Is Not a Little Square",
pages = "??",
year = "2009",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "ftp://ftp.alvyray.com/Acrobat/6_Pixel.pdf;
http://www.cs.cmu.edu/afs/cs/academic/class/15869-f11/www/readings/smith95_pixelsquare.pdf",
acknowledgement = ack-ds,
lastaccess = "27 January 2013",
rawdata = "Smith, Alvy Ray (2009) ``A Pixel Is Not A Little
Square,'' available from\hfil\break
|ftp://ftp.alvyray.com/Acrobat/6_Pixel.pdf|.",
remark = "First URL at alvyray.com no longer accessible on 27
January 2013; CMU URL is okay on that date.",
}
@InProceedings{Song:2009:BAP,
author = "Chuan-Ming Song and Xiang-Hai Wang and Yanwen Guo and
Fu-Yan Zhang",
title = "Binary Alpha-Plane Assisted Fast Motion Estimation of
Video Objects in Wavelet Domain",
crossref = "Storer:2009:DPD",
pages = "467--467",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.32",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976521",
acknowledgement = ack-nhfb,
}
@InProceedings{Soundararajan:2009:CDC,
author = "R. Soundararajan and S. Vishwanath",
title = "Communicating the Difference of Correlated {Gaussian}
Sources over a {MAC}",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "282--291",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.17",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976472",
acknowledgement = ack-nhfb,
}
@MastersThesis{Stamplecoskie:2009:DCB,
author = "Jennifer Krista Stamplecoskie",
title = "Data compression of {Blainville}'s beaked whale
vocalizations = {La} compression de vocalizations de
baleine {\`a} bec de {Blainville}",
type = "{Master of Applied Science in Signal Processing}",
school = "Division of Graduate Studies, Royal Military College
of Canada",
address = "St. Jean, QC, Canada",
pages = "ix + 79",
month = apr,
year = "2009",
ISBN = "0-494-52296-8",
ISBN-13 = "978-0-494-52296-7",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:29 MST 2013",
bibsource = "amicus.nlc-bnc.ca:210/NL;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Canadian theses = Th{\`e}ses canadiennes.",
URL = "http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/002/MR52296.PDF",
acknowledgement = ack-nhfb,
advisor = "Donald R. McGaughey and Michael J. Korenberg",
remark = "1 microfiche.",
}
@InProceedings{Steger:2009:URT,
author = "S. Steger and T. Richter",
title = "Universal Refinable {Trellis} Coded Quantization",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "312--321",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.16",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976475",
acknowledgement = ack-nhfb,
}
@InProceedings{Tabus:2009:LBR,
author = "I. Tabus and A. Vasilache",
title = "Low Bit Rate Vector Quantization of Outlier
Contaminated Data Based on Shells of {Golay} Codes",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "302--311",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.62",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976474",
acknowledgement = ack-nhfb,
}
@Article{Tournier:2009:MCM,
author = "M. Tournier and X. Wu and N. Courty and E. Arnaud and
L. Rev{\'e}ret",
title = "Motion Compression: Motion Compression using Principal
Geodesics Analysis",
journal = j-CGF,
volume = "28",
number = "2",
pages = "355--364",
month = apr,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01375.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "27 Mar 2009",
}
@InProceedings{Unat:2009:ASS,
author = "D. Unat and T. Hromadka and S. B. Baden",
title = "An Adaptive Sub-sampling Method for In-memory
Compression of Scientific Data",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "262--271",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.65",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976470",
acknowledgement = ack-nhfb,
}
@Article{Valette:2009:HCP,
author = "S{\'e}bastien Valette and Rapha{\"e}lle Chaine and
R{\'e}my Prost",
title = "Hierarchies and Compression: Progressive Lossless Mesh
Compression Via Incremental Parametric Refinement",
journal = j-CGF,
volume = "28",
number = "5",
pages = "1301--1310",
month = jul,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01507.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:31 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "31 Aug 2009",
}
@InProceedings{Vanam:2009:HMA,
author = "R. Vanam and E. A. Riskin and R. E. Ladner",
title = "{H.264\slash MPEG-4 AVC} Encoder Parameter Selection
Algorithms for Complexity Distortion Tradeoff",
crossref = "Storer:2009:DPD",
volume = "visualization",
pages = "372--381",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.53",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976481",
acknowledgement = ack-nhfb,
}
@InProceedings{Vucetic:2009:CKP,
author = "S. Vucetic and V. Coric and Zhuang Wang",
title = "Compressed Kernel Perceptrons",
crossref = "Storer:2009:DPD",
pages = "153--162",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.75",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976459",
acknowledgement = ack-nhfb,
}
@Book{Wayner:2009:DCI,
author = "Peter Wayner",
title = "Disappearing cryptography: information hiding:
steganography and watermarking",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Third",
pages = "xv + 439",
year = "2009",
ISBN = "0-12-374479-2, 0-08-092270-8 (e-book)",
ISBN-13 = "978-0-12-374479-1, 978-0-08-092270-6 (e-book)",
LCCN = "TK5105.59 .W39 2009",
bibdate = "Wed Aug 27 07:34:37 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.sciencedirect.com/science/book/9780123744791",
abstract = "Cryptology is the practice of hiding digital
information by means of various obfuscatory and
steganographic techniques. The application of said
techniques facilitates message confidentiality and
sender/receiver identity authentication, and helps to
ensure the integrity and security of computer
passwords, ATM card information, digital signatures,
DVD and HDDVD content, and electronic commerce.
Cryptography is also central to digital rights
management (DRM), a group of techniques for
technologically controlling the use of copyrighted
material that is being widely implemented and deployed
at the behest of corporations that own and create
revenue from the hundreds of thousands of
mini-transactions that take place daily on programs
like iTunes. This new edition of our best-selling book
on cryptography and information hiding delineates a
number of different methods to hide information in all
types of digital media files. These methods include
encryption, compression, data embedding and
watermarking, data mimicry, and scrambling. During the
last 5 years, the continued advancement and exponential
increase of computer processing power have enhanced the
efficacy and scope of electronic espionage and content
appropriation. Therefore, this edition has amended and
expanded outdated sections in accordance with new
dangers, and includes 5 completely new chapters that
introduce newer more sophisticated and refined
cryptographic algorithms and techniques (such as
fingerprinting, synchronization, and quantization)
capable of withstanding the evolved forms of attack.
Each chapter is divided into sections, first providing
an introduction and high-level summary for those who
wish to understand the concepts without wading through
technical explanations, and then presenting concrete
examples and greater detail for those who want to write
their own programs. This combination of practicality
and theory allows programmers and system designers to
not only implement tried and true encryption
procedures, but also consider probable future
developments in their designs, thus fulfilling the need
for preemptive caution that is becoming ever more
explicit as the transference of digital media
escalates.",
acknowledgement = ack-nhfb,
author-dates = "1964--",
subject = "Computer networks; Security measures; Cryptography;
Internet",
tableofcontents = "Framing information \\
Encryption \\
Error correction \\
Secret sharing \\
Compression \\
Basic mimicry \\
Grammars and mimicry \\
Turing and reverse \\
Life in the noise \\
Anonymous remailers \\
Secret broadcasts \\
Keys \\
Ordering and reordering \\
Spreading \\
Synthetic worlds \\
Watermarks \\
Steganalysis \\
Obfuscation \\
Synchronization \\
Translucent databases \\
Plain sight \\
Coda",
}
@Article{Wennersten:2009:TVT,
author = "Per Wennersten and Jacob Str{\"o}m",
title = "Textures and Video: Table-based {Alpha} Compression",
journal = j-CGF,
volume = "28",
number = "2",
pages = "687--695",
month = apr,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01409.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:16 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "27 Mar 2009",
}
@InProceedings{Wu:2009:ARD,
author = "Feng Wu and Jingjing Fu and Zhouchen Lin and Bing
Zeng",
title = "Analysis on Rate-Distortion Performance of Compressive
Sensing for Binary Sparse Source",
crossref = "Storer:2009:DPD",
pages = "113--122",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.24",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976455",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2009:HCI,
author = "Feng Wu and Xiulian Peng and Jizheng Xu and Shipeng
Li",
title = "How Can Intra Correlation Be Exploited Better?",
crossref = "Storer:2009:DPD",
pages = "468--468",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.23",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976522",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2009:MGA,
author = "Xiaolin Wu and Xiangjun Zhang and Jia Wang",
title = "Model-Guided Adaptive Recovery of Compressive
Sensing",
crossref = "Storer:2009:DPD",
pages = "123--132",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.69",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976456",
acknowledgement = ack-nhfb,
}
@Article{Xiao:2009:PCW,
author = "Jinyou Xiao and Johannes Tausch and Yucai Hu",
title = "A-posteriori compression of wavelet-{BEM} matrices",
journal = j-COMPUT-MECH,
volume = "44",
number = "5",
pages = "705--715",
year = "2009",
CODEN = "CMMEEE",
DOI = "https://doi.org/10.1007/s00466-009-0403-6",
ISSN = "0178-7675",
ISSN-L = "0178-7675",
MRclass = "65T60 (65N30)",
MRnumber = "MR2538921 (2010i:65331)",
bibdate = "Tue Sep 28 08:51:17 2010",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fastmultipole.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computational Mechanics",
keywords = "fast multipole method",
}
@InProceedings{Yan:2009:IIL,
author = "Yusong Yan and Hongmei Zhu",
title = "Invertible Integer {Lie} Group Transforms",
crossref = "Storer:2009:DPD",
pages = "469--469",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.38",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976523",
acknowledgement = ack-nhfb,
}
@InProceedings{Yen:2009:IDC,
author = "Kuang-Yi Yen and Chun-Feng Wu and Wen-Whei Chang",
title = "Iterative Decoding of Convolutionally Encoded Multiple
Descriptions",
crossref = "Storer:2009:DPD",
pages = "470--470",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.85",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976524",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2009:AKC,
author = "Guoqiang Zhang and J. Klejsa and W. B. Kleijn",
title = "Analysis of {K}-Channel Multiple Description
Quantization",
crossref = "Storer:2009:DPD",
pages = "53--62",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.36",
bibdate = "Tue Feb 5 12:39:04 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976449",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2009:FPS,
author = "Fan Zhao and Guizhong Liu and Feifei Ren and Na
Zhang",
title = "Flexible Predictions Selection for Multi-view Video
Coding",
crossref = "Storer:2009:DPD",
pages = "471--471",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.35",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976525",
acknowledgement = ack-nhfb,
}
@InProceedings{Zribi:2009:LCJ,
author = "A. Zribi and S. Zaibi and R. Pyndiah and A.
Bouallegue",
title = "Low-Complexity Joint Source\slash Channel Turbo
Decoding of Arithmetic Codes with Image Transmission
Application",
crossref = "Storer:2009:DPD",
pages = "472--472",
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.31",
bibdate = "Tue Feb 5 12:39:10 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976526",
acknowledgement = ack-nhfb,
}
@InProceedings{Abedini:2010:SBS,
author = "N. Abedini and S. P. Khatri and S. A. Savari",
title = "A {SAT}-Based Scheme to Determine Optimal Fix-Free
Codes",
crossref = "Storer:2010:DPD",
pages = "169--178",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.22",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453461",
acknowledgement = ack-nhfb,
}
@Article{Abel:2010:PBS,
author = "J{\"u}rgen Abel",
title = "Post {BWT} stages of the {Burrows--Wheeler}
compression algorithm",
journal = j-SPE,
volume = "40",
number = "9",
pages = "751--777",
month = aug,
year = "2010",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.982",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Jun 21 17:09:49 MDT 2011",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "2 Jul 2010",
}
@InProceedings{Adiego:2010:MPT,
author = "J. Adiego and M. A. Martinez-Prieto and J. E.
Hoyos-Torio and F. Sanchez-Martinez",
title = "Modelling Parallel Texts for Boosting Compression",
crossref = "Storer:2010:DPD",
pages = "517--517",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.86",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453473",
acknowledgement = ack-nhfb,
}
@InProceedings{Akyol:2010:OAM,
author = "E. Akyol and K. Rose and T. Ramstad",
title = "Optimized Analog Mappings for Distributed
Source-Channel Coding",
crossref = "Storer:2010:DPD",
pages = "159--168",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.92",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453458",
acknowledgement = ack-nhfb,
}
@Article{Al-Bahadili:2010:BLT,
author = "H. Al-Bahadili and A. Rababa'a",
title = "A Bit-Level Text Compression Scheme Based on the
{HCDC} Algorithm",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "3",
pages = "355--361",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.3.202-2914",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.3.202-2914",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@InProceedings{AlZahir:2010:LCM,
author = "S. AlZahir and A. Borici",
title = "Lossless Compression of Maps, Charts, and Graphs via
Color Separation",
crossref = "Storer:2010:DPD",
pages = "518--518",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.102",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453472",
acknowledgement = ack-nhfb,
}
@InProceedings{Anh:2010:LMW,
author = "V. N. Anh and A. Moffat",
title = "Local Modeling for {WebGraph} Compression",
crossref = "Storer:2010:DPD",
pages = "519--519",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.59",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453475",
acknowledgement = ack-nhfb,
}
@InProceedings{Anonymous:2010:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2010:DPD",
pages = "vi--vi",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.6",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453519",
acknowledgement = ack-nhfb,
}
@Article{Arandiga:2010:PVW,
author = "F. Ar{\`a}ndiga and A. M. Belda and P. Mulet",
title = "Point-Value {WENO} Multiresolution Applications to
Stable Image Compression",
journal = j-J-SCI-COMPUT,
volume = "43",
number = "2",
pages = "158--182",
month = may,
year = "2010",
CODEN = "JSCOEB",
DOI = "https://doi.org/10.1007/s10915-010-9351-8",
ISSN = "0885-7474 (print), 1573-7691 (electronic)",
ISSN-L = "0885-7474",
bibdate = "Sat Dec 22 13:07:30 MST 2012",
bibsource = "http://link.springer.com/journal/10915;
http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7474&volume=43&issue=2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jscicomput.bib",
URL = "http://link.springer.com/article/10.1007/s10915-010-9351-8;
http://link.springer.com/content/pdf/10.1007/s10915-010-9351-8;
http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7474&volume=43&issue=2&spage=158-182",
acknowledgement = ack-nhfb,
fjournal = "Journal of Scientific Computing",
}
@InProceedings{Arildsen:2010:FLS,
author = "T. Arildsen and J. stergaard and M. N. Murthi and S.
V. Andersen and S. H. Jensen",
title = "Fixed-Lag Smoothing for Low-Delay Predictive Coding
with Noise Shaping for Lossy Networks",
crossref = "Storer:2010:DPD",
pages = "279--287",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.33",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453446",
acknowledgement = ack-nhfb,
}
@Article{Arroyuelo:2010:PAR,
author = "Diego Arroyuelo and Gonzalo Navarro",
title = "Practical approaches to reduce the space requirement
of {Lempel--Ziv}-based compressed text indices",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "15",
number = "1",
pages = "15:1--15:??",
month = mar,
year = "2010",
DOI = "https://doi.org/10.1145/1671970.1883684",
ISSN = "1084-6654",
bibdate = "Mon Dec 10 09:03:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "Given a text $ T [1. \, .n] $ over an alphabet of size
$ \sigma $, the full-text search problem consists in
locating the occ occurrences of a given pattern $ P[1.
\, .m] $ in $T$. Compressed full-text self-indices are
space-efficient representations of the text that
provide direct access to and indexed search on
it.\par
The LZ-index of Navarro is a compressed full-text
self-index based on the LZ78 compression algorithm.
This index requires about 5 times the size of the
compressed text (in theory, $ 4 n H_k(T) + o(n \log
\sigma)$ bits of space, where $ H_k(T)$ is the $k$-th
order empirical entropy of $T$). In practice, the
average locating complexity of the LZ-index is $
O(\sigma m \log_\sigma n + {\rm occ} \sigma^{m / 2})$,
where {\em occ} is the number of occurrences of $P$. It
can extract text substrings of length $l$ in $ O(l)$
time. This index outperforms competing schemes both to
locate short patterns and to extract text snippets.
However, the LZ-index can be up to 4 times larger than
the smallest existing indices (which use $ n H_k(T) +
o(n \log \sigma)$ bits in theory), and it does not
offer space/time tuning options. This limits its
applicability.\par
In this article, we study practical ways to reduce the
space of the LZ-index. We obtain new LZ-index variants
that require $ 2 (1 + \epsilon) n H_k(T) + o(n \log
\sigma)$ bits of space, for any $ 0 < \epsilon < 1$.
They have an average locating time of $ O(1 / \epsilon
(m \log n + {\rm occ} \sigma^{m / 2}))$, while
extracting takes $ O(l)$ time.\par
We perform extensive experimentation and conclude that
our schemes are able to reduce the space of the
original LZ-index by a factor of $ 2 / 3$, that is,
around $3$ times the compressed text size. Our schemes
are able to extract about 1 to 2 MB of the text per
second, being twice as fast as the most competitive
alternatives. Pattern occurrences are located at a rate
of up to 1 to 4 million per second. This constitutes
the best space\slash time trade-off when indices are
allowed to use 4 times the size of the compressed text
or more.",
acknowledgement = ack-nhfb,
articleno = "1.5",
fjournal = "Journal of Experimental Algorithmics (JEA)",
}
@InProceedings{Aslam:2010:MQS,
author = "S. Aslam and A. Bobick and C. Barnes",
title = "Modeling the Quantization Staircase Function",
crossref = "Storer:2010:DPD",
pages = "520--520",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.89",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453474",
acknowledgement = ack-nhfb,
}
@InProceedings{Auli-Llinas:2010:LAB,
author = "F. Aul{\'\i}-Llin{\'a}s",
title = "Local Average-Based Model of Probabilities for
{JPEG2000} Bitplane Coder",
crossref = "Storer:2010:DPD",
pages = "59--68",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.12",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453434",
acknowledgement = ack-nhfb,
}
@InProceedings{Barbero:2010:DCJ,
author = "J. M. Barbero and E. Santos and A. Gutierrez",
title = "Dual Contribution of {JPEG 2000} Images for
Unidirectional Links",
crossref = "Storer:2010:DPD",
pages = "521--521",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.81",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453477",
acknowledgement = ack-nhfb,
}
@InProceedings{Baron:2010:MAL,
author = "D. Baron and T. Weissman",
title = "An {MCMC} Approach to Lossy Compression of Continuous
Sources",
crossref = "Storer:2010:DPD",
pages = "40--48",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.11",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453443",
acknowledgement = ack-nhfb,
}
@Book{Benatti:2010:QIC,
editor = "Fabio Benatti",
title = "Quantum information, computation and cryptography: an
introductory survey of theory, technology and
experiments",
volume = "808",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2010",
DOI = "https://doi.org/10.1007/978-3-642-11914-9",
ISBN = "3-642-11914-X, 3-642-11913-1",
ISBN-13 = "978-3-642-11914-9, 978-3-642-11913-2",
LCCN = "Q360 Q36 2010",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Lecture notes in physics",
acknowledgement = ack-nhfb,
subject = "Information theory; Quantum computers; Cryptography",
}
@InProceedings{Bhattar:2010:ALC,
author = "R. K. Bhattar and K. R. Ramakrishnan and K. S.
Dasgupta",
title = "Analysis of {LDPC} Codes for Compression of Nonuniform
Sources with Side Information Using Density Evolution",
crossref = "Storer:2010:DPD",
pages = "522--522",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.65",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453501",
acknowledgement = ack-nhfb,
}
@Article{Bjorner:2010:CDC,
author = "Nikolaj Bj{\o}rner and Andreas Blass and Yuri
Gurevich",
title = "Content-dependent chunking for differential
compression, the local maximum approach",
journal = j-J-COMP-SYS-SCI,
volume = "76",
number = "3--4",
pages = "154--203",
month = may # "\slash " # jun,
year = "2010",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2009.06.004",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:13 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000009000580",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Bonny:2010:HBC,
author = "Talal Bonny and J{\"o}rg Henkel",
title = "{Huffman}-based code compression techniques for
embedded processors",
journal = j-TODAES,
volume = "15",
number = "4",
pages = "31:1--31:??",
month = sep,
year = "2010",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1835420.1835424",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Wed Oct 6 09:42:42 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The size of embedded software is increasing at a rapid
pace. It is often challenging and time consuming to fit
an amount of required software functionality within a
given hardware resource budget. Code compression is a
means to alleviate the problem by providing substantial
savings in terms of code size. In this article we
introduce a novel and efficient hardware-supported
compression technique that is based on Huffman Coding.
Our technique reduces the size of the generated
decoding table, which takes a large portion of the
memory. It combines our previous techniques,
Instruction Splitting Technique and Instruction
Re-encoding Technique into new one called Combined
Compression Technique to improve the final compression
ratio by taking advantage of both previous techniques.
The instruction Splitting Technique is instruction set
architecture (ISA)-independent. It splits the
instructions into portions of varying size (called
patterns) before Huffman coding is applied. This
technique improves the final compression ratio by more
than 20\% compared to other known schemes based on
Huffman Coding. The average compression ratios achieved
using this technique are 48\% and 50\% for ARM and
MIPS, respectively. The Instruction Re-encoding
Technique is ISA-dependent. It investigates the
benefits of reencoding unused bits (we call them
reencodable bits) in the instruction format for a
specific application to improve the compression ratio.
Reencoding those bits can reduce the size of decoding
tables by up to 40\%. Using this technique, we improve
the final compression ratios in comparison to the first
technique to 46\% and 45\% for ARM and MIPS,
respectively (including all overhead that incurs). The
Combined Compression Technique improves the compression
ratio to 45\% and 42\% for ARM and MIPS, respectively.
In our compression technique, we have conducted
evaluations using a representative set of applications
and we have applied each technique to two major
embedded processor architectures, namely ARM and
MIPS.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
keywords = "code compression; code density; Embedded systems;
Huffman coding",
}
@InProceedings{Bouttefroy:2010:MRM,
author = "P. L. M. Bouttefroy and A. Bouzerdoum and A. Beghdadi
and S. L. Phung",
title = "Multi-resolution Mean-Shift Algorithm for Vector
Quantization",
crossref = "Storer:2010:DPD",
pages = "523--523",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.55",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453500",
acknowledgement = ack-nhfb,
}
@Article{Brisaboa:2010:DLT,
author = "Nieves Brisaboa and Antonio Fari{\~n}a and Gonzalo
Navarro and Jos{\'e} Param{\'a}",
title = "Dynamic lightweight text compression",
journal = j-TOIS,
volume = "28",
number = "3",
pages = "10:1--10:??",
month = jun,
year = "2010",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/1777432.1777433",
ISSN = "1046-8188",
ISSN-L = "0734-2047",
bibdate = "Tue Jul 6 15:53:00 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tois/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "We address the problem of adaptive compression of
natural language text, considering the case where the
receiver is much less powerful than the sender, as in
mobile applications. Our techniques achieve compression
ratios around 32\% and require very little effort from
the receiver. Furthermore, the receiver is not only
lighter, but it can also search the compressed text
with less work than that necessary to decompress it.
This is a novelty in two senses: it breaks the usual
compressor/decompressor symmetry typical of adaptive
schemes, and it contradicts the long-standing
assumption that only semistatic codes could be searched
more efficiently than the uncompressed text. Our novel
compression methods are preferable in several aspects
over the existing adaptive and semistatic compressors
for natural language texts.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information Systems (TOIS)",
keywords = "adaptive natural language text compression; compressed
pattern matching; real-time transmission; searching
compressed texts; text compression",
}
@InProceedings{Brisaboa:2010:NSV,
author = "N. R. Brisaboa and A. Faria and J. R. Lopez and G.
Navarro and E. R. Lopez",
title = "A New Searchable Variable-to-Variable Compressor",
crossref = "Storer:2010:DPD",
pages = "199--208",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.25",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453462",
acknowledgement = ack-nhfb,
}
@InProceedings{Bursalioglu:2010:FMD,
author = "O. Y. Bursalioglu and G. Caire",
title = "A Flexible Multiple Description Coding Scheme Based on
Rateless Codes",
crossref = "Storer:2010:DPD",
pages = "269--278",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.32",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453447",
acknowledgement = ack-nhfb,
}
@InProceedings{Burtscher:2010:GST,
author = "M. Burtscher and P. Ratanaworabhan",
title = "{gFPC}: a Self-Tuning Compression Algorithm",
crossref = "Storer:2010:DPD",
pages = "396--405",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.42",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453485",
acknowledgement = ack-nhfb,
}
@Book{Buttcher:2010:IRI,
author = "Stefan B{\"u}ttcher and Charles L. A. Clarke and
Gordon V. Cormack",
title = "Information Retrieval: Implementing and Evaluating
Search Engines",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "xxiv + 606",
year = "2010",
ISBN = "0-262-02651-1 (hardcover)",
ISBN-13 = "978-0-262-02651-2 (hardcover)",
LCCN = "TK5105.884 .B98 2010",
bibdate = "Tue May 7 11:06:35 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Search engines; Programming; Information retrieval",
tableofcontents = "I. Foundations \\
1. Introduction \\
2. Basic techniques \\
3. Tokens and terms \\
II. Indexing \\
4. Static inverted indices \\
5. Query processing \\
6. Index compression \\
7. Dynamic inverted indices \\
III. Retrieval and ranking \\
8. Probabilistic retrieval \\
9. Language modeling and related methods \\
10. Categorization and filtering \\
11. Fusion and metalearning \\
IV. Evaluation \\
12. Measuring effectiveness \\
13. Measuring efficiency \\
V. Applications and extensions \\
14. Parallel information retrieval \\
15. Web search \\
16. XML retrieval",
}
@InProceedings{Cerra:2010:SMU,
author = "D. Cerra and M. Datcu",
title = "A Similarity Measure Using Smallest Context-Free
Grammars",
crossref = "Storer:2010:DPD",
pages = "346--355",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.37",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453478",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:2010:PRN,
author = "Weiling Chang and Binxing Fang and Xiaochun Yun and
Shupeng Wang and Xiangzhan Yu",
title = "A Pseudo-Random Number Generator Based on {LZSS}",
crossref = "Storer:2010:DPD",
pages = "524--524",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.77",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453503",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2010:ICU,
author = "Zhuoyuan Chen and Jiangtao Wen and Shiqiang Yang and
Yuxing Han and J. D. Villasenor",
title = "Image Compression Using the {DCT} and Noiselets: a New
Algorithm and Its Rate Distortion Performance",
crossref = "Storer:2010:DPD",
pages = "527--527",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.62",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453504",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2010:IIC,
author = "D. M. Chen and S. S. Tsai and V. Chandrasekhar and G.
Takacs and R. Vedantham and R. Grzeszczuk and B.
Girod",
title = "Inverted Index Compression for Scalable Image
Matching",
crossref = "Storer:2010:DPD",
pages = "525--525",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.53",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453502",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2010:NFE,
author = "Hao Chen and Ruimin Hu and Dan Mao and Zhongyuan
Wang",
title = "A Novel Frame Error Concealment Algorithm Based on
Dynamic Texture Synthesis",
crossref = "Storer:2010:DPD",
pages = "526--526",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.83",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453505",
acknowledgement = ack-nhfb,
}
@InProceedings{Cheng:2010:NEL,
author = "S. Cheng and R. ma",
title = "The Non-existence of Length-$5$ Perfect
{Slepian--Wolf} Codes of Three Sources",
crossref = "Storer:2010:DPD",
pages = "528--528",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.85",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453507",
acknowledgement = ack-nhfb,
}
@InProceedings{Chiu:2010:ECT,
author = "Sheng-Yuan Chiu and Wing-Kai Hon and R. Shah and J. S.
Vitter",
title = "{I/O}-Efficient Compressed Text Indexes: From Theory
to Practice",
crossref = "Storer:2010:DPD",
pages = "426--434",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.45",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453486",
acknowledgement = ack-nhfb,
}
@Article{Cinque:2010:SCP,
author = "Luigi Cinque and Sergio {De Agostino} and Luca
Lombardi",
title = "Scalability and Communication in Parallel
Low-Complexity Lossless Compression",
journal = j-MATH-COMPUT-SCI,
volume = "3",
number = "4",
pages = "391--406",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-010-0034-5",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Sun Aug 22 09:02:18 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=3&issue=4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1661-8270&volume=3&issue=4&spage=391",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@InProceedings{Corvetto:2010:RDL,
author = "A. Corvetto and A. Ruedin and D. Acevedo",
title = "Robust Detection and Lossless Compression of the
Foreground in Magnetic Resonance Images",
crossref = "Storer:2010:DPD",
pages = "529--529",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.74",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453506",
acknowledgement = ack-nhfb,
}
@InProceedings{Danieli:2010:MMI,
author = "M. Danieli and S. Forchhammer and J. D. Andersen and
L. P. B. Christensen and S. S. Christensen",
title = "Maximum Mutual Information Vector Quantization of
Log-Likelihood Ratios for Memory Efficient {HARQ}
Implementations",
crossref = "Storer:2010:DPD",
pages = "30--39",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.98",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453440",
acknowledgement = ack-nhfb,
}
@InBook{Dechevsky:2010:WCD,
author = "Lubomir T. Dechevsky and Niklas Grip and Joakim
Gundersen",
booktitle = "????",
title = "Wavelet Compression, Data Fitting and Approximation
Based on Adaptive Composition of {Lorentz}-Type
Thresholding and {Besov}-Type Non-threshold Shrinkage",
publisher = "????",
address = "????",
bookpages = "????",
pages = "738--746",
year = "2010",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
xxnote = "This was a short report \cite{Dechevsky:2009:WCD}; it
must be reprinted in a larger book, but which??",
}
@InProceedings{Demay:2010:RDB,
author = "G. Demay and V. Rathi and L. K. Rasmussen",
title = "Rate Distortion Bounds for Binary Erasure Source Using
Sparse Graph Codes",
crossref = "Storer:2010:DPD",
pages = "49--58",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.95",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453435",
acknowledgement = ack-nhfb,
}
@InProceedings{deMedeiros:2010:LAC,
author = "R. J. V. de Medeiros and E. C. Gurjao and J. M. de
Carvalho",
title = "Lossy Audio Compression via Compressed Sensing",
crossref = "Storer:2010:DPD",
pages = "545--545",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.88",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453498",
acknowledgement = ack-nhfb,
}
@InProceedings{DiLillo:2010:SRU,
author = "A. {Di Lillo} and G. Motta and J. A. Storer",
title = "Shape Recognition Using Vector Quantization",
crossref = "Storer:2010:DPD",
pages = "484--493",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.97",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453468",
acknowledgement = ack-nhfb,
}
@InProceedings{Dube:2010:LDC,
author = "D. Dube and V. Beaudoin",
title = "Lossless Data Compression via Substring Enumeration",
crossref = "Storer:2010:DPD",
pages = "229--238",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.28",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453467",
acknowledgement = ack-nhfb,
}
@InProceedings{Fan:2010:OOT,
author = "Zihong Fan and A. Ortega",
title = "Optimization of Overlapped Tiling for Efficient {$3$D}
Image Retrieval",
crossref = "Storer:2010:DPD",
pages = "494--503",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.99",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453471",
acknowledgement = ack-nhfb,
}
@InProceedings{Fernandez:2010:EAC,
author = "F. Fernandez and A. Viola and M. J. Weinberger",
title = "Efficient Algorithms for Constructing Optimal
Bi-directional Context Sets",
crossref = "Storer:2010:DPD",
pages = "179--188",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.23",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453460",
acknowledgement = ack-nhfb,
}
@InProceedings{Fu:2010:TSB,
author = "Jingjing Fu and Zhouchen Lin and Bing Zeng and Feng
Wu",
title = "Tree Structure Based Analyses on Compressive Sensing
for Binary Sparse Sources",
crossref = "Storer:2010:DPD",
pages = "530--530",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.60",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453509",
acknowledgement = ack-nhfb,
}
@InProceedings{Gasthaus:2010:LCB,
author = "J. Gasthaus and F. Wood and Yee Whye Teh",
title = "Lossless Compression Based on the Sequence Memoizer",
crossref = "Storer:2010:DPD",
pages = "337--345",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.36",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453479",
acknowledgement = ack-nhfb,
}
@InProceedings{Gog:2010:ASD,
author = "S. Gog and J. Fischer",
title = "Advantages of Shared Data Structures for Sequences of
Balanced Parentheses",
crossref = "Storer:2010:DPD",
pages = "406--415",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.43",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453484",
acknowledgement = ack-nhfb,
}
@Book{Grotschel:2010:PMP,
editor = "Martin Gr{\"o}tschel and Klaus Lucas and V. L. (Volker
Ludwig) Mehrmann",
title = "{Produktionsfaktor Mathematik} = {Production} factor
mathematics",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 402",
year = "2010",
ISBN = "3-642-11247-1 (paperback)",
ISBN-13 = "978-3-642-11247-8 (paperback)",
LCCN = "HB241 .P76513 2010",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://d-nb.info/1000034348/04;
http://deposit.d-nb.de/cgi-bin/dokserv?id=3423837\%26prov=M\%26dok\_var=1\%26dok\_ext=htm",
acknowledgement = ack-nhfb,
subject = "Production functions (Economic theory); Factors of
production; Angewandte Mathematik",
tableofcontents = "Predictive planning and systematic action: on the
control of technical processes / Lars Gr{\"u}ne
\ldots{} [et al.] \\
Data compression, process optimization, aerodynamics: a
tour through the scales / Wolfgang Dahmen and Wolfgang
Marquardt \\
Active flow control: a mathematical challenge /
Rudibert King, Volker Mehrmann, and Wolfgang Nitsche
\\
Data mining for the category management in the retail
market / Jochen Garcke, Michael Griebel, and Michael
Thess \\
Planning problems in public transit / Ralf
Bornd{\"o}rfer, Martin Gr{\"o}tschel, and Ulrich
J{\"a}ger \\
Towards more intelligence in logistics with mathematics
/ Rolf H. M{\"o}hring and Michael Schenk \\
Optimization of communication networks / J{\"o}rg
Ebersp{\"a}cher, Moritz Kiese, and Roland Wess{\"a}ly
\\
Mathematics in wireless communications / Holger Boche
and Andreas Eisenbl{\"a}tter \\
Mathematics of chip design / J{\"u}rgen Koehl, Bernhard
Korte, and Jens Vygen \\
Chances and visions of advanced mechanics / Wolfgang
Ehlers and Peter Wriggers \\
Mathematics for machine tools and factory automation /
Berend Denkena, Dietmar H{\"o}mberg, and Eckart Uhlmann
\\
Production and use of novel materials / Wolfgang Dreyer
\\
Topology and dynamic networks: optimization with
application in future technologies / G{\"u}nter
Leeugering, Alexander Martin, and Michael Stingl \\
Capacity planning and scheduling in electrical power
systems and in chemical and metallurgical production
plants / Sebastian Engell \ldots{} [et al.] \\
Simulation-based optimization in structural
engineering: new concepts from computer science /
Dietrich Hartmann, Matthias Baitsch, and Van Vinh
Nguyen \\
Object-oriented modelling for simulation and control of
energy transformation processes / Dirk Abel \\
Design tools for energy efficient architecture / Dirk
M{\"u}ller \\
More mathematics into medicine! / Peter Deuflhard
\ldots{} [et al.] \\
Compounds, drugs and mathematical image processing /
G{\"u}nter J. Bauer \ldots{} [et al.]",
}
@InProceedings{Hamano:2010:DCB,
author = "K. Hamano and H. Yamamoto",
title = "Data Compression Based on a Dictionary Method Using
Recursive Construction of {T}-Codes",
crossref = "Storer:2010:DPD",
pages = "531--531",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.68",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453508",
acknowledgement = ack-nhfb,
}
@InProceedings{Han:2010:ETD,
author = "Jingning Han and V. Melkote and K. Rose",
title = "Estimation-Theoretic Delayed Decoding of Predictively
Encoded Video Sequences",
crossref = "Storer:2010:DPD",
pages = "119--128",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.18",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453454",
acknowledgement = ack-nhfb,
}
@InProceedings{Harada:2010:LCM,
author = "N. Harada and Y. Kamamoto and T. Moriya",
title = "Lossless Compression of Mapped Domain Linear
Prediction Residual for {ITU-T} Recommendation
{G.711.0}",
crossref = "Storer:2010:DPD",
pages = "532--532",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.69",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453511",
acknowledgement = ack-nhfb,
}
@InProceedings{Harrusi:2010:FCP,
author = "S. Harrusi and A. Averbuch and N. Rabin",
title = "A Fast Compact Prefix Encoding for Pattern Matching in
Limited Resources Devices",
crossref = "Storer:2010:DPD",
pages = "533--533",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.80",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453510",
acknowledgement = ack-nhfb,
}
@InProceedings{Hon:2010:CIA,
author = "Wing-Kai Hon and Winson Wu and Ting-Shuo Yang",
title = "Compressed Indexes for Approximate Library
Management",
crossref = "Storer:2010:DPD",
pages = "534--534",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.75",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453513",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:2010:CTC,
author = "Ying-Zong Huang and Y. Kochman and G. W. Wornell",
title = "Causal Transmission of Colored Source Frames over a
Packet Erasure Channel",
crossref = "Storer:2010:DPD",
pages = "129--138",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.19",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453457",
acknowledgement = ack-nhfb,
}
@Article{Jahnke:2010:SCM,
author = "Tobias Jahnke and Tudor Udrescu",
title = "Solving chemical master equations by adaptive wavelet
compression",
journal = j-J-COMPUT-PHYS,
volume = "229",
number = "16",
pages = "5724--5741",
day = "10",
month = aug,
year = "2010",
CODEN = "JCTPAH",
DOI = "https://doi.org/10.1016/j.jcp.2010.04.015",
ISSN = "0021-9991 (print), 1090-2716 (electronic)",
ISSN-L = "0021-9991",
bibdate = "Sat Dec 31 11:58:30 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputphys2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0021999110001919",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Physics",
journal-URL = "http://www.sciencedirect.com/science/journal/00219991",
}
@InProceedings{Jiang:2010:TSC,
author = "Wenfei Jiang and Wenyu Liu and L. J. Latecki and Hui
Liang and Changqing Wang and Bing Feng",
title = "Two-Step Coding for High Definition Video
Compression",
crossref = "Storer:2010:DPD",
pages = "535--535",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.54",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453512",
acknowledgement = ack-nhfb,
}
@InProceedings{Kamamoto:2010:LCP,
author = "Y. Kamamoto and T. Moriya and N. Harada",
title = "Low-Complexity {PARCOR} Coefficient Quantizer and
Prediction Order Estimator for {G.711.0} (Lossless
Speech Coding)",
crossref = "Storer:2010:DPD",
pages = "475--483",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.49",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453469",
acknowledgement = ack-nhfb,
}
@InProceedings{Kasai:2010:RCS,
author = "K. Kasai and T. Tsujimoto and R. Matsumoto and K.
Sakaniwa",
title = "Rate-Compatible {Slepian--Wolf} Coding with Short
Non-Binary {LDPC} Codes",
crossref = "Storer:2010:DPD",
pages = "288--296",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.96",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453449",
acknowledgement = ack-nhfb,
}
@InProceedings{Khalifeh:2010:HMT,
author = "A. Khalifeh and H. Yousefi'zadeh",
title = "A Hybrid Media Transmission Scheme for Wireless
{VoIP}",
crossref = "Storer:2010:DPD",
pages = "465--474",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.48",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453466",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2010:BES,
author = "A. N. Kim and T. A. Ramstad",
title = "Bandwidth Expansion in a Simple {Gaussian} Sensor
Network Using Feedback",
crossref = "Storer:2010:DPD",
pages = "259--268",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.31",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453444",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2010:EWD,
author = "Y. Kim and M. S. Nadar and A. Bilgin",
title = "Exploiting Wavelet-Domain Dependencies in Compressed
Sensing",
crossref = "Storer:2010:DPD",
pages = "536--536",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.51",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453515",
acknowledgement = ack-nhfb,
}
@Article{Kounchev:2010:PDTb,
author = "Ognyan Kounchev and Damyan Kalaglarsky and Milcho
Tsvetkov",
title = "Polyharmonic {Daubechies} type wavelets in Image
Processing and Astronomy, {II}",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "1--9",
day = "29",
month = jun,
year = "2010",
CODEN = "????",
ISSN = "2331-8422",
ISSN-L = "2331-8422",
bibdate = "Fri Mar 9 06:55:56 MST 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://arxiv.org/abs/1006.5739",
abstract = "We consider the application of the polyharmonic
subdivision wavelets (of Daubechies type) to Image
Processing, in particular to Astronomical Images. The
results show an essential advantage over some standard
multivariate wavelets and a potential for better
compression.",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
remark = "9 pages.",
subject = "Numerical Analysis (math.NA); Computer Vision and
Pattern Recognition (cs.CV)",
}
@InProceedings{Koyuncu:2010:SDQ,
author = "E. Koyuncu and H. Jafarkhani",
title = "A Systematic Distributed Quantizer Design Method with
an Application to {MIMO} Broadcast Channels",
crossref = "Storer:2010:DPD",
pages = "297--306",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.34",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453448",
acknowledgement = ack-nhfb,
}
@Article{Krause:2010:FFP,
author = "Philipp Klaus Krause",
title = "{{\tt ftc}} --- Floating precision texture
compression",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "34",
number = "5",
pages = "594--601",
month = oct,
year = "2010",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2010.06.005",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:42:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849310000890",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@InProceedings{Kreft:2010:LLC,
author = "S. Kreft and G. Navarro",
title = "{LZ77}-Like Compression with Fast Random Access",
crossref = "Storer:2010:DPD",
pages = "239--248",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.29",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453442",
acknowledgement = ack-nhfb,
}
@InProceedings{Lai:2010:ADE,
author = "Zhongyuan Lai and Junhuan Zhu and Zhou Ren and Wenyu
Liu and Baolan Yan",
title = "Arbitrary Directional Edge Encoding Schemes for the
Operational Rate-Distortion Optimal Shape Coding
Framework",
crossref = "Storer:2010:DPD",
pages = "20--29",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.10",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453441",
acknowledgement = ack-nhfb,
}
@InProceedings{Lan:2010:ARB,
author = "Xuguang Lan and Nanning Zheng and Wen Ma and Miao Hui
and Jianru Xue",
title = "Arbitrary {ROI}-Based Wavelet Video Coding",
crossref = "Storer:2010:DPD",
pages = "537--537",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.82",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453490",
acknowledgement = ack-nhfb,
}
@Book{Lange:2010:AP,
author = "Kenneth Lange",
title = "Applied probability",
publisher = "Springer Science+Business Media, LLC",
address = "New York, NY, USA",
edition = "Second",
pages = "xv + 436",
year = "2010",
DOI = "https://doi.org/10.1007/978-1-4419-7165-4",
ISBN = "1-4419-7165-3, 1-4419-7164-5",
ISBN-13 = "978-1-4419-7165-4, 978-1-4419-7164-7",
LCCN = "QA273 .L36 2010",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Springer texts in statistics.",
acknowledgement = ack-nhfb,
subject = "Probabilities",
}
@InProceedings{Li:2010:PAP,
author = "Mengdong Li",
title = "Preimage awareness proofs of two compression
functions",
crossref = "Yang:2010:PII",
pages = "660--664",
month = dec,
year = "2010",
DOI = "https://doi.org/10.1109/ICITIS.2010.5689483",
ISBN = "1-4244-6942-2",
ISBN-13 = "978-1-4244-6942-0",
bibdate = "Fri Mar 13 10:55:22 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "collision resistance; Compression Function;
Cryptography; cryptography; data compression; Domain
extension; Games; hash function; Hash Function;
Merkle-Damgard paradigm; Message authentication;
Polynomials; PrA property; Preimage aware; preimage
awareness proof; PRO compression function; random
oracle; Resistance; security property; Transforms",
}
@InProceedings{Li:2010:SMM,
author = "Zhi Li and Feng Wu and J. Wright",
title = "On the Systematic Measurement Matrix for Compressed
Sensing in the Presence of Gross Errors",
crossref = "Storer:2010:DPD",
pages = "356--365",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.38",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453481",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2010:PDW,
author = "Ting-Lan Lin and Jihyun Shin and P. Cosman",
title = "Packet Dropping for Widely Varying Bit Reduction Rates
Using a Network-Based Packet Loss Visibility Model",
crossref = "Storer:2010:DPD",
pages = "445--454",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.47",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453488",
acknowledgement = ack-nhfb,
}
@InProceedings{Little:2010:OSM,
author = "G. Little and J. Diamond",
title = "Optimum String Match Choices in {LZSS}",
crossref = "Storer:2010:DPD",
pages = "538--538",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.67",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453493",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2010:ERD,
author = "Da Liu and Debin Zhao and Siwei Ma",
title = "Error Resilient Dual Frame Motion Compensation with
Uneven Quality Protection",
crossref = "Storer:2010:DPD",
pages = "539--539",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.56",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453492",
acknowledgement = ack-nhfb,
}
@Article{Liu:2010:GDH,
author = "Yang Liu and Balakrishnan Prabhakaran and Xiaohu Guo",
title = "Geometry {I}: {Dirichlet} Harmonic Shape Compression
with Feature Preservation for Parameterized Surfaces",
journal = j-CGF,
volume = "29",
number = "7",
pages = "2039--2048",
month = sep,
year = "2010",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2010.01790.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:28:12 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "18 Oct 2010",
}
@InProceedings{Liu:2010:NAT,
author = "Xiteng Liu",
title = "A New Approach to Time-Frequency Analysis",
crossref = "Storer:2010:DPD",
pages = "540--540",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.79",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453495",
acknowledgement = ack-nhfb,
}
@InProceedings{Lu:2010:IAF,
author = "Jiyuan Lu and Peizhao Zhang and Hongyang Chao and P.
Fisher",
title = "An Integrated Algorithm for Fractional Pixel
Interpolation and Motion Estimation of {H.264}",
crossref = "Storer:2010:DPD",
pages = "541--541",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.101",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453494",
acknowledgement = ack-nhfb,
}
@InProceedings{Majumdar:2010:MCA,
author = "A. Majumdar and R. K. Ward",
title = "A Matrix Completion Approach to Reduce Energy
Consumption in Wireless Sensor Networks",
crossref = "Storer:2010:DPD",
pages = "542--542",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.66",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453497",
acknowledgement = ack-nhfb,
}
@InProceedings{Mao:2010:STE,
author = "M. Z. Mao and R. M. Gray",
title = "Stationary and {Trellis} Encoding for {IID} Sources
and Simulation",
crossref = "Storer:2010:DPD",
pages = "3--12",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.8",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453439",
acknowledgement = ack-nhfb,
}
@InProceedings{Martinez-Prieto:2010:HOT,
author = "M. A. Martinez-Prieto and J. Adiego and P. Fuente and
J. D. Fernandez",
title = "High-Order Text Compression on Hierarchical
Edge-Guided",
crossref = "Storer:2010:DPD",
pages = "543--543",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.72",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453496",
acknowledgement = ack-nhfb,
}
@InProceedings{Matthews:2010:TNA,
author = "S. J. Matthews and Seung-Jin Sul and T. L. Williams",
title = "{TreeZip}: a New Algorithm for Compressing Large
Collections of Evolutionary Trees",
crossref = "Storer:2010:DPD",
pages = "544--544",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.64",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453499",
acknowledgement = ack-nhfb,
}
@InProceedings{Mishali:2010:XAD,
author = "M. Mishali and Y. C. Eldar",
title = "{Xampling}: Analog Data Compression",
crossref = "Storer:2010:DPD",
pages = "366--375",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.39",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453480",
acknowledgement = ack-nhfb,
}
@InProceedings{Monteagudo-Pereira:2010:SJP,
author = "J. L. Monteagudo-Pereira and F. Aul{\'\i}-Llin{\'a}s
and J. Serra-Sagrist{\`a} and J. Bartrina-Rapesta",
title = "Smart {JPIP} Proxy Server with Prefetching
Strategies",
crossref = "Storer:2010:DPD",
pages = "99--108",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.16",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453452",
acknowledgement = ack-nhfb,
}
@InProceedings{Moriya:2010:ELC,
author = "T. Moriya and Y. Kamamoto and N. Harada",
title = "Enhanced Lossless Coding Tools of {LPC} Residual for
{ITU-T G.711.0}",
crossref = "Storer:2010:DPD",
pages = "546--546",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.71",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453523",
acknowledgement = ack-nhfb,
}
@Article{Moskowitz:2010:ITE,
author = "I. S. Moskowitz and F. Ahmed and P. A. Lafferty",
title = "Information Theoretic Effects of {JPEG} Compression on
Image Steganography",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "3",
pages = "318--327",
year = "2010",
DOI = "https://doi.org/10.2316/Journal.202.2010.3.202-2736",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:37 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.3.202-2736",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@InProceedings{Mun:2010:BCS,
author = "Sungkwang Mun and J. E. Fowler",
title = "Block Compressed Sensing of Images Using Directional
Transforms",
crossref = "Storer:2010:DPD",
pages = "547--547",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.90",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453522",
acknowledgement = ack-nhfb,
}
@Article{Neuburger:2010:BRB,
author = "Shoshana Neuburger",
title = "Book Review: {{\booktitle{The Burrows--Wheeler
Transform: Data Compression, Suffix Arrays, and Pattern
Matching}}, by Donald Adjeroh, Timothy Bell and Amar
Mukherjee Springer, 2008}",
journal = j-SIGACT,
volume = "41",
number = "1",
pages = "21--24",
month = mar,
year = "2010",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1753171.1753177",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Mar 20 14:39:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Adjeroh:2008:BWT}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Book{Ng:2010:PSI,
editor = "Jason Ng",
title = "Practical signal and image processing in clinical
cardiology",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 400",
year = "2010",
DOI = "https://doi.org/10.1007/978-1-84882-515-4",
ISBN = "1-84882-515-3, 1-84882-514-5",
ISBN-13 = "978-1-84882-515-4, 978-1-84882-514-7",
LCCN = "RC683 .P73 2010",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
acknowledgement = ack-nhfb,
subject = "Heart; Diseases; Diagnosis; Signal processing; Digital
techniques; Image processing; Electronics in
cardiology",
}
@InProceedings{Nomura:2010:OPF,
author = "R. Nomura and T. Matsushima",
title = "On the Overflow Probability of Fixed-to-Variable
Length Codes with Side Information",
crossref = "Storer:2010:DPD",
pages = "548--548",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.93",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453525",
acknowledgement = ack-nhfb,
}
@InProceedings{Odagiri:2010:DCT,
author = "J. Odagiri and N. Itani and Y. Nakano and D. E.
Culler",
title = "Data Compression Technology Dedicated to Distribution
and Embedded Systems",
crossref = "Storer:2010:DPD",
pages = "549--549",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.73",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453524",
acknowledgement = ack-nhfb,
}
@Article{Oh:2010:JJI,
author = "Tick H. Oh",
title = "{JPEG2000} and {JPEG}: Image Quality Comparison of
Compressed Medical Modalities",
journal = j-INT-J-COMPUT-APPL,
volume = "32",
number = "4",
pages = "393--398",
year = "2010",
CODEN = "IJCAFW",
DOI = "https://doi.org/10.2316/Journal.202.2010.4.202-1503",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:26:51 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.2316/Journal.202.2010.4.202-1503",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Papadopoulos:2010:TRM,
author = "Konstantinos Papadopoulos and Ioannis Papaefstathiou",
title = "{Titan-R}: a Multigigabit Reconfigurable Combined
Compression\slash Decompression Unit",
journal = j-TRETS,
volume = "3",
number = "2",
pages = "7:1--7:??",
month = may,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1754386.1754388",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Jun 22 16:00:33 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "Data compression techniques can alleviate bandwidth
problems in even multigigabit networks and are
especially useful when combined with encryption. This
article demonstrates a reconfigurable hardware
compressor/decompressor core, the Titan-R, which can
compress/decompress data streams at 8.5 Gb/sec, making
it the fastest reconfigurable such device ever
proposed; the presented full-duplex implementation
allows for fully symmetric compression and
decompression rates at 8.5 Gbps each. Its compression
algorithm is a variation of the most widely used and
efficient such scheme, the Lempel--Ziv (LZ) algorithm
that uses part of the previous input stream as the
dictionary. In order to support this high network
throughput, the Titan-R utilizes a very fine-grained
pipeline and takes advantage of the high bandwidth
provided by the distributed on-chip RAMs of
state-of-the-art FPGAs.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "data compression; FPGA; hardware algorithms;
networking; parallel processing; reconfigurable
computing; Stream processing",
}
@InProceedings{Park:2010:DCO,
author = "Sang-Young Park and Seong-Dae Kim",
title = "Depth Compression of {$3$D} Object Represented by
Layered Depth Image",
crossref = "Storer:2010:DPD",
pages = "504--513",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.50",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453470",
acknowledgement = ack-nhfb,
}
@Article{Parodi:2010:PLA,
author = "Mauro Parodi and Mauro Gaggero and Marco Storace",
title = "Piecewise linear approximations of multivariate
functions: a multiresolution-based compression
algorithm suitable for circuit implementation",
journal = j-APPL-NUM-MATH,
volume = "60",
number = "9",
pages = "924--933",
month = sep,
year = "2010",
CODEN = "ANMAEL",
DOI = "https://doi.org/10.1016/j.apnum.2010.05.002",
ISSN = "0168-9274 (print), 1873-5460 (electronic)",
ISSN-L = "0168-9274",
bibdate = "Tue Aug 24 11:17:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applnummath.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/01689274",
acknowledgement = ack-nhfb,
fjournal = "Applied Numerical Mathematics: Transactions of IMACS",
journal-URL = "http://www.sciencedirect.com/science/journal/01689274",
}
@InProceedings{Patchoo:2010:AAQ,
author = "W. Patchoo and T. R. Fischer and Changho Ahn and
Sangwon Kang",
title = "Analysis of Amplitude Quantization in {ACELP}
Excitation Coding",
crossref = "Storer:2010:DPD",
pages = "550--550",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.52",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453527",
acknowledgement = ack-nhfb,
}
@Article{Pence:2010:OCF,
author = "W. D. Pence and R. L. White and R. Seaman",
title = "Optimal Compression of Floating-point Astronomical
Images Without Significant Loss of Information",
journal = "arXiv.org",
volume = "??",
number = "??",
pages = "??--??",
day = "7",
month = jul,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1086/656249",
ISSN = "????",
ISSN-L = "????",
bibdate = "Wed Sep 30 12:43:49 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "Published in PASP {\bf 122}, 1096 (2010).",
URL = "http://arxiv.org/abs/1007.1179",
abstract = "We describe a compression method for floating-point
astronomical images that gives compression ratios of
$6$--$ 10$ while still preserving the scientifically
important information in the image. The pixel values
are first preprocessed by quantizing them into scaled
integer intensity levels, which removes some of the
uncompressible noise in the image. The integers are
then losslessly compressed using the fast and efficient
Rice algorithm and stored in a portable FITS format
file. Quantizing an image more coarsely gives greater
image compression, but it also increases the noise and
degrades the precision of the photometric and
astrometric measurements in the quantized image.
Dithering the pixel values during the quantization
process can greatly improve the precision of
measurements in the images. This is especially
important if the analysis algorithm relies on the mode
or the median which would be similarly quantized if the
pixel values are not dithered. We perform a series of
experiments on both synthetic and real astronomical CCD
images to quantitatively demonstrate that the
magnitudes and positions of stars in the quantized
images can be measured with the predicted amount of
precision. In order to encourage wider use of these
image compression methods, we have made available a
pair of general-purpose image compression programs,
called fpack and funpack, which can be used to compress
any FITS format image.",
acknowledgement = ack-nhfb,
subject = "Instrumentation and Methods for Astrophysics
(astro-ph.IM)",
}
@Article{Pulina:2010:ESQ,
author = "Luca Pulina and Armando Tacchella",
title = "An Empirical Study of {QBF} Encodings: from Treewidth
Estimation to Useful Preprocessing",
journal = j-FUND-INFO,
volume = "102",
number = "3--4",
pages = "391--427",
month = aug,
year = "2010",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2010-312",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:10:51 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Qadir:2010:EJC,
author = "G. Qadir and X. Zhao and A. T. S. Ho",
booktitle = "{Society of Photo-Optical Instrumentation Engineers
(SPIE)} Conference Series",
title = "Estimating {JPEG2000} compression for image forensics
using {Benford's Law}",
volume = "7723",
publisher = pub-SPIE,
address = pub-SPIE:adr,
month = apr,
year = "2010",
DOI = "https://doi.org/10.1117/12.855085",
bibdate = "Mon Nov 14 18:25:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Society of Photo-Optical Instrumentation Engineers
(SPIE) Conference Series",
URL = "http://adsabs.harvard.edu/abs/2010SPIE.7723E..14Q",
acknowledgement = ack-nhfb,
}
@InProceedings{Reyes:2010:LRC,
author = "M. G. Reyes and D. L. Neuhoff",
title = "Lossless Reduced Cutset Coding of {Markov} Random
Fields",
crossref = "Storer:2010:DPD",
pages = "386--395",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.41",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453482",
acknowledgement = ack-nhfb,
}
@InProceedings{Richter:2010:SCQ,
author = "T. Richter",
title = "Spatial Constant Quantization in {JPEG XR} is Nearly
Optimal",
crossref = "Storer:2010:DPD",
pages = "79--88",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.14",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453436",
acknowledgement = ack-nhfb,
}
@Article{Rubinstein:2010:CSO,
author = "Benjamin I. P. Rubinstein and Peter L. Bartlett and J.
Hyam Rubinstein",
title = "Corrigendum to {``Shifting: One-inclusion mistake
bounds and sample compression'' [J. Comput. System Sci.
{\bf 75} (1) (2009) 37--59]}",
journal = j-J-COMP-SYS-SCI,
volume = "76",
number = "3--4",
pages = "278--280",
month = may # "\slash " # jun,
year = "2010",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2010.03.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:13 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
note = "See \cite{Rubinstein:2009:SOI}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000010000280",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Book{Salomon:2010:HDC,
author = "David Salomon and Giovanni Motta",
title = "Handbook of Data Compression",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Fifth",
pages = "300",
year = "2010",
ISBN = "1-84882-902-7 (hardcover), 1-84882-903-5",
ISBN-13 = "978-1-84882-902-2 (hardcover), 978-1-84882-903-9",
LCCN = "QA76.9.D33 S282 2010",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
note = "With contributions by David Bryant.",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science); Datenkompression;
Datenkompression.",
}
@InProceedings{Sano:2010:SPP,
author = "K. Sano and K. Katahira and S. Yamamoto",
title = "Segment-Parallel Predictor for {FPGA}-Based Hardware
Compressor and Decompressor of Floating-Point Data
Streams to Enhance Memory {I/O} Bandwidth",
crossref = "Storer:2010:DPD",
pages = "416--425",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.44",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453487",
acknowledgement = ack-nhfb,
}
@InProceedings{Sartipi:2010:LCI,
author = "M. Sartipi",
title = "{LDPC} Codes for Information Embedding and Lossy
Distributed Source Coding",
crossref = "Storer:2010:DPD",
pages = "551--551",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.87",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453526",
acknowledgement = ack-nhfb,
}
@InProceedings{Savari:2010:WHM,
author = "S. A. Savari and J. Kliewer",
title = "When {Huffman} Meets {Hamming}: a Class of Optimal
Variable-Length Error Correcting Codes",
crossref = "Storer:2010:DPD",
pages = "327--336",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.35",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453476",
acknowledgement = ack-nhfb,
}
@Book{Schlick:2010:MMS,
author = "Tamar Schlick",
title = "Molecular modeling and simulation: an
interdisciplinary guide",
volume = "21",
publisher = "Springer Science+Business Media, LLC",
address = "New York, NY, USA",
edition = "Second",
pages = "xlv + 723",
year = "2010",
DOI = "https://doi.org/10.1007/978-1-4419-6351-2",
ISBN = "1-4419-6351-0, 1-4419-6350-2",
ISBN-13 = "978-1-4419-6351-2, 978-1-4419-6350-5",
LCCN = "QD480 .S37 2010",
bibdate = "Mon Jan 28 15:18:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
libraries.colorado.edu:210/INNOPAC",
series = "Interdisciplinary applied mathematics",
acknowledgement = ack-nhfb,
subject = "Biomolecules; Models; Computer simulation",
}
@InProceedings{Shamaie:2010:SQD,
author = "S. Shamaie and F. Lahouti",
title = "Scalar Quantizer Design for Noisy Channel with Decoder
Side Information",
crossref = "Storer:2010:DPD",
pages = "307--316",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.91",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453451",
acknowledgement = ack-nhfb,
}
@InProceedings{Shapira:2010:BDF,
author = "D. Shapira and M. Kats",
title = "Bidirectional Delta Files",
crossref = "Storer:2010:DPD",
pages = "249--258",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.30",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453445",
acknowledgement = ack-nhfb,
}
@InProceedings{Shayevitz:2010:SDS,
author = "O. Shayevitz",
title = "A Symbolic Dynamical System Approach to Lossy Source
Coding with Feedforward",
crossref = "Storer:2010:DPD",
pages = "317--326",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.94",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453450",
acknowledgement = ack-nhfb,
}
@InProceedings{Shermer:2010:NMP,
author = "E. Shermer and M. Avigal and D. Shapira",
title = "Neural {Markovian} Predictive Compression: An
Algorithm for Online Lossless Data Compression",
crossref = "Storer:2010:DPD",
pages = "209--218",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.26",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453465",
acknowledgement = ack-nhfb,
}
@InProceedings{Tao:2010:HSP,
author = "Pin Tao and Wenting Wu and Chao Wang and Mou Xiao and
Jiangtao Wen",
title = "Horizontal Spatial Prediction for High Dimension Intra
Coding",
crossref = "Storer:2010:DPD",
pages = "552--552",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.76",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453529",
acknowledgement = ack-nhfb,
}
@InProceedings{Testoni:2010:ACS,
author = "V. Testoni and M. H. M. Costa and D. Kirovski and H.
S. Malvar",
title = "On the Adaptive Coefficient Scanning of {JPEG XR\slash
HD} Photo",
crossref = "Storer:2010:DPD",
pages = "69--78",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.13",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453437",
acknowledgement = ack-nhfb,
}
@Book{Thyagarajan:2010:SIV,
author = "K. S. Thyagarajan",
title = "Still image and video compression with {MATLAB}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "????",
year = "2010",
ISBN = "0-470-48416-0",
ISBN-13 = "978-0-470-48416-6",
LCCN = "TA1638 .T48 2010",
bibdate = "Mon Jan 31 15:15:11 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
z3950.loc.gov:7090/Voyager",
abstract = "This book describes the principles of image and video
compression techniques and introduces current and
popular compression standards, such as the MPEG series.
Derivations of relevant compression algorithms are
developed in an easy-to-follow fashion. Numerous
examples are provided in each chapter to illustrate the
concepts. The book includes complementary software
written in MATLAB SIMULINK to give readers hands-on
experience in using and applying various video
compression methods. Readers can enhance the software
by including their own algorithms.",
acknowledgement = ack-nhfb,
subject = "Image compression; Video compression; MATLAB",
}
@InProceedings{Tu:2010:BPH,
author = "Tang-Hsun Tu and Chih-Wen Hsueh",
title = "Batch-Pipelining for {H.264} Decoding on Multicore
Systems",
crossref = "Storer:2010:DPD",
pages = "553--553",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.57",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453528",
acknowledgement = ack-nhfb,
}
@Article{Vasa:2010:GDL,
author = "Libor V{\'a}{\v{s}}a and V{\'a}clav Skala",
title = "Geometry-Driven Local Neighbourhood Based Predictors
for Dynamic Mesh Compression",
journal = j-CGF,
volume = "29",
number = "6",
pages = "1921--1933",
month = sep,
year = "2010",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2010.01659.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:28:09 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "12 Apr 2010",
}
@InProceedings{Villafranca:2010:DOL,
author = "A. G. Villafranca and J. Portell and E. Garcia-Berro",
title = "Development of Optimum Lossless Compression Systems
for Space Missions",
crossref = "Storer:2010:DPD",
pages = "554--554",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.70",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453531",
acknowledgement = ack-nhfb,
}
@Article{Wang:2010:ADC,
author = "Chaoli Wang and Hongfeng Yu and Kwan-Liu Ma",
title = "Application-Driven Compression for Visualizing
Large-Scale Time-Varying Data",
journal = j-IEEE-CGA,
volume = "30",
number = "1",
pages = "59--69",
month = jan # "\slash " # feb,
year = "2010",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/MCG.2010.3",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Thu May 13 08:52:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@InProceedings{Wang:2010:IFV,
author = "Jia Wang and Xiaolin Wu",
title = "Information Flows in Video Coding",
crossref = "Storer:2010:DPD",
pages = "149--158",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.21",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453459",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2010:RBR,
author = "Qifei Wang and Xiangyang Ji and Qionghai Dai and
Naiyao Zhang",
title = "Region Based Rate-Distortion Analysis for {$3$D} Video
Coding",
crossref = "Storer:2010:DPD",
pages = "555--555",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.63",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453530",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2010:SSV,
author = "Qijun Wang and Ruimin Hu and Zhongyuan Wang",
title = "Spatially Scalable Video Coding Based on Hybrid
Epitomic Resizing",
crossref = "Storer:2010:DPD",
pages = "139--148",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.20",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453456",
acknowledgement = ack-nhfb,
}
@InProceedings{Wen:2010:FRD,
author = "Jiangtao Wen and Mou Xiao and Jianwen Chen and Pin Tao
and Chao Wang",
title = "Fast Rate Distortion Optimized Quantization for
{H.264\slash AVC}",
crossref = "Storer:2010:DPD",
pages = "557--557",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.58",
bibdate = "Tue Feb 5 12:39:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453532",
acknowledgement = ack-nhfb,
}
@InProceedings{Wen:2010:RSB,
author = "Jiangtao Wen and Zhuoyuan Chen and Shiqiang Yang and
Yuxing Han and J. D. Villasenor",
title = "Reconstruction of Sparse Binary Signals Using
Compressive Sensing",
crossref = "Storer:2010:DPD",
pages = "556--556",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.61",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453533",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2010:CPB,
author = "Xiaolin Wu and H. D. Mittelmann and Xiaohan Wang and
J. Wang",
title = "On Computation of Performance Bounds of Optimal Index
Assignment",
crossref = "Storer:2010:DPD",
pages = "189--198",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.24",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453463",
acknowledgement = ack-nhfb,
}
@Article{Wu:2010:PDB,
author = "Hao Wu and Frank No{\'e}",
title = "Probability Distance Based Compression of Hidden
{Markov} Models",
journal = j-MULTISCALE-MODELING-SIMUL,
volume = "8",
number = "5",
pages = "1838--1861",
month = "????",
year = "2010",
CODEN = "MMSUBT",
DOI = "https://doi.org/10.1137/090774161",
ISSN = "1540-3459 (print), 1540-3467 (electronic)",
ISSN-L = "1540-3459",
bibdate = "Fri Mar 4 09:14:27 MST 2011",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/MMS/8/5;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siammms.bib",
URL = "http://epubs.siam.org/mms/resource/1/mmsubt/v8/i5/p1838_s1",
acknowledgement = ack-nhfb,
fjournal = "Multiscale Modeling and Simulation",
journal-URL = "http://epubs.siam.org/mms",
onlinedate = "November 09, 2010",
}
@InProceedings{Wu:2010:TOL,
author = "Feng Wu and Peiwen Yu",
title = "Theoretically Optimal Low-Density Parity-Check Code
Ensemble for {Gallager's Decoding Algorithm A}",
crossref = "Storer:2010:DPD",
pages = "558--558",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.84",
bibdate = "Tue Feb 5 12:39:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453535",
acknowledgement = ack-nhfb,
}
@InProceedings{Xiong:2010:TGB,
author = "Ruiqin Xiong and Wen Gao",
title = "{Tanner} Graph Based Image Interpolation",
crossref = "Storer:2010:DPD",
pages = "376--385",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.40",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453483",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2010:SAD,
author = "Jizheng Xu and Feng Wu",
title = "Subsampling-Adaptive Directional Wavelet Transform for
Image Coding",
crossref = "Storer:2010:DPD",
pages = "89--98",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.15",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453453",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2010:LCL,
author = "Jeehong Yang and S. A. Savari",
title = "A Lossless Circuit Layout Image Compression Algorithm
for Maskless Lithography Systems",
crossref = "Storer:2010:DPD",
pages = "109--118",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.17",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453455",
acknowledgement = ack-nhfb,
}
@InProceedings{Ye:2010:EAI,
author = "Yan Ye and G. Motta and M. Karczewicz",
title = "Enhanced Adaptive Interpolation Filters for Video
Coding",
crossref = "Storer:2010:DPD",
pages = "435--444",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.46",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453489",
acknowledgement = ack-nhfb,
}
@InProceedings{Yokoo:2010:FSP,
author = "H. Yokoo",
title = "File-Size Preserving {LZ} Encoding for Reversible Data
Embedding",
crossref = "Storer:2010:DPD",
pages = "559--559",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.78",
bibdate = "Tue Feb 5 12:39:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453534",
acknowledgement = ack-nhfb,
}
@InProceedings{Yoshida:2010:EAA,
author = "S. Yoshida and T. Kida",
title = "An Efficient Algorithm for Almost Instantaneous {VF}
Code Using Multiplexed Parse Tree",
crossref = "Storer:2010:DPD",
pages = "219--228",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.27",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453464",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2010:ARM,
author = "Yongbing Zhang and Xinguang Xiang and Siwei Ma and
Debin Zhao and Wen Gao",
title = "Auto Regressive Model and Weighted Least Squares Based
Packet Video Error Concealment",
crossref = "Storer:2010:DPD",
pages = "455--464",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.100",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453491",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2010:BRR,
author = "Guoqiang Zhang and W. B. Kleijn and J. {\O}stergaard",
title = "Bounding the Rate Region of Vector {Gaussian} Multiple
Descriptions with Individual and Central Receivers",
crossref = "Storer:2010:DPD",
pages = "13--19",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.9",
bibdate = "Tue Feb 5 12:39:22 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453438",
acknowledgement = ack-nhfb,
}
@InProceedings{Amelio:2011:ICM,
author = "A. Amelio and A. Apostolico and S. E. Rombo",
title = "Image Compression by {$2$D} {Motif} Basis",
crossref = "Storer:2011:DDC",
pages = "153--162",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.22",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749473",
acknowledgement = ack-nhfb,
}
@InProceedings{Anonymous:2011:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2011:DDC",
pages = "vi--vi",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.5",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749553",
acknowledgement = ack-nhfb,
}
@InProceedings{Anonymous:2011:PA,
author = "Anonymous",
title = "Proceedings Available",
crossref = "Storer:2011:DDC",
pages = "??--??",
year = "2011",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Apostolico:2011:SSG,
author = "A. Apostolico and F. Cunial",
title = "Sequence Similarity by Gapped {LZW}",
crossref = "Storer:2011:DDC",
pages = "343--352",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.41",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749492",
acknowledgement = ack-nhfb,
}
@InProceedings{Auli-Llinas:2011:RDO,
author = "F. Aul{\'\i}-Llin{\'a}s and M. W. Marcellin",
title = "Rate-Distortion Optimized Adaptive Scanning Order for
Bitplane Image Coding Engines",
crossref = "Storer:2011:DDC",
pages = "163--172",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.23",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749474",
acknowledgement = ack-nhfb,
}
@Article{Balster:2011:PCR,
author = "Eric J. Balster and Benjamin T. Fortener and William
F. Turri",
title = "Post-Compression Rate-Distortion Development for
Embedded Block Coding with Optimal Truncation in
{JPEG2000} Imagery",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "11",
number = "4",
pages = "611--627",
month = oct,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467811004238",
ISSN = "0219-4678",
bibdate = "Wed Feb 8 18:48:57 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Barbero:2011:LRS,
author = "J. M. Barbero",
title = "Lossy {RAID} Storage Architecture for {JPEG 2000}
Images",
crossref = "Storer:2011:DDC",
pages = "445--445",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.94",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749502",
acknowledgement = ack-nhfb,
}
@InProceedings{Bartlett:2011:DSD,
author = "N. Bartlett and F. Wood",
title = "Deplump for Streaming Data",
crossref = "Storer:2011:DDC",
pages = "363--372",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.43",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749494",
acknowledgement = ack-nhfb,
}
@InProceedings{Beirami:2011:RTP,
author = "A. Beirami and F. Fekri",
title = "The Redundancy of Two-Part Codes for Finite-Length
Parametric Sources",
crossref = "Storer:2011:DDC",
pages = "446--446",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.96",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749503",
acknowledgement = ack-nhfb,
}
@InProceedings{Belkasim:2011:MRA,
author = "S. Belkasim",
title = "Multi-resolution Analysis Using Symmetrized Odd and
Even {DCT} Transforms",
crossref = "Storer:2011:DDC",
pages = "447--447",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.51",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749504",
acknowledgement = ack-nhfb,
}
@InProceedings{Bocherer:2011:MDD,
author = "G. B{\"o}cherer and R. Mathar",
title = "Matching Dyadic Distributions to Channels",
crossref = "Storer:2011:DDC",
pages = "23--32",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.10",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749460",
acknowledgement = ack-nhfb,
}
@Article{Bonyadi:2011:NHQ,
author = "Mohammad Reza Bonyadi and Mohsen Ebrahimi Moghaddam",
title = "A Nonuniform High-Quality Image Compression Method to
Preserve User-Specified Compression Ratio",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "11",
number = "3",
pages = "355--375",
month = jul,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467811004123",
ISSN = "0219-4678",
bibdate = "Wed Aug 24 06:48:16 MDT 2011",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Bottcher:2011:SMC,
author = "S. B{\"o}ttcher and A. B{\"u}ltmann and R. Hartel",
title = "Search and Modification in Compressed Texts",
crossref = "Storer:2011:DDC",
pages = "403--412",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.47",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749498",
acknowledgement = ack-nhfb,
}
@InProceedings{Boucheron:2011:HSV,
author = "L. E. Boucheron and P. L. D. Leon and S. Sandoval",
title = "Hybrid Scalar\slash Vector Quantization of
Mel-Frequency Cepstral Coefficients for Low Bit-Rate
Coding of Speech",
crossref = "Storer:2011:DDC",
pages = "103--112",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.17",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749468",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2011:FVQ,
author = "Yushi Chen and Yuhhang Zhang and Ye Zhang and Zhixin
Zhou",
title = "Fast Vector Quantization Algorithm for Hyperspectral
Image Compression",
crossref = "Storer:2011:DDC",
pages = "450--450",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.54",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749507",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2011:IPB,
author = "Zhifeng Chen and S. Doken and Dapeng Wu",
title = "An Improved Parametric Bit Rate Model for Frame-Level
Rate Control in Video Coding",
crossref = "Storer:2011:DDC",
pages = "451--451",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.55",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749508",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2011:ITF,
author = "Hao Chen and Ye Zhang and Yu Tao and Bin Zou and
Wenyan Tang",
title = "An Improved Temporal Frame Interpolation Algorithm for
{H.264} Video Compression",
crossref = "Storer:2011:DDC",
pages = "449--449",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.53",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749506",
acknowledgement = ack-nhfb,
}
@InProceedings{Chobey:2011:NPM,
author = "D. K. Chobey and A. Sharma and A. K. Tiwari",
title = "A Novel Prediction Model for Lossless Video
Compression",
crossref = "Storer:2011:DDC",
pages = "452--452",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.56",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749509",
acknowledgement = ack-nhfb,
}
@InProceedings{Chon:2011:ICV,
author = "Jaehong Chon and S. Whittle and E. A. Riskin and R. E.
Ladner",
title = "Improving Compressed Video Sign Language Conversations
in the Presence of Data Loss",
crossref = "Storer:2011:DDC",
pages = "383--392",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.45",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749496",
acknowledgement = ack-nhfb,
}
@InProceedings{Constantinescu:2011:MDC,
author = "C. Constantinescu and J. Glider and D. Chambliss",
title = "Mixing Deduplication and Compression on Active Data
Sets",
crossref = "Storer:2011:DDC",
pages = "393--402",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.46",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749497",
acknowledgement = ack-nhfb,
}
@Article{Courbet:2011:TPM,
author = "Cl{\'e}ment Courbet and C{\'e}line Hudelot",
title = "{Taylor} Prediction for Mesh Geometry Compression",
journal = j-CGF,
volume = "30",
number = "1",
pages = "139--151",
month = mar,
year = "2011",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2010.01838.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:28:20 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "12 Jan 2011",
}
@InProceedings{Dai:2011:BSP,
author = "Wenrui Dai and Hongkai Xiong",
title = "Bitwise Structured Prediction Model for Lossless Image
Coding",
crossref = "Storer:2011:DDC",
pages = "453--453",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.57",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749510",
acknowledgement = ack-nhfb,
}
@Article{DeAgostino:2011:LZD,
author = "Sergio {De Agostino}",
title = "{Lempel--Ziv} Data Compression on Parallel and
Distributed Systems",
journal = j-ALGORITHMS-BASEL,
volume = "4",
number = "3",
pages = "183--199",
month = sep,
year = "2011",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a4030183",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/4/3/183",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 29 July 2011 / Revised: 23 August 2011 /
Accepted: 30 August 2011 / Published: 14 September
2011",
}
@InProceedings{Dube:2011:USS,
author = "D. Dub{\'e}",
title = "On the Use of Stronger Synchronization to Boost
Compression by Substring Enumeration",
crossref = "Storer:2011:DDC",
pages = "454--454",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.58",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749511",
acknowledgement = ack-nhfb,
}
@InProceedings{Fan:2011:NTS,
author = "Yuhua Fan and Jia Wang and Jun Sun",
title = "On Natural Type Selection in Universal Multiple
Description Coding",
crossref = "Storer:2011:DDC",
pages = "273--282",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.34",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749485",
acknowledgement = ack-nhfb,
}
@Article{Feng:2011:SRI,
author = "Wu-Chi Feng and Thanh Dang and John Kassebaum and Tim
Bauman",
title = "Supporting region-of-interest cropping through
constrained compression",
journal = j-TOMCCAP,
volume = "7",
number = "3",
pages = "17:1--17:??",
month = aug,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2000486.2000491",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Mon Sep 5 17:00:22 MDT 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Ferragina:2011:OPT,
author = "Paolo Ferragina and Igor Nitto and Rossano Venturini",
title = "On Optimally Partitioning a Text to Improve Its
Compression",
journal = j-ALGORITHMICA,
volume = "61",
number = "1",
pages = "51--74",
month = sep,
year = "2011",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-010-9437-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Fri Jun 17 18:57:04 MDT 2011",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=61&issue=1;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=61&issue=1&spage=51",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@InProceedings{Ferreira:2011:SWU,
author = "A. Ferreira and A. Oliveira and M. Figueiredo",
title = "Sliding Window Update Using Suffix Arrays",
crossref = "Storer:2011:DDC",
pages = "456--456",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.60",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749513",
acknowledgement = ack-nhfb,
}
@Article{Filgueira:2011:ACE,
author = "Rosa Filgueira and David E. Singh and Jes{\'u}s
Carretero and Alejandro Calder{\'o}n and F{\'e}lix
Garc{\'\i}a",
title = "{Adaptive-CoMPI}: Enhancing {MPI}-Based Applications'
Performance and Scalability by using Adaptive
Compression",
journal = j-IJHPCA,
volume = "25",
number = "1",
pages = "93--114",
month = feb,
year = "2011",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342010373486",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Tue Sep 6 15:14:36 MDT 2011",
bibsource = "http://hpc.sagepub.com/content/25/1.toc;
http://hpc.sagepub.com/content/by/year;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
URL = "http://hpc.sagepub.com/content/25/1/93.full.pdf+html",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "http://hpc.sagepub.com/content/by/year",
onlinedate = "July 26, 2010",
}
@InProceedings{Fu:2011:CMV,
author = "Changjun Fu and Xiangyang Ji and Qionghai Dai",
title = "Compressed Multi-view Imaging with Joint
Reconstruction",
crossref = "Storer:2011:DDC",
pages = "448--448",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.52",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749505",
acknowledgement = ack-nhfb,
}
@InProceedings{Gaston:2011:QCM,
author = "B. Gast{\'o}n and J. Pujol and M. Villanueva",
title = "Quasi-cyclic Minimum Storage Regenerating Codes for
Distributed Data Compression",
crossref = "Storer:2011:DDC",
pages = "33--42",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.11",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749461",
acknowledgement = ack-nhfb,
}
@InProceedings{Haggag:2011:MEF,
author = "M. N. Haggag and M. El-Sharkawy and G. Fahmy",
title = "Modified Efficient Fast Multiplication-Free Integer
Transformation for the {$2$-D DCT H.265} Standard",
crossref = "Storer:2011:DDC",
pages = "455--455",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.59",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749512",
acknowledgement = ack-nhfb,
}
@PhdThesis{Haley:2011:PCC,
author = "Brent Kreh Haley",
title = "A Pipeline for the Creation, Compression, and Display
of Streamable {$3$D} Motion Capture Based Skeletal
Animation Data",
type = "{Ph.D.} thesis",
school = "The Ohio State University",
address = "Columbus, OH, USA",
pages = "158",
year = "2011",
ISBN = "1-124-57872-2",
ISBN-13 = "978-1-124-57872-9",
LCCN = "????",
bibdate = "Fri Feb 1 08:42:55 MST 2013",
bibsource = "http://search.proquest.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://search.proquest.com/docview/863205140",
acknowledgement = ack-nhfb,
advisor = "Matt Lewis and Raghu Machiraju",
classification = "0984: Computer science",
committee-member = "Parent, Rick",
department = "Computer Science and Engineering",
dissertation-thesis-number = "3451742",
subject = "Computer science",
}
@InProceedings{Holub:2011:LDC,
author = "J. Holub and J. {\v{R}}ezn{\'\i}{\v{c}}ek and F.
{\v{S}}imek",
title = "Lossless Data Compression Testbed: {ExCom} and {Prague
Corpus}",
crossref = "Storer:2011:DDC",
pages = "457--457",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.61",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749514",
acknowledgement = ack-nhfb,
}
@InProceedings{Hon:2011:CDM,
author = "Wing-Kai Hon and Tsung-Han Ku and R. Shah and S. V.
Thankachan and J. S. Vitter",
title = "Compressed Dictionary Matching with One Error",
crossref = "Storer:2011:DDC",
pages = "113--122",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.18",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749469",
acknowledgement = ack-nhfb,
}
@InProceedings{Hon:2011:CPS,
author = "Wing-Kai Hon and M. Patil and R. Shah and S. V.
Thankachan",
title = "Compressed Property Suffix Trees",
crossref = "Storer:2011:DDC",
pages = "123--132",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.19",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749470",
acknowledgement = ack-nhfb,
}
@Article{Hoobin:2011:RLZ,
author = "Christopher Hoobin and Simon J. Puglisi and Justin
Zobel",
title = "Relative {Lempel--Ziv} factorization for efficient
storage and retrieval of {Web} collections",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "5",
number = "3",
pages = "265--273",
month = nov,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.14778/2078331.2078341",
ISSN = "2150-8097",
bibdate = "Sat Mar 24 07:52:09 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Compression techniques that support fast random access
are a core component of any information system. Current
state-of-the-art methods group documents into
fixed-sized blocks and compress each block with a
general-purpose adaptive algorithm such as gzip. Random
access to a specific document then requires
decompression of a block. The choice of block size is
critical: it trades between compression effectiveness
and document retrieval times. In this paper we present
a scalable compression method for large document
collections that allows fast random access. We build a
representative sample of the collection and use it as a
dictionary in a LZ77-like encoding of the rest of the
collection, relative to the dictionary. We demonstrate
on large collections, that using a dictionary as small
as 0.1\% of the collection size, our algorithm is
dramatically faster than previous methods, and in
general gives much better compression.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@InProceedings{Hou:2011:CIC,
author = "Xin Hou and K. S. Gurumoorthy and A. Rajwade",
title = "Color Image Compression Using a Learned Dictionary of
Pairs of Orthonormal Bases",
crossref = "Storer:2011:DDC",
pages = "458--458",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.62",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749515",
acknowledgement = ack-nhfb,
}
@Article{Hsu:2011:DET,
author = "Chun-Lung Hsu and Yu-Sheng Huang and Ming-Da Chang and
Hung-Yen Huang",
title = "Design of an Error-Tolerance Scheme for Discrete
Wavelet Transform in {JPEG} 2000 Encoder",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "5",
pages = "628--638",
month = may,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.239",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 29 10:26:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Hu:2011:IPA,
author = "Yichuan Hu and Jianzhong Zhang and Farooq Khan and
Ying Li",
title = "Improving {PPM} Algorithm Using Dictionaries",
crossref = "Storer:2011:DDC",
pages = "459--459",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.63",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749516",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@InProceedings{Ingber:2011:DLS,
author = "A. Ingber and Y. Kochman",
title = "The Dispersion of Lossy Source Coding",
crossref = "Storer:2011:DDC",
pages = "53--62",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.13",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749463",
acknowledgement = ack-nhfb,
}
@Article{Inoue:2011:TCD,
author = "Hiroaki Inoue and Junya Yamada and Hideyuki Yoneda and
Katsumi Togawa and Masato Motomura and Koichiro
Furuta",
title = "Test compression for dynamically reconfigurable
processors",
journal = j-TRETS,
volume = "4",
number = "4",
pages = "40:1--40:??",
month = dec,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2068716.2068726",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Fri Mar 16 16:20:35 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "We present the world's first test compression
technique that features automation of compression rules
for test time reduction on dynamically reconfigurable
processors. Evaluations on an actual 40-nm product show
that our technique achieves a 2.7 times compression
ratio for original configuration information (better
than does GZIP), the peak decompression bandwidth of
1.6 GB/s, and 2.7 times shorter test times.",
acknowledgement = ack-nhfb,
articleno = "40",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@InProceedings{Jimenez-Rodriguez:2011:PEJ,
author = "L. Jim{\'e}nez-Rodr{\'\i}guez and F.
Aul{\'\i}-Llin{\'a}s and M. W. Marcellin and J.
Serra-Sagrist{\`a}",
title = "Pre-encoded {JPEG2000} Video Transmission in a
Video-on-Demand Scenario",
crossref = "Storer:2011:DDC",
pages = "460--460",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.64",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749517",
acknowledgement = ack-nhfb,
}
@InProceedings{Khalid:2011:WAH,
author = "Azra Khalid and Uzma Afsheen and Saad Umer Baig",
booktitle = "International Conference on Graphic and Image
Processing ({ICGIP} 2011)",
title = "Wavelet analysis and high quality {JPEG2000}
compression using {Daubechies} wavelet",
publisher = pub-SPIE,
address = pub-SPIE:adr,
month = oct,
year = "2011",
DOI = "https://doi.org/10.1117/12.913401",
bibdate = "Sat Mar 10 14:29:20 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@InProceedings{Kieffer:2011:AOS,
author = "J. C. Kieffer and J. Marcos",
title = "Advances in Optimal Structured Source Code Design",
crossref = "Storer:2011:DDC",
pages = "13--22",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.9",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749459",
acknowledgement = ack-nhfb,
}
@InProceedings{Kim:2011:QLM,
author = "Jong-Nam Kim and Won-Hee Kim and Tae-Il Jung",
title = "Quassi Lossless Motion Estimation Algorithm Using Fast
Elimination of Checking Points",
crossref = "Storer:2011:DDC",
pages = "461--461",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.65",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749518",
acknowledgement = ack-nhfb,
}
@Article{Kinsman:2011:TOT,
author = "Adam B. Kinsman and Nicola Nicolici",
title = "Trade-Offs in Test Data Compression and Deterministic
{X}-Masking of Responses",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "4",
pages = "498--507",
month = apr,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.124",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 29 10:26:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Kitakami:2011:ERM,
author = "M. Kitakami and T. Ebihara",
title = "Error Recovery Method for {PPM} Compressed Data",
crossref = "Storer:2011:DDC",
pages = "462--462",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.66",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749519",
acknowledgement = ack-nhfb,
keywords = "prediction by partial matching (PPM) data compression
algorithm",
}
@Article{Klein:2011:CMD,
author = "Shmuel T. Klein and Dana Shapira",
title = "Compressed Matching in Dictionaries",
journal = j-ALGORITHMS-BASEL,
volume = "4",
number = "1",
pages = "61--74",
month = mar,
year = "2011",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a4010061",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/4/1/61",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Shmuel T. Klein/0000-0002-9478-3303",
pubdates = "Received: 30 January 2011 / Revised: 2 March 2011 /
Accepted: 17 March 2011 / Published: 22 March 2011",
}
@InProceedings{Klein:2011:SDM,
author = "S. T. Klein and D. Shapira",
title = "The String-to-Dictionary Matching Problem",
crossref = "Storer:2011:DDC",
pages = "143--152",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.21",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749472",
acknowledgement = ack-nhfb,
}
@InProceedings{Kulekci:2011:CCM,
author = "M. O{\u{g}}uzhan K{\"u}lekci",
title = "Compressed Context Modeling for Text Compression",
crossref = "Storer:2011:DDC",
pages = "373--382",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.44",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749495",
acknowledgement = ack-nhfb,
}
@InProceedings{Lahsini:2011:DVC,
author = "C. Lahsini and S. Zaibi and R. Pyndiah and A.
Bouallegue",
title = "Distributed Video Coding in Pixel Domain Using Spatial
Correlation at the Decoder",
crossref = "Storer:2011:DDC",
pages = "463--463",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.67",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749520",
acknowledgement = ack-nhfb,
}
@InProceedings{Lai:2011:ADM,
author = "Zhongyuan Lai and Zhen Zuo and Zhe Wang and Wenyu
Liu",
title = "Accurate Distortion Measurement Using Analytical Model
for the {B}-Spline-Based Shape Coding",
crossref = "Storer:2011:DDC",
pages = "465--465",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.69",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749522",
acknowledgement = ack-nhfb,
}
@InProceedings{Lai:2011:HAD,
author = "Zhongyuan Lai and Zhen Zuo and Zhe Wang and Wenyu
Liu",
title = "A Hybrid Admissible Distortion Checking Algorithm for
the {B}-Spline-Based Operational Rate-Distortion
Optimal Shape Coding",
crossref = "Storer:2011:DDC",
pages = "464--464",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.68",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749521",
acknowledgement = ack-nhfb,
}
@InProceedings{Lechner:2011:SGC,
author = "G. Lechner and R. Timo and L. Ong",
title = "Sparse Graph Codes for the Two-Way Relay Network with
Correlated Sources",
crossref = "Storer:2011:DDC",
pages = "466--466",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.70",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749523",
acknowledgement = ack-nhfb,
}
@Article{Lin:2011:EPB,
author = "Yih-Lon Lin and Ming-Sheng Wu",
title = "An edge property-based neighborhood region search
strategy for fractal image compression",
journal = j-COMPUT-MATH-APPL,
volume = "62",
number = "1",
pages = "310--318",
month = jul,
year = "2011",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2011.05.011",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122111003993",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Lin:2011:RLC,
author = "Yu-Hsun Lin and Ja-Ling Wu",
title = "Rendering Lossless Compression of Depth Image",
crossref = "Storer:2011:DDC",
pages = "467--467",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.71",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749524",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2011:FBC,
author = "Xiao Lin Liu and Chong Luo and Feng Wu",
title = "Formulating Binary Compressive Sensing Decoding with
Asymmetrical Property",
crossref = "Storer:2011:DDC",
pages = "213--222",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.28",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749479",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2011:JST,
author = "Jiaying Liu and Yongjin Cho and Zongming Guo",
title = "Joint Spatial-Temporal Layer Bit Allocation with
{S}-Domain Dependent {R-D} Modeling",
crossref = "Storer:2011:DDC",
pages = "468--468",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.72",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749525",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2011:TRL,
author = "Xianming Liu and Debin Zhao and Ruiqin Xiong and Siwei
Ma and Wen Gao and Huifang Sun",
title = "Transductive Regression with Local and Global
Consistency for Image Super-Resolution",
crossref = "Storer:2011:DDC",
pages = "173--182",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.24",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749475",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2011:VEI,
author = "Shaoli Liu and Ling Li and Yunji Chen and Tianshi
Chen",
title = "Video Encoding without Integer-Pel Motion Estimation",
crossref = "Storer:2011:DDC",
pages = "469--469",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.73",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749526",
acknowledgement = ack-nhfb,
}
@InProceedings{Lohrey:2011:TSC,
author = "M. Lohrey and S. Maneth and R. Mennicke",
title = "Tree Structure Compression with {RePair}",
crossref = "Storer:2011:DDC",
pages = "353--362",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.42",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749493",
acknowledgement = ack-nhfb,
}
@InProceedings{Mao:2011:AOS,
author = "M. Z. Mao and R. M. Gray and T. Linder",
title = "On Asymptotically Optimal Stationary Source Codes for
{IID} Sources",
crossref = "Storer:2011:DDC",
pages = "3--12",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.8",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749458",
acknowledgement = ack-nhfb,
}
@InProceedings{Martinez-Enriquez:2011:LTG,
author = "E. Mart{\'\i}nez-Enr{\'\i}quez and A. Ortega",
title = "Lifting Transforms on Graphs for Video Coding",
crossref = "Storer:2011:DDC",
pages = "73--82",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.15",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749465",
acknowledgement = ack-nhfb,
}
@InProceedings{Matela:2011:EJE,
author = "Ji{\v{r}}{\'\i} Matela and V{\'\i}t Rus{\v{n}}{\'a}k
and Petr Holub",
title = "Efficient {JPEG2000} {EBCOT} Context Modeling for
Massively Parallel Architectures",
crossref = "Storer:2011:DDC",
pages = "423--432",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.49",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749500",
acknowledgement = ack-nhfb,
}
@MastersThesis{Mistereggen:2011:CSR,
author = "Eirik Mistereggen",
title = "Compression of {Short Read} data sets",
type = "{Masteroppgave i informatikk}",
publisher = "E. Mistereggen",
school = "Institutt for informatikk, Universitetet i Oslo",
address = "Oslo, Norway",
year = "2011",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
remark = "Masteroppgave i informatikk - Universitetet i Oslo,
2011.",
}
@InProceedings{Moreno:2011:ICB,
author = "J. Moreno and X. Otazu",
title = "Image Coder Based on {Hilbert} Scanning of Embedded
{QuadTrees}",
crossref = "Storer:2011:DDC",
pages = "470--470",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.74",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749527",
acknowledgement = ack-nhfb,
}
@InProceedings{Mun:2011:RRB,
author = "Sungkwang Mun and J. E. Fowler",
title = "Residual Reconstruction for Block-Based Compressed
Sensing of Video",
crossref = "Storer:2011:DDC",
pages = "183--192",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.25",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749476",
acknowledgement = ack-nhfb,
}
@InProceedings{Munoz-Gomez:2011:INF,
author = "Juan Mu{\~n}oz-G{\'o}mez and Joan Bartrina-Rapesta and
Michael W. Marcellin and Joan Serra-Sagrist{\`a}",
title = "Influence of Noise Filtering in Coding Computed
Tomography with {JPEG2000}",
crossref = "Storer:2011:DDC",
pages = "413--422",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.48",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749499",
acknowledgement = ack-nhfb,
}
@Article{Olano:2011:ETV,
author = "M. Olano and D. Baker and W. Griffin and J. Barczak",
title = "Efficient Textures: Variable Bit Rate {GPU} Texture
Decompression",
journal = j-CGF,
volume = "30",
number = "4",
pages = "1299--1308",
month = jun,
year = "2011",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2011.01989.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:28:36 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "19 Jul 2011",
}
@InProceedings{Pereira:2011:CBA,
author = "R. Pereira and K. Breitman",
title = "A Cloud Based Architecture for Improving Video
Compression Time Efficiency: The Split \& Merge
Approach",
crossref = "Storer:2011:DDC",
pages = "471--471",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.75",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749528",
acknowledgement = ack-nhfb,
}
@Article{Popa:2011:SCG,
author = "Ionu{\d{t}} Popa",
title = "{SE}-Compression: a Generalization of Dictionary-Based
Compression",
journal = j-COMP-J,
volume = "54",
number = "11",
pages = "1876--1881",
month = nov,
year = "2011",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxr046",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Oct 28 10:35:35 MDT 2011",
bibsource = "http://comjnl.oxfordjournals.org/content/54/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "May 17, 2011",
}
@InProceedings{Prochazka:2011:BOD,
author = "Petr Proch{\'a}zka and Jan Holub",
title = "Block-Oriented Dense Compressor",
crossref = "Storer:2011:DDC",
pages = "472--472",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.76",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749529",
acknowledgement = ack-nhfb,
}
@InProceedings{Pugh:2011:DQO,
author = "M. Pugh and B. D. Rao",
title = "Distributed Quantization of Order Statistics with
Applications to {CSI} Feedback",
crossref = "Storer:2011:DDC",
pages = "323--332",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.39",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749490",
acknowledgement = ack-nhfb,
}
@Article{Qi:2011:UHC,
author = "Zhao-Hui Qi and Ling Li and Xiao-Qin Qi",
title = "Using {Huffman} coding method to visualize and analyze
{DNA} sequences",
journal = j-J-COMPUT-CHEM,
volume = "32",
number = "15",
pages = "3233--3240",
day = "30",
month = nov,
year = "2011",
CODEN = "JCCHDD",
DOI = "https://doi.org/10.1002/jcc.21906",
ISSN = "0192-8651 (print), 1096-987X (electronic)",
ISSN-L = "0192-8651",
bibdate = "Thu Nov 29 14:55:36 MST 2012",
bibsource = "http://www.interscience.wiley.com/jpages/0192-8651;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputchem2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Chemistry",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1096-987X",
onlinedate = "26 Aug 2011",
}
@InProceedings{Ramirez-Javega:2011:VLS,
author = "F. Ramirez-Javega and M. Lamarca",
title = "Variable-Length Source Compression Using Successive
Refinement and Non-linear Graph-Based Codes",
crossref = "Storer:2011:DDC",
pages = "473--473",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.77",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749530",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2011:AQD,
author = "Y. A. Reznik",
title = "An Algorithm for Quantization of Discrete Probability
Distributions",
crossref = "Storer:2011:DDC",
pages = "333--342",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.40",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749491",
acknowledgement = ack-nhfb,
}
@InProceedings{Reznik:2011:CSW,
author = "Y. A. Reznik",
title = "Coding of Sets of Words",
crossref = "Storer:2011:DDC",
pages = "43--52",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.12",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749462",
acknowledgement = ack-nhfb,
}
@InProceedings{Rhim:2011:CDHa,
author = "Joong Bum Rhim and L. R. Varshney and V. K. Goyal",
title = "Collaboration in Distributed Hypothesis Testing with
Quantized Prior Probabilities",
crossref = "Storer:2011:DDC",
pages = "303--312",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.37",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749488",
acknowledgement = ack-nhfb,
}
@InProceedings{Rhim:2011:CDHb,
author = "Joong Bum Rhim and L. R. Varshney and V. K. Goyal",
title = "Conflict in Distributed Hypothesis Testing with
Quantized Prior Probabilities",
crossref = "Storer:2011:DDC",
pages = "313--322",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.38",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749489",
acknowledgement = ack-nhfb,
}
@InProceedings{Richter:2011:DBR,
author = "T. Richter",
title = "Deadzone Based Rate Allocation for {JPEG XR}",
crossref = "Storer:2011:DDC",
pages = "474--474",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.78",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749531",
acknowledgement = ack-nhfb,
}
@InProceedings{Sartipi:2011:EED,
author = "M. Sartipi and R. Fletcher",
title = "Energy-Efficient Data Acquisition in Wireless Sensor
Networks Using Compressed Sensing",
crossref = "Storer:2011:DDC",
pages = "223--232",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.29",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749480",
acknowledgement = ack-nhfb,
}
@InProceedings{Schneider:2011:SRP,
author = "J. Schneider",
title = "Set Reordering for Paletted Data",
crossref = "Storer:2011:DDC",
pages = "475--475",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.79",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749532",
acknowledgement = ack-nhfb,
}
@Article{Schwartz:2011:IFI,
author = "William Robson Schwartz and Helio Pedrini",
title = "Improved Fractal Image Compression Based on Robust
Feature Descriptors",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "11",
number = "4",
pages = "571--587",
month = oct,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467811004251",
ISSN = "0219-4678",
bibdate = "Wed Feb 8 18:48:57 MST 2012",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Seo:2011:CDM,
author = "Jaewoo Seo and Geoffrey Irving and J. P. Lewis and
Junyong Noh",
title = "Compression and direct manipulation of complex
blendshape models",
journal = j-TOG,
volume = "30",
number = "6",
pages = "164:1--164:??",
month = dec,
year = "2011",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2070781.2024198",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Mon Dec 19 15:59:18 MST 2011",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "We present a method to compress complex blendshape
models and thereby enable interactive,
hardware-accelerated animation of these models. Facial
blendshape models in production are typically large in
terms of both the resolution of the model and the
number of target shapes. They are represented by a
single huge blendshape matrix, whose size presents a
storage burden and prevents real-time processing. To
address this problem, we present a new matrix
compression scheme based on a hierarchically
semi-separable (HSS) representation with matrix block
reordering. The compressed data are also suitable for
parallel processing. An efficient GPU implementation
provides very fast feedback of the resulting
animation.",
acknowledgement = ack-nhfb,
articleno = "164",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@InProceedings{Sezer:2011:RLD,
author = "O. G. Sezer and R. Cohen and A. Vetro",
title = "Robust Learning of {$2$-D} Separable Transforms for
Next-Generation Video Coding",
crossref = "Storer:2011:DDC",
pages = "63--72",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.14",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749464",
acknowledgement = ack-nhfb,
}
@Article{Sharafeddine:2011:LAC,
author = "Sanaa Sharafeddine and Rakan Maddah",
title = "A lightweight adaptive compression scheme for
energy-efficient mobile-to-mobile file sharing
applications",
journal = j-J-NETW-COMPUT-APPL,
volume = "34",
number = "1",
pages = "52--61",
month = jan,
year = "2011",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2010.09.006",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:49 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001682",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@InProceedings{Shayevitz:2011:GEC,
author = "O. Shayevitz",
title = "Graph Entropy Characterization of Relay-Assisted
Zero-Error Source Coding with Side Information",
crossref = "Storer:2011:DDC",
pages = "243--252",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.31",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749482",
acknowledgement = ack-nhfb,
}
@InProceedings{Shen:2011:EDV,
author = "Yun-Chung Shen and Han-Ping Cheng and Ja-Ling Wu",
title = "An Efficient Distributed Video Coding with
Parallelized Design for Concurrent Computing",
crossref = "Storer:2011:DDC",
pages = "476--476",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.80",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749533",
acknowledgement = ack-nhfb,
}
@InProceedings{Soatto:2011:CRB,
author = "S. Soatto and A. Chiuso",
title = "Controlled Recognition Bounds for Scaling and
Occlusion Channels",
crossref = "Storer:2011:DDC",
pages = "477--477",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.81",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749534",
acknowledgement = ack-nhfb,
}
@InProceedings{Sun:2011:SQR,
author = "J. Z. Sun and V. K. Goyal",
title = "Scalar Quantization for Relative Error",
crossref = "Storer:2011:DDC",
pages = "293--302",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.36",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749487",
acknowledgement = ack-nhfb,
}
@InProceedings{Suzuki:2011:UMG,
author = "J. Suzuki",
title = "The Universal Measure for General Sources and Its
Application to {MDL\slash Bayesian} Criteria",
crossref = "Storer:2011:DDC",
pages = "478--478",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.82",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749535",
acknowledgement = ack-nhfb,
}
@Article{Syahrul:2011:CTA,
author = "E. Syahrul and J. Dubois and V. Vajnovszki",
title = "Combinatorial transforms: Applications in lossless
image compression",
journal = j-J-DISCR-MATH-SCI-CRYPTO,
volume = "14",
number = "2",
pages = "129--147",
month = apr,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1080/09720529.2011.10698328",
ISSN = "0972-0529",
ISSN-L = "0972-0529",
bibdate = "Wed Oct 31 12:02:24 MDT 2012",
bibsource = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072;
http://www.iospress.nl/journal/journal-of-discrete-mathematical-sciences-and-cryptography/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jdiscrmathscicrypto.bib",
URL = "http://www.connectjournals.com/achivestoc.php?bookmark=CJ-003072&volume=14&issue_id=02",
acknowledgement = ack-nhfb,
ajournal = "J. Discr. Math. Sci. Crypto.",
fjournal = "Journal of Discrete Mathematical Sciences and
Cryptography",
}
@InProceedings{Timo:2011:TWR,
author = "R. Timo and L. Ong and G. Lechner",
title = "The Two-Way Relay Network with Arbitrarily Correlated
Sources and an Orthogonal {MAC}",
crossref = "Storer:2011:DDC",
pages = "253--262",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.32",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749483",
acknowledgement = ack-nhfb,
}
@InProceedings{Tokdemir:2011:PPD,
author = "S. Tokdemir and S. Belkasim",
title = "Parallel Processing of {DCT} on {GPU}",
crossref = "Storer:2011:DDC",
pages = "479--479",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.95",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749536",
acknowledgement = ack-nhfb,
}
@InProceedings{Tramel:2011:VCS,
author = "E. W. Tramel and J. E. Fowler",
title = "Video Compressed Sensing with Multihypothesis",
crossref = "Storer:2011:DDC",
pages = "193--202",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.26",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749477",
acknowledgement = ack-nhfb,
}
@InProceedings{Vaishnav:2011:NCE,
author = "M. Vaishnav and A. Sharma and A. K. Tiwari",
title = "A Novel Computationally Efficient Motion Compensation
Method Based on Pixel by Pixel Prediction",
crossref = "Storer:2011:DDC",
pages = "480--480",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.83",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749537",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2011:LGT,
author = "Ching Ming Wang and J. Shol-Dickstein and I.
To{\v{s}}i{\'c} and B. A. Olshausen",
title = "{Lie} Group Transformation Models for Predictive Video
Coding",
crossref = "Storer:2011:DDC",
pages = "83--92",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.93",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749466",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2011:PQC,
author = "Liangjun Wang and Xiaolin Wu and Guangming Shi",
title = "Progressive Quantization of Compressive Sensing
Measurements",
crossref = "Storer:2011:DDC",
pages = "233--242",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.30",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749481",
acknowledgement = ack-nhfb,
}
@Article{Wang:2011:SRB,
author = "Jin Wang and Yunhui Shi and Dehui Kong and Wenpeng
Ding and Chunjing Li and Baocai Yin",
title = "Sparse representation based down-sampling image
compression",
journal = j-J-COMPUT-APPL-MATH,
volume = "236",
number = "5",
pages = "675--683",
day = "1",
month = oct,
year = "2011",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2011.06.025",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:24:38 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S037704271100361X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@InProceedings{Wei:2011:TSB,
author = "Hai Wei and S. Zabuawala and J. Yadegar and J. de la
Cruz and H. J. Gonzalez",
title = "Towards the Synergy between Compression and
Content-Based Analysis: a Pattern-Driven Approach",
crossref = "Storer:2011:DDC",
pages = "481--481",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.84",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749538",
acknowledgement = ack-nhfb,
}
@InProceedings{Wu:2011:HFI,
author = "Xiaolin Wu and Jiantao Zhou and Heng Wang",
title = "High-Fidelity Image Compression for High-Throughput
and Energy-Efficient Cameras",
crossref = "Storer:2011:DDC",
pages = "433--442",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.50",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749501",
acknowledgement = ack-nhfb,
}
@Article{Wu:2011:SAS,
author = "Hongzhi Wu and Julie Dorsey and Holly Rushmeier",
title = "Surface Appearance: a Sparse Parametric Mixture Model
for {BTF} Compression, Editing and Rendering",
journal = j-CGF,
volume = "30",
number = "2",
pages = "465--473",
month = apr,
year = "2011",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2011.01890.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:28:23 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "28 Apr 2011",
}
@Article{Xie:2011:ULD,
author = "Ningde Xie and Guiqiang Dong and Tong Zhang",
title = "Using Lossless Data Compression in Data Storage
Systems: Not for Saving Space",
journal = j-IEEE-TRANS-COMPUT,
volume = "60",
number = "3",
pages = "335--345",
month = mar,
year = "2011",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2010.150",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Jun 29 10:26:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Xiong:2011:AID,
author = "Ruiqin Xiong",
title = "Adaptive Image Deblurring via {Tanner} Graph
Representation and Belief Propagation",
crossref = "Storer:2011:DDC",
pages = "482--482",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.85",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749539",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2011:FRD,
author = "Jiayi Xu and S. Dumitrescu",
title = "Fast {R-D} Optimal Packetization of Embedded
Bitstreams into Independent Source Packets",
crossref = "Storer:2011:DDC",
pages = "283--292",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.35",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749486",
acknowledgement = ack-nhfb,
}
@InProceedings{Xu:2011:IBP,
author = "Yang Xu and Hongkai Xiong and Y. F. Zheng",
title = "Inferring {BP} Priority Order Using {$5$D} Tensor
Voting for Inpainting-Based Macroblock Prediction",
crossref = "Storer:2011:DDC",
pages = "483--483",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.86",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749540",
acknowledgement = ack-nhfb,
}
@InProceedings{Yang:2011:AQD,
author = "Chun-Ling Yang and Dong-Qin Xiao and Lai-Man Po and
Wang-Hua Mo",
title = "Adaptive Quantization in {DCT} Domain for Distributed
Video Coding",
crossref = "Storer:2011:DDC",
pages = "484--484",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.87",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749541",
acknowledgement = ack-nhfb,
}
@Article{Yang:2011:CPM,
author = "Xiaoyuan Yang and Yan Shi and Wanlu Zhou",
title = "Construction of parameterizations of masks for tight
wavelet frames with two symmetric\slash antisymmetric
generators and applications in image compression and
denoising",
journal = j-J-COMPUT-APPL-MATH,
volume = "235",
number = "8",
pages = "2112--2136",
day = "15",
month = feb,
year = "2011",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/j.cam.2010.10.009",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:24:32 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042710005650",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@InProceedings{Yang:2011:ENA,
author = "Meng Yang and Xuguang Lan and Nanning Zheng",
title = "Explicit Network-Adaptive Robust Multiple Description
Coding",
crossref = "Storer:2011:DDC",
pages = "485--485",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.88",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749542",
acknowledgement = ack-nhfb,
}
@InProceedings{Yoshida:2011:PCP,
author = "S. Yoshida and T. Kida",
title = "On Performance of Compressed Pattern Matching on {VF}
Codes",
crossref = "Storer:2011:DDC",
pages = "486--486",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.89",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749543",
acknowledgement = ack-nhfb,
}
@InProceedings{Yu:2011:EVC,
author = "Like Yu and Feng Dai and Yongdong Zhang and Shouxun
Lin",
title = "Efficient Video Coding Optimization Using a Novel
Perceptual Distortion Model",
crossref = "Storer:2011:DDC",
pages = "487--487",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.90",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749544",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2011:BRR,
author = "Guoqiang Zhang and W. B. Kleijn",
title = "Bounding the Rate Region of the Two-Terminal Vector
{Gaussian CEO} Problem",
crossref = "Storer:2011:DDC",
pages = "488--488",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.91",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749545",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2011:CSR,
author = "Xinyu Zhang and Zhuoyuan Chen and Jiangtao Wen and
Jianwei Ma and Yuxing Han and J. Villasenor",
title = "A Compressive Sensing Reconstruction Algorithm for
Trinary and Binary Sparse Signals Using Pre-mapping",
crossref = "Storer:2011:DDC",
pages = "203--212",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.27",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749478",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2011:RRV,
author = "Guoqiang Zhang",
title = "On the Rate Region of the Vector {Gaussian} One-Helper
Distributed Source-Coding Problem",
crossref = "Storer:2011:DDC",
pages = "263--272",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.33",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749484",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2011:SDF,
author = "Yongbing Zhang and Haoqian Wang and Debin Zhao",
title = "Up-sampling Dependent Frame Rate Reduction for Low
Bit-Rate Video Coding",
crossref = "Storer:2011:DDC",
pages = "489--489",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.92",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749546",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhao:2011:CIP,
author = "Hua Zhao and Songfeng Lu",
title = "Compressed Index for Property Matching",
crossref = "Storer:2011:DDC",
pages = "133--142",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.20",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749471",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhu:2011:ITB,
author = "Lingchen Zhu and Hongkai Xiong",
title = "Iterative Thresholding-Based Sparse Directional
Representation for Efficient Low Bit-Rate Embedded
Video Coding",
crossref = "Storer:2011:DDC",
pages = "93--102",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.16",
bibdate = "Tue Feb 5 11:58:09 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5749467",
acknowledgement = ack-nhfb,
}
@InProceedings{Akyol:2012:CRQ,
author = "E. Akyol and K. Rose",
title = "On Constrained Randomized Quantization",
crossref = "Storer:2012:DDC",
pages = "72--81",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.15",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189238",
acknowledgement = ack-nhfb,
}
@InProceedings{Akyol:2012:TOM,
author = "E. Akyol and K. Rose",
title = "Towards Optimality in Multiterminal Transform Coding",
crossref = "Storer:2012:DDC",
pages = "247--256",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.32",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189256",
acknowledgement = ack-nhfb,
}
@Article{Al-Hafeedh:2012:CIB,
author = "Anisa Al-Hafeedh and Maxime Crochemore and Lucian Ilie
and Evguenia Kopylova and W. F. Smyth and German
Tischler and Munina Yusufu",
title = "A comparison of index-based {Lempel--Ziv LZ77}
factorization algorithms",
journal = j-COMP-SURV,
volume = "45",
number = "1",
pages = "5:1--5:??",
month = nov,
year = "2012",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2379776.2379781",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Dec 6 10:55:59 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Since 1977, when Lempel and Ziv described a kind of
string factorization useful for text compression, there
has been a succession of algorithms proposed for
computing ``LZ factorization''. In particular, there
have been several recent algorithms proposed that
extend the usefulness of LZ factorization, for example,
to the calculation of maximal repetitions. In this
article, we provide an overview of these new algorithms
and compare their efficiency in terms of their usage of
time and space.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Al-Shammary:2012:RAS,
author = "Dhiah Al-Shammary and Ibrahim Khalil",
title = "Redundancy-aware {SOAP} messages compression and
aggregation for enhanced performance",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "1",
pages = "365--381",
month = jan,
year = "2012",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2011.08.004",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480451100172X",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Amir:2012:QDP,
author = "Amihood Amir and Yonatan Aumann and Avivit Levy and
Yuri Roshko",
title = "Quasi-distinct parsing and optimal compression
methods",
journal = j-THEOR-COMP-SCI,
volume = "422",
number = "1",
pages = "1--14",
day = "9",
month = mar,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.11.022",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Feb 2 08:49:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511009418",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{An:2012:EDP,
author = "Baik Song An and Manhee Lee and Ki Hwan Yum and Eun
Jung Kim",
title = "Efficient Data Packet Compression for Cache Coherent
Multiprocessor Systems",
crossref = "Storer:2012:DDC",
pages = "129--138",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.21",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189244",
acknowledgement = ack-nhfb,
}
@Article{Andujar:2012:ACT,
author = "C. Andujar",
title = "Adaptive Compression of Texture Pyramids",
journal = j-CGF,
volume = "31",
number = "6",
pages = "1973--1983",
month = sep,
year = "2012",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2012.03077.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:29:24 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "15 May 2012",
}
@InProceedings{Anonymous:2012:CP,
author = "Anonymous",
title = "The {Capocelli Prize}",
crossref = "Storer:2012:DDC",
pages = "vi--vi",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.5",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189302",
acknowledgement = ack-nhfb,
}
@TechReport{Anonymous:2012:SHS,
author = "Anonymous",
key = "FIPS-180-4",
title = "{Secure Hash Standard (SHS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 180-4",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "v + 30",
month = mar,
year = "2012",
bibdate = "Wed Jan 30 09:27:44 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf;
http://csrc.nist.gov/publications/PubsFIPS.html#fips180-4",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Federal Information
Processing Standards; hash algorithm; hash function;
message digest; Secure Hash Standard",
}
@Article{Arroyuelo:2012:SLZ,
author = "Diego Arroyuelo and Gonzalo Navarro and Kunihiko
Sadakane",
title = "Stronger {Lempel--Ziv} Based Compressed Text
Indexing",
journal = j-ALGORITHMICA,
volume = "62",
number = "1--2",
pages = "54--101",
month = feb,
year = "2012",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-010-9443-8",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Apr 11 09:16:50 MDT 2012",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=62&issue=1;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=62&issue=1&spage=54",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@InProceedings{Auli-Llinas:2012:EQD,
author = "F. Aul{\'\i}-Llin{\'a}s and M. W. Marcellin and L.
Jimenez-Rodriguez and I. Blanes and J.
Serra-Sagrist{\`a}",
title = "Embedded Quantizer Design for Low Rate Lossy Image
Coding",
crossref = "Storer:2012:DDC",
pages = "89--98",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.17",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189240",
acknowledgement = ack-nhfb,
}
@InProceedings{Bai:2012:MDV,
author = "Huihui Bai and Mengmeng Zhang and Meiqin Liu and
Anhong Wang and Yao Zhao",
title = "Multiple Description Video Coding Using Macro Block
Level Correlation of Inter-\slash Intra-Descriptions",
crossref = "Storer:2012:DDC",
pages = "389--389",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.45",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189270",
acknowledgement = ack-nhfb,
}
@InProceedings{Barbero:2012:SRS,
author = "J. M. Barbero",
title = "Scalable {RAID} Storage Based on the Structure of
Multimedia File",
crossref = "Storer:2012:DDC",
pages = "390--390",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.46",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189271",
acknowledgement = ack-nhfb,
}
@InProceedings{Bartrina-Rapesta:2012:MIC,
author = "J. Bartrina-Rapesta and M. Navarro and J. Munoz-Gomez
and M. W. Marcellin and J. Ruberte and J.
Serra-Sagrist{\`a}",
title = "{MicroCT} Image Coding Based on Air Filtering",
crossref = "Storer:2012:DDC",
pages = "391--391",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.47",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189272",
acknowledgement = ack-nhfb,
}
@InProceedings{Beirami:2012:MAU,
author = "A. Beirami and F. Fekri",
title = "Memory-Assisted Universal Source Coding",
crossref = "Storer:2012:DDC",
pages = "392--392",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.48",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189273",
acknowledgement = ack-nhfb,
}
@InProceedings{Bottcher:2012:FID,
author = "S. Bottcher and A. Bultmann and R. Hartel and J.
Schlussler",
title = "Fast Insertion and Deletion in Compressed Texts",
crossref = "Storer:2012:DDC",
pages = "393--393",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.50",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189274",
acknowledgement = ack-nhfb,
}
@Article{Bredies:2012:TVB,
author = "K. Bredies and M. Holler",
title = "A Total Variation-Based {JPEG} Decompression Model",
journal = j-SIAM-J-IMAGING-SCI,
volume = "5",
number = "1",
pages = "366--393",
month = "????",
year = "2012",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/110833531",
ISSN = "1936-4954",
bibdate = "Tue Oct 30 14:27:32 MDT 2012",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2012",
}
@InProceedings{Brisaboa:2012:CDB,
author = "N. R. Brisaboa and G. de Bernardo and G. Navarro",
title = "Compressed Dynamic Binary Relations",
crossref = "Storer:2012:DDC",
pages = "52--61",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.13",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189236",
acknowledgement = ack-nhfb,
}
@Article{Cantone:2012:ABM,
author = "Domenico Cantone and Simone Faro and Emanuele
Giaquinta",
title = "Adapting {Boyer--Moore}-Like Algorithms for Searching
{Huffman} Encoded Texts",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "23",
number = "2",
pages = "343--356",
month = feb,
year = "2012",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054112400163",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Sat Mar 24 15:27:30 MDT 2012",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@InProceedings{Changjun:2012:PVE,
author = "Fu Changjun and Ji Xiangyang and Yongbing Zhang and
Qionghai Dai",
title = "Packet Video Error Concealment Based on Compressed
Sensing and Regularized Least Squares",
crossref = "Storer:2012:DDC",
pages = "394--394",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.74",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189275",
acknowledgement = ack-nhfb,
}
@InProceedings{Changjun:2012:SFS,
author = "Fu Changjun and Ji Xiangyang and Zhang Yongbing and
Dai Qionghai",
title = "A Single Frame Super-Resolution Method Based on Matrix
Completion",
crossref = "Storer:2012:DDC",
pages = "297--306",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.36",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189261",
acknowledgement = ack-nhfb,
}
@InProceedings{Chen:2012:CGT,
author = "Minjie Chen and Mantao Xu and P. Franti",
title = "Compression of {GPS} Trajectories",
crossref = "Storer:2012:DDC",
pages = "62--71",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.14",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189237",
acknowledgement = ack-nhfb,
}
@InProceedings{Claude:2012:DES,
author = "F. Claude and P. K. Nicholson and D. Seco",
title = "Differentially Encoded Search Trees",
crossref = "Storer:2012:DDC",
pages = "357--366",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.42",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189267",
acknowledgement = ack-nhfb,
}
@Article{Cozzolino:2012:EEM,
author = "Angelo Cozzolino and Francesco Flammini and Valentina
Galli and Mariangela Lamberti",
title = "Evaluating the Effects of {MJPEG} Compression on
Motion Tracking in Metro Railway Surveillance",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7517",
pages = "142--154",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33140-4_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33140-4_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33140-4",
book-URL = "http://www.springerlink.com/content/978-3-642-33140-4",
fjournal = "Lecture Notes in Computer Science",
}
@Book{Davis:2012:LAP,
author = "Ernest Davis",
title = "Linear algebra and probability for computer science
applications",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "xviii + 413",
year = "2012",
ISBN = "1-4665-0155-3 (hardcover)",
ISBN-13 = "978-1-4665-0155-3 (hardcover)",
LCCN = "QA76.9.M35 D38 2012",
bibdate = "Tue May 5 16:14:05 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Taking a computer scientist's point of view, this
classroom-tested text gives an introduction to linear
algebra and probability theory, including some basic
aspects of statistics. It discusses examples of
applications from a wide range of areas of computer
science, including computer graphics, computer vision,
robotics, natural language processing, web search,
machine learning, statistical analysis, game playing,
graph theory, scientific computing, decision theory,
coding, cryptography, network analysis, data
compression, and signal processing. It includes an
extensive discussion of MATLAB, and includes numerous
MATLAB exercises and programming assignments.",
acknowledgement = ack-nhfb,
subject = "Computer science; Mathematics; Algebras, Linear;
Probabilities",
}
@Article{Deng:2012:OAC,
author = "Xi Deng and Yuanyuan Yang",
title = "Online Adaptive Compression in Delay Sensitive
Wireless Sensor Networks",
journal = j-IEEE-TRANS-COMPUT,
volume = "61",
number = "10",
pages = "1429--1442",
month = oct,
year = "2012",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2011.174",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Wed Aug 29 17:46:04 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Deng:2012:VIA,
author = "Aidong Deng and Jianeng Tang and Li Zhao and Cairong
Zou",
title = "The variable-interval arithmetic coding using
asymptotic deterministic randomness for data
compression and encryption",
journal = j-J-STAT-COMPUT-SIMUL,
volume = "82",
number = "10",
pages = "1545--1555",
year = "2012",
CODEN = "JSCSAJ",
DOI = "https://doi.org/10.1080/00949655.2011.587423",
ISSN = "0094-9655 (print), 1026-7778 (electronic), 1563-5163",
ISSN-L = "0094-9655",
bibdate = "Tue Apr 22 09:13:07 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jstatcomputsimul.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Statistical Computation and Simulation",
journal-URL = "http://www.tandfonline.com/loi/gscs20",
}
@Article{deRooij:2012:ARD,
author = "Steven de Rooij and Paul M. B. Vitanyi",
title = "Approximating Rate-Distortion Graphs of Individual
Data: Experiments in Lossy Compression and Denoising",
journal = j-IEEE-TRANS-COMPUT,
volume = "61",
number = "3",
pages = "395--407",
month = mar,
year = "2012",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2011.25",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Feb 3 07:35:03 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{DiLillo:2012:CBT,
author = "Antonella {Di Lillo} and Ajay Daptardar and Kevin
Thomas and James A. Storer and Giovanni Motta",
title = "Compression-Based Tools for Navigation with an Image
Database",
journal = j-ALGORITHMS-BASEL,
volume = "5",
number = "1",
pages = "1--17",
month = mar,
year = "2012",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a5010001",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/5/1/1",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 23 August 2011 / Revised: 6 December 2011 /
Accepted: 19 December 2011 / Published: 10 January
2012",
}
@InProceedings{Duan:2012:RDA,
author = "Yizhou Duan and Jun Sun and Zongming Guo",
title = "Rate-Distortion Analysis and Modeling of Dead-Zone
Plus Uniform Threshold Scalar Quantization for
Generalized {Gaussian} Random Variables",
crossref = "Storer:2012:DDC",
pages = "395--395",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.51",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189276",
acknowledgement = ack-nhfb,
}
@InProceedings{Erdozain:2012:ODE,
author = "A. Erdozain and P. M. Crespo and B. Beferull-Lozano",
title = "Optimum Distortion Exponent in Parallel Fading
Channels by Using Analog Joint Source-Channel Coding
Schemes",
crossref = "Storer:2012:DDC",
pages = "277--286",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.35",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189259",
acknowledgement = ack-nhfb,
}
@InProceedings{Etezadi:2012:PRT,
author = "F. Etezadi and A. Khisti and M. D. Trott",
title = "Prospicient Real-Time Coding of {Markov} Sources over
Burst Erasure Channels: Lossless Case",
crossref = "Storer:2012:DDC",
pages = "267--276",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.34",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189258",
acknowledgement = ack-nhfb,
}
@InProceedings{Fan:2012:DSV,
author = "Xiaopeng Fan and Feng Wu and Debin Zhao and O. C. Au
and Wen Gao",
title = "Distributed Soft Video Broadcast ({DCAST}) with
Explicit Motion",
crossref = "Storer:2012:DDC",
pages = "199--208",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.27",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189251",
acknowledgement = ack-nhfb,
}
@InProceedings{Farina:2012:ISI,
author = "A. Farina and A. Ordonez and J. R. Parama",
title = "Indexing Sequences of {IEEE 754} Double Precision
Numbers",
crossref = "Storer:2012:DDC",
pages = "367--376",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.43",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189268",
acknowledgement = ack-nhfb,
}
@Article{Fenwick:2012:PCE,
author = "P. M. Fenwick",
title = "{PPM} compression without escapes",
journal = j-SPE,
volume = "42",
number = "2",
pages = "255--260",
month = feb,
year = "2012",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.1070",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Jan 31 08:08:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software---Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "25 Apr 2011",
}
@InProceedings{Forchhammer:2012:RAB,
author = "S. Forchhammer and M. Salmistraro and K. J. Larsen and
Xin Huang and Huynh Van Luong",
title = "Rate-Adaptive {BCH} Coding for {Slepian--Wolf} Coding
of Highly Correlated Sources",
crossref = "Storer:2012:DDC",
pages = "237--246",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.31",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189255",
acknowledgement = ack-nhfb,
}
@Article{Fout:2012:APB,
author = "Nathaniel Fout and Kwan-Liu Ma",
title = "An Adaptive Prediction-Based Approach to Lossless
Compression of Floating-Point Volume Data",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "18",
number = "12",
pages = "2295--2304",
month = dec,
year = "2012",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2012.194",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Mon Oct 22 07:55:05 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@InProceedings{Georgiadis:2012:SAV,
author = "G. Georgiadis and S. Soatto",
title = "Scene-Aware Video Modeling and Compression",
crossref = "Storer:2012:DDC",
pages = "149--158",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.23",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189246",
acknowledgement = ack-nhfb,
}
@InProceedings{Gera:2012:FCF,
author = "Y. Gera and Zhe Wang and S. Simon and T. Richter",
title = "Fast and Context-Free Lossless Image Compression
Algorithm Based on {JPEG-LS}",
crossref = "Storer:2012:DDC",
pages = "396--396",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.64",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189277",
acknowledgement = ack-nhfb,
}
@Article{Grassi:2012:KSP,
author = "Elena Grassi and Federico Di Gregorio and Ivan
Molineris",
title = "{KungFQ}: a Simple and Powerful Approach to Compress
{{\tt fastq}} Files",
journal = j-TCBB,
volume = "9",
number = "6",
pages = "1837--1842",
month = nov,
year = "2012",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2012.123",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Wed Dec 19 17:33:56 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Nowadays storing data derived from deep sequencing
experiments has become pivotal and standard compression
algorithms do not exploit in a satisfying manner their
structure. A number of reference-based compression
algorithms have been developed but they are less
adequate when approaching new species without fully
sequenced genomes or nongenomic data. We developed a
tool that takes advantages of {\tt fastq}
characteristics and encodes them in a binary format
optimized in order to be further compressed with
standard tools (such as {\tt gzip} or {\tt lzma}). The
algorithm is straightforward and does not need any
external reference file, it scans the {\tt fastq} only
once and has a constant memory requirement. Moreover,
we added the possibility to perform lossy compression,
losing some of the original information (IDs and/or
qualities) but resulting in smaller files; it is also
possible to define a quality cutoff under which
corresponding base calls are converted to $N$. We
achieve 2.82 to 7.77 compression ratios on various {\tt
fastq} files without losing information and 5.37 to
8.77 losing IDs, which are often not used in common
analysis pipelines. In this paper, we compare the
algorithm performance with known tools, usually
obtaining higher compression levels.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@MastersThesis{Haukeli:2012:LDC,
author = "Martin Haukeli",
title = "Lossless data compression using cellular automata",
type = "{Masteroppgave i informatikk}",
publisher = "M. Haukeli",
school = "Institutt for informatikk, Universitetet i Oslo",
address = "Oslo, Norway",
pages = "97",
year = "2012",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
remark = "Masteroppgave i informatikk - Universitetet i Oslo,
2012. Komprimering informasjonsteori digital data.",
}
@Article{Hautamaki:2012:RBC,
author = "Ville Hautam{\"a}ki",
title = "Review of {{\booktitle{A Concise Introduction to Data
Compression}} by David Salomon}",
journal = j-SIGACT,
volume = "43",
number = "2",
pages = "9--10",
month = jun,
year = "2012",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2261417.2261420",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Tue Nov 6 17:32:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@InProceedings{Hernandez-Cabronero:2012:DMI,
author = "M. Hernandez-Cabronero and J. Munoz-Gomez and I.
Blanes and M. W. Marcellin and J. Serra-Sagrist{\`a}",
title = "{DNA} Microarray Image Coding",
crossref = "Storer:2012:DDC",
pages = "32--41",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.11",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189234",
acknowledgement = ack-nhfb,
}
@Article{Hernandez-Cabronero:2012:SSC,
author = "Miguel Hern{\'a}ndez-Cabronero and Ian Blanes and
Michael W. Marcellin and Joan Serra-Sagrist{\`a}",
title = "Standard and Specific Compression Techniques for {DNA}
Microarray Images",
journal = j-ALGORITHMS-BASEL,
volume = "5",
number = "1",
pages = "30--49",
month = mar,
year = "2012",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a5010030",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/5/1/30",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 14 November 2011 / Revised: 22 January 2012
/ Accepted: 22 January 2012 / Published: 14 February
2012",
}
@InProceedings{Herrero:2012:NPS,
author = "R. Herrero and V. Ingle",
title = "A New Preprocessing Stage for Compression of
Ultraspectral Images",
crossref = "Storer:2012:DDC",
pages = "397--397",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.52",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189278",
acknowledgement = ack-nhfb,
}
@InProceedings{Hijazi:2012:MAD,
author = "H. Hijazi and A. Diallo and M. Kieffer and L. Liberti
and C. Weidmann",
title = "A {MILP} Approach for Designing Robust Variable-Length
Codes Based on Exact Free Distance Computation",
crossref = "Storer:2012:DDC",
pages = "257--266",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.33",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189257",
acknowledgement = ack-nhfb,
}
@Article{Imaizumi:2012:KDS,
author = "Shoko Imaizumi and Masaaki Fujiyoshi and Hitoshi
Kiya",
title = "A Key Derivation Scheme for Hierarchical Access
Control to {JPEG} 2000 Coded Images",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7088",
pages = "180--191",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25346-1_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:23:58 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25346-1_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25346-1",
book-URL = "http://www.springerlink.com/content/978-3-642-25346-1",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jenkins:2012:ADL,
author = "John Jenkins and Isha Arkatkar and Sriram
Lakshminarasimhan and Neil Shah and Eric R. Schendel",
title = "Analytics-Driven Lossless Data Compression for Rapid
In-situ Indexing, Storing, and Querying",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7447",
pages = "16--30",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32597-7_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:47 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32597-7_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32597-7",
book-URL = "http://www.springerlink.com/content/978-3-642-32597-7",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Ji:2012:ECB,
author = "Wen Ji and P. Frossard and Yiqiang Chen",
title = "{EXIT} Chart-Based Side Information Refinement for
{Wyner--Ziv} Video Coding",
crossref = "Storer:2012:DDC",
pages = "209--218",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.28",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189252",
acknowledgement = ack-nhfb,
}
@InProceedings{Jiang:2012:CTI,
author = "Wenfei Jiang and Fan Zhang and L. J. Latecki and Zhibo
Chen and Yi Hu",
title = "Coefficient Thresholding with Image Restoration",
crossref = "Storer:2012:DDC",
pages = "399--399",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.54",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189280",
acknowledgement = ack-nhfb,
}
@InProceedings{Jiang:2012:EPC,
author = "Wenfei Jiang and Jiang Tian and Kangying Cai and Fan
Zhang and Tao Luo",
title = "Efficient Progressive Compression of {$3$D} Points by
Maximizing Tangent-Plane Continuity",
crossref = "Storer:2012:DDC",
pages = "398--398",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.53",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189279",
acknowledgement = ack-nhfb,
}
@Article{Joseph:2012:EQP,
author = "A. Benjamin Joseph and Baskaran Ramachandran",
title = "Enhanced Quality Preserved Image Compression Technique
Using Edge Assisted Wavelet Based Interpolation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7135",
pages = "146--153",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29280-4_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29280-4_16/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29280-4",
book-URL = "http://www.springerlink.com/content/978-3-642-29280-4",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kang:2012:SLC,
author = "Xiangui Kang and Xianyu Xu and Anjie Peng and Wenjun
Zeng",
title = "Scalable Lossy Compression for Pixel-Value Encrypted
Images",
crossref = "Storer:2012:DDC",
pages = "400--400",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.55",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189281",
acknowledgement = ack-nhfb,
}
@InProceedings{Karkkainen:2012:STB,
author = "J. Karkkainen and D. Kempa and S. J. Puglisi",
title = "Slashing the Time for {BWT} Inversion",
crossref = "Storer:2012:DDC",
pages = "99--108",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.18",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189241",
acknowledgement = ack-nhfb,
keywords = "Burrows--Wheeler Transform (BWT)",
}
@Article{Karwowski:2012:IAA,
author = "Damian Karwowski",
title = "Improved Adaptive Arithmetic Coding for {HEVC} Video
Compression Technology",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7594",
pages = "121--128",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33564-8_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012j.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33564-8_15/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33564-8",
book-URL = "http://www.springerlink.com/content/978-3-642-33564-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kasirajan:2012:NDA,
author = "Priya Kasirajan and Carl Larsen and S. Jagannathan",
title = "A new data aggregation scheme via adaptive compression
for wireless sensor networks",
journal = j-TOSN,
volume = "9",
number = "1",
pages = "5:1--5:??",
month = nov,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2379799.2379804",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Sun May 5 09:18:51 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Data aggregation is necessary for extending the
network lifetime of wireless sensor nodes with limited
processing and power capabilities, since energy
expended in transmitting a single data bit would be at
least several orders of magnitude higher when compared
to that needed for a 32-bit computation. Therefore, in
this article, a novel nonlinear adaptive pulse coded
modulation-based compression (NADPCMC) scheme is
proposed for data aggregation in a wireless sensor
network (WSN). The NADPCMC comprises of two
estimators-one at the source or transmitter and the
second one at the destination node. The estimator at
the source node approximates the data value for each
sample. The difference between the data sample and its
estimate is quantized and transmitted to the next hop
node instead of the actual data sample, thus reducing
the amount of data transmission and rending energy
savings. A similar estimator at the next hop node or
base station reconstructs the original data. It is
demonstrated that repeated application of the NADPCMC
scheme along the route in a WSN results in data
aggregation. Satisfactory performance of the proposed
scheme in terms of distortion, compression ratio, and
energy efficiency and in the presence of estimation and
quantization errors for data aggregation is
demonstrated using the Lyapunov approach. Then the
performance of the proposed scheme is contrasted with
the available compression schemes in an NS-2
environment through several benchmarking datasets.
Simulation and hardware results demonstrate that almost
50\% energy savings with low distortion levels below
5\% and low overhead are observed when compared to no
compression. Iteratively applying the proposed
compression scheme at the cluster head nodes along the
routes over the network yields an additional
improvement of 20\% in energy savings per aggregation
with an overall distortion below 8\%.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Klonatos:2012:TOS,
author = "Yannis Klonatos and Thanos Makatos and Manolis
Marazakis and Michail D. Flouris and Angelos Bilas",
title = "Transparent Online Storage Compression at the
Block-Level",
journal = j-TOS,
volume = "8",
number = "2",
pages = "5:1--5:??",
month = may,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2180905.2180906",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Tue Nov 6 18:17:34 MST 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "In this work, we examine how transparent block-level
compression in the I/O path can improve both the space
efficiency and performance of online storage. We
present ZBD, a block-layer driver that transparently
compresses and decompresses data as they flow between
the file-system and storage devices. Our system
provides support for variable-size blocks, metadata
caching, and persistence, as well as block allocation
and cleanup. ZBD targets maintaining high performance,
by mitigating compression and decompression overheads
that can have a significant impact on performance by
leveraging modern multicore CPUs through explicit work
scheduling. We present two case-studies for
compression. First, we examine how our approach can be
used to increase the capacity of SSD-based caches, thus
increasing their cost-effectiveness. Then, we examine
how ZBD can improve the efficiency of online disk-based
storage systems. We evaluate our approach in the Linux
kernel on a commodity server with multicore CPUs, using
PostMark, SPECsfs2008, TPC-C, and TPC-H. Preliminary
results show that transparent online block-level
compression is a viable option for improving effective
storage capacity, it can improve I/O performance up to
80\% by reducing I/O traffic and seek distance, and has
a negative impact on performance, up to 34\%, only when
single-thread I/O latency is critical. In particular,
for SSD-based caching, our results indicate that, in
line with current technology trends, compressed caching
trades off CPU utilization for performance and enhances
SSD efficiency as a storage cache up to 99\%.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@InProceedings{Knoll:2012:MLP,
author = "B. Knoll and N. de Freitas",
title = "A Machine Learning Perspective on Predictive Coding
with {PAQ8}",
crossref = "Storer:2012:DDC",
pages = "377--386",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.44",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189269",
acknowledgement = ack-nhfb,
}
@InProceedings{Koc:2012:MPD,
author = "B. Koc and Z. Arnavut",
title = "A Modified Pseudo-distance Technique for Lossless
Compression on Color-Mapped Images",
crossref = "Storer:2012:DDC",
pages = "401--401",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.56",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189282",
acknowledgement = ack-nhfb,
}
@InProceedings{Koloda:2012:SEC,
author = "J. Koloda and J. {\O}stergaard and S. H. Jensen and A.
M. Peinado and V. Sanchez",
title = "Sequential Error Concealment for Video\slash Images by
Weighted Template Matching",
crossref = "Storer:2012:DDC",
pages = "159--168",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.24",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189247",
acknowledgement = ack-nhfb,
}
@Article{Kulekci:2012:SBW,
author = "M. Oguzhan K{\"u}lekci",
title = "On scrambling the {Burrows--Wheeler} transform to
provide privacy in lossless compression",
journal = j-COMPUT-SECUR,
volume = "31",
number = "1",
pages = "26--32",
month = feb,
year = "2012",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:27 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404811001416",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "https://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Lai:2012:IVS,
author = "Yi Lai and Xuguang Lan and Yuehu Liu and Nanning
Zheng",
title = "Improved View Synthesis with Depth Reliability Maps",
crossref = "Storer:2012:DDC",
pages = "402--402",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.57",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189283",
acknowledgement = ack-nhfb,
}
@InProceedings{Lee:2012:CSR,
author = "S. S. Lee and M. Shishibori and C. Y. Han",
title = "Compression of Search Range of {VP}-Tree for
Multimedia Data Retrieval Applications",
crossref = "Storer:2012:DDC",
pages = "403--403",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.58",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189284",
acknowledgement = ack-nhfb,
}
@Article{Lemire:2012:RRB,
author = "Daniel Lemire and Owen Kaser and Eduardo Gutarra",
title = "Reordering rows for better compression: {Beyond} the
lexicographic order",
journal = j-TODS,
volume = "37",
number = "3",
pages = "20:1--20:??",
month = aug,
year = "2012",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2338626.2338633",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Sep 6 09:52:39 MDT 2012",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Sorting database tables before compressing them
improves the compression rate. Can we do better than
the lexicographical order? For minimizing the number of
runs in a run-length encoding compression scheme, the
best approaches to row-ordering are derived from
traveling salesman heuristics, although there is a
significant trade-off between running time and
compression. A new heuristic, Multiple Lists, which is
a variant on Nearest Neighbor that trades off
compression for a major running-time speedup, is a good
option for very large tables. However, for some
compression schemes, it is more important to generate
long runs rather than few runs. For this case, another
novel heuristic, Vortex, is promising. We find that we
can improve run-length encoding up to a factor of 3
whereas we can improve prefix coding by up to 80\%:
these gains are on top of the gains due to
lexicographically sorting the table. We prove that the
new row reordering is optimal (within 10\%) at
minimizing the runs of identical values within columns,
in a few cases.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@InProceedings{Lenhardt:2012:GHS,
author = "R. Lenhardt and J. Alakuijala",
title = "{Gipfeli} --- High Speed Compression Algorithm",
crossref = "Storer:2012:DDC",
pages = "109--118",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.19",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189242",
acknowledgement = ack-nhfb,
}
@Article{Lin:2012:FAH,
author = "Yih-Kai Lin and Shu-Chien Huang and Cheng-Hsing Yang",
title = "A fast algorithm for {Huffman} decoding based on a
recursion {Huffman} tree",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "4",
pages = "974--980",
month = apr,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.11.1019",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Feb 17 07:42:13 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002925",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Liu:2012:LMO,
author = "Zhenyu Liu and Dongsheng Wang and Junwei Zhou and T.
Ikenaga",
title = "{Lagrangian} Multiplier Optimization Using {Markov}
Chain Based Rate and Piecewise Approximated Distortion
Models",
crossref = "Storer:2012:DDC",
pages = "404--404",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.59",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189285",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2012:MSS,
author = "Xianming Liu and Deming Zhai and Guangtao Zhai and
Debin Zhao and Ruiqin Xiong and Wen Gao",
title = "Multi-scale Spatial Error Concealment via Hybrid
{Bayesian} Regression",
crossref = "Storer:2012:DDC",
pages = "169--178",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.25",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189248",
acknowledgement = ack-nhfb,
}
@Book{Lopes:2012:ICS,
author = "Dorsey Lopes",
title = "Important concepts in signal processing, image
processing and data compression",
publisher = "University Publications",
address = "Delhi, India",
pages = "????",
year = "2012",
ISBN = "81-323-3604-6",
ISBN-13 = "978-81-323-3604-4",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
subject = "Image processing; Signal processing; Data compression
(Computer science)",
}
@InProceedings{Lu:2012:SBM,
author = "Weizhi Lu and K. Kpalma and J. Ronsin",
title = "Sparse Binary Matrices of {LDPC} Codes for Compressed
Sensing",
crossref = "Storer:2012:DDC",
pages = "405--405",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.60",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189286",
acknowledgement = ack-nhfb,
}
@Book{MacCormick:2012:NAC,
author = "John MacCormick",
title = "Nine algorithms that changed the future: the ingenious
ideas that drive today's computers",
publisher = pub-PRINCETON,
address = pub-PRINCETON:adr,
pages = "x + 2 + 219",
year = "2012",
ISBN = "0-691-14714-0 (hardcover), 0-691-15819-3 (paperback)",
ISBN-13 = "978-0-691-14714-7 (hardcover), 978-0-691-15819-8
(paperback)",
LCCN = "QA76 .M21453 2012",
bibdate = "Tue May 5 17:16:06 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
https://www.math.utah.edu/pub/tex/bib/pagerank.bib;
z3950.loc.gov:7090/Voyager",
note = "With a foreword by Christopher M. Bishop.",
URL = "http://press.princeton.edu/chapters/s9528.pdf;
http://www.jstor.org/stable/10.2307/j.ctt7t71s",
abstract = "Every day, we use our computers to perform remarkable
feats. A simple web search picks out a handful of
relevant needles from the world's biggest haystack: the
billions of pages on the World Wide Web. Uploading a
photo to Facebook transmits millions of pieces of
information over numerous error-prone network links,
yet somehow a perfect copy of the photo arrives intact.
Without even knowing it, we use public-key cryptography
to transmit secret information like credit card
numbers; and, we use digital signatures to verify the
identity of the websites we visit. How do our computers
perform these tasks with such ease?\par
This is the first book to answer that question in
language anyone can understand, revealing the
extraordinary ideas that power our PCs, laptops, and
smartphones. Using vivid examples, John MacCormick
explains the fundamental ``tricks'' behind nine types
of computer algorithms, including artificial
intelligence (where we learn about the ``nearest
neighbor trick'' and ``twenty questions trick''),
Google's famous PageRank algorithm (which uses the
``random surfer trick''), data compression, error
correction, and much more.\par
These revolutionary algorithms have changed our world:
this book unlocks their secrets, and lays bare the
incredible ideas that our computers use every day.",
acknowledgement = ack-nhfb,
author-dates = "1972--",
subject = "Computer science; Computer algorithms; Artificial
intelligence",
tableofcontents = "Foreword / ix \\
1. Introduction: What Are the Extraordinary Ideas
Computers Use Every Day? / 1 \\
2. Search Engine Indexing: Finding Needles in the
World's Biggest Haystack / 10 \\
3. PageRank: The Technology That Launched Google / 24
\\
4. Public Key Cryptography: Sending Secrets on a
Postcard 38 \\
5. Error-Correcting Codes: Mistakes That Fix Themselves
/ 60 \\
6. Pattern Recognition: Learning from Experience / 80
\\
7. Data Compression: Something for Nothing / 105 \\
8. Databases: The Quest for Consistency / 122 \\
9. Digital Signatures: Who Really Wrote This Software?
/ 149 \\
10. What Is Computable? / 174 \\
11. Conclusion: More Genius at Your Fingertips? / 199
\\
Acknowledgments / 205 \\
Sources and Further Reading / 207 \\
Index / 211",
}
@InProceedings{Malvar:2012:PLC,
author = "H. S. Malvar and G. J. Sullivan",
title = "Progressive-to-Lossless Compression of
Color-Filter-Array Images Using Macropixel
Spectral-Spatial Transformation",
crossref = "Storer:2012:DDC",
pages = "3--12",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.8",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189231",
acknowledgement = ack-nhfb,
}
@Article{Matei:2012:WET,
author = "Basarab Mate{\"\i} and Sylvain Meignen and Anastasia
Zakharova",
title = "On a {(W)ENO}-Type Multiscale Representation Based on
Quincunx Refinement: Application to Image Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "6920",
pages = "473--487",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-27413-8_30",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon Dec 24 07:13:45 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/978-3-642-27413-8_30",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-27413-8",
book-URL = "http://www.springerlink.com/content/978-3-642-27413-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Matela:2012:LGO,
author = "Ji{\v{r}}{\'\i} Matela and Martin {\v{S}}rom and Petr
Holub",
title = "Low {GPU} Occupancy Approach to Fast Arithmetic Coding
in {JPEG2000}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7119",
pages = "136--145",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-25929-6_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012a.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-25929-6_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-25929-6",
book-URL = "http://www.springerlink.com/content/978-3-642-25929-6",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Mathew:2012:HSC,
author = "R. Mathew and P. Zanuttigh and D. Taubman",
title = "Highly Scalable Coding of Depth Maps with Arc
Breakpoints",
crossref = "Storer:2012:DDC",
pages = "42--51",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.12",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189235",
acknowledgement = ack-nhfb,
}
@InProceedings{Mattern:2012:MSD,
author = "C. Mattern",
title = "Mixing Strategies in Data Compression",
crossref = "Storer:2012:DDC",
pages = "337--346",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.40",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189265",
acknowledgement = ack-nhfb,
}
@Article{Mavridis:2012:PTM,
author = "Pavlos Mavridis and Georgios Papaioannou",
title = "Parameterization and Texture Mapping: Texture
Compression using Wavelet Decomposition",
journal = j-CGF,
volume = "31",
number = "7pt1",
pages = "2107--2116",
month = sep,
year = "2012",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2012.03203.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:29:27 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "3 Oct 2012",
}
@Article{Meyer:2012:DPD,
author = "Quirin Meyer and Benjamin Keinert and Gerd Su{\ss}ner
and Marc Stamminger",
title = "Data-Parallel Decompression of Triangle Mesh
Topology",
journal = j-CGF,
volume = "31",
number = "8",
pages = "2541--2553",
month = dec,
year = "2012",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2012.03221.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:29:33 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "4 Oct 2012",
}
@Article{Min:2012:DCT,
author = "Joonki Min and Jookyoung Kim and Youngmi Kwon",
title = "Data Compression Technique for Wireless Sensor
Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7425",
pages = "9--16",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32645-5_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:17 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32645-5_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32645-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32645-5",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mo:2012:TBD,
author = "Shangfeng Mo and Hong Chen and Yinglong Li",
title = "Topology-Based Data Compression in Wireless Sensor
Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7418",
pages = "22--34",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32281-5_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:09 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32281-5_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32281-5",
book-URL = "http://www.springerlink.com/content/978-3-642-32281-5",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Monteagudo-Pereira:2012:ETJ,
author = "J. L. Monteagudo-Pereira and F. Aul{\'\i}-Llin{\'a}s
and J. Serra-Sagrist{\`a} and A. Zabala and J. Maso and
X. Pons",
title = "Enhanced Transmission of {JPEG2000} Imagery through
{JPIP} Proxy and User-Navigation Model",
crossref = "Storer:2012:DDC",
pages = "22--31",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.10",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189233",
acknowledgement = ack-nhfb,
}
@InProceedings{Moreno:2012:PPF,
author = "J. Moreno",
title = "{P$^2$SNR}: Perceptual Full-Reference Image Quality
Assessment for {JPEG2000}",
crossref = "Storer:2012:DDC",
pages = "406--406",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.61",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189287",
acknowledgement = ack-nhfb,
}
@InProceedings{ONeill:2012:ACT,
author = "A. O'Neill and M. Hutter and Wen Shao and P. Sunehag",
title = "Adaptive Context Tree Weighting",
crossref = "Storer:2012:DDC",
pages = "317--326",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.38",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189263",
acknowledgement = ack-nhfb,
}
@InProceedings{Osorio:2012:FCN,
author = "R. R. Osorio and P. Gonzalez",
title = "Fast Construction of Nearly-Optimal Prefix Codes
without Probability Sorting",
crossref = "Storer:2012:DDC",
pages = "407--407",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.62",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189288",
acknowledgement = ack-nhfb,
}
@InProceedings{Pan:2012:SST,
author = "Zhiming Pan and Hongkai Xiong",
title = "Sparse spatio-temporal representation with adaptive
regularized dictionaries for super-resolution based
video coding",
crossref = "Storer:2012:DDC",
pages = "139--148",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.22",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189245",
acknowledgement = ack-nhfb,
}
@Article{Pande:2012:PDP,
author = "Amit Pande and Joseph Zambreno",
title = "{Poly-DWT}: {Polymorphic} wavelet hardware support for
dynamic image compression",
journal = j-TECS,
volume = "11",
number = "1",
pages = "6:1--6:??",
month = mar,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2146417.2146423",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Apr 2 17:42:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Many modern computing applications have been enabled
through the use of real-time multimedia processing.
While several hardware architectures have been proposed
in the research literature to support such primitives,
these fail to address applications whose performance
and resource requirements have a dynamic aspect.
Embedded multimedia systems typically need a power and
computation efficient design in addition to good
compression performance. In this article, we introduce
a Polymorphic Wavelet Architecture (Poly-DWT) as a
crucial building block towards the development of
embedded systems to address such challenges. We
illustrate how our Poly-DWT architecture can
potentially make dynamic resource allocation decisions,
such as the internal bit representation and the
processing kernel, according to the application
requirements. We introduce a filter switching
architecture that allows for dynamic switching between
5/3 and 9/7 wavelet filters and leads to a more power
efficient design. Further, a multiplier-free design
with a low adder requirement demonstrates the potential
of Poly-DWT for embedded systems. Through an FPGA
prototype, we perform a quantitative analysis of our
Poly-DWT architecture, and compare our filter to
existing approaches to illustrate the area and
performance benefits inherent in our approach.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@InProceedings{Porat:2012:CHV,
author = "E. Porat and B. Shalem",
title = "A Cuckoo Hashing Variant with Improved Memory
Utilization and Insertion Time",
crossref = "Storer:2012:DDC",
pages = "347--356",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.41",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189266",
acknowledgement = ack-nhfb,
}
@Article{Qian:2012:LDH,
author = "Zhenxing Qian and Xinpeng Zhang",
title = "Lossless data hiding in {JPEG} bitstream",
journal = j-J-SYST-SOFTW,
volume = "85",
number = "2",
pages = "309--313",
month = feb,
year = "2012",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2011.08.015",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Feb 6 15:39:32 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121211002123",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Qu:2012:ISD,
author = "Zhenhua Qu and Weiqi Luo and Jiwu Huang",
title = "Identifying Shifted Double {JPEG} Compression
Artifacts for Non-intrusive Digital Image Forensics",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7633",
pages = "1--8",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34263-9_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:26:15 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012k.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-34263-9_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-34263-9",
book-URL = "http://www.springerlink.com/content/978-3-642-34263-9",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Quan:2012:NWB,
author = "Jin Quan and W. G. Wee and C. Y. Han",
title = "A New Wavelet Based Image Denoising Method",
crossref = "Storer:2012:DDC",
pages = "408--408",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.63",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189289",
acknowledgement = ack-nhfb,
}
@Book{Rebaza:2012:FCA,
author = "Jorge Rebaza",
title = "A first course in applied mathematics",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xvi + 439",
year = "2012",
ISBN = "1-118-22962-2",
ISBN-13 = "978-1-118-22962-0",
LCCN = "TA342 .R43 2012",
bibdate = "Tue May 5 16:13:00 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathgaz2010.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy1201/2011043340-d.html;
http://www.loc.gov/catdir/enhancements/fy1201/2011043340-t.html;
http://www.loc.gov/catdir/enhancements/fy1210/2011043340-b.html",
abstract = "This book details how applied mathematics involves
predictions, interpretations, analysis, and
mathematical modeling to solve real-world problems. Due
to the broad range of applications, mathematical
concepts and techniques and reviewed throughout,
especially those in linear algebra, matrix analysis,
and differential equations. Some classical definitions
and results from analysis are also discussed and used.
Some applications (postscript fonts, information
retrieval, etc.) are presented at the end of a chapter
as an immediate application of the theory just covered,
while those applications that are discussed in more
detail (ranking web pages, compression, etc.) are
presented in dedicated chapters. A collection of
mathematical models of a slightly different nature,
such as basic discrete mathematics and optimization, is
also provided. Clear proofs of the main theorems
ultimately help to make the statements of the theorems
more understandable, and a multitude of examples follow
important theorems and concepts. In addition, the
author builds material from scratch and thoroughly
covers the theory needed to explain the applications in
full detail, while not overwhelming readers with
unnecessary topics or discussions. In terms of
exercises, the author continuously refers to the real
numbers and results in calculus when introducing a new
topic so readers can grasp the concept of the otherwise
intimidating expressions. By doing this, the author is
able to focus on the concepts rather than the rigor.
The quality, quantity, and varying level of difficulty
of the exercises provides instructors more classroom
flexibility. Topical coverage includes linear algebra;
ranking web pages; matrix factorizations; least
squares; image compression; ordinary differential
equations; dynamical systems; and mathematical
models.",
acknowledgement = ack-nhfb,
author-dates = "1962--",
subject = "Mathematical models; Computer simulation; Mathematics
/ Applied",
tableofcontents = "Preface / xi \\
1. Basics of Linear Algebra / 1 \\
1.1 Notation and Terminology / 1 \\
1.2 Vector and Matrix Norms / 4 \\
1.3 Dot Product and Orthogonality / 8 \\
1.4 Special Matrices / 9 \\
1.5 Vector Spaces / 21 \\
1.6 Linear Independence and Basis / 24 \\
1.7 Orthogonalization and Direct Sums / 30 \\
1.8 Column Space, Row Space and Null Space / 34 \\
1.9 Orthogonal Projections / 43 \\
1.10 Eigenvalues and Eigenvectors / 47 \\
1.11 Similarity / 56 \\
1.12 Bezier Curves Postscripts Fonts / 59 \\
1.13 Final Remarks and Further Reading / 68 \\
2. Ranking Web Pages / 79 \\
2.1 The Power Method / 80 \\
2.2 Stochastic, Irreducible and Primitive Matrices / 84
\\
2.3 Google's PageRank Algorithm / 92 \\
2.4 Alternatives to Power Method / 106 \\
2.5 Final Remarks and Further Reading / 120 \\
3. Matrix Factorizations / 131 \\
3.1 LU Factorization / 132 \\
3.2 QR Factorization / 142 \\
3.3 Singular Value Decomposition (SVD) / 155 \\
3.4 Schur Factorization / 166 \\
3.5 Information Retrieval / 186 \\
3.6 Partition of Simple Substitution Cryptograms / 194
\\
3.7 Final Remarks and Further Reading / 203 \\
4. Least Squares / 215 \\
4.1 Projections and Normal Equations / 215 \\
4.2 Least Squares and QR Factorization / 224 \\
4.3 Lagrange Multipliers / 228 \\
4.4 Final Remarks and Further Reading / 231 \\
5. Image Compression / 235 \\
5.1 Compressing with Discrete Cosine Transform / 236
\\
5.2 Huffman Coding / 260 \\
5.3 Compression with SVD / 267 \\
5.4 Final Remarks and Further Reading / 271 \\
6. Ordinary Differential Equations / 277 \\
6.1 One-Dimensional Differential Equations / 278 \\
6.2 Linear Systems of Differential Equations / 307 \\
6.3 Solutions via Eigenvalues and Eigenvectors / 308
\\
6.4 Fundamentals Matrix Solution / 312 \\
6.5 Final Remarks and Further Reading / 316 \\
7. Dynamical Systems / 325 \\
7.1 Linear Dynamical Systems / 326 \\
7.2 Nonlinear Dynamical Systems / 340 \\
7.3 Predator--Prey Models with Harvesting / 374 \\
7.4 Final Remarks and Further Reading / 385 \\
8. Mathematical Models / 395 \\
8.1 Optimization of a Waste Management System / 396 \\
8.2 Grouping Problem in Networks / 404 \\
8.3 American Cutaneous Leishmaniasis / 410 \\
8.4 Variable Population Interactions / 420 \\
References / 431 \\
Index / 435",
}
@InProceedings{Richter:2012:CJJ,
author = "T. Richter",
title = "Compressing {JPEG 2000} {JPIP} Cache State
Information",
crossref = "Storer:2012:DDC",
pages = "13--21",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.9",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189232",
acknowledgement = ack-nhfb,
}
@InProceedings{Sartipi:2012:LCD,
author = "M. Sartipi",
title = "Low-Complexity Distributed Compression in Wireless
Sensor Networks",
crossref = "Storer:2012:DDC",
pages = "227--236",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.30",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189254",
acknowledgement = ack-nhfb,
}
@Article{Sasaki:2012:DBT,
author = "Yu Sasaki and Lei Wang",
title = "Distinguishers beyond Three Rounds of the
{RIPEMD-128\slash -160} Compression Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7341",
pages = "275--292",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31284-7_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:27 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31284-7_17/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31284-7",
book-URL = "http://www.springerlink.com/content/978-3-642-31284-7",
fjournal = "Lecture Notes in Computer Science",
}
@Book{Sayood:2012:IDC,
author = "Khalid Sayood",
title = "Introduction to data compression",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Fourth",
pages = "xxiii + 740",
year = "2012",
ISBN = "0-12-415796-3, 0-12-415796-3 (e-book)",
ISBN-13 = "978-0-12-415796-5, 978-0-12-415796-5 (e-book)",
LCCN = "QA76.9.D33 S29 2012; TK5102.92 .S39 2012",
bibdate = "Thu Jan 10 08:20:35 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Morgan Kaufmann series in multimedia information and
systems",
URL = "http://www.sciencedirect.com/science/book/9780124157965",
abstract = "Each edition of Introduction to Data Compression has
widely been considered the best introduction and
reference text on the art and science of data
compression, and the fourth edition continues in this
tradition. Data compression techniques and technology
are ever-evolving with new applications in image,
speech, text, audio, and video. The fourth edition
includes all the cutting edge updates the reader will
need during the work day and in class. Khalid Sayood
provides an extensive introduction to the theory
underlying today's compression techniques with detailed
instruction for their applications using several
examples to explain the concepts. Encompassing the
entire field of data compression, Introduction to Data
Compression includes lossless and lossy compression,
Huffman coding, arithmetic coding, dictionary
techniques, context based compression, scalar and
vector quantization. Khalid Sayood provides a working
knowledge of data compression, giving the reader the
tools to develop a complete and concise compression
package upon completion of his book. New content added
to include a more detailed description of the JPEG 2000
standard. New content includes speech coding for
internet applications. Explains established and
emerging standards in depth including JPEG 2000,
JPEG-LS, MPEG-2, H.264, JBIG 2, ADPCM, LPC, CELP, MELP,
and iLBC. Source code provided via companion web site
that gives readers the opportunity to build their own
algorithms, choose and implement techniques in their
own applications.",
acknowledgement = ack-nhfb,
subject = "Data compression (Computer science)",
}
@InProceedings{Seraco:2012:PVQ,
author = "E. P. Seraco and J. G. R. C. Gomes",
title = "On the Performance of Vector Quantization under
Constraint of Complexity Functionals",
crossref = "Storer:2012:DDC",
pages = "409--409",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.65",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189290",
acknowledgement = ack-nhfb,
}
@InProceedings{Shcherbakov:2012:PAR,
author = "I. Shcherbakov and N. Wehn",
title = "A Parallel Adaptive Range Coding Compressor:
Algorithm, {FPGA} Prototype, Evaluation",
crossref = "Storer:2012:DDC",
pages = "119--128",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.20",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189243",
acknowledgement = ack-nhfb,
}
@InProceedings{Shen:2012:PSI,
author = "Yun-Chung Shen and Pin-Shiang Wang and Ja-Ling Wu",
title = "Progressive Side Information Refinement with Non-local
Means Based Denoising Process for {Wyner--Ziv} Video
Coding",
crossref = "Storer:2012:DDC",
pages = "219--226",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.29",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189253",
acknowledgement = ack-nhfb,
}
@Article{Shih:2012:APB,
author = "Y.-T. Shih and C.-S. Chien and C.-Y. Chuang",
title = "An adaptive parameterized block-based singular value
decomposition for image de-noising and compression",
journal = j-APPL-MATH-COMP,
volume = "218",
number = "21",
pages = "10370--10385",
day = "1",
month = jul,
year = "2012",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2012.03.070",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jun 4 08:00:56 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300312003281",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shilane:2012:WOR,
author = "Phlip Shilane and Mark Huang and Grant Wallace and
Windsor Hsu",
title = "{WAN}-optimized replication of backup datasets using
stream-informed delta compression",
journal = j-TOS,
volume = "8",
number = "4",
pages = "13:1--13:??",
month = nov,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2385603.2385606",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Sun May 5 09:02:36 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "Replicating data off site is critical for disaster
recovery reasons, but the current approach of
transferring tapes is cumbersome and error prone.
Replicating across a wide area network (WAN) is a
promising alternative, but fast network connections are
expensive or impractical in many remote locations, so
improved compression is needed to make WAN replication
truly practical. We present a new technique for
replicating backup datasets across a WAN that not only
eliminates duplicate regions of files (deduplication)
but also compresses similar regions of files with delta
compression, which is available as a feature of EMC
Data Domain systems. Our main contribution is an
architecture that adds stream-informed delta
compression to already existing deduplication systems
and eliminates the need for new, persistent indexes.
Unlike techniques based on knowing a file's version or
that use a memory cache, our approach achieves delta
compression across all data replicated to a server at
any time in the past. From a detailed analysis of
datasets and statistics from hundreds of customers
using our product, we achieve an additional 2X
compression from delta compression beyond deduplication
and local compression, which enables customers to
replicate data that would otherwise fail to complete
within their backup window.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@InProceedings{Singla:2012:APS,
author = "A. Singla and J. Shukla and A. K. Tiwari and S. P.
Jaiswal and V. Jakhetiya",
title = "Adaptive Predictor Structures for Lossless Compression
of Videos",
crossref = "Storer:2012:DDC",
pages = "410--410",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.66",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189291",
acknowledgement = ack-nhfb,
}
@Article{Srisooksai:2012:PDC,
author = "Tossaporn Srisooksai and Kamol Keamarungsi and Poonlap
Lamsrichan and Kiyomichi Araki",
title = "Practical data compression in wireless sensor
networks: a survey",
journal = j-J-NETW-COMPUT-APPL,
volume = "35",
number = "1",
pages = "37--59",
month = jan,
year = "2012",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2011.03.001",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:44:09 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804511000555",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Book{Sterne:2012:MMF,
author = "Jonathan Sterne",
title = "{MP3}: the meaning of a format",
publisher = pub-DUKE,
address = pub-DUKE:adr,
pages = "360",
year = "2012",
ISBN = "0-8223-5287-7, 0-8223-5283-4",
ISBN-13 = "978-0-8223-5287-7, 978-0-8223-5283-9",
LCCN = "????",
bibdate = "Sat Jan 19 21:01:40 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
}
@InProceedings{Suzuki:2012:BNS,
author = "J. Suzuki",
title = "{Bayesian} Network Structure Estimation Based on the
{Bayesian\slash MDL} Criteria When Both Discrete and
Continuous Variables Are Present",
crossref = "Storer:2012:DDC",
pages = "307--316",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.37",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189262",
acknowledgement = ack-nhfb,
}
@Article{Uno:2012:BNR,
author = "Takeaki Uno and Ryuhei Uehara and Shin-ichi Nakano",
title = "Bounding the Number of Reduced Trees, Cographs, and
Series-Parallel Graphs by Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7157",
pages = "5--16",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-28076-4_4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:25:16 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-28076-4_4/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-28076-4",
book-URL = "http://www.springerlink.com/content/978-3-642-28076-4",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Veness:2012:CTS,
author = "J. Veness and Kee Siong Ng and M. Hutter and M.
Bowling",
title = "Context Tree Switching",
crossref = "Storer:2012:DDC",
pages = "327--336",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.39",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189264",
acknowledgement = ack-nhfb,
}
@Article{Wang:2012:GSD,
author = "Cong Wang and Hongzhi Wang",
title = "Graph-Structured Data Compression Based on Frequent
Subgraph Contraction",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7419",
pages = "11--18",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-33050-6_2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:22:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-33050-6_2/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-33050-6",
book-URL = "http://www.springerlink.com/content/978-3-642-33050-6",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2012:NFS,
author = "Hui Wang and Anthony T. S. Ho and Xi Zhao",
title = "A Novel Fast Self-restoration Semi-fragile
Watermarking Algorithm for Image Content Authentication
Resistant to {JPEG} Compression",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7128",
pages = "72--85",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-32205-1_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:41 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-32205-1_8/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-32205-1",
book-URL = "http://www.springerlink.com/content/978-3-642-32205-1",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Wendt:2012:ECR,
author = "J. B. Wendt and S. Meguerdichian and H. Noshadi and M.
Potkonjak",
title = "Energy and Cost Reduction in Localized Multisensory
Systems through Application-Driven Compression",
crossref = "Storer:2012:DDC",
pages = "411--411",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.67",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189292",
acknowledgement = ack-nhfb,
}
@Article{Yang:2012:TTP,
author = "Zhuoluo Yang and Jinguo You and Min Zhou",
title = "{TDSC}: a Two-phase Duplicate String Compression
Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7234",
pages = "27--34",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-29426-6_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:18:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-29426-6_5/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-29426-6",
book-URL = "http://www.springerlink.com/content/978-3-642-29426-6",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Ye:2012:OST,
author = "Xinwei Ye and Hongkai Xiong",
title = "Optimal Spatio-Temporal Projections with
Holo-{Kronecker} Compressive Sensing of Video
Acquisition",
crossref = "Storer:2012:DDC",
pages = "412--412",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.68",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189293",
acknowledgement = ack-nhfb,
}
@Article{Yoshizawa:2012:AIS,
author = "Sayuri Yoshizawa and Takao Terano and Atsushi
Yoshikawa",
title = "Assessing the Impact of Student Peer Review in Writing
Instruction by Using the Normalized Compression
Distance",
journal = j-IEEE-TRANS-PROF-COMMUN,
volume = "55",
number = "1",
pages = "85--96",
month = mar,
year = "2012",
CODEN = "IEPCBU",
DOI = "https://doi.org/10.1109/TPC.2011.2172833",
ISSN = "0361-1434 (print), 1558-1500 (electronic)",
ISSN-L = "0361-1434",
bibdate = "Sat Dec 18 11:57:01 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransprofcommun.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Professional Communication",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=47",
}
@InProceedings{Zhang:2012:CAS,
author = "Yongbing Zhang and Xiangyang Ji and Haoqian Wang and
Lei Zhang and Qionghai Dai",
title = "Content Adaptive Subsampling for Stereo Interleaving
Video Coding",
crossref = "Storer:2012:DDC",
pages = "179--188",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.70",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189249",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2012:CSR,
author = "Jian Zhang and Debin Zhao and Chen Zhao and Ruiqin
Xiong and Siwei Ma and Wen Gao",
title = "Compressed Sensing Recovery via Collaborative
Sparsity",
crossref = "Storer:2012:DDC",
pages = "287--296",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.71",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189260",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2012:CSV,
author = "Zhebin Zhang and Ronggang Wang and Chen Zhou and
Yizhou Wang and Wen Gao",
title = "A Compact Stereoscopic Video Representation for {$3$D}
Video Generation and Coding",
crossref = "Storer:2012:DDC",
pages = "189--198",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.26",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189250",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2012:TSB,
author = "Mengmeng Zhang and Huihui Bai",
title = "Temporal Sampling Based Multiple Description Video
Coding for Scenes Switching",
crossref = "Storer:2012:DDC",
pages = "413--413",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.69",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189294",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhou:2012:CMC,
author = "Jiantao Zhou and Xiaolin Wu",
title = "Context Modeling and Correction of Quantization Errors
in Prediction Loop",
crossref = "Storer:2012:DDC",
pages = "82--88",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.16",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189239",
acknowledgement = ack-nhfb,
}
@InProceedings{Zou:2012:PIR,
author = "Bin Zou and Dewu Wang and Ye Zhang and Zhilu Wu",
title = "Phase Information Reserved Polarimetric {SAR} Raw Data
Compression",
crossref = "Storer:2012:DDC",
pages = "414--414",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.49",
bibdate = "Tue Feb 5 12:15:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6189295",
acknowledgement = ack-nhfb,
}
@Article{Andersson:2013:DDS,
author = "M. Andersson and J. Munkberg and T.
Akenine-M{\"o}ller",
title = "Depth and Distance: Stochastic Depth Buffer
Compression using Generalized Plane Encoding",
journal = j-CGF,
volume = "32",
number = "2pt1",
pages = "103--112",
month = may,
year = "2013",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12030",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:29:39 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "7 May 2013",
}
@InProceedings{Andoni:2013:HFU,
author = "Alexandr Andoni and Assaf Goldberger and Andrew
McGregor and Ely Porat",
title = "Homomorphic fingerprints under misalignments:
sketching edit and shift distances",
crossref = "ACM:2013:SPF",
pages = "931--940",
year = "2013",
DOI = "https://doi.org/10.1145/2488608.2488726",
bibdate = "Mon Mar 3 06:30:33 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/stoc2010.bib",
abstract = "Fingerprinting is a widely-used technique for
efficiently verifying that two files are identical.
More generally, linear sketching is a form of lossy
compression (based on random projections) that also
enables the ``dissimilarity'' of non-identical files to
be estimated. Many sketches have been proposed for
dissimilarity measures that decompose coordinate-wise
such as the Hamming distance between alphanumeric
strings, or the Euclidean distance between vectors.
However, virtually nothing is known on sketches that
would accommodate alignment errors. With such errors,
Hamming or Euclidean distances are rendered useless: a
small misalignment may result in a file that looks very
dissimilar to the original file according such
measures. In this paper, we present the first linear
sketch that is robust to a small number of alignment
errors. Specifically, the sketch can be used to
determine whether two files are within a small Hamming
distance of being a cyclic shift of each other.
Furthermore, the sketch is homomorphic with respect to
rotations: it is possible to construct the sketch of a
cyclic shift of a file given only the sketch of the
original file. The relevant dissimilarity measure,
known as the shift distance, arises in the context of
embedding edit distance and our result addressed an
open problem [Question 13 in
Indyk-McGregor-Newman-Onak'11] with a rather surprising
outcome. Our sketch projects a length $n$ file into $
D(n) \cdot \polylog n $ dimensions where $ D(n)l n $ is
the number of divisors of $n$. The striking fact is
that this is near-optimal, i.e., the $ D(n) $
dependence is inherent to a problem that is ostensibly
about lossy compression. In contrast, we then show that
any sketch for estimating the edit distance between two
files, even when small, requires sketches whose size is
nearly linear in $n$. This lower bound addresses a
long-standing open problem on the low distortion
embeddings of edit distance [Question 2.15 in
Naor-Matousek'11, Indyk'01], for the case of linear
embeddings.",
acknowledgement = ack-nhfb,
}
@Article{Andriotis:2013:JSD,
author = "Panagiotis Andriotis and George Oikonomou and Theo
Tryfonas",
title = "{JPEG} steganography detection with {Benford's Law}",
journal = "Digital Investigation",
volume = "9",
number = "3--4",
pages = "246--257",
year = "2013",
DOI = "https://doi.org/10.1016/j.diin.2013.01.005",
ISSN = "1742-2876 (print), 1873-202X (electronic)",
ISSN-L = "1742-2876",
bibdate = "Tue Jan 26 09:03:59 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1742287613000066",
abstract = "In this paper we present a novel approach to the
problem of steganography detection in {JPEG} images by
applying a statistical attack. The method is based on
the empirical Benford's Law and, more specifically, on
its generalized form. We prove and extend the validity
of the logarithmic rule in colour images and introduce
a blind steganographic method which can flag a file as
a suspicious stego-carrier. The proposed method
achieves very high accuracy and speed and is based on
the distributions of the first digits of the quantized
Discrete Cosine Transform coefficients present in
JPEGs. In order to validate and evaluate our algorithm,
we developed steganographic tools which are able to
analyse image files and we subsequently applied them on
the popular Uncompressed Colour Image Database.
Furthermore, we demonstrate that not only can our
method detect steganography but, if certain criteria
are met, it can also reveal which steganographic
algorithm was used to embed data in a {JPEG} file.",
acknowledgement = ack-nhfb,
keywords = "Benford's Law; Data hiding; Generalized Benford's Law;
Quantized DCT coefficients; Quantized {DCT}
coefficients; Steganalysis; Steganography detection",
}
@Article{Arai:2013:MDH,
author = "Kohei Arai",
title = "Method for data hiding based on {LeGall} 5/3
({Cohen--Daubechies--Feauveau}: {CDF} 5/3) wavelet with
data compression and random scanning of secret imagery
data",
journal = j-INT-J-WAVELETS-MULTIRESOLUT-INF-PROCESS,
volume = "11",
number = "4",
pages = "1360006, 18",
year = "2013",
CODEN = "IJWMIP",
DOI = "https://doi.org/10.1142/S0219691313600060",
ISSN = "0219-6913 (print), 1793-690X (electronic)",
ISSN-L = "0219-6913",
MRclass = "94A60 (42C40 65T60 94A08 94A62)",
MRnumber = "3081432",
bibdate = "Wed Mar 7 18:04:36 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Wavelets Multiresolut. Inf. Process.",
fjournal = "International Journal of Wavelets, Multiresolution and
Information Processing",
journal-URL = "https://www.worldscientific.com/worldscinet/ijwmip",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{Cinque:2013:BIC,
author = "Luigi Cinque and Sergio {De Agostino} and Luca
Lombardi",
title = "Binary Image Compression via Monochromatic Pattern
Substitution: Sequential and {Parallel}
Implementations",
journal = j-MATH-COMPUT-SCI,
volume = "7",
number = "2",
pages = "155--166",
month = jun,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-013-0153-x",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Thu Feb 13 09:03:24 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=7&issue=2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
URL = "http://link.springer.com/article/10.1007/s11786-013-0153-x",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Conley:2013:IAB,
author = "Ehud S. Conley and Shmuel T. Klein",
title = "Improved Alignment-Based Algorithm for Multilingual
Text Compression",
journal = j-MATH-COMPUT-SCI,
volume = "7",
number = "2",
pages = "137--153",
month = jun,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-012-0138-1",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Thu Feb 13 09:03:24 MST 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1661-8270&volume=7&issue=2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
URL = "http://link.springer.com/article/10.1007/s11786-012-0138-1",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://www.springerlink.com/content/1661-8270/",
}
@Article{Cuzzocrea:2013:SIP,
author = "Alfredo Cuzzocrea and Domenico Sacc{\`a}",
title = "Special Issue Papers: Exploiting compression and
approximation paradigms for effective and efficient
online analytical processing over sensor network
readings in data grid environments",
journal = j-CCPE,
volume = "25",
number = "14",
pages = "2016--2035",
day = "25",
month = sep,
year = "2013",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.2982",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Dec 3 10:37:36 MST 2013",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "29 Jan 2013",
}
@Article{Faro:2013:EOS,
author = "Simone Faro and Thierry Lecroq",
title = "The exact online string matching problem: a review of
the most recent results",
journal = j-COMP-SURV,
volume = "45",
number = "2",
pages = "13:1--13:??",
month = feb,
year = "2013",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2431211.2431212",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Mar 7 11:42:33 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "This article addresses the online exact string
matching problem which consists in finding all
occurrences of a given pattern $p$ in a text $t$. It is
an extensively studied problem in computer science,
mainly due to its direct applications to such diverse
areas as text, image and signal processing, speech
analysis and recognition, information retrieval, data
compression, computational biology and chemistry. In
the last decade more than 50 new algorithms have been
proposed for the problem, which add up to a wide set of
(almost 40) algorithms presented before 2000. In this
article we review the string matching algorithms
presented in the last decade and present experimental
results in order to bring order among the dozens of
articles published in this area.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Fazzinga:2013:RDC,
author = "Bettina Fazzinga and Sergio Flesca and Filippo Furfaro
and Elio Masciari",
title = "{RFID}-data compression for supporting aggregate
queries",
journal = j-TODS,
volume = "38",
number = "2",
pages = "11:1--11:??",
month = jun,
year = "2013",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/2487259.2487263",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Mon Jul 1 18:44:25 MDT 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "RFID-based systems for object tracking and supply
chain management have been emerging since the RFID
technology proved effective in monitoring movements of
objects. The monitoring activity typically results in
huge numbers of readings, thus making the problem of
efficiently retrieving aggregate information from the
collected data a challenging issue. In fact, tackling
this problem is of crucial importance, as fast answers
to aggregate queries are often mandatory to support the
decision making process. In this regard, a compression
technique for RFID data is proposed, and used as the
core of a system supporting the efficient estimation of
aggregate queries. Specifically, this technique aims at
constructing a lossy synopsis of the data over which
aggregate queries can be estimated, without accessing
the original data. Owing to the lossy nature of the
compression, query estimates are approximate, and are
returned along with intervals that are guaranteed to
contain the exact query answers. The effectiveness of
the proposed approach has been experimentally
validated, showing a remarkable trade-off between the
efficiency and the accuracy of the query estimation.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Fiorini:2013:DTDb,
author = "Rodolfo A. Fiorini and Andrea Condorelli and Giuseppe
Laguteta",
title = "Discrete Tomography Data Footprint Reduction via
Natural Compression",
journal = j-FUND-INFO,
volume = "125",
number = "3--4",
pages = "273--284",
month = jul,
year = "2013",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2013-864",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:17:16 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Holub:2013:GAD,
author = "Petr Holub and Martin Srom and Martin Pulec and
Jir{\'\i} Matela and Martin Jirman",
title = "{GPU}-accelerated {DXT} and {JPEG} compression schemes
for low-latency network transmissions of {HD}, {2K},
and {4K} video",
journal = j-FUT-GEN-COMP-SYS,
volume = "29",
number = "8",
pages = "1991--2006",
month = oct,
year = "2013",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2013.06.006",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:55:00 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001209",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Hon:2013:FCD,
author = "Wing-Kai Hon and Tsung-Han Ku and Rahul Shah and
Sharma V. Thankachan and Jeffrey Scott Vitter",
title = "Faster compressed dictionary matching",
journal = j-THEOR-COMP-SCI,
volume = "475",
number = "??",
pages = "113--119",
day = "4",
month = mar,
year = "2013",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2012.10.050",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Feb 12 17:38:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib;
http://www.sciencedirect.com/science/journal/03043975",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512009826",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Hovestadt:2013:AOC,
author = "Matthias Hovestadt and Odej Kao and Andreas Kliem and
Daniel Warneke",
title = "Adaptive Online Compression in Clouds --- Making
Informed Decisions in Virtual Machine Environments",
journal = j-J-GRID-COMP,
volume = "11",
number = "2",
pages = "167--186",
month = jun,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-013-9249-4",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Sat Jun 22 11:03:44 MDT 2013",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=11&issue=2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "http://link.springer.com/article/10.1007/s10723-013-9249-4",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Islam:2013:MSC,
author = "Tanzima Zerin Islam and Kathryn Mohror and Saurabh
Bagchi and Adam Moody and Bronis R. de Supinski and
Rudolf Eigenmann",
title = "{McrEngine}: a scalable checkpointing system using
data-aware aggregation and compression",
journal = j-SCI-PROG,
volume = "21",
number = "3--4",
pages = "149--163",
month = "????",
year = "2013",
CODEN = "SCIPEV",
DOI = "https://doi.org/10.3233/SPR-130371",
ISSN = "1058-9244 (print), 1875-919X (electronic)",
ISSN-L = "1058-9244",
bibdate = "Sat Mar 8 14:11:02 MST 2014",
bibsource = "http://www.iospress.nl/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sciprogram.bib",
acknowledgement = ack-nhfb,
fjournal = "Scientific Programming",
journal-URL = "http://iospress.metapress.com/content/1058-9244",
}
@Article{Jang:2013:PSP,
author = "Hakbeom Jang and Channoh Kim and Jae W. Lee",
title = "Practical speculative parallelization of
variable-length decompression algorithms",
journal = j-SIGPLAN,
volume = "48",
number = "5",
pages = "55--64",
month = may,
year = "2013",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/2499369.2465557",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Mon Jul 1 17:15:32 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Variable-length coding is widely used for efficient
data compression. Typically, the compressor splits the
original data into blocks and compresses each block
with variable-length codes, hence producing
variable-length compressed blocks. Although the
compressor can easily exploit ample block-level
parallelism, it is much more difficult to extract such
coarse-grain parallelism from the decompressor because
a block boundary cannot be located until decompression
of the previous block is completed. This paper presents
novel algorithms to efficiently predict block
boundaries and a runtime system that enables efficient
block-level parallel decompression, called SDM. The SDM
execution model features speculative pipelining with
three stages: Scanner, Decompressor, and Merger. The
scanner stage employs a high-confidence prediction
algorithm that finds compressed block boundaries
without fully decompressing individual blocks. This
information is communicated to the parallel
decompressor stage in which multiple blocks are
decompressed in parallel. The decompressed blocks are
merged in order by the merger stage to produce the
final output. The SDM runtime is specialized to execute
this pipeline correctly and efficiently on
resource-constrained embedded platforms. With SDM we
effectively parallelize three production-grade
variable-length decompression algorithms --- zlib,
bzip2, and H.264 --- with maximum speedups of $ 2.50
\times $ and $ 8.53 \times $ (and geometric mean
speedups of $ 1.96 \times $ and $ 4.04 \times $ ) on
4-core and 36-core embedded platforms, respectively.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "GPCE '12 conference proceedings.",
}
@Article{Mazza:2013:MSC,
author = "Tommaso Mazza and Stefano Castellana",
title = "Multi-Sided Compression Performance Assessment of {ABI
SOLiD WES} Data",
journal = j-ALGORITHMS-BASEL,
volume = "6",
number = "2",
pages = "309--318",
month = jun,
year = "2013",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a6020309",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/6/2/309",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 18 March 2013 / Revised: 23 April 2013 /
Accepted: 27 April 2013 / Published: 21 May 2013",
}
@Article{Mei:2013:NLS,
author = "Tao Mei and Lin-Xie Tang and Jinhui Tang and
Xian-Sheng Hua",
title = "Near-lossless semantic video summarization and its
applications to video analysis",
journal = j-TOMCCAP,
volume = "9",
number = "3",
pages = "16:1--16:??",
month = jun,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2487268.2487269",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:50 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "The ever increasing volume of video content on the Web
has created profound challenges for developing
efficient indexing and search techniques to manage
video data. Conventional techniques such as video
compression and summarization strive for the two
commonly conflicting goals of low storage and high
visual and semantic fidelity. With the goal of
balancing both video compression and summarization,
this article presents a novel approach, called
Near-Lossless Semantic Summarization (NLSS), to
summarize a video stream with the least high-level
semantic information loss by using an extremely small
piece of metadata. The summary consists of compressed
image and audio streams, as well as the metadata for
temporal structure and motion information. Although at
a very low compression rate (around $ 1 / 4 $0; of
H.264 baseline, where traditional compression
techniques can hardly preserve an acceptable visual
fidelity), the proposed NLSS still can be applied to
many video-oriented tasks, such as visualization,
indexing and browsing, duplicate detection, concept
detection, and so on. We evaluate the NLSS on TRECVID
and other video collections, and demonstrate that it is
a powerful tool for significantly reducing storage
consumption, while keeping high-level semantic
fidelity.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Merry:2013:FPB,
author = "Bruce Merry and James Gain and Patrick Marais",
title = "Fast in-place binning of laser range-scanned point
sets",
journal = j-JOCCH,
volume = "6",
number = "3",
pages = "14:1--14:??",
month = jul,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2499931.2499935",
ISSN = "1556-4673 (print), 1556-4711 (electronic)",
ISSN-L = "1556-4673",
bibdate = "Thu Mar 13 11:30:09 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/jocch/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jocch.bib",
abstract = "Laser range scanning is commonly used in cultural
heritage to create digital models of real-world
artefacts. A large scanning campaign can produce
billions of point samples-too many to be manipulated in
memory on most computers. It is thus necessary to
spatially partition the data so that it can be
processed in bins or slices. We introduce a novel
compression mechanism that exploits spatial coherence
in the data to allow the bins to be computed with only
1.01 bytes of I/O traffic for each byte of input,
compared to 2 or more for previous schemes.
Additionally, the bins are loaded from the original
files for processing rather than from a sorted copy,
thus minimizing disk space requirements. We demonstrate
that our method yields performance improvements in a
typical point-processing task, while also using little
memory and guaranteeing an upper bound on the number of
samples held in-core.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "Journal on Computing and Cultural Heritage (JOCCH)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1157",
}
@Article{Nasim:2013:RVL,
author = "Farhan Nasim",
title = "Review of {{\booktitle{Variable-length codes for data
compression}} by David Salomon}",
journal = j-SIGACT,
volume = "44",
number = "4",
pages = "24--26",
month = dec,
year = "2013",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2556663.2556666",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sat Mar 15 09:22:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Pande:2013:SMC,
author = "Amit Pande and Prasant Mohapatra and Joseph Zambreno",
title = "Securing Multimedia Content Using Joint Compression
and Encryption",
journal = j-IEEE-MULTIMEDIA,
volume = "20",
number = "4",
pages = "50--61",
month = oct # "\slash " # dec,
year = "2013",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2012.29",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Aug 25 06:43:49 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Article{Razzaque:2013:CWS,
author = "M. A. Razzaque and Chris Bleakley and Simon Dobson",
title = "Compression in wireless sensor networks: a survey and
comparative evaluation",
journal = j-TOSN,
volume = "10",
number = "1",
pages = "5:1--5:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2528948",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Thu Mar 13 07:56:30 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Wireless sensor networks (WSNs) are highly resource
constrained in terms of power supply, memory capacity,
communication bandwidth, and processor performance.
Compression of sampling, sensor data, and
communications can significantly improve the efficiency
of utilization of three of these resources, namely,
power supply, memory and bandwidth. Recently, there
have been a large number of proposals describing
compression algorithms for WSNs. These proposals are
diverse and involve different compression approaches.
It is high time that these individual efforts are put
into perspective and a more holistic view taken. In
this article, we take a step in that direction by
presenting a survey of the literature in the area of
compression and compression frameworks in WSNs. A
comparative study of the various approaches is also
provided. In addition, open research issues, challenges
and future research directions are highlighted.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@InProceedings{Salman:2013:HDD,
author = "Raied Salman",
booktitle = "Computer Science \& Information Technology ({CS \&
IT})",
title = "{Hamming} Distance and Data Compression of {$1$-D}
{CA}",
publisher = "Academy \& Industry Research Collaboration Center
({AIRCC})",
address = "????",
month = may,
year = "2013",
DOI = "https://doi.org/10.5121/csit.2013.3301",
bibdate = "Mon Aug 6 18:53:15 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
subject-dates = "Richard Wesley Hamming (1915--1998)",
}
@Article{Schneider:2013:NCC,
author = "D. Schneider",
title = "New camera chip captures only what it needs",
journal = j-IEEE-SPECTRUM,
volume = "50",
number = "3",
pages = "13--14",
month = mar,
year = "2013",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2013.6471041",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Batteries; battery drain; camera chip; Cameras;
compressed sensing; compressive sensing; data
compression; imaging chip; phone power; smart phones;
Smart phones; smartphone battery; Sony; Stanford; video
cameras; video coding; Video communication; video frame
compression; video recording",
}
@Article{Wandelt:2013:FRC,
author = "Sebastian Wandelt and Ulf Leser",
title = "{FRESCO}: Referential Compression of Highly Similar
Sequences",
journal = j-TCBB,
volume = "10",
number = "5",
pages = "1275--1288",
month = sep,
year = "2013",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2013.122",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Thu Jan 9 15:34:03 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "In many applications, sets of similar texts or
sequences are of high importance. Prominent examples
are revision histories of documents or genomic
sequences. Modern high-throughput sequencing
technologies are able to generate DNA sequences at an
ever-increasing rate. In parallel to the decreasing
experimental time and cost necessary to produce DNA
sequences, computational requirements for analysis and
storage of the sequences are steeply increasing.
Compression is a key technology to deal with this
challenge. Recently, referential compression schemes,
storing only the differences between a to-be-compressed
input and a known reference sequence, gained a lot of
interest in this field. In this paper, we propose a
general open-source framework to compress large amounts
of biological sequence data called Framework for
REferential Sequence COmpression (FRESCO). Our basic
compression algorithm is shown to be one to two orders
of magnitudes faster than comparable related work,
while achieving similar compression ratios. We also
propose several techniques to further increase
compression ratios, while still retaining the advantage
in speed: (1) selecting a good reference sequence; and
(2) rewriting a reference sequence to allow for better
compression. In addition, we propose a new way of
further boosting the compression ratios by applying
referential compression to already referentially
compressed files (second-order compression). This
technique allows for compression ratios way beyond
state of the art, for instance, 4,000:1 and higher for
human genomes. We evaluate our algorithms on a large
data set from three different species (more than 1,000
genomes, more than 3 TB) and on a collection of
versions of Wikipedia pages. Our results show that
real-time compression of highly similar sequences at
high compression ratios is possible on modern
hardware.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Xie:2013:EHA,
author = "Yulai Xie and Kiran-Kumar Muniswamy-Reddy and Dan Feng
and Yan Li and Darrell D. E. Long",
title = "Evaluation of a Hybrid Approach for Efficient
Provenance Storage",
journal = j-TOS,
volume = "9",
number = "4",
pages = "14:1--14:??",
month = nov,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2501986",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Thu Dec 12 18:12:51 MST 2013",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "Provenance is the metadata that describes the history
of objects. Provenance provides new functionality in a
variety of areas, including experimental documentation,
debugging, search, and security. As a result, a number
of groups have built systems to capture provenance.
Most of these systems focus on provenance collection, a
few systems focus on building applications that use the
provenance, but all of these systems ignore an
important aspect: efficient long-term storage of
provenance. In this article, we first analyze the
provenance collected from multiple workloads and
characterize the properties of provenance with respect
to long-term storage. We then propose a hybrid scheme
that takes advantage of the graph structure of
provenance data and the inherent duplication in
provenance data. Our evaluation indicates that our
hybrid scheme, a combination of Web graph compression
(adapted for provenance) and dictionary encoding,
provides the best trade-off in terms of compression
ratio, compression time, and query performance when
compared to other compression schemes.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Y:2013:LCE,
author = "Asnath Victy Phamila Y. and R. Amutha",
title = "Low complexity energy efficient very low bit-rate
image compression scheme for wireless sensor network",
journal = j-INFO-PROC-LETT,
volume = "113",
number = "18",
pages = "672--676",
day = "15",
month = sep,
year = "2013",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2013.06.008",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jul 1 18:58:17 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013001750",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhang:2013:FBA,
author = "Yan Zhang and Fan Zhang and Zheming Jin and Jason D.
Bakos",
title = "An {FPGA-Based} Accelerator for Frequent Itemset
Mining",
journal = j-TRETS,
volume = "6",
number = "1",
pages = "2:1--2:??",
month = may,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2457443.2457445",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Thu Mar 13 08:09:42 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "In this article we describe a Field Programmable Gate
Array (FPGA)-based coprocessor architecture for
Frequent Itemset Mining (FIM). FIM is a common data
mining task used to find frequently occurring subsets
amongst a database of sets. FIM is a nonnumerical, data
intensive computation and is used in machine learning
and computational biology. FIM is particularly
expensive---in terms of execution time and
memory---when performed on large and/or sparse
databases or when applied using a low appearance
frequency threshold. Because of this, the development
of increasingly efficient FIM algorithms and their
mapping to parallel architectures is an active field.
Previous attempts to accelerate FIM using FPGAs have
relied on performance-limiting strategies such as
iterative database loading and runtime logic unit
reconfiguration. In this article, we present a novel
architecture to implement Eclat, a well-known FIM
algorithm. Unlike previous efforts, our technique does
not impose limits on the maximum set size as a function
of available FPGA logic resources and our design scales
well to multiple FPGAs. In addition to a novel hardware
design, we also present a corresponding compression
scheme for intermediate results that are stored in
on-chip memory. On a four-FPGA board, experimental
results show up to 68X speedup compared to a highly
optimized software implementation.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Abbas:2014:FDC,
author = "Ahmed Mohammed Abbas and Azuraliza Abu Bakar and Mohd
Zakree Ahmad",
title = "Fast dynamic clustering {SOAP} messages based
compression and aggregation model for enhanced
performance of {Web} services",
journal = j-J-NETW-COMPUT-APPL,
volume = "41",
number = "??",
pages = "80--88",
month = may,
year = "2014",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2013.10.010",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:45:00 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804513002154",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Anagnostopoulos:2014:APC,
author = "Christos Anagnostopoulos and Stathes
Hadjiefthymiades",
title = "Advanced Principal Component-Based Compression Schemes
for Wireless Sensor Networks",
journal = j-TOSN,
volume = "11",
number = "1",
pages = "7:1--7:??",
month = aug,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629330",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Aug 26 18:16:52 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "This article proposes two models that improve the
Principal Component-based Context Compression (PC3)
model for contextual information forwarding among
sensor nodes in a Wireless Sensor Network (WSN). The
proposed models (referred to as iPC3 and oPC3) address
issues associated with the control of multivariate
contextual information transmission in a stationary
WSN. Because WSN nodes are typically battery equipped,
the primary design goal of the models is to optimize
the amount of energy used for data transmission while
retaining data accuracy at high levels. The proposed
energy conservation techniques and algorithms are based
on incremental principal component analysis and optimal
stopping theory. iPC3 and oPC3 models are presented and
compared with PC3 and other models found in the
literature through simulations. The proposed models
manage to extend the lifetime of a WSN application by
improving energy efficiency within WSN.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Arelakis:2014:CVA,
author = "Angelos Arelakis and Per Stenstrom",
title = "A Case for a Value-Aware Cache",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "13",
number = "1",
pages = "1--4",
month = jan # "\slash " # jun,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1109/L-CA.2012.31",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Replication of values causes poor utilization of
on-chip cache memory resources. This paper addresses
the question: How much cache resources can be
theoretically and practically saved if value
replication is eliminated? We introduce the concept of
value-aware caches and show that a sixteen times
smaller value-aware cache can yield the same miss rate
as a conventional cache. We then make a case for a
value-aware cache design using Huffman-based
compression. Since the value set is rather stable
across the execution of an application, one can afford
to reconstruct the coding tree in software. The
decompression latency is kept short by our proposed
novel pipelined Huffman decoder that uses canonical
codewords. While the (loose) upper-bound compression
factor is 5.2X, we show that, by eliminating
cache-block alignment restrictions, it is possible to
achieve a compression factor of 3.4X for practical
designs.",
acknowledgement = ack-nhfb,
affiliation = "Arelakis, A (Reprint Author), Chalmers, Gothenburg,
Sweden. Arelakis, Angelos; Stenstrom, Per, Chalmers,
Gothenburg, Sweden.",
author-email = "angelos@chalmers.se per.stenstrom@chalmers.se",
da = "2019-06-20",
doc-delivery-number = "AT5MU",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "Swedish Research Council",
funding-text = "This research is supported by the Swedish Research
Council. The simulations ran on the resources provided
by the Swedish National Infrastructure for Computing
(SNIC) at C3SE.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
number-of-cited-references = "17",
research-areas = "Computer Science",
times-cited = "3",
unique-id = "Arelakis:2014:CVA",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Arelakis:2014:SSC,
author = "Angelos Arelakis and Per Stenstrom",
title = "{SC2}: a statistical compression cache scheme",
journal = j-COMP-ARCH-NEWS,
volume = "42",
number = "3",
pages = "145--156",
month = jun,
year = "2014",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2678373.2665696",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Wed Dec 3 16:18:50 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Low utilization of on-chip cache capacity limits
performance and wastes energy because of the long
latency, limited bandwidth, and energy consumption
associated with off-chip memory accesses. Value
replication is an important source of low capacity
utilization. While prior cache compression techniques
manage to code frequent values densely, they trade off
a high compression ratio for low decompression latency,
thus missing opportunities to utilize capacity more
effectively. This paper presents, for the first time, a
detailed design space exploration of caches that
utilize statistical compression. We show that more
aggressive approaches like Huffman coding, which have
been neglected in the past due to the high processing
overhead for (de)compression, are suitable techniques
for caches and memory. Based on our key observation
that value locality varies little over time and across
applications, we first demonstrate that the overhead of
statistics acquisition for code generation is low
because new encodings are needed rarely, making it
possible to off-load it to software routines. We then
show that the high compression ratio obtained by
Huffman-coding makes it possible to utilize the
performance benefits of 4X larger last-level caches
with about 50\% lower power consumption than such
larger caches",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ISCA '14 conference proceedings.",
}
@InProceedings{Arvinti:2014:PDM,
author = "B. Arvinti and M. Costache",
booktitle = "2014 11th International Symposium on Electronics and
Telecommunications ({ISETC})",
title = "The performance of the {Daubechies} mother wavelets on
{ECG} compression",
publisher = pub-IEEE,
address = pub-IEEE:adr,
month = nov,
year = "2014",
DOI = "https://doi.org/10.1109/isetc.2014.7010808",
bibdate = "Sat Mar 10 14:29:20 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
}
@Article{Baek:2014:DHD,
author = "Seungcheol Baek and Hyung Gyu Lee and Chrysostomos
Nicopoulos and Jongman Kim",
title = "Designing Hybrid {DRAM\slash PCM} Main Memory Systems
Utilizing Dual-Phase Compression",
journal = j-TODAES,
volume = "20",
number = "1",
pages = "11:1--11:??",
month = nov,
year = "2014",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2658989",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Wed Nov 19 11:18:40 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The last few years have witnessed the emergence of a
promising new memory technology, namely Phase-Change
Memory (PCM). Due to its inherent ability to scale
deeply into the nanoscale regime and its low power
consumption, PCM is increasingly viewed as an
attractive alternative for the memory subsystem of
future microprocessor architectures. However, PCM is
marred by a duo of potentially show-stopping
deficiencies, that is, poor write performance
(especially when compared to the prevalent and
ubiquitous DRAM technology) and limited durability.
These weaknesses have urged designers to develop
various supporting architectural techniques to aid and
complement the operation of the PCM while mitigating
its innate flaws. One promising such solution is the
deployment of hybridized memory architectures that fuse
DRAM and PCM, in order to combine the best attributes
of each technology. In this article, we introduce a
novel Dual-Phase Compression (DPC) scheme and its
architectural design aimed at DRAM/PCM hybrids, which
caters to the limitations of PCM technology while
optimizing memory performance. The DPC technique is
specifically optimized for PCM-based environments and
is transparent to the operation of the remaining
components of the memory subsystem. Furthermore, the
proposed architecture is imbued with a multifaceted
wear-leveling technique to enhance the durability and
prolong the lifetime of the PCM. Extensive simulations
with traces from real applications running on a
full-system simulator demonstrate 20.4\% performance
improvement and 46.9\% energy reduction, on average, as
compared to a baseline DRAM/PCM hybrid implementation.
Additionally, the multifaceted wear-leveling technique
is shown to significantly prolong the lifetime of the
PCM.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Barbay:2014:EFC,
author = "J{\'e}r{\'e}my Barbay and Francisco Claude and Travis
Gagie and Gonzalo Navarro and Yakov Nekrich",
title = "Efficient Fully-Compressed Sequence Representations",
journal = j-ALGORITHMICA,
volume = "69",
number = "1",
pages = "232--268",
month = may,
year = "2014",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-012-9726-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Thu Mar 13 15:09:12 MDT 2014",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=69&issue=1;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/s00453-012-9726-3",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://www.springerlink.com/link.asp?id=100117",
}
@Article{Belazzougui:2014:AIC,
author = "Djamal Belazzougui and Gonzalo Navarro",
title = "Alphabet-Independent Compressed Text Indexing",
journal = j-TALG,
volume = "10",
number = "4",
pages = "23:1--23:??",
month = aug,
year = "2014",
DOI = "https://doi.org/10.1145/2635816",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Mon Sep 1 11:11:53 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "Self-indexes are able to represent a text
asymptotically within the information-theoretic lower
bound under the $k$ th order entropy model and offer
access to any text substring and indexed pattern
searches. Their time complexities are not optimal,
however; in particular, they are always multiplied by a
factor that depends on the alphabet size. In this
article, we achieve, for the first time, full alphabet
independence in the time complexities of self-indexes
while retaining space optimality. We also obtain some
relevant byproducts.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Algorithms (TALG)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J982",
}
@Article{Bjorklund:2014:CFS,
author = "Henrik Bj{\"o}rklund and Johanna Bj{\"o}rklund and
Niklas Zechner",
title = "Compression of finite-state automata through failure
transitions",
journal = j-THEOR-COMP-SCI,
volume = "557",
number = "??",
pages = "87--100",
day = "6",
month = nov,
year = "2014",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2014.09.007",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Oct 31 17:23:02 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514006720",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Bremler-Barr:2014:CSP,
author = "Anat Bremler-Barr and David Hay and Yaron Koral",
title = "{CompactDFA}: Scalable pattern matching using longest
prefix match solutions",
journal = j-IEEE-TRANS-NETWORKING,
volume = "22",
number = "2",
pages = "415--428",
month = apr,
year = "2014",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2013.2253119",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Jun 11 19:05:55 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "A central component in all contemporary intrusion
detection systems (IDSs) is their pattern matching
algorithms, which are often based on constructing and
traversing a deterministic finite automaton (DFA) that
represents the patterns. While this approach ensures
deterministic time guarantees, modern IDSs need to deal
with hundreds of patterns, thus requiring to store very
large DFAs, which usually do not fit in fast memory.
This results in a major bottleneck on the throughput of
the IDS, as well as its power consumption and cost. We
propose a novel method to compress DFAs by observing
that the name used by common DFA encoding is
meaningless. While regular DFAs store separately each
transition between two states, we use this degree of
freedom and encode states in such a way that all
transitions to a specific state are represented by a
single prefix that defines a set of current states. Our
technique applies to a large class of automata, which
can be categorized by simple properties. Then, the
problem of pattern matching is reduced to the
well-studied problem of Longest Prefix Match (LPM),
which can be solved either in ternary
content-addressable memory (TCAM), in commercially
available IP-lookup chips, or in software.
Specifically, we show that with a TCAM our scheme can
reach a throughput of 10 Gb/s with low power
consumption.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Chandra:2014:HPM,
author = "Surendar Chandra and John Boreczky and Lawrence A.
Rowe",
title = "High performance many-to-many intranet screen sharing
with {DisplayCast}",
journal = j-TOMCCAP,
volume = "10",
number = "2",
pages = "19:1--19:??",
month = feb,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2534328",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 13 07:37:57 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "DisplayCast is a many to many Intranet screen sharing
system. Its screen capture mechanism creates a sequence
of pixmap images of the screen updates. Prior systems
that used a similar approach were designed to operate
over constrained wide-area networks and did not exploit
the Intranet network conditions to achieve high capture
rates. First we empirically analyzed the screen
contents for a variety of scenarios. We showed that
screen updates were sporadic with long periods of
inactivity. When active, screens were updated at far
higher rates than was supported by earlier systems. The
mismatch was pronounced for interactive scenarios. Even
during active screen updates, the number of updated
pixels were frequently small. We showed that crucial
information can be lost if individual updates were
merged. When the available system resources could not
support high capture rates, we showed ways in which
updates can be effectively collapsed. Next, we
investigate compression mechanisms for streaming these
updates. Even while using a hardware encoder, lossy
compressors such as H.264 were unable to sustain high
frame rates. Though Zlib lossless compression operated
within the latency and compression rate requirements,
the compression efficiency was poor. By analyzing the
screen pixels, we developed a practical transformation
that significantly improved compression rates.
DisplayCast incorporates these observations. It shares
the processor and network resources required for screen
capture, compression and transmission with host
applications whose output needs to be shared.
DisplayCast is agile and uses faster processing
capability to achieve even higher performance. Our
system components operate natively in Windows 7, Mac OS
X and iOS and is deployed in a production setting.
DisplayCast is released under a New BSD License.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Crochemore:2014:NGP,
author = "Maxime Crochemore and Alessio Langiu and Filippo
Mignosi",
title = "Note on the greedy parsing optimality for
dictionary-based text compression",
journal = j-THEOR-COMP-SCI,
volume = "525",
number = "??",
pages = "55--59",
day = "13",
month = mar,
year = "2014",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2014.01.013",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Mar 8 16:44:06 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397514000309",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Deligiannis:2014:PRW,
author = "Nikos Deligiannis and Frederik Verbist and J{\"u}rgen
Slowack and Rik van de Walle and Peter Schelkens and
Adrian Munteanu",
title = "Progressively refined {Wyner--Ziv} video coding for
visual sensors",
journal = j-TOSN,
volume = "10",
number = "2",
pages = "21:1--21:??",
month = jan,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2530279",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Thu Mar 13 07:56:33 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Wyner-Ziv video coding constitutes an alluring
paradigm for visual sensor networks, offering efficient
video compression with low complexity encoding
characteristics. This work presents a novel hash-driven
Wyner-Ziv video coding architecture for visual sensors,
implementing the principles of successively refined
Wyner-Ziv coding. To this end, so-called
side-information refinement levels are constructed for
a number of grouped frequency bands of the discrete
cosine transform. The proposed codec creates
side-information by means of an original overlapped
block motion estimation and pixel-based multihypothesis
prediction technique, specifically built around the
pursued refinement strategy. The quality of the
side-information generated at every refinement level is
successively improved, leading to gradually enhanced
Wyner-Ziv coding performance. Additionally, this work
explores several temporal prediction structures,
including a new hierarchical unidirectional prediction
structure, providing both temporal scalability and low
delay coding. Experimental results include a thorough
evaluation of our novel Wyner-Ziv codec, assessing the
impact of the proposed successive refinement scheme and
the supported temporal prediction structures for a wide
range of hash configurations and group of pictures
sizes. The results report significant compression gains
with respect to benchmark systems in Wyner-Ziv video
coding (e.g., up to 42.03\% over DISCOVER) as well as
versus alternative state-of-the-art schemes refining
the side-information.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Do:2014:FRL,
author = "Huy Hoang Do and Jesper Jansson and Kunihiko Sadakane
and Wing-Kin Sung",
title = "Fast relative {Lempel--Ziv} self-index for similar
sequences",
journal = j-THEOR-COMP-SCI,
volume = "532",
number = "??",
pages = "14--30",
day = "1",
month = may,
year = "2014",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2013.07.024",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Apr 15 15:23:27 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513005409",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Edwards:2014:PAB,
author = "James A. Edwards and Uzi Vishkin",
title = "Parallel algorithms for {Burrows--Wheeler} compression
and decompression",
journal = j-THEOR-COMP-SCI,
volume = "525",
number = "??",
pages = "10--22",
day = "13",
month = mar,
year = "2014",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2013.10.009",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Mar 8 16:44:06 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513007615",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Gedik:2014:DFG,
author = "Bugra Gedik",
title = "Discriminative Fine-Grained Mixing for Adaptive
Compression of Data Streams",
journal = j-IEEE-TRANS-COMPUT,
volume = "63",
number = "9",
pages = "2228--2244",
month = sep,
year = "2014",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2013.103",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Sep 9 06:54:10 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Guan:2014:EBG,
author = "Tao Guan and Yunfeng He and Liya Duan and Jianzhong
Yang and Juan Gao and Junqing Yu",
title = "Efficient {BOF} Generation and Compression for
On-Device Mobile Visual Location Recognition",
journal = j-IEEE-MULTIMEDIA,
volume = "21",
number = "2",
pages = "32--41",
month = apr # "\slash " # jun,
year = "2014",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2013.31",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Aug 25 06:43:49 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Article{Keller:2014:GSC,
author = "Orgad Keller and Tsvi Kopelowitz and Shir Landau
Feibish and Moshe Lewenstein",
title = "Generalized substring compression",
journal = j-THEOR-COMP-SCI,
volume = "525",
number = "??",
pages = "42--54",
day = "13",
month = mar,
year = "2014",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2013.10.010",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Mar 8 16:44:06 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513007627",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@TechReport{Kukunas:2014:HPZ,
author = "James T. Kukunas and Vinodh Gopal and Jim Guilford and
Sean Gulley and Arjan van de Ven and Wajdi Feghali",
title = "High Performance {ZLIB} Compression on {Intel}
Architecture Processors",
type = "White paper",
number = "330343-002",
institution = "Intel Corporation",
address = "????",
pages = "19",
month = apr,
year = "2014",
bibdate = "Wed Jan 18 08:33:54 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Article{Laney:2014:AED,
author = "Daniel Laney and Steven Langer and Christopher Weber
and Peter Lindstrom and Al Wegener",
title = "Assessing the effects of data compression in
simulations using physically motivated metrics",
journal = j-SCI-PROG,
volume = "22",
number = "2",
pages = "141--155",
month = "????",
year = "2014",
CODEN = "SCIPEV",
DOI = "https://doi.org/10.3233/SPR-140386",
ISSN = "1058-9244 (print), 1875-919X (electronic)",
ISSN-L = "1058-9244",
bibdate = "Tue Sep 9 18:01:01 MDT 2014",
bibsource = "http://www.iospress.nl/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sciprog.bib",
acknowledgement = ack-nhfb,
fjournal = "Scientific Programming",
journal-URL = "http://iospress.metapress.com/content/1058-9244",
}
@Article{Lee:2014:JEP,
author = "Jae-Gil Lee and Gopi Attaluri and Ronald Barber and
Naresh Chainani and Oliver Draese and Frederick Ho and
Stratos Idreos and Min-Soo Kim and Sam Lightstone and
Guy Lohman and Konstantinos Morfonios and Keshava
Murthy and Ippokratis Pandis and Lin Qiao and
Vijayshankar Raman and Vincent Kulandai Samy and
Richard Sidle and Knut Stolze and Liping Zhang",
title = "Joins on encoded and partitioned data",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "7",
number = "13",
pages = "1355--1366",
month = aug,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.14778/2733004.2733008",
ISSN = "2150-8097",
bibdate = "Wed Feb 4 17:20:31 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Compression has historically been used to reduce the
cost of storage, I/Os from that storage, and buffer
pool utilization, at the expense of the CPU required to
decompress data every time it is queried. However,
significant additional CPU efficiencies can be achieved
by deferring decompression as late in query processing
as possible and performing query processing operations
directly on the still-compressed data. In this paper,
we investigate the benefits and challenges of
performing joins on compressed (or encoded) data. We
demonstrate the benefit of independently optimizing the
compression scheme of each join column, even though
join predicates relating values from multiple columns
may require translation of the encoding of one join
column into the encoding of the other. We also show the
benefit of compressing ``payload'' data other than the
join columns ``on the fly,'' to minimize the size of
hash tables used in the join. By partitioning the
domain of each column and defining separate
dictionaries for each partition, we can achieve even
better overall compression as well as increased
flexibility in dealing with new values introduced by
updates. Instead of decompressing both join columns
participating in a join to resolve their different
compression schemes, our system performs a light-weight
mapping of only qualifying rows from one of the join
columns to the encoding space of the other at run time.
Consequently, join predicates can be applied directly
on the compressed data. We call this procedure encoding
translation. Two alternatives of encoding translation
are developed and compared in the paper. We provide a
comprehensive evaluation of these alternatives using
product implementations of each on the TPC-H data set,
and demonstrate that performing joins on encoded and
partitioned data achieves both superior performance and
excellent compression.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{LeGia:2014:DCS,
author = "Q. T. {Le Gia} and H. Wendland",
title = "Data compression on the sphere using multiscale radial
basis function approximation",
journal = j-ADV-COMPUT-MATH,
volume = "40",
number = "4",
pages = "923--943",
month = aug,
year = "2014",
CODEN = "ACMHEX",
DOI = "https://doi.org/10.1007/s10444-013-9334-z",
ISSN = "1019-7168 (print), 1572-9044 (electronic)",
ISSN-L = "1019-7168",
MRclass = "94A15 (41A30 65D18)",
MRnumber = "3240219",
bibdate = "Sat Feb 3 18:23:11 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/advcomputmath.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/s10444-013-9334-z",
acknowledgement = ack-nhfb,
fjournal = "Advances in Computational Mathematics",
journal-URL = "http://link.springer.com/journal/10444",
}
@Article{Lin:2014:SSE,
author = "Xing Lin and Yebin Liu and Jiamin Wu and Qionghai
Dai",
title = "Spatial-spectral encoded compressive hyperspectral
imaging",
journal = j-TOG,
volume = "33",
number = "6",
pages = "233:1--233:??",
month = nov,
year = "2014",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2661229.2661262",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Fri Nov 14 19:16:26 MST 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "This paper proposes a novel compressive hyperspectral
(HS) imaging approach that allows for high-resolution
HS images to be captured in a single image. The
proposed architecture comprises three key components:
spatial-spectral encoded optical camera design,
over-complete HS dictionary learning and
sparse-constraint computational reconstruction. Our
spatial-spectral encoded sampling scheme provides a
higher degree of randomness in the measured projections
than previous compressive HS imaging approaches; and a
robust nonlinear sparse reconstruction method is
employed to recover the HS images from the coded
projection with higher performance. To exploit the
sparsity constraint on the nature HS images for
computational reconstruction, an over-complete HS
dictionary is learned to represent the HS images in a
sparser way than previous representations. We validate
the proposed approach on both synthetic and real
captured data, and show successful recovery of HS
images for both indoor and outdoor scenes. In addition,
we demonstrate other applications for the over-complete
HS dictionary and sparse coding techniques, including
3D HS images compression and denoising.",
acknowledgement = ack-nhfb,
articleno = "233",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Lindstrom:2014:FRC,
author = "Peter Lindstrom",
title = "Fixed-Rate Compressed Floating-Point Arrays",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "20",
number = "12",
pages = "2674--2683",
month = dec,
year = "2014",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2014.2346458",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Feb 12 16:40:54 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
URL = "http://csdl.computer.org/csdl/trans/tg/2014/12/06876024-abs.html",
abstract-URL = "http://csdl.computer.org/csdl/trans/tg/2014/12/06876024-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Lobaz:2014:HLB,
author = "P. Lobaz and L. V{\'a}sa",
title = "Hierarchical {Laplacian}-based compression of triangle
meshes",
journal = j-GRAPH-MODELS,
volume = "76",
number = "6",
pages = "682--690",
month = nov,
year = "2014",
CODEN = "GRMOFM",
DOI = "https://doi.org/10.1016/j.gmod.2014.09.003",
ISSN = "1524-0703 (print), 1524-0711 (electronic)",
ISSN-L = "1524-0703",
bibdate = "Mon Dec 1 07:05:17 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/graph-models.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1524070314000502",
acknowledgement = ack-nhfb,
fjournal = "Graphical Models",
journal-URL = "http://www.sciencedirect.com/science/journal/15240703/",
}
@Article{Luo:2014:ICH,
author = "Da Luo and Weiqi Luo and Rui Yang and Jiwu Huang",
title = "Identifying Compression History of Wave Audio and Its
Applications",
journal = j-TOMCCAP,
volume = "10",
number = "3",
pages = "30:1--30:??",
month = apr,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2575978",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Apr 15 12:20:53 MDT 2014",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Audio signal is sometimes stored and/or processed in
WAV (waveform) format without any knowledge of its
previous compression operations. To perform some
subsequent processing, such as digital audio forensics,
audio enhancement and blind audio quality assessment,
it is necessary to identify its compression history. In
this article, we will investigate how to identify a
decompressed wave audio that went through one of three
popular compression schemes, including MP3, WMA
(windows media audio) and AAC (advanced audio coding).
By analyzing the corresponding frequency coefficients,
including modified discrete cosine transform (MDCT) and
Mel-frequency cepstral coefficients (MFCCs), of those
original audio clips and their decompressed versions
with different compression schemes and bit rates, we
propose several statistics to identify the compression
scheme as well as the corresponding bit rate previously
used for a given WAV signal. The experimental results
evaluated on 8,800 audio clips with various contents
have shown the effectiveness of the proposed method. In
addition, some potential applications of the proposed
method are discussed.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Nanjundaswamy:2014:CLT,
author = "T. Nanjundaswamy and K. Rose",
title = "Cascaded Long Term Prediction for Enhanced Compression
of Polyphonic Audio Signals",
journal = j-IEEE-ACM-TASLP,
volume = "22",
number = "3",
pages = "697--710",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1109/TASLP.2014.2303292",
ISSN = "2329-9290",
ISSN-L = "2329-9290",
bibdate = "Mon Oct 5 06:29:36 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeacmtaslp.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Audio, Speech, and
Language Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6570655",
}
@Article{Ozsoy:2014:OLC,
author = "Adnan Ozsoy and Martin Swany and Arun Chauhan",
title = "Optimizing {LZSS} compression on {GPGPUs}",
journal = j-FUT-GEN-COMP-SYS,
volume = "30",
number = "??",
pages = "170--178",
month = jan,
year = "2014",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2013.06.022",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Dec 2 16:57:46 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001362",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Pajak:2014:IIP,
author = "Dawid Paj{\k{a}}k and Robert Herzog and Rados{\l}aw
Mantiuk and Piotr Didyk and Elmar Eisemann and Karol
Myszkowski and Kari Pulli",
title = "{Images II}: Perceptual depth compression for stereo
applications",
journal = j-CGF,
volume = "33",
number = "2",
pages = "195--204",
month = may,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12293",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Sep 10 08:54:12 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "1 Jun 2014",
}
@Article{Qian:2014:IAF,
author = "Zhenxing Qian and Xinpeng Zhang",
title = "Improved anti-forensics of {JPEG} compression",
journal = j-J-SYST-SOFTW,
volume = "91",
number = "??",
pages = "100--108",
month = may,
year = "2014",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2013.12.043",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Fri Mar 14 17:00:13 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121214000168",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Senapati:2014:ILE,
author = "Ranjan Kumar Senapati and Prasanth Mankar",
title = "Improved Listless Embedded Block Partitioning
Algorithms for Image Compression",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "14",
number = "4",
pages = "1450020",
month = oct,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1142/S021946781450020X",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Wed Dec 3 09:27:35 MST 2014",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Son:2014:DCE,
author = "Seung Woo Son and Zhengzhang Chen and William Hendrix
and Ankit Agrawal and Wei-keng Liao and Alok
Choudhary",
title = "Data Compression for the Exascale Computing Era ---
Survey",
journal = j-SUPERFRI,
volume = "1",
number = "2",
pages = "76--88",
month = "????",
year = "2014",
CODEN = "????",
ISSN = "2409-6008 (print), 2313-8734 (electronic)",
bibdate = "Sat Nov 11 07:15:27 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/superfri.bib",
URL = "http://superfri.org/superfri/article/view/13",
acknowledgement = ack-nhfb,
fjournal = "Supercomputing Frontiers and Innovations",
journal-URL = "http://superfri.org/superfri/issue/archive",
}
@Article{Song:2014:PNF,
author = "Renchu Song and Weiwei Sun and Baihua Zheng and Yu
Zheng",
title = "{PRESS}: a novel framework of trajectory compression
in road networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "7",
number = "9",
pages = "661--672",
month = may,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.14778/2732939.2732940",
ISSN = "2150-8097",
bibdate = "Wed Feb 4 17:20:18 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Location data becomes more and more important. In this
paper, we focus on the trajectory data, and propose a
new framework, namely PRESS (\underline{P}aralleled
\underline{R}oad-Network-Based Trajectory
Compr\underline{ess}ion), to effectively compress
trajectory data under road network constraints.
Different from existing work, PRESS proposes a novel
representation for trajectories to separate the spatial
representation of a trajectory from the temporal
representation, and proposes a Hybrid Spatial
Compression (HSC) algorithm and error Bounded Temporal
Compression (BTC) algorithm to compress the spatial and
temporal information of trajectories respectively.
PRESS also supports common spatial-temporal queries
without fully decompressing the data. Through an
extensive experimental study on real trajectory
dataset, PRESS significantly outperforms existing
approaches in terms of saving storage cost of
trajectory data with bounded errors.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Vasa:2014:AIM,
author = "L. V{\'a}{\v{s}}a and G. Brunnett",
title = "{Animation II} (Motion Data Processing):
Rate-distortion optimized compression of motion capture
data",
journal = j-CGF,
volume = "33",
number = "2",
pages = "283--292",
month = may,
year = "2014",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12326",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Sep 10 08:54:12 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "1 Jun 2014",
}
@Article{Wei:2014:NEA,
author = "Qingting Wei and Jihong Guan and Shuigeng Zhou and Xin
Wang",
title = "A New and Effective Approach to {GML} Documents
Compression",
journal = j-COMP-J,
volume = "57",
number = "11",
pages = "1723--1740",
month = nov,
year = "2014",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxt106",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Oct 27 08:54:43 MDT 2014",
bibsource = "http://comjnl.oxfordjournals.org/content/57/11.toc;
https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://comjnl.oxfordjournals.org/content/57/11/1723",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
onlinedate = "October 6, 2013",
}
@Article{Xie:2014:TEC,
author = "Ruitao Xie and Xiaohua Jia",
title = "Transmission-Efficient Clustering Method for Wireless
Sensor Networks Using Compressive Sensing",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "25",
number = "3",
pages = "806--815",
month = mar,
year = "2014",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2013.90",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Mon Aug 25 07:12:16 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Yang:2014:SCB,
author = "Chi Yang and Xuyun Zhang and Changmin Zhong and Chang
Liu and Jian Pei and Kotagiri Ramamohanarao and Jinjun
Chen",
title = "A spatiotemporal compression based approach for
efficient big data processing on {Cloud}",
journal = j-J-COMP-SYS-SCI,
volume = "80",
number = "8",
pages = "1563--1583",
month = dec,
year = "2014",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2014.04.022",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:27 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002200001400066X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Zordan:2014:PLC,
author = "Davide Zordan and Borja Martinez and Ignasi Vilajosana
and Michele Rossi",
title = "On the Performance of Lossy Compression Schemes for
Energy Constrained Sensor Networking",
journal = j-TOSN,
volume = "11",
number = "1",
pages = "15:1--15:??",
month = aug,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629660",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Aug 26 18:16:52 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Lossy temporal compression is key for
energy-constrained wireless sensor networks (WSNs),
where the imperfect reconstruction of the signal is
often acceptable at the data collector, subject to some
maximum error tolerance. In this article, we evaluate a
number of selected lossy compression methods from the
literature and extensively analyze their performance in
terms of compression efficiency, computational
complexity, and energy consumption. Specifically, we
first carry out a performance evaluation of existing
and new compression schemes, considering linear,
autoregressive, FFT-/DCT- and wavelet-based models , by
looking at their performance as a function of relevant
signal statistics. Second, we obtain formulas through
numerical fittings to gauge their overall energy
consumption and signal representation accuracy. Third,
we evaluate the benefits that lossy compression methods
bring about in interference-limited multihop networks,
where the channel access is a source of inefficiency
due to collisions and transmission scheduling. Our
results reveal that the DCT-based schemes are the best
option in terms of compression efficiency but are
inefficient in terms of energy consumption. Instead,
linear methods lead to substantial savings in terms of
energy expenditure by, at the same time, leading to
satisfactory compression ratios, reduced network delay,
and increased reliability performance.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@TechReport{Alakuijala:2015:CBD,
author = "Jyrki Alakuijala and Evgenii Kliuchnikov and Zoltan
Szabadka and Lode Vandevenne",
title = "Comparison of {Brotli}, {Deflate}, {Zopfli}, {LZMA},
{LZHAM} and {Bzip2} Compression Algorithms",
type = "Report",
institution = "Google, Inc.",
pages = "6",
day = "22",
month = sep,
year = "2015",
bibdate = "Sat Jan 09 09:37:26 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://github.com/google/brotli/blob/master/docs/brotli-comparison-study-2015-09-22.pdf",
abstract = "This paper compares six compression techniques, and
based on the results proposes that brotli could be used
as a replacement of the common deflate algorithm. We
compared the performance of brotli by measuring the
compression ratio and speed, as well as decompression
speed on three different corpora: the Canterbury
compression corpus, an ad hoc crawled web content
corpus, and enwik8. On all three corpora we show
performance superior to that of deflate. Further, we
show that Zopfli, LZMA, LZHAM and bzip2 use
significantly more CPU time for either compression or
decompression and could not always work as direct
replacements of deflate.",
acknowledgement = ack-nhfb,
remark = "From the Introduction: ``Much of the practical
lossless data compression is done with the deflate
algorithm, not only because it is well supported by
existing systems, but also because it is relatively
simple and fast to encode and decode. In 2013 we
launched Zopfli, a compression algorithm that allows
for denser compression while remaining compatible with
the deflate format. While Zopfli is now well-accepted
in the field, there were opinions expressed that we
should move on from the deflate file format to a modern
solution. Brotli is our attempt at building a
compression format and an example implementation of
this format that is fundamentally more efficient than
deflate.''",
}
@Article{Altaf:2015:LPM,
author = "Muhammad Shoaib Bin Altaf and David A. Wood",
title = "{LogCA}: A Performance Model for Hardware
Accelerators",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "14",
number = "2",
pages = "132--135",
month = jul # "\slash " # dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2014.2360182",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "To address the Dark Silicon problem, architects have
increasingly turned to special-purpose hardware
accelerators to improve the performance and energy
efficiency of common computational kernels, such as
encryption and compression. Unfortunately, the latency
and overhead required to off-load a computation to an
accelerator sometimes outweighs the potential benefits,
resulting in a net decrease in performance or energy
efficiency. To help architects and programmers reason
about these trade-offs, we have developed the LogCA
model, a simple performance model for hardware
accelerators. LogCA provides a simplified abstraction
of a hardware accelerator characterized by five key
parameters. We have validated the model against a
variety of accelerators, ranging from on-chip
cryptographic accelerators in Sun's UltraSparc T2 and
Intel's Sandy Bridge to both discrete and integrated
GPUs.",
acknowledgement = ack-nhfb,
affiliation = "Bin Altaf, MS (Reprint Author), Univ Wisconsin,
Madison, WI 53706 USA. Bin Altaf, Muhammad Shoaib;
Wood, David A., Univ Wisconsin, Madison, WI 53706
USA.",
author-email = "shoaibbinalt@wisc.edu david@cs.wisc.edu",
da = "2019-06-20",
doc-delivery-number = "CZ7DC",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "NSF [CNS-1117280, CCF-1218323,
CNS-1302260]",
funding-text = "We thank Mark Hill, Michael Swift, Rathijit Sen, and
the members of the Wisconsin Multifacet group for their
comments on the paper. This work is supported in part
with NSF grants CNS-1117280, CCF-1218323, and
CNS-1302260. The views expressed herein are not
necessarily those of the NSF. Professor Wood has
significant financial interests in AMD, Google and
Panasas.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Accelerators; heterogeneous systems; modeling
techniques; performance of systems",
number-of-cited-references = "12",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Altaf:2015:LPM",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Arroyuelo:2015:FMX,
author = "Diego Arroyuelo and Francisco Claude and Sebastian
Maneth and Veli M{\"a}kinen and Gonzalo Navarro and Kim
Nguy{\~{\^e}}n and Jouni Sir{\'e}n and Niko
V{\"a}lim{\"a}ki",
title = "Fast in-memory {XPath} search using compressed
indexes",
journal = j-SPE,
volume = "45",
number = "3",
pages = "399--434",
month = mar,
year = "2015",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2227",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Jan 27 11:58:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "3 Oct 2013",
}
@Article{Campobello:2015:CLL,
author = "G. Campobello and O. Giordano and A. Segreto and S.
Serrano",
title = "Comparison of local lossless compression algorithms
for {Wireless Sensor Networks}",
journal = j-J-NETW-COMPUT-APPL,
volume = "47",
number = "??",
pages = "23--31",
month = jan,
year = "2015",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2014.09.013",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:45:16 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804514002203",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Castiglione:2015:CBA,
author = "Arcangelo Castiglione and Raffaele Pizzolante and
Alfredo {De Santis} and Bruno Carpentieri and Aniello
Castiglione and Francesco Palmieri",
title = "Cloud-based adaptive compression and secure management
services for {$3$D} healthcare data",
journal = j-FUT-GEN-COMP-SYS,
volume = "43--44",
number = "??",
pages = "120--134",
month = feb,
year = "2015",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Nov 17 07:31:47 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14001332",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Chen:2015:RBD,
author = "Yanlai Chen",
title = "Reduced basis decomposition: a certified and fast
lossy data compression algorithm",
journal = j-COMPUT-MATH-APPL,
volume = "70",
number = "10",
pages = "2566--2574",
month = nov,
year = "2015",
CODEN = "CMAPDK",
DOI = "https://doi.org/10.1016/j.camwa.2015.09.023",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:51:45 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122115004630",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Cheng:2015:CMD,
author = "Kin-On Cheng and Paula Wu and Ngai-Fong Law and
Wan-Chi Siu",
title = "Compression of Multiple {DNA} Sequences Using
Intra-Sequence and Inter-Sequence Similarities",
journal = j-TCBB,
volume = "12",
number = "6",
pages = "1322--1332",
month = nov,
year = "2015",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2015.2403370",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Fri Jan 15 05:57:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Traditionally, intra-sequence similarity is exploited
for compressing a single DNA sequence. Recently,
remarkable compression performance of individual DNA
sequence from the same population is achieved by
encoding its difference with a nearly identical
reference sequence. Nevertheless, there is lack of
general algorithms that also allow less similar
reference sequences. In this work, we extend the
intra-sequence to the inter-sequence similarity in that
approximate matches of subsequences are found between
the DNA sequence and a set of reference sequences.
Hence, a set of nearly identical DNA sequences from the
same population or a set of partially similar DNA
sequences like chromosome sequences and DNA sequences
of related species can be compressed together. For
practical compressors, the compressed size is usually
influenced by the compression order of sequences. Fast
search algorithms for the optimal compression order are
thus developed for multiple sequences compression.
Experimental results on artificial and real datasets
demonstrate that our proposed multiple sequences
compression methods with fast compression order search
are able to achieve good compression performance under
different levels of similarity in the multiple DNA
sequences.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Chlopkowski:2015:GPL,
author = "Marek Chlopkowski and Rafal Walkowiak",
title = "A general purpose lossless data compression method for
{GPU}",
journal = j-J-PAR-DIST-COMP,
volume = "75",
number = "??",
pages = "40--52",
month = jan,
year = "2015",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2014.09.016",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Tue Nov 25 18:17:38 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731514001956",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Eichinger:2015:TSC,
author = "Frank Eichinger and Pavel Efros and Stamatis
Karnouskos and Klemens B{\"o}hm",
title = "A time-series compression technique and its
application to the smart grid",
journal = j-VLDB-J,
volume = "24",
number = "2",
pages = "193--218",
month = apr,
year = "2015",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-014-0368-8",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Wed Mar 18 19:14:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "Time-series data is increasingly collected in many
domains. One example is the smart electricity
infrastructure, which generates huge volumes of such
data from sources such as smart electricity meters.
Although today these data are used for visualization
and billing in mostly 15-min resolution, its original
temporal resolution frequently is more fine-grained,
e.g., seconds. This is useful for various analytical
applications such as short-term forecasting,
disaggregation and visualization. However, transmitting
and storing huge amounts of such fine-grained data are
prohibitively expensive in terms of storage space in
many cases. In this article, we present a compression
technique based on piecewise regression and two methods
which describe the performance of the compression.
Although our technique is a general approach for
time-series compression, smart grids serve as our
running example and as our evaluation scenario.
Depending on the data and the use-case scenario, the
technique compresses data by ratios of up to factor
5,000 while maintaining its usefulness for analytics.
The proposed technique has outperformed related work
and has been applied to three real-world energy
datasets in different scenarios. Finally, we show that
the proposed compression technique can be implemented
in a state-of-the-art database management system.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Elmoataz:2015:LLG,
author = "Abderrahim Elmoataz and Matthieu Toutain and Daniel
Tenbrinck",
title = "On the $p$-{Laplacian} and $ \infty $-{Laplacian} on
Graphs with Applications in Image and Data Processing",
journal = j-SIAM-J-IMAGING-SCI,
volume = "8",
number = "4",
pages = "2412--2451",
month = "????",
year = "2015",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/15M1022793",
ISSN = "1936-4954",
bibdate = "Tue Feb 9 08:45:16 MST 2016",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2015",
}
@Article{Gonzalez:2015:LCS,
author = "Rodrigo Gonz{\'a}lez and Gonzalo Navarro and
H{\'e}ctor Ferrada",
title = "Locally Compressed Suffix Arrays",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "19",
number = "??",
pages = "1.1:1--1.1:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2594408",
ISSN = "1084-6654",
bibdate = "Fri Apr 3 16:22:03 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "We introduce a compression technique for suffix
arrays. It is sensitive to the compressibility of the
text and local, meaning that random portions of the
suffix array can be decompressed by accessing mostly
contiguous memory areas. This makes decompression very
fast, especially when various contiguous cells must be
accessed. Our main technical contributions are the
following. First, we show that runs of consecutive
values that are known to appear in function $ \Psi (i)
= A^{-1} [A [i] + 1] $ of suffix arrays $A$ of
compressible texts also show up as repetitions in the
differential suffix array $ A'[i] = A [i] - A [i - 1]$.
Second, we use Re-Pair, a grammar-based compressor, to
compress the differential suffix array, and upper bound
its compression ratio in terms of the number of runs.
Third, we show how to compact the space used by the
grammar rules by up to 50\%, while still permitting
direct access to the rules. Fourth, we develop specific
variants of Re-Pair that work using knowledge of $ \Psi
$, and use much less space than the general Re-Pair
compressor, while achieving almost the same compression
ratios. Fifth, we implement the scheme and compare it
exhaustively with previous work, including the first
implementations of previous theoretical proposals.",
acknowledgement = ack-nhfb,
articleno = "1.1",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Grossi:2015:FCT,
author = "Roberto Grossi and Giuseppe Ottaviano",
title = "Fast Compressed Tries through Path Decompositions",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "19",
number = "??",
pages = "1.8:1--1.8:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2656332",
ISSN = "1084-6654",
bibdate = "Fri Apr 3 16:22:03 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "Tries are popular data structures for storing a set of
strings, where common prefixes are represented by
common root-to-node paths. More than 50 years of usage
have produced many variants and implementations to
overcome some of their limitations. We explore new
succinct representations of path-decomposed tries and
experimentally evaluate the corresponding reduction in
space usage and memory latency, comparing with the
state of the art. We study the following applications:
compressed string dictionary and monotone minimal
perfect hash for strings. In compressed string
dictionary, we obtain data structures that outperform
other state-of-the-art compressed dictionaries in space
efficiency while obtaining predictable query times that
are competitive with data structures preferred by the
practitioners. On real-world datasets, our compressed
tries obtain the smallest space (except for one case)
and have the fastest lookup times, whereas access times
are within 20\% slower than the best-known solutions.
In monotone minimal perfect hash for strings, our
compressed tries perform several times faster than
other trie-based monotone perfect hash functions while
occupying nearly the same space. On real-world
datasets, our tries are approximately 2 to 5 times
faster than previous solutions, with a space occupancy
less than 10\% larger.",
acknowledgement = ack-nhfb,
articleno = "1.8",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Jansson:2015:LDT,
author = "Jesper Jansson and Kunihiko Sadakane and Wing-Kin
Sung",
title = "Linked Dynamic Tries with Applications to
{LZ}-Compression in Sublinear Time and Space",
journal = j-ALGORITHMICA,
volume = "71",
number = "4",
pages = "969--988",
month = apr,
year = "2015",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-013-9836-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Sat Aug 8 11:47:15 MDT 2015",
bibsource = "http://link.springer.com/journal/453/71/4;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/s00453-013-9836-6",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Jez:2015:FFC,
author = "Artur Jez",
title = "Faster Fully Compressed Pattern Matching by
Recompression",
journal = j-TALG,
volume = "11",
number = "3",
pages = "20:1--20:??",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2631920",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Tue Jan 13 18:05:43 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "In this article, a fully compressed pattern matching
problem is studied. The compression is represented by
straight-line programs (SLPs)-that is, context-free
grammars generating exactly one string; the term fully
means that both the pattern and the text are given in
the compressed form. The problem is approached using a
recently developed technique of local recompression:
the SLPs are refactored so that substrings of the
pattern and text are encoded in both SLPs in the same
way. To this end, the SLPs are locally decompressed and
then recompressed in a uniform way. This technique
yields an $ O((n + m) \log M) $ algorithm for
compressed pattern matching, assuming that $M$ fits in
$ O(1)$ machine words, where $ n(m)$ is the size of the
compressed representation of the text (pattern,
respectively), and $M$ is the size of the decompressed
pattern. If only $ m + n$ fits in $ O(1)$ machine
words, the running time increases to $ O((n + m) \log M
\log (n + m))$. The previous best algorithm due to
Lifshits has $ O(n^2 m)$ running time.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Algorithms (TALG)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J982",
}
@Article{Jung:2015:CCD,
author = "Eun-Sung Jung and Rajkumar Kettimuthu and Venkatram
Vishwanath",
title = "Cluster-to-cluster data transfer with data compression
over wide-area networks",
journal = j-J-PAR-DIST-COMP,
volume = "79--80",
number = "??",
pages = "90--103",
month = may,
year = "2015",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Jul 25 13:25:17 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731514001713",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Liu:2015:GTB,
author = "Shaohui Liu and Anand Paul and Guochao Zhang and
Gwanggil Jeon",
title = "A game theory-based block image compression method in
encryption domain",
journal = j-J-SUPERCOMPUTING,
volume = "71",
number = "9",
pages = "3353--3372",
month = sep,
year = "2015",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-015-1413-0",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Tue Sep 29 10:07:23 MDT 2015",
bibsource = "http://link.springer.com/journal/11227/71/9;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://link.springer.com/article/10.1007/s11227-015-1413-0",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Maglo:2015:MCS,
author = "Adrien Maglo and Guillaume Lavou{\'e} and Florent
Dupont and C{\'e}line Hudelot",
title = "{$3$D} Mesh Compression: Survey, Comparisons, and
Emerging Trends",
journal = j-COMP-SURV,
volume = "47",
number = "3",
pages = "44:1--44:??",
month = apr,
year = "2015",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/2693443",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Apr 16 18:47:49 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "3D meshes are commonly used to represent virtual
surface and volumes. However, their raw data
representations take a large amount of space. Hence, 3D
mesh compression has been an active research topic
since the mid 1990s. In 2005, two very good review
articles describing the pioneering works were
published. Yet, new technologies have emerged since
then. In this article, we summarize the early works and
put the focus on these novel approaches. We classify
and describe the algorithms, evaluate their
performance, and provide synthetic comparisons. We also
outline the emerging trends for future research.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Massberg:2015:GHC,
author = "Jens Ma{\ss}berg",
title = "Generalized {Huffman} coding for binary trees with
choosable edge lengths",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "4",
pages = "502--506",
month = apr,
year = "2015",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2014.11.013",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Tue Jan 20 08:43:02 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014002634",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Matthews:2015:HCL,
author = "Suzanne J. Matthews",
title = "Heterogeneous compression of large collections of
evolutionary trees",
journal = j-TCBB,
volume = "12",
number = "4",
pages = "807--814",
month = jul,
year = "2015",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2014.2366756",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Wed Sep 16 18:55:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Compressing heterogeneous collections of trees is an
open problem in computational phylogenetics. In a
heterogeneous tree collection, each tree can contain a
unique set of taxa. An ideal compression method would
allow for the efficient archival of large tree
collections and enable scientists to identify common
evolutionary relationships over disparate analyses. In
this paper, we extend TreeZip to compress heterogeneous
collections of trees. TreeZip is the most efficient
algorithm for compressing homogeneous tree collections.
To the best of our knowledge, no other domain-based
compression algorithm exists for large heterogeneous
tree collections or enable their rapid analysis. Our
experimental results indicate that TreeZip averages
89.03 percent (72.69 percent) space savings on
unweighted (weighted) collections of trees when the
level of heterogeneity in a collection is moderate. The
organization of the TRZ file allows for efficient
computations over heterogeneous data. For example,
consensus trees can be computed in mere seconds.
Lastly, combining the TreeZip compressed (TRZ) file
with general-purpose compression yields average space
savings of 97.34 percent (81.43 percent) on unweighted
(weighted) collections of trees. Our results lead us to
believe that TreeZip will prove invaluable in the
efficient archival of tree collections, and enables
scientists to develop novel methods for relating
heterogeneous collections of trees.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Nagarkar:2015:CSH,
author = "Parth Nagarkar and K. Sel{\c{c}}uk Candan and Aneesha
Bhat",
title = "Compressed spatial hierarchical bitmap {(cSHB)}
indexes for efficiently processing spatial range query
workloads",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "8",
number = "12",
pages = "1382--1393",
month = aug,
year = "2015",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.14778/2824032.2824038",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Wed Sep 16 18:23:11 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "In most spatial data management applications, objects
are represented in terms of their coordinates in a
2-dimensional space and search queries in this space
are processed using spatial index structures. On the
other hand, bitmap-based indexing, especially thanks to
the compression opportunities bitmaps provide, has been
shown to be highly effective for query processing
workloads including selection and aggregation
operations. In this paper, we show that bitmap-based
indexing can also be highly effective for managing
spatial data sets. More specifically, we propose a
novel compressed spatial hierarchical bitmap (cSHB)
index structure to support spatial range queries. We
consider query workloads involving multiple range
queries over spatial data and introduce and consider
the problem of bitmap selection for identifying the
appropriate subset of the bitmap files for processing
the given spatial range query workload. We develop cost
models for compressed domain range query processing and
present query planning algorithms that not only select
index nodes for query processing, but also associate
appropriate bitwise logical operations to identify the
data objects satisfying the range queries in the given
workload. Experiment results confirm the efficiency and
effectiveness of the proposed compressed spatial
hierarchical bitmap (cSHB) index structure and the
range query planning algorithms in supporting spatial
range query workloads.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Navarro:2015:GDR,
author = "Gonzalo Navarro and Simon J. Puglisi and Daniel
Valenzuela",
title = "General Document Retrieval in Compact Space",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "19",
number = "??",
pages = "2.3:1--2.3:??",
month = feb,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2670128",
ISSN = "1084-6654",
bibdate = "Fri Apr 3 16:22:03 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "Given a collection of documents and a query pattern,
document retrieval is the problem of obtaining
documents that are relevant to the query. The
collection is available beforehand so that a data
structure, called an index, can be built on it to speed
up queries. While initially restricted to natural
language text collections, document retrieval problems
arise nowadays in applications like bioinformatics,
multimedia databases, and web mining. This requires a
more general setup where text and pattern can be
general sequences of symbols, and the classical
inverted indexes developed for words cannot be applied.
While linear-space time-optimal solutions have been
developed for most interesting queries in this general
case, space usage is a serious problem in practice. In
this article, we develop compact data structures that
solve various important document retrieval problems on
general text collections. More specifically, we provide
practical solutions for listing the documents where a
query pattern appears, together with its frequency in
each document, and for listing $k$ documents where a
query pattern appears most frequently. Some of our
techniques build on existing theoretical proposals,
while others are new. In particular, we introduce a
novel grammar-based compressed bitmap representation
that may be of independent interest when dealing with
repetitive sequences. Ours are the first practical
indexes that use less space when the text collection is
compressible. Our experimental results show that, in
various real-life text collections, our data structures
are significantly smaller than the most space-efficient
previous solutions, using up to half the space without
noticeably increasing the query time. Overall, document
listing can be carried out in 10 to 40 milliseconds for
patterns that appear 100 to 10,000 times in the
collection, whereas top-$k$ retrieval is carried out in
$k$ to $ 10 k$ milliseconds.",
acknowledgement = ack-nhfb,
articleno = "2.3",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Pekhimenko:2015:TAC,
author = "Gennady Pekhimenko and Evgeny Bolotin and Mike
O'Connor and Onur Mutlu and Todd C. Mowry and Stephen
W. Keckler",
title = "Toggle-Aware Compression for {GPUs}",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "14",
number = "2",
pages = "164--168",
month = jul # "\slash " # dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2015.2430853",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Memory bandwidth compression can be an effective way
to achieve higher system performance and energy
efficiency in modern data-intensive applications by
exploiting redundancy in data. Prior works studied
various data compression techniques to improve both
capacity (e.g., of caches and main memory) and
bandwidth utilization (e.g., of the on-chip and
off-chip interconnects). These works addressed two
common shortcomings of compression: (i)
compression/decompression overhead in terms of latency,
energy, and area, and (ii) hardware complexity to
support variable data size. In this paper, we make the
new observation that there is another important problem
related to data compression in the context of the
communication energy efficiency: transferring
compressed data leads to a substantial increase in the
number of bit toggles (communication channel switchings
from 0 to 1 or from 1 to 0). This, in turn, increases
the dynamic energy consumed by on-chip and off-chip
buses due to more frequent charging and discharging of
the wires. Our results, for example, show that the bit
toggle count increases by an average of 2.2x with some
compression algorithms across 54 mobile GPU
applications. We characterize and demonstrate this new
problem across a wide variety of 221 GPU applications
and six different compression algorithms. To mitigate
the problem, we propose two new toggle-aware
compression techniques: energy control and Metadata
Consolidation. These techniques greatly reduce the bit
toggle count impact of the six data compression
algorithms we examine, while keeping most of their
bandwidth reduction benefits.",
acknowledgement = ack-nhfb,
affiliation = "Pekhimenko, G (Reprint Author), Carnegie Mellon Univ,
Dept Comp Sci, Pittsburgh, PA 15206 USA. Pekhimenko,
Gennady; Mutlu, Onur; Mowry, Todd C., Carnegie Mellon
Univ, Dept Comp Sci, Pittsburgh, PA 15206 USA. Bolotin,
Evgeny; O'Connor, Mike; Keckler, Stephen W., NVIDA,
Santa Clara, CA USA. O'Connor, Mike; Keckler, Stephen
W., Univ Texas Austin, Austin, TX 78712 USA.",
author-email = "gpekhimento@gmail.com ebolotin@nvidia.com
moconnor@nvidia.com omutlu@gmail.com tcm@cs.cmu.edu
skeckler@nvidia.com",
da = "2019-06-20",
doc-delivery-number = "CZ7DC",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "Intel Science and Technology Center for
Cloud Computing; US National Science Foundation
[1212962, 1409723, 1423172]; US Department of Energy",
funding-text = "The authors acknowledge the support of Intel Science
and Technology Center for Cloud Computing; US National
Science Foundation grants 1212962, 1409723, and
1423172; and the US Department of Energy.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Data compression; interconnected systems; memory",
number-of-cited-references = "29",
research-areas = "Computer Science",
times-cited = "2",
unique-id = "Pekhimenko:2015:TAC",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Ristov:2015:USS,
author = "Strahil Ristov and Damir Korenci{\'c}",
title = "Using static suffix array in dynamic application: Case
of text compression by longest first substitution",
journal = j-INFO-PROC-LETT,
volume = "115",
number = "2",
pages = "175--181",
month = feb,
year = "2015",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2014.08.014",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Nov 20 09:46:44 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019014001835",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Schaeffer:2015:RTA,
author = "Hayden Schaeffer and Yi Yang and Hongkai Zhao and
Stanley Osher",
title = "Real-Time Adaptive Video Compression",
journal = j-SIAM-J-SCI-COMP,
volume = "37",
number = "6",
pages = "B980--B1001",
month = "????",
year = "2015",
CODEN = "SJOCE3",
DOI = "https://doi.org/10.1137/130937792",
ISSN = "1064-8275 (print), 1095-7197 (electronic)",
ISSN-L = "1064-8275",
bibdate = "Tue Feb 9 08:55:41 MST 2016",
bibsource = "http://epubs.siam.org/toc/sjoce3/37/6;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Scientific Computing",
journal-URL = "http://epubs.siam.org/sisc",
onlinedate = "January 2015",
}
@Article{Schaeffer:2015:STR,
author = "Hayden Schaeffer and Yi Yang and Stanley Osher",
title = "Space-Time Regularization for Video Decompression",
journal = j-SIAM-J-IMAGING-SCI,
volume = "8",
number = "1",
pages = "373--402",
month = "????",
year = "2015",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/140977400",
ISSN = "1936-4954",
bibdate = "Wed Jun 10 14:58:30 MDT 2015",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2015",
}
@Article{Seo:2015:DDF,
author = "Bon-Keun Seo and Seungryoul Maeng and Joonwon Lee and
Euiseong Seo",
title = "{DRACO}: A Deduplicating {FTL} for Tangible Extra
Capacity",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "14",
number = "2",
pages = "123--126",
month = jul # "\slash " # dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2014.2350984",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "The rapid random access of SSDs enables efficient
searching of redundant data and their deduplication.
However, the space earned from deduplication cannot be
used as permanent storage because it must be reclaimed
when deduplication is cancelled as a result of an
update to the deduplicated data. To overcome this
limitation, we propose a novel FTL scheme that enables
the gained capacity to be used as permanent storage
space for the file system layer. The proposed approach
determines the safe amount of gained capacity that can
be provided to the upper layer based on the compression
rate prediction scheme. It then secures the required
space by compressing cold data when capacity overflow
occurs from cancelled deduplication. Our evaluation
with a kernel source repository showed that the file
system obtained approximately 79 percent additional
capacity by the proposed scheme.",
acknowledgement = ack-nhfb,
affiliation = "Seo, BK (Reprint Author), Korea Adv Inst Sci \&
Technol, Dept Comp Sci, Taejon 305701, South Korea.
Seo, Bon-Keun; Maeng, Seungryoul, Korea Adv Inst Sci \&
Technol, Dept Comp Sci, Taejon 305701, South Korea.
Lee, Joonwon; Seo, Euiseong, Sungkyunkwan Univ, Coll
Informat \& Commun Engn, Suwon 440746, South Korea.",
author-email = "joonwon@skku.edu euiseong@skku.edu",
da = "2019-06-20",
doc-delivery-number = "CZ7DC",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "Basic Science Research Program through the
National Research Foundation of Korea
[2012R1A1A2A10038823]",
funding-text = "This research was supported by Basic Science Research
Program through the National Research Foundation of
Korea (2012R1A1A2A10038823).",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "compression; deduplication; file systems; flash
memory; FTL; over-provisioning; SSD",
number-of-cited-references = "6",
research-areas = "Computer Science",
researcherid-numbers = "Maeng, Seungryoul/C-1882-2011",
times-cited = "2",
unique-id = "Seo:2015:DDF",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Sofia:2015:IHP,
author = "A. T. Sofia and C. C. Lewis and C. Jacobi and D. A.
Jamsek and D. F. Riedy and J. Vogt and P. Sutton and R.
W. {St. John}",
title = "Integrated high-performance data compression in the
{IBM z13}",
journal = j-IBM-JRD,
volume = "59",
number = "4--5",
pages = "7:1--7:10",
month = jul # "\slash " # sep,
year = "2015",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2015.2430091",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Wed Oct 21 11:38:12 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Song:2015:VRF,
author = "Ying Song and Jiaping Wang and Li-Yi Wei and Wencheng
Wang",
title = "Vector Regression Functions for Texture Compression",
journal = j-TOG,
volume = "35",
number = "1",
pages = "5:1--5:??",
month = dec,
year = "2015",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2818996",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Fri Jan 8 08:02:07 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "Raster images are the standard format for texture
mapping, but they suffer from limited resolution.
Vector graphics are resolution-independent but are less
general and more difficult to implement on a GPU. We
propose a hybrid representation called vector
regression functions (VRFs), which compactly
approximate any point-sampled image and support GPU
texture mapping, including random access and filtering
operations. Unlike standard GPU texture compression,
(VRFs) provide a variable-rate encoding in which
piecewise smooth regions compress to the square root of
the original size. Our key idea is to represent images
using the multilayer perceptron, allowing general
encoding via regression and efficient decoding via a
simple GPU pixel shader. We also propose a
content-aware spatial partitioning scheme to reduce the
complexity of the neural network model. We demonstrate
benefits of our method including its quality, size, and
runtime speed.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Vlachos:2015:CMF,
author = "Michail Vlachos and Nikolaos M. Freris and Anastasios
Kyrillidis",
title = "Compressive mining: fast and optimal data mining in
the compressed domain",
journal = j-VLDB-J,
volume = "24",
number = "1",
pages = "1--24",
month = feb,
year = "2015",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-014-0360-3",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Fri Mar 6 15:25:03 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "Real-world data typically contain repeated and
periodic patterns. This suggests that they can be
effectively represented and compressed using only a few
coefficients of an appropriate basis (e.g., Fourier and
wavelets). However, distance estimation when the data
are represented using different sets of coefficients is
still a largely unexplored area. This work studies the
optimization problems related to obtaining the tightest
lower/upper bound on Euclidean distances when each data
object is potentially compressed using a different set
of orthonormal coefficients. Our technique leads to
tighter distance estimates, which translates into more
accurate search, learning and mining operations
directly in the compressed domain. We formulate the
problem of estimating lower/upper distance bounds as an
optimization problem. We establish the properties of
optimal solutions and leverage the theoretical analysis
to develop a fast algorithm to obtain an exact solution
to the problem. The suggested solution provides the
tightest estimation of the $ L_2$-norm or the
correlation. We show that typical data analysis
operations, such as $k$-nearest-neighbor search or
$k$-Means clustering, can operate more accurately using
the proposed compression and distance reconstruction
technique. We compare it with many other prevalent
compression and reconstruction techniques, including
random projections and PCA-based techniques. We
highlight a surprising result, namely that when the
data are highly sparse in some basis, our technique may
even outperform PCA-based compression. The
contributions of this work are generic as our
methodology is applicable to any sequential or
high-dimensional data as well as to any orthogonal data
transformation used for the underlying data compression
scheme.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Wandelt:2015:MCS,
author = "Sebastian Wandelt and Ulf Leser",
title = "{MRCSI}: compressing and searching string collections
with multiple references",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "8",
number = "5",
pages = "461--472",
month = jan,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.14778/2735479.2735480",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Mon Feb 9 18:24:35 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Efficiently storing and searching collections of
similar strings, such as large populations of genomes
or long change histories of documents from Wikis, is a
timely and challenging problem. Several recent
proposals could drastically reduce space requirements
by exploiting the similarity between strings in
so-called reference-based compression. However, these
indexes are usually not searchable any more, i.e., in
these methods search efficiency is sacrificed for
storage efficiency. We propose Multi-Reference
Compressed Search Indexes (MRCSI) as a framework for
efficiently compressing dissimilar string collections.
In contrast to previous works which can use only a
single reference for compression, MRCSI (a) uses
multiple references for achieving increased compression
rates, where the reference set need not be specified by
the user but is determined automatically, and (b)
supports efficient approximate string searching with
edit distance constraints. We prove that finding the
smallest MRCSI is NP-hard. We then propose three
heuristics for computing MRCSIs achieving increasing
compression ratios. Compared to state-of-the-art
competitors, our methods target an interesting and
novel sweet-spot between high compression ratio versus
search efficiency.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2015:CSP,
author = "Chao Wang and Xi Li and Peng Chen and Xuehai Zhou",
title = "A case study of parallel {JPEG} encoding on an
{FPGA}",
journal = j-J-PAR-DIST-COMP,
volume = "78",
number = "??",
pages = "1--5",
month = apr,
year = "2015",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2014.09.010",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Sat Mar 21 09:26:08 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731514001737",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315/",
}
@Article{Weinstein:2015:ICQ,
author = "O. Weinstein",
title = "Information Complexity and the Quest for Interactive
Compression",
journal = j-SIGACT,
volume = "46",
number = "2",
pages = "41--64",
month = jun,
year = "2015",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/2789149.2789161",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
bibdate = "Tue Feb 16 11:18:41 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "Information complexity is the interactive analogue of
Shannon's classical information theory. In recent years
this field has emerged as a powerful tool for proving
strong communication lower bounds, and for addressing
some of the major open problems in communication
complexity and circuit complexity. A notable
achievement of information complexity is the
breakthrough in understanding of the fundamental direct
sum and direct product conjectures, which aim to
quantify the power of parallel computation. This survey
provides a brief introduction to information
complexity, and overviews some of the recent progress
on these conjectures and their tight relationship with
the fascinating problem of compressing interactive
protocols.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Xie:2015:CTC,
author = "Xiaojing Xie and Shuigeng Zhou and Jihong Guan",
title = "{CoGI}: Towards Compressing Genomes as an Image",
journal = j-TCBB,
volume = "12",
number = "6",
pages = "1275--1285",
month = nov,
year = "2015",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2015.2430331",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Fri Jan 15 05:57:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Genomic science is now facing an explosive increase of
data thanks to the fast development of sequencing
technology. This situation poses serious challenges to
genomic data storage and transferring. It is desirable
to compress data to reduce storage and transferring
cost, and thus to boost data distribution and
utilization efficiency. Up to now, a number of
algorithms / tools have been developed for compressing
genomic sequences. Unlike the existing algorithms, most
of which treat genomes as one-dimensional text strings
and compress them based on dictionaries or probability
models, this paper proposes a novel approach called
CoGI (the abbreviation of Compressing Genomes as an
Image) for genome compression, which transforms the
genomic sequences to a two-dimensional binary image (or
bitmap), then applies a rectangular partition coding
algorithm to compress the binary image. CoGI can be
used as either a reference-based compressor or a
reference-free compressor. For the former, we develop
two entropy-based algorithms to select a proper
reference genome. Performance evaluation is conducted
on various genomes. Experimental results show that the
reference-based CoGI significantly outperforms two
state-of-the-art reference-based genome compressors
GReEn and RLZ-opt in both compression ratio and
compression efficiency. It also achieves comparable
compression ratio but two orders of magnitude higher
compression efficiency in comparison with XM-one
state-of-the-art reference-free genome compressor.
Furthermore, our approach performs much better than
Gzip-a general-purpose and widely-used compressor, in
both compression speed and compression ratio. So, CoGI
can serve as an effective and practical genome
compressor. The source code and other related documents
of CoGI are available at:
http://admis.fudan.edu.cn/projects/cogi.htm.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Yu:2015:ESS,
author = "William Yu and Noah M. Daniels and David Christian
Danko and Bonnie Berger",
title = "Entropy-Scaling Search of Massive Biological Data",
journal = j-CELL-SYST,
volume = "1",
number = "2",
pages = "130--140",
day = "26",
month = aug,
year = "2015",
DOI = "https://doi.org/10.1016/j.cels.2015.08.004",
ISSN = "2405-4712",
bibdate = "Tue Sep 15 09:42:13 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://gems.csail.mit.edu/;
http://www.sciencedirect.com/science/article/pii/S2405471215000587",
acknowledgement = ack-nhfb,
fjournal = "Cell Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/24054712",
keywords = "compressed string searching; data compression",
}
@Article{Zhao:2015:BSB,
author = "Jishen Zhao and Sheng Li and Jichuan Chang and John L.
Byrne and Laura L. Ramirez and Kevin Lim and Yuan Xie
and Paolo Faraboschi",
title = "{Buri}: Scaling Big-Memory Computing with
Hardware-Based Memory Expansion",
journal = j-TACO,
volume = "12",
number = "3",
pages = "31:1--31:??",
month = oct,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2808233",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Wed Oct 7 18:51:05 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Motivated by the challenges of scaling up memory
capacity and fully exploiting the benefits of memory
compression, we propose Buri, a hardware-based memory
compression scheme, which simultaneously achieves cost
efficiency, high performance, and ease of adoption.
Buri combines (1) a self-contained, ready-to-adopt
hardware compression module, which manages metadata
compression and memory allocation/relocation
operations; (2) a set of hardware optimization
mechanisms, which reduce the area and performance
overheads in accommodating the address indirection
required by memory compression; and (3) lightweight
BIOS/OS extensions used to handle exceptions. Our
evaluation with large memory workload traces shows that
Buri can increase capacity by 70\%, in addition to the
compression ratio already provided by database
software.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Zhao:2015:GSB,
author = "Wayne Xin Zhao and Xudong Zhang and Daniel Lemire and
Dongdong Shan and Jian-Yun Nie and Hongfei Yan and
Ji-Rong Wen",
title = "A General {SIMD}-Based Approach to Accelerating
Compression Algorithms",
journal = j-TOIS,
volume = "33",
number = "3",
pages = "15:1--15:??",
month = mar,
year = "2015",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/2735629",
ISSN = "1046-8188",
bibdate = "Mon Mar 23 17:09:13 MDT 2015",
bibsource = "http://www.acm.org/pubs/contents/journals/tois/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "Compression algorithms are important for data-oriented
tasks, especially in the era of ``Big Data.'' Modern
processors equipped with powerful SIMD instruction sets
provide us with an opportunity for achieving better
compression performance. Previous research has shown
that SIMD-based optimizations can multiply decoding
speeds. Following these pioneering studies, we propose
a general approach to accelerate compression
algorithms. By instantiating the approach, we have
developed several novel integer compression algorithms,
called Group-Simple, Group-Scheme, Group-AFOR, and
Group-PFD, and implemented their corresponding
vectorized versions. We evaluate the proposed
algorithms on two public TREC datasets, a Wikipedia
dataset, and a Twitter dataset. With competitive
compression ratios and encoding speeds, our SIMD-based
algorithms outperform state-of-the-art nonvectorized
algorithms with respect to decoding speeds.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J779",
}
@Article{Zheng:2015:DGC,
author = "Haifeng Zheng and Feng Yang and Xiaohua Tian and
Xiaoying Gan and Xinbing Wang and Shilin Xiao",
title = "Data Gathering with Compressive Sensing in Wireless
Sensor Networks: A Random Walk Based Approach",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "26",
number = "1",
pages = "35--44",
month = jan,
year = "2015",
CODEN = "ITDSEO",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Feb 12 13:58:35 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2015/01/06748092-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2015/01/06748092-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}
@Article{Amat:2016:NMA,
author = "S. Amat and J. Liandrat and J. Ruiz and J. C. Trillo",
title = "On a nonlinear mean and its application to image
compression using multiresolution schemes",
journal = j-NUMER-ALGORITHMS,
volume = "71",
number = "4",
pages = "729--752",
month = apr,
year = "2016",
CODEN = "NUALEG",
DOI = "https://doi.org/10.1007/s11075-015-0019-1",
ISSN = "1017-1398 (print), 1572-9265 (electronic)",
ISSN-L = "1017-1398",
bibdate = "Thu Apr 7 12:13:13 MDT 2016",
bibsource = "http://link.springer.com/journal/11075/71/4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/numeralgorithms.bib",
URL = "http://link.springer.com/article/10.1007/s11075-015-0019-1",
acknowledgement = ack-nhfb,
fjournal = "Numerical Algorithms",
journal-URL = "http://link.springer.com/journal/11075",
}
@Misc{Anonymous:2016:Z,
author = "Anonymous",
title = "Zstandard",
howpublished = "Web site.",
year = "2016",
bibdate = "Tue Nov 15 15:40:12 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://facebook.github.io/zstd/;
https://github.com/facebook/zstd",
abstract = "Zstandard is a real-time compression algorithm,
providing high compression ratios. It offers a very
wide range of compression / speed trade-off, while
being backed by a very fast decoder (see benchmarks
below). It also offers a special mode for small data,
called dictionary compression, and can create
dictionaries from any sample set. Zstandard library is
provided as open source software using a BSD license.",
acknowledgement = ack-nhfb,
remark = "In local tests of zstd on a large bibliography, a Web
page file, and a system log file, I found that zstd's
compression ratio was somewhat poorer than available
with {\tt bzip2} and {\tt xz}. Its decompression speed
is claimed to be superior to other compression
algorithms.",
}
@Article{Atya:2016:PAE,
author = "Ahmed Osama Fathy Atya and Ioannis Broustis and
Shailendra Singh and Dimitris Syrivelis and Srikanth V.
Krishnamurthy and Thomas F. {La Porta}",
title = "A Policy-Aware Enforcement Logic for Appropriately
Invoking Network Coding",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2005--2018",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2438775",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Network coding has been shown to offer significant
throughput benefits over certain wireless network
topologies. However, the application of network coding
may not always improve the network performance. In this
paper, we first provide an analytical study, which
helps in assessing when network coding is preferable to
a traditional store-and-forward approach.
Interestingly, our study reveals that in many
topological scenarios, network coding can in fact hurt
the throughput performance; in such scenarios, applying
the store-and-forward approach leads to higher network
throughput. We validate our analytical findings via
extensive testbed experiments. Guided by our findings
as our primary contribution, we design and implement
PACE, a Policy-Aware Coding Enforcement logic that
enables network coding only when it is expected to
offer performance benefits. Specifically, PACE
leverages a minimal set of periodic link quality
measurements in order to make per-flow online decisions
with regards to when network coding should be
activated, and when store-and-forward is preferable. It
can be easily embedded into network-coding-aware
routers as a user-level or kernel-level software
utility. We evaluate the efficacy of PACE via: (1) ns-3
simulations, and (2) experiments on a wireless testbed.
We observe that our scheme wisely activates network
coding only when appropriate, thereby improving the
total network throughput by as much as 350\% in some
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Beal:2016:CPP,
author = "Richard Beal and Donald Adjeroh",
title = "Compressed parameterized pattern matching",
journal = j-THEOR-COMP-SCI,
volume = "609 (part 1)",
number = "??",
pages = "129--142",
day = "4",
month = jan,
year = "2016",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2015.09.015",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Dec 4 06:41:42 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515008440",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Beirami:2016:PLN,
author = "Ahmad Beirami and Mohsen Sardari and Faramarz Fekri",
title = "Packet-level network compression: realization and
scaling of the network-wide benefits",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "3",
pages = "1588--1604",
month = jun,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/tnet.2015.2418296",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Sep 9 11:16:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "The existence of considerable amount of redundancy in
the Internet traffic at the packet level has stimulated
the deployment of packet-level redundancy elimination
techniques within the network by enabling network nodes
to memorize data packets. Redundancy elimination
results in traffic reduction which in turn improves the
efficiency of network links. In this paper, the concept
of network compression is introduced that aspires to
exploit the statistical correlation beyond removing
large duplicate strings from the flow to better
suppress redundancy. In the first part of the paper, we
introduce ``memory-assisted compression,'' which
utilizes the memorized content within the network to
learn the statistics of the information source
generating the packets which can then be used toward
reducing the length of codewords describing the packets
emitted by the source. Using simulations on data
gathered from real network traces, we show that
memory-assisted compression can result in significant
traffic reduction. In the second part of the paper, we
study the scaling of the average network-wide benefits
of memory-assisted compression. We discuss routing and
memory placement problems in network for the reduction
of overall traffic. We derive a closed-form expression
for the scaling of the gain in Erd{\H{o}}s--R{\'e}nyi
random network graphs, where obtain a threshold value
for the number of memories deployed in a random graph
beyond which network-wide benefits start to shine.
Finally, the network-wide benefits are studied on
Internet-like scale-free networks. We show that
non-vanishing network compression gain is obtained even
when only a tiny fraction of the total number of nodes
in the network are memory-enabled.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bornholt:2016:DBA,
author = "James Bornholt and Randolph Lopez and Douglas M.
Carmean and Luis Ceze and Georg Seelig and Karin
Strauss",
title = "A {DNA}-Based Archival Storage System",
journal = j-COMP-ARCH-NEWS,
volume = "44",
number = "2",
pages = "637--649",
month = may,
year = "2016",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/2980024.2872397",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Jan 12 18:43:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "Demand for data storage is growing exponentially, but
the capacity of existing storage media is not keeping
up. Using DNA to archive data is an attractive
possibility because it is extremely dense, with a raw
limit of 1 exabyte/mm$^3$ (109 GB/mm$^3$ ), and
long-lasting, with observed half-life of over 500
years. This paper presents an architecture for a
DNA-based archival storage system. It is structured as
a key-value store, and leverages common biochemical
techniques to provide random access. We also propose a
new encoding scheme that offers controllable
redundancy, trading off reliability for density. We
demonstrate feasibility, random access, and robustness
of the proposed encoding with wet lab experiments
involving 151 kB of synthesized DNA and a 42 kB
random-access subset, and simulation experiments of
larger sets calibrated to the wet lab experiments.
Finally, we highlight trends in biotechnology that
indicate the impending practicality of DNA storage for
much larger datasets.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ASPLOS'16 conference proceedings.",
}
@Article{Caillaud:2016:GPC,
author = "F. Caillaud and V. Vidal and F. Dupont and G.
Lavou{\'e}",
title = "Geometry: Progressive compression of arbitrary
textured meshes",
journal = j-CGF,
volume = "35",
number = "7",
pages = "475--484",
month = oct,
year = "2016",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.13044",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Oct 28 10:54:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Cheng:2016:FCL,
author = "Long Cheng and Avinash Malik and Spyros Kotoulas and
Tomas E. Ward and Georgios Theodoropoulos",
title = "Fast Compression of Large {Semantic Web} Data Using
{X10}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "9",
pages = "2603--2617",
month = sep,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2496579",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Wed Aug 10 09:25:16 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "https://www.computer.org/csdl/trans/td/2016/09/07313002-abs.html",
abstract-URL = "https://www.computer.org/csdl/trans/td/2016/09/07313002-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}
@Article{Colin:2016:CTC,
author = "Alexei Colin and Brandon Lucia",
title = "{Chain}: tasks and channels for reliable intermittent
programs",
journal = j-SIGPLAN,
volume = "51",
number = "10",
pages = "514--530",
month = oct,
year = "2016",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3022671.2983995",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:13 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "Energy harvesting computers enable general-purpose
computing using energy collected from their
environment. Energy-autonomy of such devices has great
potential, but their intermittent power supply poses a
challenge. Intermittent program execution compromises
progress and leaves state inconsistent. This work
describes Chain: a new model for programming
intermittent devices. A Chain program is a set of
programmer-defined tasks that compute and exchange data
through channels. Chain guarantees forward progress at
task granularity. A task is restartable and never sees
inconsistent state, because its input and output
channels are separated. Our system supports language
features for expressing advanced data exchange patterns
and for encapsulating reusable functionality. Chain
fundamentally differs from state-of-the-art
checkpointing approaches and does not incur the
associated overhead. We implement Chain as C language
extensions and a runtime library. We used Chain to
implement four applications: machine learning,
encryption, compression, and sensing. In experiments,
Chain ensured consistency where prior approaches failed
and improved throughput by 2-7x over the leading
state-of-the-art system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "OOPSLA '16 conference proceedings.",
}
@Article{Dado:2016:TCG,
author = "Bas Dado and Timothy R. Kol and Pablo Bauszat and
Jean-Marc Thiery and Elmar Eisemann",
title = "Texturing \& Compression: Geometry and Attribute
Compression for Voxel Scenes",
journal = j-CGF,
volume = "35",
number = "2",
pages = "397--407",
month = may,
year = "2016",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.12841",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Jun 8 07:22:02 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Daly:2016:DRA,
author = "James Daly and Alex X. Liu and Eric Torng",
title = "A difference resolution approach to compressing access
control lists",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "610--623",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2397393",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Access control lists (ACLs) are the core of many
networking and security devices. As new threats and
vulnerabilities emerge, ACLs on routers and firewalls
are getting larger. Therefore, compressing ACLs is an
important problem. In this paper, we propose a new
approach, called Diplomat, to ACL compression. The key
idea is to transform higher dimensional target patterns
into lower dimensional patterns by dividing the
original pattern into a series of hyperplanes and then
resolving differences between two adjacent hyperplanes
by adding rules that specify the differences. This
approach is fundamentally different from prior ACL
compression algorithms and is shown to be very
effective. We implemented Diplomat and conducted
side-by-side comparison with the prior Firewall
Compressor, TCAM Razor, and ACL Compressor algorithms
on real life classifiers. Our experimental results show
that Diplomat outperforms all of them on most of our
real-life classifiers, often by a considerable margin,
particularly as classifier size and complexity
increases. In particular, on our largest ACLs, Diplomat
has an average improvement ratio of 34.9\% over
Firewall Compressor on range-ACLs, of 14.1\% over TCAM
Razor on prefix-ACLs, and 8.9\% over ACL Compressor on
mixed-ACLs.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Misc{DiazDiaz:2016:XFI,
author = "Antonio {Diaz Diaz}",
title = "Xz format inadequate for long-term archiving",
howpublished = "Web document.",
day = "11",
month = jun,
year = "2016",
bibdate = "Fri Sep 28 07:17:25 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Updated 20-Jul-2018.",
URL = "https://www.nongnu.org/lzip/xz_inadequate.html",
abstract = "One of the challenges of digital preservation is the
evaluation of data formats. It is important to choose
well-designed data formats for long-term archiving.
This article describes the reasons why the xz
compressed data format is inadequate for long-term
archiving and inadvisable for data sharing and for free
software distribution. The relevant weaknesses and
design errors in the xz format are analyzed and, where
applicable, compared with the corresponding behavior of
the bzip2, gzip and lzip formats. Key findings include:
(1) safe interoperability among xz implementations is
not guaranteed; (2) xz's extensibility is unreasonable
and problematic; (3) xz is vulnerable to unprotected
flags and length fields; (4) LZMA2 is unsafe and less
efficient than the original LZMA; (5) xz includes
useless features that increase the number of false
positives for corruption; (6) xz shows inconsistent
behavior with respect to trailing data; (7) error
detection in xz is several times less accurate than in
bzip2, gzip and lzip.",
acknowledgement = ack-nhfb,
}
@Article{Ebrahim:2016:MIB,
author = "Mansoor Ebrahim and Wai Chong Chia",
title = "Multiview Image Block Compressive Sensing with Joint
Multiphase Decoding for Visual Sensor Network",
journal = j-TOMCCAP,
volume = "12",
number = "2",
pages = "30:1--30:??",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2818712",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Thu Mar 3 17:36:33 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In this article, a multiview image compression
framework, which involves the use of Block-based
Compressive Sensing (BCS) and Joint Multiphase Decoding
(JMD), is proposed for a Visual Sensor Network (VSN).
In the proposed framework, one of the sensor nodes is
configured to serve as the reference node, the others
as nonreference nodes. The images are encoded
independently using the BCS to produce two observed
measurements that are transmitted to the host
workstation. In this case, the nonreference nodes
always encoded the images (I$_{NR}$ ) at a lower
subrate when compared with the images from the
reference nodes (I$_R$ ). The idea is to improve the
reconstruction of I$_{NR}$ using I$_R$. After the two
observed measurements are received by the host
workstation, they are first decoded independently, then
image registration is applied to align I$_R$ onto the
same plane of I$_{NR}$. The aligned I$_R$ is then fused
with I$_{NR}$, using wavelets to produce the projected
image I$_P$. Subsequently, the difference between the
measurements of the I$_P$ and I$_{NR}$ is calculated.
The difference is then decoded and added to I$_P$ to
produce the final reconstructed I$_{NR}$. The
simulation results show that the proposed framework is
able to improve the quality of I$_{NR}$ on average by
2dB to 3dB at lower subrates when compared with other
Compressive Sensing (CS)--based multiview image
compression frameworks.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Ebrahimi:2016:JPT,
author = "Touradj Ebrahimi and Siegfried Foessel and Fernando
Pereira and Peter Schelkens",
title = "{JPEG Pleno}: Toward an Efficient Representation of
Visual Reality",
journal = j-IEEE-MULTIMEDIA,
volume = "23",
number = "4",
pages = "14--20",
month = oct # "\slash " # dec,
year = "2016",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/mmul.2016.64",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 25 09:51:37 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2016/04/mmu2016040014-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Elgohary:2016:CLA,
author = "Ahmed Elgohary and Matthias Boehm and Peter J. Haas
and Frederick R. Reiss and Berthold Reinwald",
title = "Compressed linear algebra for large-scale machine
learning",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "9",
number = "12",
pages = "960--971",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.14778/2994509.2994515",
ISSN = "2150-8097",
bibdate = "Tue Sep 6 16:21:12 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Large-scale machine learning (ML) algorithms are often
iterative, using repeated read-only data access and
I/O-bound matrix-vector multiplications to converge to
an optimal model. It is crucial for performance to fit
the data into single-node or distributed main memory.
General-purpose, heavy- and lightweight compression
techniques struggle to achieve both good compression
ratios and fast decompression speed to enable
block-wise uncompressed operations. Hence, we initiate
work on compressed linear algebra (CLA), in which
lightweight database compression techniques are applied
to matrices and then linear algebra operations such as
matrix-vector multiplication are executed directly on
the compressed representations. We contribute effective
column compression schemes, cache-conscious operations,
and an efficient sampling-based compression algorithm.
Our experiments show that CLA achieves in-memory
operations performance close to the uncompressed case
and good compression ratios that allow us to fit larger
datasets into available memory. We thereby obtain
significant end-to-end performance improvements up to
26x or reduced memory requirements.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Ewetz:2016:CRC,
author = "Rickard Ewetz and Cheng-Kok Koh",
title = "Construction of Reconfigurable Clock Trees for {MCMM}
Designs Using Mode Separation and Scenario
Compression",
journal = j-TODAES,
volume = "21",
number = "4",
pages = "57:1--57:??",
month = sep,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2883609",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Sep 23 15:16:20 MDT 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "The clock networks of many modern circuits have to
operate in multiple corners and multiple modes (MCMM).
We propose to construct mode-reconfigurable clock trees
(MRCTs) based on mode separation and scenario
compression. The technique of scenario compression is
proposed to consider the timing constraints in multiple
scenarios at the same time, compressing the MCMM
problem into an equivalent single-corner multiple-mode
(SCMM), or single-corner single-mode (SCSM) problem.
The compression is performed by combining the skew
constraints of the different scenarios in skew
constraint graphs based on delay linearization and
dominating skew constraints. An MRCT consists of
several clock trees and mode separation involves,
depending on the active mode, selecting one of the
clock trees to deliver the clock signal. To limit the
overhead, the bottom part (closer to the clock sinks)
of all the different clock trees are shared and only
the top part (closer to the clock source) of the clock
network is mode reconfigurable. The reconfiguration is
realized using OR-gates and a one-input-multiple-output
demultiplexer. The experimental results show that for a
set of synthesized MCMM circuits, with 715 to 13, 216
sequential elements, the proposed approach can achieve
high yield.",
acknowledgement = ack-nhfb,
articleno = "57",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Ferragina:2016:CCO,
author = "Paolo Ferragina and Rossano Venturini",
title = "Compressed Cache-Oblivious String {B}-Tree",
journal = j-TALG,
volume = "12",
number = "4",
pages = "52:1--52:??",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2903141",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Fri Sep 2 19:05:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "In this article, we study three variants of the
well-known prefix-search problem for strings, and we
design solutions for the cache-oblivious model which
improve the best known results. Among these
contributions, we close (asymptotically) the classic
problem, which asks for the detection of the set of
strings that share the longest common prefix with a
queried pattern by providing an I/O-optimal solution
that matches the space lower bound for tries up to a
constant multiplicative factor of the form $ (1 +
\epsilon) $, for $ \epsilon > 0 $. Our solutions hinge
upon a novel compressed storage scheme that adds the
ability to decompress prefixes of the stored strings
I/O-optimally to the elegant locality-preserving front
coding (Bender et al. 2006) still preserving its space
bounds.",
acknowledgement = ack-nhfb,
articleno = "52",
fjournal = "ACM Transactions on Algorithms (TALG)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J982",
}
@Article{Fu:2016:FPP,
author = "Yongquan Fu and Ernst Biersack",
title = "False-Positive Probability and Compression
Optimization for Tree-Structured {Bloom} Filters",
journal = j-TOMPECS,
volume = "1",
number = "4",
pages = "19:1--19:39",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2940324",
ISSN = "2376-3639 (print), 2376-3647 (electronic)",
ISSN-L = "2376-3639",
bibdate = "Thu Jun 15 12:19:55 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tompecs.bib",
URL = "http://dl.acm.org/citation.cfm?id=2940324",
abstract = "Bloom filters are frequently used to to check the
membership of an item in a set. However, Bloom filters
face a dilemma: the transmission bandwidth and the
accuracy cannot be optimized simultaneously. This
dilemma is particularly severe for transmitting Bloom
filters to remote nodes when the network bandwidth is
limited. We propose a novel Bloom filter called
BloomTree that consists of a tree-structured
organization of smaller Bloom filters, each using a set
of independent hash functions. BloomTree spreads items
across levels that are compressed to reduce the
transmission bandwidth need. We show how to find
optimal configurations for BloomTree and investigate in
detail by how much BloomTree outperforms the standard
Bloom filter or the compressed Bloom filter. Finally,
we use the intersection of BloomTrees to predict the
set intersection, decreasing the false-positive
probabilities by several orders of magnitude compared
to both the compressed Bloom filter and the standard
Bloom filter.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Modeling and Performance
Evaluation of Computing Systems (TOMPECS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J1525",
}
@Article{Gaur:2016:BVC,
author = "Jayesh Gaur and Alaa R. Alameldeen and Sreenivas
Subramoney",
title = "Base-victim compression: an opportunistic cache
compression architecture",
journal = j-COMP-ARCH-NEWS,
volume = "44",
number = "3",
pages = "317--328",
month = jun,
year = "2016",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3007787.3001171",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Jan 12 18:43:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "The memory wall has motivated many enhancements to
cache management policies aimed at reducing misses.
Cache compression has been proposed to increase
effective cache capacity, which potentially reduces
capacity and conflict misses. However, complexity in
cache compression implementations could increase cache
power and access latency. On the other hand, advanced
cache replacement mechanisms use heuristics to reduce
misses, leading to significant performance gains. Both
cache compression and replacement policies should
collaborate to improve performance. In this paper, we
demonstrate that cache compression and replacement
policies can interact negatively. In many workloads,
performance gains from replacement policies are lost
due to the need to alter the replacement policy to
accommodate compression. This leads to sub-optimal
replacement policies that could lose performance
compared to an uncompressed cache. We introduce a
novel, opportunistic cache compression mechanism,
Base-Victim, based on an efficient cache design. Our
compression architecture improves performance on top of
advanced cache replacement policies, and guarantees a
hit rate at least as high as that of an uncompressed
cache. For cache-sensitive applications, Base-Victim
achieves an average 7.3\% performance gain for
single-threaded workloads, and 8.7\% gain for
four-thread multi-program workload mixes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ISCA '16 conference proceedings.",
}
@Article{Gauravaram:2016:BIC,
author = "Praveen Gauravaram and Nasour Bagheri and Lars R.
Knudsen",
title = "Building indifferentiable compression functions from
the {PGV} compression functions",
journal = j-DESIGNS-CODES-CRYPTOGR,
volume = "78",
number = "2",
pages = "547--581",
month = feb,
year = "2016",
CODEN = "DCCREC",
DOI = "https://doi.org/10.1007/s10623-014-0020-z",
ISSN = "0925-1022 (print), 1573-7586 (electronic)",
ISSN-L = "0925-1022",
bibdate = "Mon Jan 25 08:43:56 MST 2016",
bibsource = "http://link.springer.com/journal/10623/78/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/designscodescryptogr.bib",
URL = "http://link.springer.com/article/10.1007/s10623-014-0020-z",
acknowledgement = ack-nhfb,
fjournal = "Designs, Codes and Cryptography",
journal-URL = "http://link.springer.com/journal/10623",
}
@Article{Guerra:2016:PCS,
author = "An{\'\i}bal Guerra and Jaime Lotero and Sebasti{\'a}n
Isaza",
title = "Performance comparison of sequential and parallel
compression applications for {DNA} raw data",
journal = j-J-SUPERCOMPUTING,
volume = "72",
number = "12",
pages = "4696--4717",
month = dec,
year = "2016",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1753-4",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:30 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/72/12;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Guzun:2016:HQO,
author = "Gheorghi Guzun and Guadalupe Canahuate",
title = "Hybrid query optimization for hard-to-compress
bit-vectors",
journal = j-VLDB-J,
volume = "25",
number = "3",
pages = "339--354",
month = jun,
year = "2016",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-015-0419-9",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue May 24 16:31:54 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "Bit-vectors are widely used for indexing and
summarizing data due to their efficient processing in
modern computers. Sparse bit-vectors can be further
compressed to reduce their space requirement. Special
compression schemes based on run-length encoders have
been designed to avoid explicit decompression and
minimize the decoding overhead during query execution.
Moreover, highly compressed bit-vectors can exhibit a
faster query time than the non-compressed ones.
However, for hard-to-compress bit-vectors, compression
does not speed up queries and can add considerable
overhead. In these cases, bit-vectors are often stored
verbatim (non-compressed). On the other hand, queries
are answered by executing a cascade of bit-wise
operations involving indexed bit-vectors and
intermediate results. Often, even when the original
bit-vectors are hard to compress, the intermediate
results become sparse. It could be feasible to improve
query performance by compressing these bit-vectors as
the query is executed. In this scenario, it would be
necessary to operate verbatim and compressed
bit-vectors together. In this paper, we propose a
hybrid framework where compressed and verbatim bitmaps
can coexist and design algorithms to execute queries
under this hybrid model. Our query optimizer is able to
decide at run time when to compress or decompress a
bit-vector. Our heuristics show that the applications
using higher-density bitmaps can benefit from using
this hybrid model, improving both their query time and
memory utilization.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Huang:2016:CFL,
author = "Xiaomeng Huang and Yufang Ni and Dexun Chen and
Songbin Liu and Haohuan Fu and Guangwen Yang",
title = "{Czip}: A Fast Lossless Compression Algorithm for
Climate Data",
journal = j-INT-J-PARALLEL-PROG,
volume = "44",
number = "6",
pages = "1248--1267",
month = dec,
year = "2016",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-016-0403-z",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Tue Sep 20 10:50:01 MDT 2016",
bibsource = "http://link.springer.com/journal/10766/44/6;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
URL = "http://link.springer.com/article/10.1007/s10766-016-0403-z",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
}
@Article{I:2016:FLF,
author = "Tomohiro I. and Yuto Nakashima and Shunsuke Inenaga
and Hideo Bannai and Masayuki Takeda",
title = "Faster {Lyndon} factorization algorithms for {SLP} and
{LZ78} compressed text",
journal = j-THEOR-COMP-SCI,
volume = "656 (Part B)",
number = "??",
pages = "215--224",
day = "20",
month = dec,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Dec 9 12:17:02 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751600195X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Jagemar:2016:AMC,
author = "Marcus J{\"a}gemar and Sigrid Eldh and Andreas
Ermedahl and Bj{\"o}rn Lisper",
title = "Automatic message compression with overload
protection",
journal = j-J-SYST-SOFTW,
volume = "121",
number = "??",
pages = "209--222",
month = nov,
year = "2016",
CODEN = "JSSODM",
DOI = "https://doi.org/10.1016/j.jss.2016.04.010",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Sep 15 06:53:44 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0164121216300267",
acknowledgement = ack-nhfb,
fjournal = "Journal of Systems and Software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212/",
}
@Article{Jez:2016:RSP,
author = "Artur Jez",
title = "Recompression: a Simple and Powerful Technique for
Word Equations",
journal = j-J-ACM,
volume = "63",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2016",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2743014",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Wed May 4 17:20:31 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "In this article, we present an application of a simple
technique of local recompression, previously developed
by the author in the context algorithms for compressed
strings [Jez 2014a, 2015b, 2015a], to word equations.
The technique is based on local modification of
variables (replacing $X$ by $ a X$ or $ X a$) and
iterative replacement of pairs of letters occurring in
the equation by a ``fresh'' letter, which can be seen
as a bottom-up compression of the solution of the given
word equation, or, to be more specific, building a
Straight-Line Programme for the solution of the word
equation. Using this technique, we give new,
independent, and self-contained proofs of many known
results for word equations. To be more specific, the
presented (nondeterministic) algorithm runs in $ O (n
\log n)$ space and in time polynomial in $n$ and $ \log
N$, where $n$ is the size of the input equation and $N$
the size of the length-minimal solution of the word
equation. Furthermore, for $ O (1)$ variables, the
bound on the space consumption is in fact linear, that
is, $ O (m)$, where $m$ is the size of the space used
by the input. This yields that for each $k$ the set of
satisfiable word equations with $k$ variables is
context sensitive. The presented algorithm can be
easily generalised to a generator of all solutions of
the given word equation (without increasing the space
usage). Furthermore, a further analysis of the
algorithm yields an independent proof of doubly
exponential upper bound on the size of the
length-minimal solution. The presented algorithm does
not use exponential bound on the exponent of
periodicity. Conversely, the analysis of the algorithm
yields an independent proof of the exponential bound on
exponent of periodicity.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Kalpathy:2016:DPA,
author = "Ravi Kalpathy and Hosam Mahmoud",
title = "Degree profile of $m$-ary search trees: a vehicle for
data structure compression",
journal = j-PROBAB-ENGRG-INFORM-SCI,
volume = "30",
number = "1",
pages = "113--123",
month = jan,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1017/S0269964815000303",
ISSN = "0269-9648 (print), 1469-8951 (electronic)",
ISSN-L = "0269-9648",
bibdate = "Thu Aug 24 10:56:11 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/probab-engrg-inform-sci.bib",
URL = "https://www.cambridge.org/core/product/790B4495DD2902C2E6B5A66DAA03F5E7",
acknowledgement = ack-nhfb,
ajournal = "Probab. Engrg. Inform. Sci.",
fjournal = "Probability in the Engineering and Informational
Sciences",
journal-URL = "http://www.journals.cambridge.org/jid_PES",
onlinedate = "14 December 2015",
}
@Article{Karkkainen:2016:LLZ,
author = "Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Simon J.
Puglisi",
title = "Lazy {Lempel--Ziv} Factorization Algorithms",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "21",
number = "1",
pages = "2.4:1--2.4:??",
month = nov,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2699876",
ISSN = "1084-6654",
bibdate = "Fri Nov 4 16:46:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "For decades the Lempel--Ziv (LZ77) factorization has
been a cornerstone of data compression and string
processing algorithms, and uses for it are still being
uncovered. For example, LZ77 is central to several
recent text indexing data structures designed to search
highly repetitive collections. However, in many
applications computation of the factorization remains a
bottleneck in practice. In this article, we describe a
number of simple and fast LZ77 factorization
algorithms, which consistently outperform all previous
methods in practice, use less memory, and still offer
strong worst-case performance guarantees. A common
feature of the new algorithms is that they compute
longest common prefix information in a lazy fashion,
with the degree of laziness in preprocessing
characterizing different algorithms.",
acknowledgement = ack-nhfb,
articleno = "2.4",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Kaser:2016:CBI,
author = "Owen Kaser and Daniel Lemire",
title = "Compressed bitmap indexes: beyond unions and
intersections",
journal = j-SPE,
volume = "46",
number = "2",
pages = "167--198",
month = feb,
year = "2016",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2289",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Mon Feb 8 18:03:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "15 Sep 2014",
}
@Article{Kim:2016:BPC,
author = "Jungrae Kim and Michael Sullivan and Esha Choukse and
Mattan Erez",
title = "Bit-plane compression: transforming data for better
compression in many-core architectures",
journal = j-COMP-ARCH-NEWS,
volume = "44",
number = "3",
pages = "329--340",
month = jun,
year = "2016",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3007787.3001172",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Thu Jan 12 18:43:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "As key applications become more data-intensive and the
computational throughput of processors increases, the
amount of data to be transferred in modern memory
subsystems grows. Increasing physical bandwidth to keep
up with the demand growth is challenging, however, due
to strict area and energy limitations. This paper
presents a novel and lightweight compression algorithm,
Bit-Plane Compression (BPC), to increase the effective
memory bandwidth. BPC aims at homogeneously-typed
memory blocks, which are prevalent in many-core
architectures, and applies a smart data transformation
to both improve the inherent data compressibility and
to reduce the complexity of compression hardware. We
demonstrate that BPC provides superior compression
ratios of 4.1:1 for integer benchmarks and reduces
memory bandwidth requirements significantly.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "ISCA '16 conference proceedings.",
}
@Article{Kim:2016:ECI,
author = "Dongwook Kim and Youjip Won and Jaehyuk Cha and
Sungroh Yoon and Jongmoo Choi and Sooyong Kang",
title = "Exploiting Compression-Induced Internal Fragmentation
for Power-Off Recovery in {SSD}",
journal = j-IEEE-TRANS-COMPUT,
volume = "65",
number = "6",
pages = "1720--1733",
month = "????",
year = "2016",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2015.2462819",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue May 31 08:56:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers -",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Klein:2016:CMF,
author = "Shmuel T. Klein and Dana Shapira",
title = "Compressed matching for feature vectors",
journal = j-THEOR-COMP-SCI,
volume = "638",
number = "??",
pages = "52--62",
day = "25",
month = jul,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Jun 8 10:05:42 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515011822",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Krajcevski:2016:GGD,
author = "Pavel Krajcevski and Srihari Pratapa and Dinesh
Manocha",
title = "{GST}: {GPU}-decodable supercompressed textures",
journal = j-TOG,
volume = "35",
number = "6",
pages = "230:1--230:??",
month = nov,
year = "2016",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2980179.2982439",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Thu Nov 17 08:53:11 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/tog/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "Modern GPUs supporting compressed textures allow
interactive application developers to save scarce GPU
resources such as VRAM and bandwidth. Compressed
textures use fixed compression ratios whose lossy
representations are significantly poorer quality than
traditional image compression formats such as JPEG. We
present a new method in the class of supercompressed
textures that provides an additional layer of
compression to already compressed textures. Our texture
representation is designed for endpoint compressed
formats such as DXT and PVRTC and decoding on commodity
GPUs. We apply our algorithm to commonly used formats
by separating their representation into two parts that
are processed independently and then entropy encoded.
Our method preserves the CPU-GPU bandwidth during the
decoding phase and exploits the parallelism of GPUs to
provide up to 3X faster decode compared to prior
texture supercompression algorithms. Along with the
gains in decoding speed, our method maintains both the
compression size and quality of current state of the
art texture representations.",
acknowledgement = ack-nhfb,
articleno = "230",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Kuhn:2016:DCC,
author = "Michael Kuhn and Julian Kunkel and Thomas Ludwig",
title = "Data Compression for Climate Data",
journal = j-SUPERFRI,
volume = "3",
number = "1",
pages = "75--94",
month = "????",
year = "2016",
CODEN = "????",
ISSN = "2409-6008 (print), 2313-8734 (electronic)",
bibdate = "Sat Nov 11 07:15:27 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/superfri.bib",
URL = "http://superfri.org/superfri/article/view/101",
acknowledgement = ack-nhfb,
fjournal = "Supercomputing Frontiers and Innovations",
journal-URL = "http://superfri.org/superfri/issue/archive",
}
@Article{Lemire:2016:CFS,
author = "Daniel Lemire and Gregory Ssi-Yan-Kai and Owen Kaser",
title = "Consistently faster and smaller compressed bitmaps
with {Roaring}",
journal = j-SPE,
volume = "46",
number = "11",
pages = "1547--1569",
month = nov,
year = "2016",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2402",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Nov 15 15:25:10 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Lemire:2016:SCI,
author = "Daniel Lemire and Leonid Boytsov and Nathan Kurz",
title = "{SIMD} compression and the intersection of sorted
integers",
journal = j-SPE,
volume = "46",
number = "6",
pages = "723--749",
month = jun,
year = "2016",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2326",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Wed Jun 8 07:13:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Li:2016:RTA,
author = "Shing-Han Li and David C. Yen and Ying-Ping Chuang",
title = "A Real-Time Audit Mechanism Based on the Compression
Technique",
journal = j-TMIS,
volume = "7",
number = "2",
pages = "4:1--4:??",
month = aug,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2629569",
ISSN = "2158-656X (print), 2158-6578 (electronic)",
ISSN-L = "2158-656X",
bibdate = "Thu Mar 16 15:48:29 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tmis/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tmis.bib",
abstract = "Log management and log auditing have become
increasingly crucial for enterprises in this era of
information and technology explosion. The log analysis
technique is useful for discovering possible problems
in business processes and preventing illegal-intrusion
attempts and data-tampering attacks. Because of the
complexity of the dynamically changing environment,
auditing a tremendous number of data is a challenging
issue. We provide a real-time audit mechanism to
improve the aforementioned problems in log auditing.
This mechanism was developed based on the
Lempel--Ziv--Welch (LZW) compression technique to
facilitate effective compression and provide reliable
auditing log entries. The mechanism can be used to
predict unusual activities when compressing the log
data according to pre-defined auditing rules. Auditors
using real-time and continuous monitoring can perceive
instantly the most likely anomalies or exceptions that
could cause problems. We also designed a user interface
that allows auditors to define the various compression
and audit parameters, using real log cases in the
experiment to verify the feasibility and effectiveness
of this proposed audit mechanism. In summary, this
mechanism changes the log access method and improves
the efficiency of log analysis. This mechanism greatly
simplifies auditing so that auditors must only trace
the sources and causes of the problems related to the
detected anomalies. This greatly reduces the processing
time of analytical audit procedures and the manual
checking time, and improves the log audit efficiency.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Management Information Systems
(TMIS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1320",
}
@Article{Li:2016:TLL,
author = "Yimei Li and Yao Liang",
title = "Temporal Lossless and Lossy Compression in Wireless
Sensor Networks",
journal = j-TOSN,
volume = "12",
number = "4",
pages = "37:1--37:??",
month = nov,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2990196",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:36 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Energy efficiency is one of the most critical issues
in the design and deployment of Wireless Sensor
Networks (WSNs). Data compression is an important
approach to reducing energy consumption of data
gathering in multihop sensor networks. Existing
compression algorithms only apply to either lossless or
lossy data compression, but not to both. This article
presents a generalized predictive coding framework for
unified lossless and lossy data compression. In
addition, we devise a novel algorithm for lossless
compression to significantly improve data compression
performance for various data collections and
applications in WSNs. Rigorous simulations show our
proposed framework and compression algorithm outperform
several recent popular compression algorithms for WSNs
such as Lossless Entropy Compression (LEC),
S-Lempel--Ziv--Welch (LZW), and Lightweight Temporal
Compression (LTC) using various real-world sensor
datasets, demonstrating the merit of the proposed
framework for unified temporal lossless and lossy data
compression in WSNs.",
acknowledgement = ack-nhfb,
articleno = "37",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Liao:2016:LCG,
author = "Xiaofei Liao and Li Lin and Guang Tan and Hai Jin and
Xiaobin Yang and Wei Zhang and Bo Li",
title = "{LiveRender}: a Cloud Gaming System Based on
Compressed Graphics Streaming",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2128--2139",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2450254",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In cloud gaming systems, the game program runs at
servers in the cloud, while clients access game
services by sending input events to the servers and
receiving game scenes via video streaming. In this
paradigm, servers are responsible for all
performance-intensive operations, and thus suffer from
poor scalability. An alternative paradigm is called
graphics streaming, in which graphics commands and data
are offloaded to the clients for local rendering,
thereby mitigating the server's burden and allowing
more concurrent game sessions. Unfortunately, this
approach is bandwidth-consuming, due to large amounts
of graphic commands and geometry data. In this paper,
we present LiveRender, an open-source gaming system
that remedies the problem by implementing a suite of
bandwidth optimization techniques including intraframe
compression, interframe compression, and caching,
establishing what we call compressed graphics
streaming. Experiments results show that the new
approach is able to reduce bandwidth consumption by
52\%-73\% compared to raw graphics streaming, with no
perceptible difference in video quality and reduced
response delay. Compared to the video streaming
approach, LiveRender achieves a traffic reduction of
40\%-90\% with even improved video quality and
substantially smaller response delay, while enabling
higher concurrency at the server.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Liu:2016:ILL,
author = "Wei Jun Liu and Ge Nong and Wai hong Chan and Yi Wu",
title = "Improving a lightweight {LZ77} computation algorithm
for running faster",
journal = j-SPE,
volume = "46",
number = "9",
pages = "1201--1217",
month = sep,
year = "2016",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2377",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Sep 13 08:44:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Mittal:2016:SAA,
author = "Sparsh Mittal and Jeffrey S. Vetter",
title = "A Survey of Architectural Approaches for Data
Compression in Cache and Main Memory Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "5",
pages = "1524--1536",
month = may,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2435788",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Apr 15 13:45:22 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2016/05/07110612-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2016/05/07110612-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Moran:2016:SCS,
author = "Shay Moran and Amir Yehudayoff",
title = "Sample Compression Schemes for {VC} Classes",
journal = j-J-ACM,
volume = "63",
number = "3",
pages = "21:1--21:??",
month = sep,
year = "2016",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/2890490",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
bibdate = "Mon Apr 3 09:29:48 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "Sample compression schemes were defined by Littlestone
and Warmuth (1986) as an abstraction of the structure
underlying many learning algorithms. Roughly speaking,
a sample compression scheme of size $k$ means that
given an arbitrary list of labeled examples, one can
retain only $k$ of them in a way that allows us to
recover the labels of all other examples in the list.
They showed that compression implies probably
approximately correct learnability for binary-labeled
classes and asked whether the other direction holds. We
answer their question and show that every concept class
C with VC dimension $d$ has a sample compression scheme
of size exponential in d.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Na:2016:FIA,
author = "Joong Chae Na and Hyunjoon Kim and Heejin Park and
Thierry Lecroq and Martine L{\'e}onard and Laurent
Mouchard and Kunsoo Park",
title = "{FM-index} of alignment: a compressed index for
similar strings",
journal = j-THEOR-COMP-SCI,
volume = "638",
number = "??",
pages = "159--170",
day = "25",
month = jul,
year = "2016",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Jun 8 10:05:42 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397515007288",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Article{Nathan:2016:SRO,
author = "Senthil Nathan and Umesh Bellur and Purushottam
Kulkarni",
title = "On Selecting the Right Optimizations for Virtual
Machine Migration",
journal = j-SIGPLAN,
volume = "51",
number = "7",
pages = "37--49",
month = jul,
year = "2016",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3007611.2892247",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "To reduce the migration time of a virtual machine and
network traffic generated during migration, existing
works have proposed a number of optimizations to
pre-copy live migration. These optimizations are delta
compression, page skip, deduplication, and data
compression. The cost-benefit analysis of these
optimizations may preclude the use of certain
optimizations in specific scenarios. However, no study
has compared the performance {\&} cost of these
optimizations, and identified the impact of application
behaviour on performance gain. Hence, it is not clear
for a given migration scenario and an application, what
is the best optimization that one must employ? In this
paper, we present a comprehensive empirical study using
a large number of workloads to provide recommendations
on selection of optimizations for pre-copy live
migration. The empirical study reveals that page skip
is an important optimization as it reduces network
traffic by 20\% with negligible additional CPU cost.
Data compression yields impressive gains in reducing
network traffic (37\%) but at the cost of a significant
increase in CPU consumption (5$ \times $).
De-duplication needs to be applied with utmost care as
the increase in CPU utilization might outweigh the
benefits considerably. The combination of page skip and
data compression works the best across workloads and
results in a significant reduction in network traffic
(40\%).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "VEE '16 conference proceedings.",
}
@Article{Navarro:2016:FCS,
author = "Gonzalo Navarro and Alberto Ord{\'o}{\~n}ez Pereira",
title = "Faster Compressed Suffix Trees for Repetitive
Collections",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "21",
number = "1",
pages = "1.8:1--1.8:??",
month = nov,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2851495",
ISSN = "1084-6654",
bibdate = "Fri Nov 4 16:46:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
abstract = "Recent compressed suffix trees targeted to highly
repetitive sequence collections reach excellent
compression performance, but operation times are very
high. We design a new suffix tree representation for
this scenario that still achieves very low space usage,
only slightly larger than the best previous one, but
supports the operations orders of magnitude faster. Our
suffix tree is still orders of magnitude slower than
general-purpose compressed suffix trees, but these use
several times more space when the collection is
repetitive. Our main novelty is a practical
grammar-compressed tree representation with full
navigation functionality, which is useful in all
applications where large trees with repetitive topology
must be represented.",
acknowledgement = ack-nhfb,
articleno = "1.8",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Novoselsky:2016:RAD,
author = "Alexander Novoselsky and Eugene Kagan",
title = "Remark on {``Algorithm 673: Dynamic Huffman
Coding''}",
journal = j-TOMS,
volume = "42",
number = "1",
pages = "10:1--10:1",
month = feb,
year = "2016",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/2740959",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Tue Mar 1 17:07:56 MST 2016",
bibsource = "http://www.acm.org/pubs/contents/journals/toms/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
note = "See \cite{Vitter:1989:ADH}.",
abstract = "This remark presents a correction to Algorithm 673
(dynamic Huffman coding) [Vitter 1989] and its
translation to MATLAB.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J782",
}
@Article{Osorio:2016:FAC,
author = "Roberto R. Osorio and Patricia Gonz{\'a}lez",
title = "A fast algorithm for constructing nearly optimal
prefix codes",
journal = j-SPE,
volume = "46",
number = "10",
pages = "1299--1316",
month = oct,
year = "2016",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2375",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Sep 13 08:44:23 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Pomeranz:2016:PSS,
author = "Irith Pomeranz",
title = "Periodic Scan-In States to Reduce the Input Test Data
Volume for Partially Functional Broadside Tests",
journal = j-TODAES,
volume = "22",
number = "1",
pages = "7:1--7:??",
month = dec,
year = "2016",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2911983",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 21 10:49:29 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "This article describes a procedure for test data
compression targeting functional and partially
functional broadside tests. The scan-in state of such a
test is either a reachable state or has a known Hamming
distance from a reachable state. Reachable states are
fully specified, while the popular LFSR -based test
data compression methods require the use of
incompletely specified test cubes. The test data
compression approach considered in this article is
based on the use of periodic scan-in states. Such
states require the storage of a period that can be
significantly shorter than a scan-in state, thus
providing test data compression. The procedure computes
a set of periods that is sufficient for detecting all
the detectable target faults. Considering the scan-in
states that the periods produce, the procedure ranks
the periods based on the distances of the scan-in
states from reachable states, and the lengths of the
periods. Functional and partially functional broadside
tests are generated preferring shorter periods with
smaller Hamming distances. The results are compared
with those of an LFSR -based approach.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Ponchio:2016:MFD,
author = "Federico Ponchio and Matteo Dellepiane",
title = "Multiresolution and fast decompression for optimal
web-based rendering",
journal = j-GRAPH-MODELS,
volume = "88",
number = "??",
pages = "1--11",
month = nov,
year = "2016",
CODEN = "GRMOFM",
DOI = "https://doi.org/10.1016/j.gmod.2016.09.002",
ISSN = "1524-0703 (print), 1524-0711 (electronic)",
ISSN-L = "1524-0703",
bibdate = "Thu Dec 1 12:33:40 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/graph-models.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1524070316300285",
acknowledgement = ack-nhfb,
fjournal = "Graphical Models",
journal-URL = "http://www.sciencedirect.com/science/journal/15240703/",
}
@Article{Raja:2016:EMT,
author = "S. P. Raja and A. Suruliandi",
title = "Evaluating Multiscale Transform Based Image
Compression Using Encoding Techniques",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "16",
number = "4",
pages = "1650018",
month = oct,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467816500182",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Thu Nov 17 05:56:01 MST 2016",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Retvari:2016:CIF,
author = "G{\'a}bor R{\'e}tv{\'a}ri and J{\'a}nos Tapolcai and
Attila K{\H{o}}r{\"o}si and Andr{\'a}s Majd{\'a}n and
Zal{\'a}n Heszberger",
title = "Compressing {IP} forwarding tables: towards entropy
bounds and beyond",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "1",
pages = "149--162",
month = feb,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2014.2357051",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Mon May 23 16:25:57 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Lately, there has been an upsurge of interest in
compressed data structures, aiming to pack ever larger
quantities of information into constrained memory
without sacrificing the efficiency of standard
operations, like random access, search, or update. The
main goal of this paper is to demonstrate how data
compression can benefit the networking community by
showing how to squeeze the IP Forwarding Information
Base (FIB), the giant table consulted by IP routers to
make forwarding decisions, into information-theoretical
entropy bounds, with essentially zero cost on longest
prefix match and FIB update. First, we adopt the state
of the art in compressed data structures, yielding a
static entropy-compressed FIB representation with
asymptotically optimal lookup. Then, we redesign the
venerable prefix tree, used commonly for IP lookup for
at least 20 years in IP routers, to also admit entropy
bounds and support lookup in optimal time and update in
nearly optimal time. Evaluations on a Linux kernel
prototype indicate that our compressors encode an FIB
comprising more than 440 K prefixes to just about
100-400 kB of memory, with a threefold increase in
lookup throughput and no penalty on FIB updates.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Richter:2016:JXN,
author = "Thomas Richter and Alessandro Artusi and Touradj
Ebrahimi",
title = "{JPEG XT}: A New Family of {JPEG} Backward-Compatible
Standards",
journal = j-IEEE-MULTIMEDIA,
volume = "23",
number = "3",
pages = "80--88",
month = jul # "\slash " # sep,
year = "2016",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/mmul.2016.49",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Tue Oct 25 09:05:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2016/03/mmu2016030080-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Ringh:2016:MRC,
author = "Axel Ringh and Johan Karlsson and Anders Lindquist",
title = "Multidimensional Rational Covariance Extension with
Applications to Spectral Estimation and Image
Compression",
journal = j-SIAM-J-CONTROL-OPTIM,
volume = "54",
number = "4",
pages = "1950--1982",
month = "????",
year = "2016",
CODEN = "SJCODC",
DOI = "https://doi.org/10.1137/15M1043236",
ISSN = "0363-0129 (print), 1095-7138 (electronic)",
ISSN-L = "0363-0129",
bibdate = "Fri Sep 23 09:27:56 MDT 2016",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICON/54/4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcontroloptim.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Control and Optimization",
journal-URL = "http://epubs.siam.org/sicon",
onlinedate = "January 2016",
}
@Article{Saleh:2016:PAN,
author = "Bassel Saleh and Dongyu Qiu",
title = "Performance Analysis of Network-Coding-Based {P2P}
Live Streaming Systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "24",
number = "4",
pages = "2140--2153",
month = aug,
year = "2016",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2015.2448597",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Oct 28 17:19:55 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Peer-to-peer P2P video streaming is a scalable and
cost-effective technology to stream video content to a
large population of users and has attracted a lot of
research for over a decade now. Recently, network
coding has been introduced to improve the efficiency of
these systems and to simplify the protocol design.
There are already some successful commercial
applications that utilize network coding. However,
previous analytical studies of network-coding-based P2P
streaming systems mainly focused on fundamental
properties of the system and ignored the influence of
the protocol details. In this study, a unique
stochastic model is developed to reveal how segments of
the video stream evolve over their lifetime in the
buffer before they go into playback. Different
strategies for segment selection have been studied with
the model, and their performance has been compared. A
new approximation of the probability of linear
independence of coded blocks has been proposed to study
the redundancy of network coding. Finally, extensive
numerical results and simulations have been provided to
validate our model. From these results, in-depth
insights into how system parameters and segment
selection strategies affect the performance of the
system have been obtained.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Sardashti:2016:YAC,
author = "Somayeh Sardashti and Andre Seznec and David A. Wood",
title = "Yet Another Compressed Cache: a Low-Cost Yet Effective
Compressed Cache",
journal = j-TACO,
volume = "13",
number = "3",
pages = "27:1--27:??",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2976740",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Sat Sep 17 16:20:58 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Cache memories play a critical role in bridging the
latency, bandwidth, and energy gaps between cores and
off-chip memory. However, caches frequently consume a
significant fraction of a multicore chip's area and
thus account for a significant fraction of its cost.
Compression has the potential to improve the effective
capacity of a cache, providing the performance and
energy benefits of a larger cache while using less
area. The design of a compressed cache must address two
important issues: (i) a low-latency, low-overhead
compression algorithm that can represent a fixed-size
cache block using fewer bits and (ii) a cache
organization that can efficiently store the resulting
variable-size compressed blocks. This article focuses
on the latter issue. Here, we propose Yet Another
Compressed Cache (YACC), a new compressed cache design
that targets improving effective cache capacity with a
simple design. YACC uses super-blocks to reduce tag
overheads while packing variable-size compressed blocks
to reduce internal fragmentation. YACC achieves the
benefits of two state-of-the art compressed
caches-Decoupled Compressed Cache (DCC) [Sardashti and
Wood 2013a, 2013b] and Skewed Compressed Cache (SCC)
[Sardashti et al. 2014]-with a more practical and
simpler design. YACC's cache layout is similar to
conventional caches, with a largely unmodified tag
array and unmodified data array. Compared to DCC and
SCC, YACC requires neither the significant extra
metadata (i.e., back pointers) needed by DCC to track
blocks nor the complexity and overhead of skewed
associativity (i.e., indexing ways differently) needed
by SCC. An additional advantage over previous work is
that YACC enables modern replacement mechanisms, such
as RRIP. For our benchmark set, compared to a
conventional uncompressed 8MB LLC, YACC improves
performance by 8\% on average and up to 26\%, and
reduces total energy by 6\% on average and up to 20\%.
An 8MB YACC achieves approximately the same performance
and energy improvements as a 16MB conventional cache at
a much smaller silicon footprint, with only 1.6\%
greater area than an 8MB conventional cache. YACC
performs comparably to DCC and SCC but is much simpler
to implement.",
acknowledgement = ack-nhfb,
articleno = "27",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Scandolo:2016:ERM,
author = "Leonardo Scandolo and Pablo Bauszat and Elmar
Eisemann",
title = "Efficient Rendering: Merged Multiresolution
Hierarchies for Shadow Map Compression",
journal = j-CGF,
volume = "35",
number = "7",
pages = "383--390",
month = oct,
year = "2016",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.13035",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Fri Oct 28 10:54:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Shkurti:2016:PPB,
author = "Ardita Shkurti and Ramon Goni and Pau Andrio and Elena
Breitmoser and Iain Bethune and Modesto Orozco and
Charles A. Laughton",
title = "\pkg{pyPcazip}: a {PCA}-based toolkit for compression
and analysis of molecular simulation data",
journal = j-SOFTWAREX,
volume = "5",
number = "??",
pages = "37--43",
month = "????",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1016/j.softx.2016.04.002",
ISSN = "2352-7110",
ISSN-L = "2352-7110",
bibdate = "Sat Sep 8 11:45:31 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/softwarex.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S2352711016300036",
acknowledgement = ack-nhfb,
fjournal = "SoftwareX",
journal-URL = "https://www.sciencedirect.com/journal/softwarex/issues",
}
@Article{Sodsong:2016:DPB,
author = "Wasuwee Sodsong and Jingun Hong and Seongwook Chung
and Yeongkyu Lim and Shin-Dug Kim and Bernd
Burgstaller",
title = "Dynamic partitioning-based {JPEG} decompression on
heterogeneous multicore architectures",
journal = j-CCPE,
volume = "28",
number = "2",
pages = "517--536",
month = feb,
year = "2016",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3620",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue Feb 9 06:13:21 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "14 Aug 2015",
}
@Article{Sowmyayani:2016:ETR,
author = "S. Sowmyayani and P. Arockia Jansi Rani",
title = "An Efficient Temporal Redundancy Transformation for
Wavelet Based Video Compression",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "16",
number = "3",
pages = "1650015",
month = jul,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467816500157",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Wed Nov 16 05:43:38 MST 2016",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Sun:2016:NEB,
author = "Shuliang Sun",
title = "A novel edge based image steganography with $ 2^k $
correction and {Huffman} encoding",
journal = j-INFO-PROC-LETT,
volume = "116",
number = "2",
pages = "93--99",
month = feb,
year = "2016",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2015.09.016",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Sat Nov 28 07:11:23 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019015001738",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190/",
}
@Article{Takeda:2016:CBE,
author = "Kotaro Takeda and Naoki Kobayashi and Kazuya Yaguchi
and Ayumi Shinohara",
title = "Compact bit encoding schemes for simply-typed
lambda-terms",
journal = j-SIGPLAN,
volume = "51",
number = "9",
pages = "146--157",
month = sep,
year = "2016",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/3022670.2951918",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sat Sep 16 10:18:13 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
abstract = "We consider the problem of how to compactly encode
simply-typed \lambda -terms into bit strings. The work
has been motivated by Kobayashi et al.'s recent work on
higher-order data compression, where data are encoded
as functional programs (or, \lambda -terms) that
generate them. To exploit its good compression power,
the compression scheme has to come with a method for
compactly encoding the \lambda -terms into bit strings.
To this end, we propose two type-based bit-encoding
schemes; the first one encodes a \lambda -term into a
sequence of symbols by using type information, and then
applies arithmetic coding to convert the sequence to a
bit string. The second one is more sophisticated; we
prepare a context-free grammar (CFG) that describes
only well-typed terms, and then use a variation of
arithmetic coding specialized for the CFG. We have
implemented both schemes and confirmed that they often
output more compact codes than previous bit encoding
schemes for \lambda -terms.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
remark = "ICFP '16 conference proceedings.",
}
@Article{Valero:2016:ELD,
author = "Alejandro Valero and Negar Miralaei and Salvador Petit
and Julio Sahuquillo and Timothy M. Jones",
title = "Enhancing the {L1} Data Cache Design to Mitigate
{HCI}",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "15",
number = "2",
pages = "93--96",
month = jul # "\slash " # dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2015.2460736",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Over the lifetime of a microprocessor, the Hot Carrier
Injection (HCI) phenomenon degrades the threshold
voltage, which causes slower transistor switching and
eventually results in timing violations and faulty
operation. This effect appears when the memory cell
contents flip from logic `0' to `1' and vice versa. In
caches, the majority of cell flips are concentrated
into only a few of the total memory cells that make up
each data word. In addition, other researchers have
noted that zero is the most commonly-stored data value
in a cache, and have taken advantage of this behavior
to propose data compression and power reduction
techniques. Contrary to these works, we use this
information to extend the lifetime of the caches by
introducing two microarchitectural techniques that
spread and reduce the number of flips across the
first-level (L1) data cache cells. Experimental results
show that, compared to the conventional approach, the
proposed mechanisms reduce the highest cell flip peak
up to 65.8 percent, whereas the threshold voltage
degradation savings range from 32.0 to 79.9 percent
depending on the application.",
acknowledgement = ack-nhfb,
affiliation = "Valero, A (Reprint Author), Univ Politecn Valencia,
Dept Comp Engn, Valencia, Spain. Valero, Alejandro;
Petit, Salvador; Sahuquillo, Julio, Univ Politecn
Valencia, Dept Comp Engn, Valencia, Spain. Miralaei,
Negar; Jones, Timothy M., Univ Cambridge, Comp Lab,
Cambridge, England.",
author-email = "alvabre@gap.upv.es negar.miralaei@cl.cam.ac.uk
spetit@disca.upv.es jsahuqui@disca.upv.es
timothy.jones@cl.cam.ac.uk",
da = "2019-06-20",
doc-delivery-number = "EH9MM",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "Spanish Ministerio de Economia y
Competitividad (MINECO); FEDER funds
[TIN2012-38341-C04-01]; Intel Early Career Faculty
Honor Program Award; HiPEAC Collaboration Grant-FP7
HiPEAC Network of Excellence [287759]; Engineering and
Physical Sciences Research Council (EPSRC)
[EP/K026399/1, EP/J016284/1]; Engineering and Physical
Sciences Research Council [EP/J016284/1,
EP/K026399/1]",
funding-text = "This work has been supported by the Spanish Ministerio
de Economia y Competitividad (MINECO), by FEDER funds
through Grant TIN2012-38341-C04-01, by the Intel Early
Career Faculty Honor Program Award, by a HiPEAC
Collaboration Grant funded by the FP7 HiPEAC Network of
Excellence under grant agreement 287759, and by the
Engineering and Physical Sciences Research Council
(EPSRC) through Grants EP/K026399/1 and EP/J016284/1.
Additional data related to this publication are
available in the data repository at
https://www.repository.cam.ac.uk/handle/1810/249006.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "Cache memories; cell flip peaks; Hot Carrier
Injection; threshold voltage degradation",
number-of-cited-references = "10",
oa = "Green Accepted, Green Published",
ORCID-numbers = "Valero, Alejandro/0000-0002-0824-5833",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Valero:2016:ELD",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@InProceedings{Vidhyaa:2016:HED,
author = "V. G. Vidhyaa and S. A. Rajalakshmi and R. Raghavan
and G. S. V. {Venu Gopal} and R. Gandhiraj",
booktitle = "{2016 International Conference on Communication and
Signal Processing (ICCSP)}",
title = "{Huffman} encoding and decoding algorithm using
{IJulia}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "0587--0591",
year = "2016",
DOI = "https://doi.org/10.1109/ICCSP.2016.7754207",
bibdate = "Thu Apr 8 07:17:08 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/julia.bib",
acknowledgement = ack-nhfb,
keywords = "Julia programming language",
}
@Article{Wang:2016:DBS,
author = "Changda Wang and Syed Rafiul Hussain and Elisa
Bertino",
title = "Dictionary Based Secure Provenance Compression for
Wireless Sensor Networks",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "27",
number = "2",
pages = "405--418",
month = feb,
year = "2016",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2015.2402156",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Jan 19 07:28:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "http://www.computer.org/csdl/trans/td/2016/02/07038199-abs.html",
abstract-URL = "http://www.computer.org/csdl/trans/td/2016/02/07038199-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Ye:2016:PUL,
author = "Fang Ye and Xun Zhang and Yibing Li and Hui Huang",
title = "Primary User Localization Algorithm Based on
Compressive Sensing in Cognitive Radio Networks",
journal = j-ALGORITHMS-BASEL,
volume = "9",
number = "2",
month = jun,
year = "2016",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a9020025",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/9/2/25",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Xun Zhang/0000-0003-1203-6732",
pagecount = "??",
pubdates = "Received: 22 January 2016 / Revised: 3 April 2016 /
Accepted: 11 April 2016 / Published: 14 April 2016",
}
@Article{Al-Okaily:2017:TBC,
author = "Anas Al-Okaily and Badar Almarri and Sultan {Al Yami}
and Chun-Hsi Huang",
title = "Toward a Better Compression for {DNA} Sequences Using
{Huffman} Encoding",
journal = j-J-COMPUT-BIOL,
volume = "24",
number = "4",
pages = "280--288",
month = apr,
year = "2017",
CODEN = "JCOBEM",
DOI = "https://doi.org/10.1089/cmb.2016.0151",
ISSN = "1066-5277 (print), 1557-8666 (electronic)",
ISSN-L = "1066-5277",
bibdate = "Sat Jun 1 09:52:51 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputbiol.bib",
URL = "https://www.liebertpub.com/doi/abs/10.1089/cmb.2016.0151;
https://www.liebertpub.com/doi/pdf/10.1089/cmb.2016.0151",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Biology",
journal-URL = "https://www.liebertpub.com/loi/cmb/",
onlinedate = "13 December 2016",
}
@Article{Baig:2017:MHC,
author = "Mohammad Haris Baig and Lorenzo Torresani",
title = "Multiple hypothesis colorization and its application
to image compression",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "164",
number = "??",
pages = "111--123",
month = nov,
year = "2017",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Dec 23 07:29:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cviu.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1077314217300267",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding: CVIU",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142/",
}
@Article{Basheer:2017:CBQ,
author = "Aseel Basheer and Kewei Sha",
title = "Cluster-Based Quality-Aware Adaptive Data Compression
for Streaming Data",
journal = j-JDIQ,
volume = "9",
number = "1",
pages = "2:1--2:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3122863",
ISSN = "1936-1955",
bibdate = "Mon Jan 22 16:07:56 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jdiq.bib",
abstract = "Wireless sensor networks (WSNs) are widely applied in
data collection applications. Energy efficiency is one
of the most important design goals of WSNs. In this
article, we examine the tradeoffs between the energy
efficiency and the data quality. First, four attributes
used to evaluate data quality are formally defined.
Then, we propose a novel data compression algorithm,
Quality-Aware Adaptive data Compression (QAAC), to
reduce the amount of data communication to save energy.
QAAC utilizes an adaptive clustering algorithm to build
clusters from dataset; then a code for each cluster is
generated and stored in a Huffman encoding tree. The
encoding algorithm encodes the original dataset based
on the Haffman encoding tree. An improvement algorithm
is also designed to reduce the information loss when
data are compressed. After the encoded data, the
Huffman encoding tree and parameters used in the
improvement algorithm have been received at the sink, a
decompression algorithm is used to retrieve the
approximation of the original dataset. The performance
evaluation shows that QAAC is efficient and achieves a
much higher compression ratio than lossy and lossless
compression algorithms, while it has much smaller
information loss than lossy compression algorithms.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "Journal of Data and Information Quality (JDIQ)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1191",
}
@Article{Cao:2017:DEC,
author = "Yi Cao and Javad Nejati and Muhammad Wajahat and Aruna
Balasubramanian and Anshul Gandhi",
title = "Deconstructing the Energy Consumption of the Mobile
Page Load",
journal = j-SIGMETRICS,
volume = "45",
number = "1",
pages = "68--68",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3143314.3078587",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Mon Sep 18 17:31:18 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "Mobile Web page performance is critical to content
providers, service providers, and users, as Web
browsers are one of the most popular apps on phones.
Slow Web pages are known to adversely affect profits
and lead to user abandonment. While improving mobile
web performance has drawn increasing attention, most
optimizations tend to overlook an important factor,
energy. Given the importance of battery life for mobile
users, we argue that web page optimizations should be
evaluated for their impact on energy consumption.
However, examining the energy effects of a web
optimization is challenging, even if one has access to
power monitors, for several reasons. First, the page
load process is relatively short-lived, ranging from
several milliseconds to a few seconds. Fine-grained
resource monitoring on such short timescales to model
energy consumption is known to incur substantial
overhead. Second, Web pages are complex. A Web
enhancement can have widely varying effects on
different page load activities. Thus, studying the
energy impact of a Web enhancement on page loads
requires understanding its effects on each page load
activity. Existing approaches to analyzing mobile
energy typically focus on profiling and modeling the
resource consumption of the device during execution.
Such approaches consider long-running services and apps
such as games, audio, and video streaming, for which
low-overhead, coarse-grained resource monitoring
suffices. For page loads, however, coarse-grained
resource monitoring is not sufficient to analyze the
energy consumption of individual, short-lived, page
load activities. We present RECON (REsource- and
COmpoNent-based modeling), a modeling approach that
addresses the above challenges to estimate the energy
consumption of any Web page load. The key intuition
behind RECON is to go beyond resource-level information
and exploit application-level semantics to capture the
individual Web page load activities. Instead of
modeling the energy consumption at the full page load
level, which is too coarse grained, RECON models at a
much finer component level granularity. Components are
individual page load activities such as loading
objects, parsing the page, or evaluating JavaScript. To
do this, RECON combines coarse-grained resource
utilization and component-level Web page load
information available from existing tools. During the
initial training stage, RECON uses a power monitor to
measure the energy consumption during a set of page
load processes and juxtaposes this power consumption
with coarse-grained resource and component information.
RECON uses both simple linear regression and more
complex neural networks to build a model of the power
consumption as a function of the resources used and the
individual page load components, thus providing
benefits over individual models. Using the model, RECON
can estimate the energy consumption of any Web page
loaded as-is or upon applying any enhancement, without
the monitor. We experimentally evaluate RECON on the
Samsung Galaxy S4, S5, and Nexus devices using 80 Web
pages. Comparisons with actual power measurements from
a fine-grained power meter show that, using the linear
regression model, RECON can estimate the energy
consumption of the entire page load with a mean error
of 6.3\% and that of individual page load activity
segments with a mean error of 16.4\%. When trained as a
neural network, RECON's mean error for page energy
estimation reduces to 5.4\% and the mean segment error
is 16.5\%. We show that RECON can accurately estimate
the energy consumption of a Web page under different
network conditions, such as lower bandwidth or higher
RTT, even when the model is trained under a default
network condition. RECON also accurately estimates the
energy consumption of a Web page after applying popular
Web enhancements including ad blocking, inlining,
compression, and caching.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
}
@Article{Chen:2017:VME,
author = "Jiageng Chen and Rashed Mazumder and Atsuko Miyaji and
Chunhua Su",
title = "Variable message encryption through blockcipher
compression function",
journal = j-CCPE,
volume = "29",
number = "7",
pages = "??--??",
day = "10",
month = apr,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.3956",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Fri Mar 31 19:12:52 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{DeAgostino:2017:CVE,
author = "Sergio {De Agostino} and Bruno Carpentieri and
Raffaele Pizzolante",
title = "Concurrent vs. Exclusive Reading in Parallel Decoding
of {LZ}-Compressed Files",
journal = j-ALGORITHMS-BASEL,
volume = "10",
number = "1",
month = mar,
year = "2017",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a10010021",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/10/1/21",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Sergio De Agostino/0000-0002-1379-8010",
pagecount = "??",
pubdates = "Received: 25 November 2016 / Revised: 24 December 2016
/ Accepted: 23 January 2017 / Published: 28 January
2017",
}
@Article{Deng:2017:EOD,
author = "Ze Deng and Wei Han and Lizhe Wang and Rajiv Ranjan
and Albert Y. Zomaya and Wei Jie",
title = "An efficient online direction-preserving compression
approach for trajectory streaming data",
journal = j-FUT-GEN-COMP-SYS,
volume = "68",
number = "??",
pages = "150--162",
month = mar,
year = "2017",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2016.09.019",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Dec 10 08:32:13 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16303508",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/",
}
@Article{Dutta:2017:EFC,
author = "Tanima Dutta and Hari Prabhat Gupta",
title = "An Efficient Framework for Compressed Domain
Watermarking in {$P$} Frames of High-Efficiency Video
Coding ({HEVC})-Encoded Video",
journal = j-TOMCCAP,
volume = "13",
number = "1",
pages = "12:1--12:??",
month = jan,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3002178",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Jan 18 17:18:28 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "Digital watermarking has received much attention in
recent years as a promising solution to copyright
protection. Video watermarking in compressed domain has
gained importance since videos are stored and
transmitted in a compressed format. This decreases the
overhead to fully decode and re-encode the video for
embedding and extraction of the watermark. High
Efficiency Video Coding (HEVC/H.265) is the latest and
most efficient video compression standard and a
successor to H.264 Advanced Video Coding. In this
article, we propose a robust watermarking framework for
HEVC-encoded video using informed detector. A readable
watermark is embedded invisibly in P frames for better
perceptual quality. Our framework imposes security and
robustness by selecting appropriate blocks using a
random key and the spatio-temporal characteristics of
the compressed video. A detail analysis of the
strengths of different compressed domain features is
performed for implementing the watermarking framework.
We experimentally demonstrate the utility of the
proposed work. The results show that the proposed work
effectively limits the increase in video bitrate and
degradation in perceptual quality. The proposed
framework is robust against re-encoding and image
processing attacks.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Eberhard:2017:ACF,
author = "Sebastian Eberhard and Gabriel Ebner and Stefan
Hetzl",
title = "Algorithmic Compression of Finite Tree Languages by
Rigid Acyclic Grammars",
journal = j-TOCL,
volume = "18",
number = "4",
pages = "26:1--26:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3127401",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Sat Dec 23 10:57:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "We present an algorithm to optimally compress a finite
set of terms using a vectorial totally rigid acyclic
tree grammar. This class of grammars has a tight
connection to proof theory, and the grammar compression
problem considered in this article has applications in
automated deduction. The algorithm is based on a
polynomial-time reduction to the MaxSAT optimization
problem. The crucial step necessary to justify this
reduction consists of applying a term rewriting
relation to vectorial totally rigid acyclic tree
grammars. Our implementation of this algorithm performs
well on a large real-world dataset.",
acknowledgement = ack-nhfb,
articleno = "26",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
}
@Article{Elgohary:2017:SML,
author = "Ahmed Elgohary and Matthias Boehm and Peter J. Haas
and Frederick R. Reiss and Berthold Reinwald",
title = "Scaling Machine Learning via Compressed Linear
Algebra",
journal = j-SIGMOD,
volume = "46",
number = "1",
pages = "42--49",
month = mar,
year = "2017",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/3093754.3093765",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jul 24 10:03:00 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigmod.bib",
abstract = "Large-scale machine learning (ML) algorithms are often
iterative, using repeated read-only data access and I/O
bound matrix-vector multiplications to converge to an
optimal model. It is crucial for performance to fit the
data into single-node or distributed main memory and
enable very fast matrix-vector operations on in-memory
data. General purpose, heavy- and lightweight
compression techniques struggle to achieve both good
compression ratios and fast decompression speed to
enable block-wise uncompressed operations. Compressed
linear algebra (CLA) avoids these problems by applying
lightweight lossless database compression techniques to
matrices and then executing linear algebra operations
such as matrix-vector multiplication directly on the
compressed representations. The key ingredients are
effective column compression schemes, cache-conscious
operations, and an efficient sampling-based compression
algorithm. Experiments on an initial implementation in
SystemML show in-memory operations performance close to
the uncompressed case and good compression ratios.We
thereby obtain significant end-to-end performance
improvements up to 26x or reduced memory
requirements.",
acknowledgement = ack-nhfb,
fjournal = "SIGMOD Record (ACM Special Interest Group on
Management of Data)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
}
@Article{Fan:2017:MPC,
author = "Xinxin Fan and Adilet Otemissov and Francesco Sica and
Andrey Sidorenko",
title = "Multiple point compression on elliptic curves",
journal = j-DESIGNS-CODES-CRYPTOGR,
volume = "83",
number = "3",
pages = "565--588",
month = jun,
year = "2017",
CODEN = "DCCREC",
DOI = "https://doi.org/10.1007/s10623-016-0251-2",
ISSN = "0925-1022 (print), 1573-7586 (electronic)",
ISSN-L = "0925-1022",
bibdate = "Sat Jun 24 11:01:01 MDT 2017",
bibsource = "http://link.springer.com/journal/10623/83/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/designscodescryptogr.bib",
acknowledgement = ack-nhfb,
fjournal = "Designs, Codes and Cryptography",
journal-URL = "http://link.springer.com/journal/10623",
}
@Article{Funasaka:2017:ALL,
author = "Shunji Funasaka and Koji Nakano and Yasuaki Ito",
title = "Adaptive loss-less data compression method optimized
for {GPU} decompression",
journal = j-CCPE,
volume = "29",
number = "24",
pages = "??--??",
day = "25",
month = dec,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4283",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat Dec 30 09:11:59 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Gagie:2017:CSS,
author = "Travis Gagie and Giovanni Manzini and Daniel
Valenzuela",
title = "Compressed Spaced Suffix Arrays",
journal = j-MATH-COMPUT-SCI,
volume = "11",
number = "2",
pages = "151--157",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11786-016-0283-z",
ISSN = "1661-8270 (print), 1661-8289 (electronic)",
ISSN-L = "1661-8270",
bibdate = "Mon Oct 2 10:24:35 MDT 2017",
bibsource = "http://link.springer.com/journal/11786/11/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/math-comput-sci.bib",
acknowledgement = ack-nhfb,
fjournal = "Mathematics in Computer Science",
journal-URL = "http://link.springer.com/journal/11786",
}
@Article{Gaj:2017:DCR,
author = "Sibaji Gaj and Aditya Kanetkar and Arijit Sur and
Prabin Kumar Bora",
title = "Drift-Compensated Robust Watermarking Algorithm for
{H.265\slash HEVC} Video Stream",
journal = j-TOMCCAP,
volume = "13",
number = "1",
pages = "11:1--11:??",
month = jan,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3009910",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Jan 18 17:18:28 MST 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "It has been observed in the recent literature that the
drift error due to watermarking degrades the visual
quality of the embedded video. The existing drift error
handling strategies for recent video standards such as
H.264 may not be directly applicable for upcoming
high-definition video standards (such as High
Efficiency Video Coding (HEVC)) due to different
compression architecture. In this article, a compressed
domain watermarking scheme is proposed for H.265/HEVC
bit stream that can handle drift error propagation both
for intra- and interprediction process. Additionally,
the proposed scheme shows adequate robustness against
recompression attack as well as common image processing
attacks while maintaining decent visual quality. A
comprehensive set of experiments has been carried out
to justify the efficacy of the proposed scheme over the
existing literature.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Ham:2017:DDS,
author = "Tae Jun Ham and Juan L. Arag{\'o}n and Margaret
Martonosi",
title = "Decoupling Data Supply from Computation for
Latency-Tolerant Communication in Heterogeneous
Architectures",
journal = j-TACO,
volume = "14",
number = "2",
pages = "16:1--16:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3075620",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Mon Jul 24 18:00:59 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "In today's computers, heterogeneous processing is used
to meet performance targets at manageable power. In
adopting increased compute specialization, however, the
relative amount of time spent on communication
increases. System and software optimizations for
communication often come at the costs of increased
complexity and reduced portability. The Decoupled
Supply-Compute (DeSC) approach offers a way to attack
communication latency bottlenecks automatically, while
maintaining good portability and low complexity. Our
work expands prior Decoupled Access Execute techniques
with hardware/software specialization. For a range of
workloads, DeSC offers roughly 2 $ \times $ speedup,
and additional specialized compression optimizations
reduce traffic between decoupled units by 40\%.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Han:2017:CCF,
author = "Yunheng Han and Weiwei Sun and Baihua Zheng",
title = "{COMPRESS}: a Comprehensive Framework of Trajectory
Compression in Road Networks",
journal = j-TODS,
volume = "42",
number = "2",
pages = "11:1--11:??",
month = jun,
year = "2017",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/3015457",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Jun 23 16:29:07 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "More and more advanced technologies have become
available to collect and integrate an unprecedented
amount of data from multiple sources, including GPS
trajectories about the traces of moving objects. Given
the fact that GPS trajectories are vast in size while
the information carried by the trajectories could be
redundant, we focus on trajectory compression in this
article. As a systematic solution, we propose a
comprehensive framework, namely, COMPRESS
(Comprehensive Paralleled Road-Network-Based Trajectory
Compression), to compress GPS trajectory data in an
urban road network. In the preprocessing step, COMPRESS
decomposes trajectories into spatial paths and temporal
sequences, with a thorough justification for trajectory
decomposition. In the compression step, COMPRESS
performs spatial compression on spatial paths, and
temporal compression on temporal sequences in parallel.
It introduces two alternative algorithms with different
strengths for lossless spatial compression and designs
lossy but error-bounded algorithms for temporal
compression. It also presents query processing
algorithms to support error-bounded location-based
queries on compressed trajectories without full
decompression. All algorithms under COMPRESS are
efficient and have the time complexity of $ O (| T |)
$, where $ | T | $ is the size of the input trajectory
$T$. We have also conducted a comprehensive
experimental study to demonstrate the effectiveness of
COMPRESS, whose compression ratio is significantly
better than related approaches.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{He:2017:ISA,
author = "Bin He and Gang Li",
title = "Intelligent Self-Adaptation Data Behavior Control
Inspired by Speech Acts",
journal = j-TOSN,
volume = "13",
number = "2",
pages = "13:1--13:??",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3051125",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:37 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Wireless sensor networks (WSNs) are a promising
technology for collecting information by utilizing
various types of small-sized sensors. Implementing
efficient data acquisition and transmission is
important for real-time monitoring and data analysis,
owing to massive and heterogeneous data with low
precision. In this work, the data behavior model
inspired by speech acts is built, including the data
correlation model and the data comment model.
Intelligent self-adaptation data behavior control is
then proposed, of which the main idea is to make sensor
nodes (SNs) process data intelligently. In the proposed
data behavior control, the temporal compression
behavior is achieved through variable-cycle
transmission and the multivariate spatial compression
behavior is motivated by compressed sensing (CS)
theory. The multivariate spatial-temporal compression
composed of the above two compression behaviors can
adjust itself through data comment behaviors including
the large-cycle error self-correction behavior based on
the node credibility and the large-cycle event
self-adaptation behavior based on the information
granularity. The data behavior control presented has
been validated by the experiments in the Shanghai metro
tunnel. The experiment results show that these
intelligent data behaviors inspired by speech acts can
make WSNs more effective and intelligent with no change
in the existing network structure.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Holliday:2017:SDL,
author = "Andrew Holliday and Mohammadamin Barekatain and
Johannes Laurmaa and Chetak Kandaswamy and Helmut
Prendinger",
title = "Speedup of deep learning ensembles for semantic
segmentation using a model compression technique",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "164",
number = "??",
pages = "16--26",
month = nov,
year = "2017",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Dec 23 07:29:56 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cviu.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1077314217300826",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding: CVIU",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142/",
}
@Article{Hudson:2017:JSG,
author = "Graham Hudson and Alain Leger and Birger Niss and
Istvan Sebestyen",
title = "{JPEG} at 25: Still Going Strong",
journal = j-IEEE-MULTIMEDIA,
volume = "24",
number = "2",
pages = "96--103",
month = apr # "\slash " # jun,
year = "2017",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2017.38",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Mon Jul 24 18:49:44 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
URL = "https://www.computer.org/csdl/mags/mu/2017/02/mmu2017020096-abs.html",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
}
@Book{ISO:2017:IID,
author = "{ISO}",
title = "{ISO 28500:2017}: Information and documentation ---
{WARC} file format",
publisher = pub-ISO,
address = pub-ISO:adr,
edition = "Second",
pages = "26",
month = aug,
year = "2017",
bibdate = "Fri Jun 29 11:30:27 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/isostd.bib",
URL = "https://www.iso.org/standard/68004.html",
abstract = "ISO 28500:2017 specifies the WARC file format:\par
- to store both the payload content and control
information from mainstream Internet application layer
protocols, such as the HTTP, DNS, and FTP;\par
- to store arbitrary metadata linked to other stored
data (e.g. subject classifier, discovered language,
encoding);\par
- to support data compression and maintain data record
integrity;\par
- to store all control information from the harvesting
protocol (e.g. request headers), not just response
information;\par
- to store the results of data transformations linked
to other stored data;\par
- to store a duplicate detection event linked to other
stored data (to reduce storage in the presence of
identical or substantially similar resources);\par
- to be extended without disruption to existing
functionality;\par
- to support handling of overly long records by
truncation or segmentation, where desired.",
acknowledgement = ack-nhfb,
keywords = "WARC (Web ARChive)",
remark = "Supersedes ISO 28500:2009.",
}
@Article{Jakob:2017:PPP,
author = "Johannes Jakob and Christoph Buchenau and Michael
Guthe",
title = "Parallel Processing: A Parallel Approach to
Compression and Decompression of Triangle Meshes using
the {GPU}",
journal = j-CGF,
volume = "36",
number = "5",
pages = "71--80",
month = aug,
year = "2017",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.13246",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sun Dec 17 10:45:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Jevdjic:2017:ASC,
author = "Djordje Jevdjic and Karin Strauss and Luis Ceze and
Henrique S. Malvar",
title = "Approximate Storage of Compressed and Encrypted
Videos",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "361--373",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037718",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The popularization of video capture devices has
created strong storage demand for encoded videos.
Approximate storage can ease this demand by enabling
denser storage at the expense of occasional errors.
Unfortunately, even minor storage errors, such as bit
flips, can result in major visual damage in encoded
videos. Similarly, video encryption, widely employed
for privacy and digital rights management, may create
long dependencies between bits that show little or no
tolerance to storage errors. In this paper we propose
VideoApp, a novel and efficient methodology to compute
bit-level reliability requirements for encoded videos
by tracking visual and metadata dependencies within
encoded bitstreams. We further show how VideoApp can be
used to trade video quality for storage density in an
optimal way. We integrate our methodology into a
popular H.264 encoder to partition an encoded video
stream into multiple streams that can receive different
levels of error correction according to their
reliability needs. When applied to a dense and highly
error-prone multi-level cell storage substrate, our
variable error correction mechanism reduces the error
correction overhead by half under the most
error-intolerant encoder settings, achieving
quality/density points that neither compression nor
approximation can achieve alone. Finally, we define the
basic invariants needed to support encrypted
approximate video storage. We present an analysis of
block cipher modes of operation, showing that some are
fully compatible with approximation, enabling
approximate and secure video storage systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ji:2017:LDC,
author = "Cheng Ji and Li-Pin Chang and Liang Shi and Congming
Gao and Chao Wu and Yuangang Wang and Chun Jason Xue",
title = "Lightweight Data Compression for Mobile Flash
Storage",
journal = j-TECS,
volume = "16",
number = "5s",
pages = "183:1--183:??",
month = oct,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3126511",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:33 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Data compression is beneficial to flash storage
lifespan. However, because the design of mobile flash
storage is highly cost-sensitive, hardware compression
becomes a less attractive option. This study
investigates the feasibility of data compression on
mobile flash storage. It first characterizes data
compressibility based on mobile apps, and the analysis
shows that write traffic bound for mobile storage
volumes is highly compressible. Based on this finding,
a lightweight approach is introduced for firmware-based
data compression in mobile flash storage. The
controller and flash module work in a pipelined fashion
to hide the data compression overhead. Together with
this pipelined design, the proposed approach
selectively compresses incoming data of high
compressibility, while leaving data of low
compressibility to a compression-aware garbage
collector. Experimental results show that our approach
greatly reduced the frequency of block erase by 50.5\%
compared to uncompressed flash storage. Compared to
unconditional data compression, our approach improved
the write latency by 10.4\% at a marginal cost of 4\%
more block erase operations.",
acknowledgement = ack-nhfb,
articleno = "183",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Kanakagiri:2017:MMD,
author = "Raghavendra Kanakagiri and Biswabandan Panda and Madhu
Mutyam",
title = "{MBZip}: Multiblock Data Compression",
journal = j-TACO,
volume = "14",
number = "4",
pages = "42:1--42:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151033",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Fri Dec 22 18:25:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Compression techniques at the last-level cache and the
DRAM play an important role in improving system
performance by increasing their effective capacities. A
compressed block in DRAM also reduces the transfer time
over the memory bus to the caches, reducing the latency
of a LLC cache miss. Usually, compression is achieved
by exploiting data patterns present within a block. But
applications can exhibit data locality that spread
across multiple consecutive data blocks. We observe
that there is significant opportunity available for
compressing multiple consecutive data blocks into one
single block, both at the LLC and DRAM. Our studies
using 21 SPEC CPU applications show that, at the LLC,
around 25\% (on average) of the cache blocks can be
compressed into one single cache block when grouped
together in groups of 2 to 8 blocks. In DRAM, more than
30\% of the columns residing in a single DRAM page can
be compressed into one DRAM column, when grouped
together in groups of 2 to 6. Motivated by these
observations, we propose a mechanism, namely, MBZip,
that compresses multiple data blocks into one single
block (called a zipped block), both at the LLC and
DRAM. At the cache, MBZip includes a simple tag
structure to index into these zipped cache blocks and
the indexing does not incur any redirectional delay. At
the DRAM, MBZip does not need any changes to the
address computation logic and works seamlessly with the
conventional/existing logic. MBZip is a synergistic
mechanism that coordinates these zipped blocks at the
LLC and DRAM. Further, we also explore silent writes at
the DRAM and show that certain writes need not access
the memory when blocks are zipped. MBZip improves the
system performance by 21.9\%, with a maximum of 90.3\%
on a 4-core system.",
acknowledgement = ack-nhfb,
articleno = "42",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Karkkainen:2017:LLZ,
author = "Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Simon J.
Puglisi",
title = "Lazy {Lempel--Ziv} Factorization Algorithms",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "21",
number = "1",
pages = "2.4:1--2.4:??",
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2699876",
ISSN = "1084-6654",
bibdate = "Sun Aug 20 07:54:41 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
abstract = "For decades the Lempel--Ziv (LZ77) factorization has
been a cornerstone of data compression and string
processing algorithms, and uses for it are still being
uncovered. For example, LZ77 is central to several
recent text indexing data structures designed to search
highly repetitive collections. However, in many
applications computation of the factorization remains a
bottleneck in practice. In this article, we describe a
number of simple and fast LZ77 factorization
algorithms, which consistently outperform all previous
methods in practice, use less memory, and still offer
strong worst-case performance guarantees. A common
feature of the new algorithms is that they compute
longest common prefix information in a lazy fashion,
with the degree of laziness in preprocessing
characterizing different algorithms.",
acknowledgement = ack-nhfb,
articleno = "2.4",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J430",
}
@Article{Kung:2017:CPD,
author = "Sun-Yuan Kung and Thee Chanyaswad and J. Morris Chang
and Peiyuan Wu",
title = "Collaborative {PCA\slash DCA} Learning Methods for
Compressive Privacy",
journal = j-TECS,
volume = "16",
number = "3",
pages = "76:1--76:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2996460",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Jul 24 09:51:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "In the Internet era, the data being collected on
consumers like us are growing exponentially, and
attacks on our privacy are becoming a real threat. To
better ensure our privacy, it is safer to let the data
owner control the data to be uploaded to the network as
opposed to taking chance with data servers or third
parties. To this end, we propose compressive privacy, a
privacy-preserving technique to enable the data creator
to compress data via collaborative learning so that the
compressed data uploaded onto the Internet will be
useful only for the intended utility and not be easily
diverted to malicious applications. For data in a
high-dimensional feature vector space, a common
approach to data compression is dimension reduction or,
equivalently, subspace projection. The most prominent
tool is principal component analysis (PCA). For
unsupervised learning, PCA can best recover the
original data given a specific reduced dimensionality.
However, for the supervised learning environment, it is
more effective to adopt a supervised PCA, known as
discriminant component analysis (DCA), to maximize the
discriminant capability. The DCA subspace analysis
embraces two different subspaces. The signal-subspace
components of DCA are associated with the discriminant
distance/power (related to the classification
effectiveness), whereas the noise subspace components
of DCA are tightly coupled with recoverability and/or
privacy protection. This article presents three
DCA-related data compression methods useful for
privacy-preserving applications: --- Utility-driven
DCA: Because the rank of the signal subspace is limited
by the number of classes, DCA can effectively support
classification using a relatively small dimensionality
(i.e., high compression). --- Desensitized PCA: By
incorporating a signal-subspace ridge into DCA, it
leads to a variant especially effective for extracting
privacy-preserving components. In this case, the
eigenvalues of the noise-space are made to become
insensitive to the privacy labels and are ordered
according to their corresponding component powers. ---
Desensitized K-means/SOM: Since the revelation of the
K-means or SOM cluster structure could leak sensitive
information, it is safer to perform K-means or SOM
clustering on a desensitized PCA subspace.",
acknowledgement = ack-nhfb,
articleno = "76",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{L:2017:BDW,
author = "Biji C. L. and Achuthsankar S. Nair",
title = "Benchmark Dataset for Whole Genome Sequence
Compression",
journal = j-TCBB,
volume = "14",
number = "6",
pages = "1228--1236",
month = nov,
year = "2017",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2016.2568186",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Fri Jan 12 18:05:03 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "The research in DNA data compression lacks a standard
dataset to test out compression tools specific to DNA.
This paper argues that the current state of achievement
in DNA compression is unable to be benchmarked in the
absence of such scientifically compiled whole genome
sequence dataset and proposes a benchmark dataset using
multistage sampling procedure. Considering the genome
sequence of organisms available in the National Centre
for Biotechnology and Information NCBI as the universe,
the proposed dataset selects 1,105 prokaryotes, 200
plasmids, 164 viruses, and 65 eukaryotes. This paper
reports the results of using three established tools on
the newly compiled dataset and show that their strength
and weakness are evident only with a comparison based
on the scientifically compiled benchmark dataset.
Availability: The sample dataset and the respective
links are available at
\url{https://sourceforge.net/projects/benchmarkdnacompressiondataset/}.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Lee:2017:IEE,
author = "S. Lee and K. Kim and G. Koo and H. Jeon and M.
Annavaram and W. W. Ro",
title = "Improving Energy Efficiency of {GPUs} through Data
Compression and Compressed Execution",
journal = j-IEEE-TRANS-COMPUT,
volume = "66",
number = "5",
pages = "834--847",
month = may,
year = "2017",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2016.2619348",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Apr 6 07:46:06 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Context; Data compression; data compression;
energy-efficiency; GPU architectures; Graphics
processing units; Indexes; Instruction sets; Message
systems; register file; Registers",
}
@Article{Lemire:2017:SVF,
author = "Daniel Lemire and Nathan Kurz and Christoph Rupp",
title = "{Stream VByte}: Faster byte-oriented integer
compression",
journal = j-INFO-PROC-LETT,
volume = "130",
number = "??",
pages = "1--6",
month = feb,
year = "2017",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2017.09.011",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Oct 30 08:51:08 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019017301679",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Ma:2017:QAV,
author = "Bo Ma and Susanne K. Suter and Alireza Entezari",
title = "Quality assessment of volume compression approaches
using isovalue clustering",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "63",
number = "??",
pages = "18--27",
month = apr,
year = "2017",
CODEN = "COGRD2",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Mar 27 21:12:03 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849317300158",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Mera:2017:ATP,
author = "Maria Isabel Mera and Jonah Caplan and Seyyed Hasan
Mozafari and Brett H. Meyer and Peter Milder",
title = "Area, Throughput, and Power Trade-Offs for {FPGA}- and
{ASIC}-Based Execution Stream Compression",
journal = j-TECS,
volume = "16",
number = "4",
pages = "96:1--96:??",
month = aug,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3063312",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Mon Aug 14 18:53:33 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "An emerging trend in safety-critical computer system
design is the use of compression --- for example, using
cyclic redundancy check (CRC) or Fletcher checksum (FC)
--- to reduce the state that must be compared to verify
correct redundant execution. We examine the costs and
performance of CRC and FC as compression algorithms
when implemented in hardware for embedded
safety-critical systems. To do so, we have developed
parameterizable hardware-generation tools targeting CRC
and two novel FC implementations. We evaluate the
resulting designs implemented for FPGA and ASIC and
analyze their efficiency. While CRC is often best, FC
dominates when high throughput is needed.",
acknowledgement = ack-nhfb,
articleno = "96",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Mittal:2017:ARD,
author = "Sparsh Mittal and Jeffrey S. Vetter and Lei Jiang",
title = "Addressing Read-Disturbance Issue in {STT--RAM} by
Data Compression and Selective Duplication",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "16",
number = "2",
pages = "94--98",
month = jul # "\slash " # dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2016.2645207",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "In deep sub-micron region, spin transfer torque RAM
(STT-RAM) shows read-disturbance error (RDE) which
presents a crucial reliability challenge. We present
SHIELD, a technique to mitigate RDE in STT-RAM last
level caches (LLCs). SHIELD uses data compression to
reduce cache-write traffic and restore requirement.
Also, SHIELD keeps two copies of data blocks compressed
to less than half the block size and since several LLC
blocks are only accessed once, this approach avoids
several restore operations. SHIELD consumes smaller
energy than two previous RDE-mitigation techniques,
namely high-current restore required read (HCRR, also
called restore-after-read) and low-current long latency
read (LCLL) and even an ideal RDE-free STT-RAM cache.",
acknowledgement = ack-nhfb,
affiliation = "Mittal, S (Reprint Author), IIT Hyderabad, Sangareddy
502285, Telangana, India. Mittal, Sparsh, IIT
Hyderabad, Sangareddy 502285, Telangana, India. Vetter,
Jeffrey S., Oak Ridge Natl Lab, Oak Ridge, TN 37830
USA. Jiang, Lei, Indiana Univ, Bloomington, IN 47405
USA.",
author-email = "sparsh0mittal@gmail.com vetter@ornl.gov
jiang60@iu.edu",
da = "2019-06-20",
doc-delivery-number = "FR2AX",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
funding-acknowledgement = "U.S. Department of Energy, Office of
Science, Advanced Scientific Computing Research",
funding-text = "Support for this work was provided by the U.S.
Department of Energy, Office of Science, Advanced
Scientific Computing Research.",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "data compression; duplication; last level cache;
Non-volatile memory; read disturbance error; STT-RAM",
number-of-cited-references = "14",
ORCID-numbers = "Mittal, Sparsh/0000-0002-2908-993X",
research-areas = "Computer Science",
times-cited = "1",
unique-id = "Mittal:2017:ARD",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Palangappa:2017:CCE,
author = "Poovaiah M. Palangappa and Kartik Mohanram",
title = "{CompEx++}: Compression-Expansion Coding for Energy,
Latency, and Lifetime Improvements in {MLC\slash TLC
NVMs}",
journal = j-TACO,
volume = "14",
number = "1",
pages = "10:1--10:??",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3050440",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Mon Jul 24 18:00:58 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Multilevel/triple-level cell nonvolatile memories
(MLC/TLC NVMs) such as phase-change memory (PCM) and
resistive RAM (RRAM) are the subject of active research
and development as replacement candidates for DRAM,
which is limited by its high refresh power and poor
scaling potential. In addition to the benefits of
nonvolatility (low refresh power) and improved
scalability, MLC/TLC NVMs offer high data density and
memory capacity over DRAM. However, the viability of
MLC/TLC NVMs is limited primarily due to the high
programming energy and latency as well as the low
endurance of NVM cells; these are primarily attributed
to the iterative program-and-verify procedure necessary
for programming the NVM cells. This article proposes
compression-expansion (CompEx) coding, a low overhead
scheme that synergistically integrates pattern-based
compression with expansion coding to realize
simultaneous energy, latency, and lifetime improvements
in MLC/TLC NVMs. CompEx coding is agnostic to the
choice of compression technique; in this work, we
evaluate CompEx coding using both frequent pattern
compression (FPC) and base-delta-immediate $ (B \Delta
I) $ compression. CompEx coding integrates FPC/$ B
\Delta I $ with $ (k, m)_q $ ``expansion'' coding;
expansion codes are a class of $q$-ary linear block
codes that encode data using only the low energy states
of a $q$-ary NVM cell. CompEx coding simultaneously
reduces energy and latency and improves lifetime for
negligible-to-no memory overhead and negligible logic
overhead ( \approx 10k gates, which is $ < 0.1 \% $ per
NVM module). Furthermore, we also propose CompEx++
coding, which extends CompEx coding by leveraging the
variable compressibility of pattern-based compression
techniques. CompEx++ coding integrates custom expansion
codes to each of the compression patterns to exploit
maximum energy/latency benefits of CompEx coding. Our
full-system simulations using TLC RRAM show that
CompEx/CompEx++ coding reduces total memory energy by
57\%/61\% and write latency by 23.5\%/26\%; these
improvements translate to a 5.7\%/10.6\% improvement in
IPC, a 11.8\%/19.9\% improvement in main memory
bandwidth, and $ 1.8 \times $ improvement in lifetime
over classical binary coding using data-comparison
write. CompEx/CompEx++ coding thus addresses the
programming energy/latency and lifetime challenges of
MLC/TLC NVMs that pose a serious technological
roadblock to their adoption in high-performance
computing systems.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Park:2017:HHC,
author = "Jaehyun Park and Seungcheol Baek and Hyung Gyu Lee and
Chrysostomos Nicopoulos and Vinson Young and Junghee
Lee and Jongman Kim",
title = "{HoPE}: Hot-Cacheline Prediction for Dynamic Early
Decompression in Compressed {LLCs}",
journal = j-TODAES,
volume = "22",
number = "3",
pages = "40:1--40:??",
month = may,
year = "2017",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/2999538",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Fri Jul 21 10:49:30 MDT 2017",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/multithreading.bib;
https://www.math.utah.edu/pub/tex/bib/todaes.bib",
abstract = "Data compression plays a pivotal role in improving
system performance and reducing energy consumption,
because it increases the logical effective capacity of
a compressed memory system without physically
increasing the memory size. However, data compression
techniques incur some cost, such as non-negligible
compression and decompression overhead. This overhead
becomes more severe if compression is used in the
cache. In this article, we aim to minimize the read-hit
decompression penalty in compressed Last-Level Caches
(LLCs) by speculatively decompressing frequently used
cachelines. To this end, we propose a Hot-cacheline
Prediction and Early decompression (HoPE) mechanism
that consists of three synergistic techniques:
Hot-cacheline Prediction (HP), Early Decompression
(ED), and Hit-history-based Insertion (HBI). HP and HBI
efficiently identify the hot compressed cachelines,
while ED selectively decompresses hot cachelines, based
on their size information. Unlike previous approaches,
the HoPE framework considers the performance
balance/tradeoff between the increased effective cache
capacity and the decompression penalty. To evaluate the
effectiveness of the proposed HoPE mechanism, we run
extensive simulations on memory traces obtained from
multi-threaded benchmarks running on a full-system
simulation framework. We observe significant
performance improvements over compressed cache schemes
employing the conventional Least-Recently Used (LRU)
replacement policy, the Dynamic Re-Reference Interval
Prediction (DRRIP) scheme, and the Effective Capacity
Maximizer (ECM) compressed cache management mechanism.
Specifically, HoPE exhibits system performance
improvements of approximately 11\%, on average, over
LRU, 8\% over DRRIP, and 7\% over ECM by reducing the
read-hit decompression penalty by around 65\%, over a
wide range of applications.",
acknowledgement = ack-nhfb,
articleno = "40",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{Peng:2017:PMT,
author = "Min Peng and Wang Gao and Hua Wang and Yanchun Zhang
and Jiajia Huang and Qianqian Xie and Gang Hu and Gang
Tian",
title = "Parallelization of Massive Textstream Compression
Based on Compressed Sensing",
journal = j-TOIS,
volume = "36",
number = "2",
pages = "17:1--17:??",
month = sep,
year = "2017",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/3086702",
ISSN = "1046-8188",
bibdate = "Tue Jan 16 07:16:47 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "Compressing textstreams generated by social networks
can both reduce storage consumption and improve
efficiency such as fast searching. However, the
compression process is a challenge due to the large
scale of textstreams. In this article, we propose a
textstream compression framework based on compressed
sensing theory and design a series of matching parallel
procedures. The new approach uses a linear projection
technique in the textstream compression process,
achieving fast compression speed and low compression
ratio. Two processes are executed by designing
elaborated parallel procedures for efficient
compressing and decompressing of large-scale
textstreams. The decompression process is implemented
for approximate solutions of underdetermined linear
systems. Experimental results show that the new method
can efficiently achieve the compression and
decompression tasks on a large amount of text generated
by social networks.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J779",
}
@Article{Pizzolante:2017:AVQ,
author = "Raffaele Pizzolante and Bruno Carpentieri and Sergio
{De Agostino}",
title = "Adaptive Vector Quantization for Lossy Compression of
Image Sequences",
journal = j-ALGORITHMS-BASEL,
volume = "10",
number = "2",
month = jun,
year = "2017",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a10020051",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:13 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/10/2/51",
acknowledgement = ack-nhfb,
articleno = "51",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
ORCID-numbers = "Sergio De Agostino/0000-0002-1379-8010",
pagecount = "??",
pubdates = "Received: 23 January 2017 / Revised: 24 April 2017 /
Accepted: 4 May 2017 / Published: 9 May 2017",
}
@Article{Sardashti:2017:CCG,
author = "Somayeh Sardashti and David A. Wood",
title = "Could Compression Be of General Use? {Evaluating}
Memory Compression across Domains",
journal = j-TACO,
volume = "14",
number = "4",
pages = "44:1--44:??",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3138805",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Fri Dec 22 18:25:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Recent proposals present compression as a
cost-effective technique to increase cache and memory
capacity and bandwidth. While these proposals show
potentials of compression, there are several open
questions to adopt these proposals in real systems
including the following: (1) Do these techniques work
for real-world workloads running for long time? (2)
Which application domains would potentially benefit the
most from compression? (3) At which level of memory
hierarchy should we apply compression: caches, main
memory, or both? In this article, our goal is to shed
light on some main questions on applicability of
compression. We evaluate compression in the memory
hierarchy for selected examples from different
application classes. We analyze real applications with
real data and complete runs of several benchmarks.
While simulators provide a pretty accurate framework to
study potential performance/energy impacts of ideas,
they mostly limit us to a small range of workloads with
short runtimes. To enable studying real workloads, we
introduce a fast and simple methodology to get samples
of memory and cache contents of a real machine (a
desktop or a server). Compared to a cycle-accurate
simulator, our methodology allows us to study real
workloads as well as benchmarks. Our toolset is not a
replacement for simulators but mostly complements them.
While we can use a simulator to measure
performance/energy impact of a particular compression
proposal, here with our methodology we can study the
potentials with long running workloads in early stages
of the design. Using our toolset, we evaluate a
collection of workloads from different domains, such as
a web server of CS department of UW-Madison for 24h,
Google Chrome (watching a 1h-long movie on YouTube),
and Linux games (playing for about an hour). We also
use several benchmarks from different domains,
including SPEC, mobile, and big data. We run these
benchmarks to completion. Using these workloads and our
toolset, we analyze different compression properties
for both real applications and benchmarks. We focus on
eight main hypotheses on compression, derived from
previous work on compression. These properties (Table
2) act as foundation of several proposals on
compression, so performance of those proposals depends
very much on these basic properties. Overall, our
results suggest that compression could be of general
use both in main memory and caches. On average, the
compression ratio is {$>$}=2 for 64\% and 54\% of
workloads, respectively, for memory and cache data. Our
evaluation indicates significant potential for both
cache and memory compression, with higher
compressibility in memory due to abundance of zero
blocks. Among application domains we studied, servers
show on average the highest compressibility, while our
mobile benchmarks show the lowest compressibility. For
comparing benchmarks with real workloads, we show that
(1) it is critical to run benchmarks to completion or
considerably long runtimes to avoid biased conclusions,
and (2) SPEC benchmarks are good representative of real
Desktop applications in terms of compressibility of
their datasets. However, this does not hold for all
compression properties. For example, SPEC benchmarks
have much better compression locality (i.e.,
neighboring blocks have similar compressibility) than
real workloads. Thus, it is critical for designers to
consider wider range of workloads, including real
applications, to evaluate their compression
techniques.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Selgrad:2017:CRR,
author = "Kai Selgrad and Alexander Lier and Magdalena Martinek
and Christoph Buchenau and Michael Guthe and Franziska
Kranz and Henry Sch{\"a}fer and Marc Stamminger",
title = "A Compressed Representation for Ray Tracing Parametric
Surfaces",
journal = j-TOG,
volume = "36",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2017",
CODEN = "ATGRDF",
DOI = "https://doi.org/10.1145/2953877",
ISSN = "0730-0301 (print), 1557-7368 (electronic)",
ISSN-L = "0730-0301",
bibdate = "Sat Apr 8 10:37:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tog.bib",
abstract = "Parametric surfaces are an essential modeling tool in
computer aided design and movie production. Even though
their use is well established in industry, generating
ray-traced images adds significant cost in time and
memory consumption. Ray tracing such surfaces is
usually accomplished by subdividing the surfaces on the
fly, or by conversion to a polygonal representation.
However, on-the-fly subdivision is computationally very
expensive, whereas polygonal meshes require large
amounts of memory. This is a particular problem for
parametric surfaces with displacement, where very fine
tessellation is required to faithfully represent the
shape. Hence, memory restrictions are the major
challenge in production rendering. In this article, we
present a novel solution to this problem. We propose a
compression scheme for a priori Bounding Volume
Hierarchies (BVHs) on parametric patches, that reduces
the data required for the hierarchy by a factor of up
to 48. We further propose an approximate evaluation
method that does not require leaf geometry, yielding an
overall reduction of memory consumption by a factor of
60 over regular BVHs on indexed face sets and by a
factor of 16 over established state-of-the-art
compression schemes. Alternatively, our compression can
simply be applied to a standard BVH while keeping the
leaf geometry, resulting in a compression rate of up to
2:1 over current methods. Although decompression
generates additional costs during traversal, we can
manage very complex scenes even on the memory
restrictive GPU at competitive render times.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
}
@Article{Sodsong:2017:JPE,
author = "Wasuwee Sodsong and Minyoung Jung and Jinwoo Park and
Bernd Burgstaller",
title = "{JParEnt}: {Parallel} entropy decoding for {JPEG}
decompression on heterogeneous multicore
architectures",
journal = j-CCPE,
volume = "29",
number = "15",
pages = "",
day = "10",
month = aug,
year = "2017",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.4111",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Mon Jul 24 08:22:39 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
}
@Article{Tan:2017:JDC,
author = "Rui Tan and Sheng-Yuan Chiu and Hoang Hai Nguyen and
David K. Y. Yau and Deokwoo Jung",
title = "A Joint Data Compression and Encryption Approach for
Wireless Energy Auditing Networks",
journal = j-TOSN,
volume = "13",
number = "2",
pages = "9:1--9:??",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3027489",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:37 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Fine-grained real-time metering is a fundamental
service of wireless energy auditing networks, where
metering data is transmitted from embedded wireless
power meters to gateways for centralized processing,
storage, and forwarding. Due to limited meter
capability and wireless bandwidth, the increasing
sampling rates and network scales needed to support new
energy auditing applications pose significant
challenges to metering data fidelity and secrecy. This
article exploits the compression and encryption
properties of compressive sensing (CS) to design a
joint data compression and encryption (JICE) approach
that addresses these two challenges simultaneously.
Compared with a conventional signal processing pipeline
that compresses and encrypts data sequentially, JICE
reduces computation and space complexities due to its
simple design. It thus leaves more processor time and
available buffer space for handling lossy wireless
transmissions. Moreover, JICE features an adaptive
reconfiguration mechanism that selects the signal
representation basis of CS at runtime among several
candidate bases to achieve the best fidelity of the
recovered data at the gateways. This mechanism enables
JICE to adapt to changing power consumption patterns.
On a smart plug platform, we implemented JICE and
several baseline approaches including downsampling,
lossless compression, and the pipeline approach.
Extensive testbed experiments show that JICE achieves
higher data delivery ratios and lower recovery
distortions under a range of realistic settings. In
particular, at a meter sampling rate of 8 Hz, JICE
increases the number of meters supported by a gateway
by 50\%, compared with the commonly used pipeline
approach, while keeping a signal distortion rate lower
than 5\%.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Tewari:2017:CNU,
author = "Aakanksha Tewari and B. B. Gupta",
title = "Cryptanalysis of a novel ultra-lightweight mutual
authentication protocol for {IoT} devices using {RFID}
tags",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "3",
pages = "1085--1102",
month = mar,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-016-1849-x",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jun 24 10:31:32 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Thayammal:2017:EPM,
author = "S. Thayammal and D. Selvathi",
title = "Edge Preserved Multispectral Image Compression Using
Extended Shearlet Transform",
journal = j-COMP-J,
volume = "60",
number = "7",
pages = "986--994",
day = "1",
month = jul,
year = "2017",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Nov 16 10:43:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://academic.oup.com/comjnl/article/60/7/986/2608041",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Ueno:2017:BCF,
author = "Tomohiro Ueno and Kentaro Sano and Satoru Yamamoto",
title = "Bandwidth Compression of Floating-Point Numerical Data
Streams for {FPGA}-Based High-Performance Computing",
journal = j-TRETS,
volume = "10",
number = "3",
pages = "18:1--18:??",
month = jul,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3053688",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Sat Dec 23 10:23:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/trets.bib",
abstract = "Although computational performance is often limited by
insufficient bandwidth to/from an external memory, it
is not easy to physically increase off-chip memory
bandwidth. In this study, we propose a hardware-based
bandwidth compression technique that can be applied to
field-programmable gate array-- (FPGA) based
high-performance computation with a logically wider
effective memory bandwidth. Our proposed hardware
approach can boost the performance of FPGA-based stream
computations by applying a data compression technique
to effectively transfer more data streams. To apply
this data compression technique to bandwidth
compression via hardware, several requirements must
first be satisfied, including an acceptable level of
compression performance and a sufficiently small
hardware footprint. Our proposed hardware-based
bandwidth compressor utilizes an efficient
prediction-based data compression algorithm. Moreover,
we propose a multichannel serializer and deserializer
that enable applications to use multiple channels of
computational data with the bandwidth compression. The
serializer encodes compressed data blocks of multiple
channels into a data stream, which is efficiently
written to an external memory. Based on preliminary
evaluation, we define an encoding format considering
both high compression ratio and small hardware area. As
a result, we demonstrate that our area saving bandwidth
compressor increases performance of an FPGA-based fluid
dynamics simulation by deploying more processing
elements to exploit spatial parallelism with the
enhanced memory bandwidth.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
}
@Article{Vargas-Perez:2017:HMO,
author = "Sandino Vargas-Perez and Fahad Saeed",
title = "A Hybrid {MPI-OpenMP} Strategy to Speedup the
Compression of Big Next-Generation Sequencing
Datasets",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "28",
number = "10",
pages = "2760--2769",
month = oct,
year = "2017",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2017.2692782",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Oct 12 06:58:12 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
URL = "https://www.computer.org/csdl/trans/td/2017/10/07895161-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Vasylevska:2017:CVF,
author = "Khrystyna Vasylevska and Hannes Kaufmann",
title = "Compressing {VR}: Fitting Large Virtual Environments
within Limited Physical Space",
journal = j-IEEE-CGA,
volume = "37",
number = "5",
pages = "85--91",
month = sep # "\slash " # oct,
year = "2017",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/MCG.2017.3621226",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Thu Sep 21 07:48:56 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
URL = "https://www.computer.org/csdl/mags/cg/2017/05/mcg2017050085-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=38",
}
@Misc{Ven:2017:LDC,
author = "Arjan Van De Ven",
title = "{Linux OS} data compression options: Comparing
behavior",
howpublished = "Web site",
day = "3",
month = jan,
year = "2017",
bibdate = "Wed Jan 18 08:50:31 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://clearlinux.org/blogs/linux-os-data-compression-options-comparing-behavior",
acknowledgement = ack-nhfb,
remark = "Compares bzip2, gzip, lzma, xz, zlib, and zstd with
respect to both compression speed, and compression
ratio. Versions tested: lib version 1.2.8-jtk4, xz
version 5.2.3, bzip version 1.0.6, snappy version
1.1.3, and lz4 version 1.7.4.2.",
}
@Article{Wang:2017:MIL,
author = "Jianguo Wang and Chunbin Lin and Ruining He and Moojin
Chae and Yannis Papakonstantinou and Steven Swanson",
title = "{MILC}: inverted list compression in memory",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "10",
number = "8",
pages = "853--864",
month = apr,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.14778/3090163.3090164",
ISSN = "2150-8097",
bibdate = "Fri Jun 23 17:12:46 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Inverted list compression is a topic that has been
studied for 50 years due to its fundamental importance
in numerous applications including information
retrieval, databases, and graph analytics. Typically,
an inverted list compression algorithm is evaluated on
its space overhead and query processing time. Earlier
list compression designs mainly focused on minimizing
the space overhead to reduce expensive disk I/O time in
disk-oriented systems. But the recent trend is shifted
towards reducing query processing time because the
underlying systems tend to be memory-resident. Although
there are many highly optimized compression approaches
in main memory, there is still a considerable
performance gap between query processing over
compressed lists and uncompressed lists, which
motivates this work. In this work, we set out to bridge
this performance gap for the first time by proposing a
new compression scheme, namely, MILC (memory inverted
list compression). MILC relies on a series of
techniques including offset-oriented fixed-bit
encoding, dynamic partitioning, in-block compression,
cache-aware optimization, and SIMD acceleration. We
conduct experiments on three real-world datasets in
information retrieval, databases, and graph analytics
to demonstrate the high performance and low space
overhead of MILC. We compare MILC with 12 recent
compression algorithms and experimentally show that
MILC improves the query performance by up to 13.2$
\times $ and reduces the space overhead by up to 4.7$
\times $.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Wang:2017:SNP,
author = "Changda Wang and Elisa Bertino",
title = "Sensor Network Provenance Compression Using Dynamic
{Bayesian} Networks",
journal = j-TOSN,
volume = "13",
number = "1",
pages = "5:1--5:??",
month = feb,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/2997653",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jul 24 09:36:36 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Provenance records the history of data acquisition and
transmission. In wireless sensor networks (WSNs),
provenance is critical for many different purposes,
including assessing the trustworthiness of data
acquired and forwarded by sensors, supporting situation
awareness, and detecting early signs of attacks.
However, a major drawback in provenance for WSNs is its
size. It is thus critical to develop efficient
techniques for provenance encoding. A major issue of
previously proposed provenance encoding techniques is
that the size of the provenance either expands too fast
with increases in the number of packet transmission
hops or is very sensitive to the WSN's topology, i.e.,
the size of the provenance expands drastically with
changes in the WSN's topology. In this article, we
propose a novel provenance encoding technique based on
dynamic Bayesian network and overlapped arithmetic
coding scheme, which addresses such an issue. Through
theoretical analysis, simulation, and testbed
experiments, we show that our scheme outperforms other
WSN lightweight provenance schemes with respect to
provenance size and energy consumption.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Wang:2017:SPD,
author = "Zhoukai Wang and Yinliang Zhao and Yang Liu and Zhong
Chen and Cuocuo Lv and Yuxiang Li",
title = "A speculative parallel decompression algorithm on
{Apache Spark}",
journal = j-J-SUPERCOMPUTING,
volume = "73",
number = "9",
pages = "4082--4111",
month = sep,
year = "2017",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2000-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Mon Oct 2 11:08:37 MDT 2017",
bibsource = "http://link.springer.com/journal/11227/73/9;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Xiao:2017:SOO,
author = "Jing Xiao and Zhongyuan Wang and Yu Chen and Liang
Liao and Jun Xiao and Gen Zhan and Ruimin Hu",
title = "A sensitive object-oriented approach to big
surveillance data compression for social security
applications in smart cities",
journal = j-SPE,
volume = "47",
number = "8",
pages = "1061--1080",
month = aug,
year = "2017",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2430",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Mon Jul 24 08:17:13 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Young:2017:DCD,
author = "Vinson Young and Prashant J. Nair and Moinuddin K.
Qureshi",
title = "{DICE}: Compressing {DRAM} Caches for Bandwidth and
Capacity",
journal = j-COMP-ARCH-NEWS,
volume = "45",
number = "2",
pages = "627--638",
month = may,
year = "2017",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/3140659.3080243",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri Sep 15 11:09:14 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sigarch.bib",
abstract = "This paper investigates compression for DRAM caches.
As the capacity of DRAM cache is typically large, prior
techniques on cache compression, which solely focus on
improving cache capacity, provide only a marginal
benefit. We show that more performance benefit can be
obtained if the compression of the DRAM cache is
tailored to provide higher bandwidth. If a DRAM cache
can provide two compressed lines in a single access,
and both lines are useful, the effective bandwidth of
the DRAM cache would double. Unfortunately, it is not
straight-forward to compress DRAM caches for bandwidth.
The typically used Traditional Set Indexing (TSI) maps
consecutive lines to consecutive sets, so the multiple
compressed lines obtained from the set are from
spatially distant locations and unlikely to be used
within a short period of each other. We can change the
indexing of the cache to place consecutive lines in the
same set to improve bandwidth; however, when the data
is incompressible, such spatial indexing reduces
effective capacity and causes significant slowdown.
Ideally, we would like to have spatial indexing when
the data is compressible and TSI otherwise. To this
end, we propose Dynamic-Indexing Cache comprEssion
(DICE), a dynamic design that can adapt between spatial
indexing and TSI, depending on the compressibility of
the data. We also propose low-cost Cache Index
Predictors (CIP) that can accurately predict the cache
indexing scheme on access in order to avoid probing
both indices for retrieving a given cache line. Our
studies with a 1GB DRAM cache, on a wide range of
workloads (including SPEC and Graph), show that DICE
improves performance by 19.0\% and reduces
energy-delay-product by 36\% on average. DICE is within
3\% of a design that has double the capacity and double
the bandwidth. DICE incurs a storage overhead of less
than 1KB and does not rely on any OS support.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Almurib:2018:ADI,
author = "Haider A. F. Almurib and Thulasiraman Nandha Kumar and
Fabrizio Lombardi",
title = "Approximate {DCT} Image Compression Using Inexact
Computing",
journal = j-IEEE-TRANS-COMPUT,
volume = "67",
number = "2",
pages = "149--159",
month = "????",
year = "2018",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2017.2731770",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jan 18 07:19:27 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
URL = "http://ieeexplore.ieee.org/document/7990539/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anonymous:2018:HDC,
author = "Anonymous",
title = "{HBO}'s data compression stars --- [Back Story]",
journal = j-IEEE-SPECTRUM,
volume = "55",
number = "9",
pages = "4--4",
month = sep,
year = "2018",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2018.8449030",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}
@Article{Aronica:2018:OPL,
author = "Salvatore Aronica and Alessio Langiu and Francesca
Marzi and Salvatore Mazzola and Filippo Mignosi",
title = "On optimal parsing for {LZ78}-like compressors",
journal = j-THEOR-COMP-SCI,
volume = "710",
number = "??",
pages = "19--28",
day = "1",
month = feb,
year = "2018",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Feb 7 06:04:15 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397517301524",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Arz:2018:LZC,
author = "Julian Arz and Johannes Fischer",
title = "{Lempel--Ziv-78} Compressed String Dictionaries",
journal = j-ALGORITHMICA,
volume = "80",
number = "7",
pages = "2012--2047",
month = jul,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0348-7",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:19:00 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/7;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Atoofian:2018:DTS,
author = "Ehsan Atoofian and Sean Rea",
title = "Data-type specific cache compression in {GPGPUs}",
journal = j-J-SUPERCOMPUTING,
volume = "74",
number = "4",
pages = "1609--1635",
month = apr,
year = "2018",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-017-2185-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Thu Oct 10 15:31:11 MDT 2019",
bibsource = "http://link.springer.com/journal/11227/74/4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Aubert:2018:PDC,
author = "Pierre Aubert and Thomas Vuillaume and Nahid Emad",
title = "Polynomial Data Compression for Large-Scale Physics
Experiments",
journal = j-COMPUT-SOFTW-BIG-SCI,
volume = "2",
number = "1",
pages = "??--??",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s41781-018-0010-3",
ISSN = "2510-2036 (print), 2510-2044 (electronic)",
ISSN-L = "2510-2036",
bibdate = "Fri Apr 9 06:38:18 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsoftwbigsci.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://link.springer.com/article/10.1007/s41781-018-0010-3",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "Computing and Software for Big Science",
journal-URL = "https://www.springer.com/journal/41781",
online-date = "Published: 18 September 2018 Article: 6",
}
@Article{Betzel:2018:ACT,
author = "Filipe Betzel and Karen Khatamifard and Harini Suresh
and David J. Lilja and John Sartori and Ulya Karpuzcu",
title = "Approximate Communication: Techniques for Reducing
Communication Bottlenecks in Large-Scale Parallel
Systems",
journal = j-COMP-SURV,
volume = "51",
number = "1",
pages = "1:1--1:??",
month = apr,
year = "2018",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3145812",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Sat Aug 31 09:04:34 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Approximate computing has gained research attention
recently as a way to increase energy efficiency and/or
performance by exploiting some applications' intrinsic
error resiliency. However, little attention has been
given to its potential for tackling the communication
bottleneck that remains one of the looming challenges
to be tackled for efficient parallelism. This article
explores the potential benefits of approximate
computing for communication reduction by surveying
three promising techniques for approximate
communication: compression, relaxed synchronization,
and value prediction. The techniques are compared based
on an evaluation framework composed of communication
cost reduction, performance, energy reduction,
applicability, overheads, and output degradation.
Comparison results demonstrate that lossy link
compression and approximate value prediction show great
promise for reducing the communication bottleneck in
bandwidth-constrained applications. Meanwhile, relaxed
synchronization is found to provide large speedups for
select error-tolerant applications, but suffers from
limited general applicability and unreliable output
degradation guarantees. Finally, this article concludes
with several suggestions for future research on
approximate communication techniques.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Bhushan:2018:CCU,
author = "S. N. Bharath Bhushan and Ajit Danti",
title = "Classification of compressed and uncompressed text
documents",
journal = j-FUT-GEN-COMP-SYS,
volume = "88",
number = "??",
pages = "614--623",
month = nov,
year = "2018",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.04.054",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:58 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17320708",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bienkowski:2018:OAF,
author = "Marcin Bienkowski and Nadi Sarrar and Stefan Schmid
and Steve Uhlig",
title = "Online Aggregation of the Forwarding Information Base:
Accounting for Locality and Churn",
journal = j-IEEE-TRANS-NETWORKING,
volume = "26",
number = "1",
pages = "591--604",
month = feb,
year = "2018",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2017.2787419",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Apr 19 11:27:04 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper studies the problem of compressing the
forwarding information base FIB, but taking a wider
perspective. Indeed, FIB compression goes beyond sheer
compression, as the gain in memory use obtained from
the compression has consequences on the updates that
will have to be applied to the compressed FIB. We are
interested in the situation where forwarding rules can
change over time, e.g., due to border gateway protocol
BGP route updates. Accordingly, we frame FIB
compression as an online problem and design competitive
online algorithms to solve it. In contrast to prior
work which mostly focused on static optimizations, we
study an online variant of the problem where routes can
change over time and where the number of updates to the
FIB is taken into account explicitly. The reason to
consider this version of the problem is that leveraging
temporal locality while accounting for the number of
FIB updates helps to keep routers CPU load low and
reduces the number of FIB updates to be transferred,
e.g., from the network-attached software-defined
network controller to a remote switch. This paper
introduces a formal model which is an interesting
generalization of several classic online aggregation
problems. Our main contribution is an Ow-competitive
algorithm, where $ {w} $ is the length of an IP
address. We also derive a lower bound which shows that
our result is asymptotically optimal within a natural
class of algorithms, based on so-called sticks.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Bille:2018:DRC,
author = "Philip Bille and Anders Roy Christiansen and Patrick
Hagge Cording and Inge Li G{\o}rtz and Frederik Rye
Skjoldjensen and Hjalte Wedel Vildh{\o}j and S{\o}ren
Vind",
title = "Dynamic Relative Compression, Dynamic Partial Sums,
and Substring Concatenation",
journal = j-ALGORITHMICA,
volume = "80",
number = "11",
pages = "3207--3224",
month = nov,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0380-7",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:18:57 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/11;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Bille:2018:TST,
author = "Philip Bille and Mikko Berggren Ettienne and Inge Li
G{\o}rtz and Hjalte Wedel Vildh{\o}j",
title = "Time-space trade-offs for {Lempel--Ziv} compressed
indexing",
journal = j-THEOR-COMP-SCI,
volume = "713",
number = "??",
pages = "66--77",
day = "22",
month = feb,
year = "2018",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Feb 7 06:04:17 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397517309167",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Blalock:2018:STS,
author = "Davis Blalock and Samuel Madden and John Guttag",
title = "{Sprintz}: Time Series Compression for the {Internet
of Things}",
journal = j-IMWUT,
volume = "2",
number = "3",
pages = "1--23",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3264903",
ISSN = "2474-9567 (electronic)",
bibdate = "Thu Jan 23 12:37:04 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/imwut.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3264903",
abstract = "Thanks to the rapid proliferation of connected
devices, sensor-generated time series constitute a
large and growing portion of the world's data. Often,
this data is collected from distributed,
resource-constrained devices and centralized at one or
more \ldots{}",
acknowledgement = ack-nhfb,
articleno = "93",
fjournal = "Proceedings of the ACM on Interactive, Mobile,
Wearable and Ubiquitous Technologies (IMWUT)",
journal-URL = "https://dl.acm.org/loi/imwut",
}
@Article{Borm:2018:ACL,
author = "Steffen B{\"o}rm",
title = "Adaptive compression of large vectors",
journal = j-MATH-COMPUT,
volume = "87",
number = "87",
pages = "209--235",
month = "",
year = "2018",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Sat Jan 13 15:49:07 MST 2018",
bibsource = "http://www.ams.org/mcom/2018-87-87;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathcomp2010.bib",
URL = "http://www.ams.org/journals/mcom/2018-87-309/S0025-5718-2017-03203-8;
http://www.ams.org/journals/mcom/2018-87-309/S0025-5718-2017-03203-8/S0025-5718-2017-03203-8.pdf;
https://www.ams.org/mathscinet/search/authors.html?mrauthid=678579",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Boukaram:2018:BQS,
author = "Wajih Halim Boukaram and George Turkiyyah and Hatem
Ltaief and David E. Keyes",
title = "Batched {$ Q R $} and {SVD} algorithms on {GPUs} with
applications in hierarchical matrix compression",
journal = j-PARALLEL-COMPUTING,
volume = "74",
number = "??",
pages = "19--33",
month = "????",
year = "2018",
CODEN = "PACOEJ",
DOI = "https://doi.org/10.1016/j.parco.2017.09.001",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Tue Apr 3 13:55:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167819117301461",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191",
}
@Article{Breslow:2018:MFF,
author = "Alex D. Breslow and Nuwan S. Jayasena",
title = "{Morton} filters: faster, space-efficient cuckoo
filters via biasing, compression, and decoupled logical
sparsity",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "11",
number = "9",
pages = "1041--1055",
month = may,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.14778/3213880.3213884",
ISSN = "2150-8097",
ISSN-L = "2150-8097",
bibdate = "Sat Jun 30 09:26:43 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Approximate set membership data structures (ASMDSs)
are ubiquitous in computing. They trade a tunable,
often small, error rate ($\epsilon$) for large space
savings. The canonical ASMDS is the Bloom filter, which
supports lookups and insertions but not deletions in
its simplest form. Cuckoo filters (CFs), a recently
proposed class of ASMDSs, add deletion support and
often use fewer bits per item for equal
$\epsilon$. This work introduces the Morton filter
(MF), a novel AS-MDS that introduces several key
improvements to CFs. Like CFs, MFs support lookups,
insertions, and deletions, but improve their respective
throughputs by 1.3x to 2.5x, 0.9x to 15.5x, and 1.3x to
1.6x. MFs achieve these improvements by (1) introducing
a compressed format that permits a logically sparse
filter to be stored compactly in memory, (2) leveraging
succinct embedded metadata to prune unnecessary memory
accesses, and (3) heavily biasing insertions to use a
single hash function. With these optimizations,
lookups, insertions, and deletions often only require
accessing a single hardware cache line from the
filter. These improvements are not at a loss in space
efficiency, as MFs typically use comparable to slightly
less space than CFs for the same epsis;.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Canteaut:2018:SCP,
author = "Anne Canteaut and Sergiu Carpov and Caroline Fontaine
and Tancr{\`e}de Lepoint and Mar{\'\i}a Naya-Plasencia
and Pascal Paillier and Renaud Sirdey",
title = "Stream Ciphers: A Practical Solution for Efficient
Homomorphic-Ciphertext Compression",
journal = j-J-CRYPTOLOGY,
volume = "31",
number = "3",
pages = "885--916",
month = jul,
year = "2018",
CODEN = "JOCREQ",
DOI = "https://doi.org/10.1007/s00145-017-9273-9",
ISSN = "0933-2790 (print), 1432-1378 (electronic)",
ISSN-L = "0933-2790",
bibdate = "Wed Sep 26 09:58:08 MDT 2018",
bibsource = "http://link.springer.com/journal/145/31/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcryptology.bib",
URL = "https://link.springer.com/article/10.1007/s00145-017-9273-9",
acknowledgement = ack-nhfb,
fjournal = "Journal of Cryptology",
journal-URL = "http://link.springer.com/journal/145",
}
@Article{Choukse:2018:CEM,
author = "Esha Choukse and Mattan Erez and Alaa Alameldeen",
title = "{CompressPoints}: An Evaluation Methodology for
Compressed Memory Systems",
journal = j-IEEE-COMPUT-ARCHIT-LETT,
volume = "17",
number = "2",
pages = "126--129",
month = jul # "\slash " # dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1109/LCA.2018.2821163",
ISSN = "1556-6056 (print), 1556-6064 (electronic)",
ISSN-L = "1556-6056",
bibdate = "Thu Jun 20 17:18:18 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib",
abstract = "Current memory technology has hit a wall trying to
scale to meet the increasing demands of modern client
and datacenter systems. Data compression is a promising
solution to this problem. Several compressed memory
systems have been proposed in the past years [1], [2],
[3], [4]. Unfortunately, a reasonable methodology to
evaluate these systems is missing. In this paper, we
identify the challenges for evaluating main memory
compression. We propose an effective methodology to
evaluate a compressed memory system by proposing
mechanisms to: (i) incorporate correct virtual address
translation, (ii) choose a region in the application
that is representative of the compression ratio, in
addition to regular metrics like IPC and cache hit
rates, and (iii) choose a representative region for
multi-core workloads, bringing down the correlation
error from 12.8 to 3.8 percent.",
acknowledgement = ack-nhfb,
affiliation = "Choukse, E (Reprint Author), Univ Texas Austin,
Austin, TX 78712 USA. Choukse, Esha; Erez, Mattan, Univ
Texas Austin, Austin, TX 78712 USA. Alameldeen, Alaa,
Intel Labs, Santa Clara, CA 95054 USA.",
author-email = "esha.choukse@utexas.edu mattan.erez@utexas.edu
alaa.r.alameldeen@intel.com",
da = "2019-06-20",
doc-delivery-number = "GP4TI",
eissn = "1556-6064",
fjournal = "IEEE Computer Architecture Letters",
journal-iso = "IEEE Comput. Archit. Lett.",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208",
keywords = "compressed memory; Compression; DRAM; evaluation;
memory; methodology; multi-core; representative
regions; translation; workloads",
number-of-cited-references = "8",
ORCID-numbers = "Choukse, Esha/0000-0003-0371-5522",
research-areas = "Computer Science",
times-cited = "0",
unique-id = "Choukse:2018:CEM",
web-of-science-categories = "Computer Science, Hardware \&
Architecture",
}
@Article{Di:2018:OEB,
author = "Sheng Di and Franck Cappello",
title = "Optimization of Error-Bounded Lossy Compression for
Hard-to-Compress {HPC} Data",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "29",
number = "1",
pages = "129--143",
month = jan,
year = "2018",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2017.2749300",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Dec 14 07:22:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "https://www.computer.org/csdl/trans/td/2018/01/08031063-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Dong:2018:CAP,
author = "D. Dong and J. Herbert",
title = "Content-Aware Partial Compression for Textual Big Data
Analysis in {Hadoop}",
journal = j-IEEE-TRANS-BIG-DATA,
volume = "4",
number = "4",
pages = "459--472",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1109/TBDATA.2017.2721431",
ISSN = "2332-7790",
bibdate = "Fri Aug 2 11:24:47 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Big Data",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317",
keywords = "Algorithm design and analysis; Big Data; Big data;
compression; Data analysis; Data compression;
Distributed databases; distributed file system; File
systems; mapreduce",
}
@Article{Elgohary:2018:CLA,
author = "Ahmed Elgohary and Matthias Boehm and Peter J. Haas
and Frederick R. Reiss and Berthold Reinwald",
title = "Compressed linear algebra for large-scale machine
learning",
journal = j-VLDB-J,
volume = "27",
number = "5",
pages = "719--744",
month = oct,
year = "2018",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-017-0478-1",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Thu Oct 4 06:40:44 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "Large-scale machine learning algorithms are often
iterative, using repeated read-only data access and
I/O-bound matrix--vector multiplications to converge to
an optimal model. It is crucial for performance to fit
the data into single-node or distributed main memory
and enable fast matrix--vector operations on in-memory
data. General-purpose, heavy- and lightweight
compression techniques struggle to achieve both good
compression ratios and fast decompression speed to
enable block-wise uncompressed operations. Therefore,
we initiate work --- inspired by database compression
and sparse matrix formats --- on value-based compressed
linear algebra (CLA), in which heterogeneous,
lightweight database compression techniques are applied
to matrices, and then linear algebra operations such as
matrix--vector multiplication are executed directly on
the compressed representation. We contribute effective
column compression schemes, cache-conscious operations,
and an efficient sampling-based compression algorithm.
Our experiments show that CLA achieves in-memory
operations performance close to the uncompressed case
and good compression ratios, which enables fitting
substantially larger datasets into available memory. We
thereby obtain significant end-to-end performance
improvements up to $ 9.2 \times $.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Fischer:2018:LZF,
author = "Johannes Fischer and Tomohiro I and Dominik K{\"o}ppl
and Kunihiko Sadakane",
title = "{Lempel--Ziv} Factorization Powered by Space Efficient
Suffix Trees",
journal = j-ALGORITHMICA,
volume = "80",
number = "7",
pages = "2048--2081",
month = jul,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0333-1",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:19:00 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/7;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Ganardi:2018:TCU,
author = "Moses Ganardi and Danny Hucke and Markus Lohrey and
Eric Noeth",
title = "Tree Compression Using String Grammars",
journal = j-ALGORITHMICA,
volume = "80",
number = "3",
pages = "885--917",
month = mar,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0279-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:18:58 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/3;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Book{Hassanieh:2018:SFT,
author = "Haitham Hassanieh",
title = "The {Sparse Fourier Transform}: Theory and Practice",
volume = "19",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xvii + 260",
year = "2018",
DOI = "https://doi.org/10.1145/3166186",
ISBN = "1-947487-07-8 (hardcover), 1-947487-04-3 (paperback),
1-947487-05-1 (e-book)",
ISBN-13 = "978-1-947487-07-9 (hardcover), 978-1-947487-04-8
(paperback), 978-1-947487-05-5 (e-book)",
LCCN = "QC20.7.F67 H37 2018",
bibdate = "Tue Aug 6 15:47:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/numana2010.bib;
z3950.loc.gov:7090/Voyager",
series = "ACM book series",
abstract = "The Fourier transform is one of the most fundamental
tools for computing the frequency representation of
signals. It plays a central role in signal processing,
communications, audio and video compression, medical
imaging, genomics, astronomy, as well as many other
areas. Because of its widespread use, fast algorithms
for computing the Fourier transform can benefit a large
number of applications. The fastest algorithm for
computing the Fourier transform is the Fast Fourier
Transform (FFT), which runs in near-linear time making
it an indispensable tool for many applications.
However, today, the runtime of the FFT algorithm is no
longer fast enough especially for big data problems
where each dataset can be few terabytes. Hence, faster
algorithms that run in sublinear time, i.e., do not
even sample all the data points, have become necessary.
This book addresses the above problem by developing the
Sparse Fourier Transform algorithms and building
practical systems that use these algorithms to solve
key problems in six different applications: wireless
networks; mobile systems; computer graphics; medical
imaging; biochemistry; and digital circuits. This is a
revised version of the thesis that won the 2016 ACM
Doctoral Dissertation Award.",
acknowledgement = ack-nhfb,
subject = "Fourier transformations; Sparse matrices",
tableofcontents = "1. Introduction \\
1.1 Sparse Fourier transform algorithms \\
1.2 Applications of the sparse Fourier transform \\
1.3 Book overview \\
Part I. Theory of the sparse Fourier transform \\
2. preliminaries \\
2.1 Notation \\
2.2 Basics \\
3. Simple and practical algorithm \\
3.1 Introduction \\
3.2 Algorithm \\
4. Optimizing runtime complexity \\
4.1 Introduction \\
4.2 Algorithm for the exactly sparse case \\
4.3 Algorithm for the general case \\
4.4 Extension to two dimensions \\
5. Optimizing sample complexity \\
5.1 Introduction \\
5.2 Algorithm for the exactly sparse case \\
5.3 Algorithm for the general case \\
6. Numerical evaluation \\
6.1 Implementation \\
6.2 Experimental setup \\
6.3 Numerical results \\
Part II. Applications of the sparse Fourier transform
\\
7. GHz-wide spectrum sensing and decoding \\
7.1 Introduction \\
7.2 Related work \\
7.3 BigBand \\
7.4 Channel estimation and calibration \\
7.5 Differential sensing of non-sparse spectrum \\
7.6 A USRP-based implementation \\
7.7 BigBand's spectrum sensing results \\
7.8 BigBand's decoding results \\
7.9 D-BigBand's sensing results \\
7.10 Conclusion \\
8. Faster GPS synchronization \\
8.1 Introduction \\
8.2 GPS primer \\
8.3 QuickSync \\
8.4 Theoretical guarantees \\
8.5 Doppler shift and frequency offset \\
8.6 Testing environment \\
8.7 Results \\
8.8 Related work \\
8.9 Conclusion \\
9. Light field reconstruction using continuous Fourier
sparsity \\
9.1 Introduction \\
9.2 Related work \\
9.3 Sparsity in the discrete vs. continuous Fourier
domain \\
9.4 Light field notation \\
9.5 Light field reconstruction algorithm \\
9.6 Experiments \\
9.7 Results \\
9.8 Discussion \\
9.9 Conclusion \\
10. Fast in-vivo MRS acquisition with artifact
suppression \\
10.1 Introduction \\
10.2 MRS-SFT \\
10.3 Methods \\
10.4 MRS results \\
10.5 Conclusion \\
11. Fast multi-dimensional NMR acquisition and
processing \\
11.1 Introduction \\
11.2 Multi-dimensional sparse Fourier transform \\
11.3 Materials and methods \\
11.4 Results \\
11.5 Discussion \\
11.6 Conclusion \\
12. Conclusion \\
12.1 Future directions \\
Appendix A. Proofs \\
Appendix B. The optimality of the exactly k-Sparse
algorithm 4.1 \\
Appendix C. Lower bound of the sparse Fourier transform
in the general case \\
Appendix D. Efficient constructions of window functions
\\
Appendix E. Sample lower bound for the Bernoulli
distribution \\
Appendix F. Analysis of the QuickSync system \\
Analysis of the baseline algorithm \\
Tightness of the variance bound \\
Analysis of the QuickSync algorithm \\
Appendix G. A 0.75 million point sparse Fourier
transform chip \\
The algorithm \\
The architecture \\
The chip \\
References \\
Author biography",
}
@Article{Heroy:2018:RGC,
author = "Samuel Heroy and Dane Taylor and F. Bill Shi and M.
Gregory Forest and Peter J. Mucha",
title = "Rigid Graph Compression: {Motif}-Based Rigidity
Analysis for Disordered Fiber Networks",
journal = j-MULTISCALE-MODELING-SIMUL,
volume = "16",
number = "3",
pages = "1283--1304",
month = "????",
year = "2018",
CODEN = "MMSUBT",
DOI = "https://doi.org/10.1137/17M1157271",
ISSN = "1540-3459 (print), 1540-3467 (electronic)",
ISSN-L = "1540-3459",
bibdate = "Thu Oct 10 07:17:27 MDT 2019",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/MMS/16/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siammms.bib",
acknowledgement = ack-nhfb,
fjournal = "Multiscale Modeling and Simulation",
journal-URL = "http://epubs.siam.org/mms",
onlinedate = "January 2018",
}
@Article{Jahedi:2018:CDB,
author = "S. Jahedi and F. Javadi and M. J. Mehdipour",
title = "Compression and decompression based on discrete
weighted transform",
journal = j-APPL-MATH-COMP,
volume = "335",
number = "??",
pages = "133--145",
day = "15",
month = oct,
year = "2018",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2018.04.048",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jun 2 17:40:19 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2015.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300318303667",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Kim:2018:EMS,
author = "Yong Hwi Kim and Junho Choi and Kwan H. Lee",
title = "An efficient method for specular-enhanced {BTF}
compression",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "75",
number = "??",
pages = "A4",
month = oct,
year = "2018",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2018.06.001",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Sat Sep 15 16:26:41 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0097849318300918",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Kirchhoffer:2018:PDV,
author = "Heiner Kirchhoffer and Detlev Marpe and Heiko Schwarz
and Thomas Wiegand",
title = "Properties and Design of Variable-to-Variable Length
Codes",
journal = j-TOMM,
volume = "14",
number = "3",
pages = "75:1--75:??",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3230653",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Oct 2 10:12:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "For the entropy coding of independent and identically
distributed (i.i.d.) binary sources,
variable-to-variable length (V2V) codes are an
interesting alternative to arithmetic coding. Such a
V2V code translates variable length words of the source
into variable length code words by employing two
prefix-free codes. In this article, several properties
of V2V codes are studied, and new concepts are
developed. In particular, it is shown that the
redundancy of a V2V code cannot be zero for a binary
i.i.d. source {X} with 0 \< p$_X$ (1) \< 0.5.
Furthermore, the concept of prime and composite V2V
codes is proposed, and it is shown why composite V2V
codes can be disregarded in the search for particular
classes of minimum redundancy codes. Moreover, a
canonical representation for V2V codes is proposed,
which identifies V2V codes that have the same average
code length function. It is shown how these concepts
can be employed to greatly reduce the complexity of a
search for minimum redundancy (size-limited) V2V
codes.",
acknowledgement = ack-nhfb,
articleno = "75",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Kong:2018:EVE,
author = "Lingchao Kong and Rui Dai",
title = "Efficient Video Encoding for Automatic Video Analysis
in Distributed Wireless Surveillance Systems",
journal = j-TOMM,
volume = "14",
number = "3",
pages = "72:1--72:??",
month = aug,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3226036",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Wed Oct 2 10:12:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
abstract = "In many distributed wireless surveillance
applications, compressed videos are used for performing
automatic video analysis tasks. The accuracy of object
detection, which is essential for various video
analysis tasks, can be reduced due to video quality
degradation caused by lossy compression. This article
introduces a video encoding framework with the
objective of boosting the accuracy of object detection
for wireless surveillance applications. The proposed
video encoding framework is based on systematic
investigation of the effects of lossy compression on
object detection. It has been found that current
standardized video encoding schemes cause temporal
domain fluctuation for encoded blocks in stable
background areas and spatial texture degradation for
encoded blocks in dynamic foreground areas of a raw
video, both of which degrade the accuracy of object
detection. Two measures, the sum-of-absolute frame
difference (SFD) and the degradation of texture in 2D
transform domain (TXD), are introduced to depict the
temporal domain fluctuation and the spatial texture
degradation in an encoded video, respectively. The
proposed encoding framework is designed to suppress
unnecessary temporal fluctuation in stable background
areas and preserve spatial texture in dynamic
foreground areas based on the two measures, and it
introduces new mode decision strategies for both intra-
and interframes to improve the accuracy of object
detection while maintaining an acceptable rate
distortion performance. Experimental results show that,
compared with traditional encoding schemes, the
proposed scheme improves the performance of object
detection and results in lower bit rates and
significantly reduced complexity with comparable
quality in terms of PSNR and SSIM.",
acknowledgement = ack-nhfb,
articleno = "72",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Article{Lee:2018:IEE,
author = "Hochan Lee and Mansureh S. Moghaddam and Dongkwan Suh
and Bernhard Egger",
title = "Improving Energy Efficiency of Coarse-Grain
Reconfigurable Arrays Through Modulo Schedule
Compression\slash Decompression",
journal = j-TACO,
volume = "15",
number = "1",
pages = "1:1--1:??",
month = apr,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3162018",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Tue Jan 8 17:19:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
abstract = "Modulo-scheduled course-grain reconfigurable array
(CGRA) processors excel at exploiting loop-level
parallelism at a high performance per watt ratio. The
frequent reconfiguration of the array, however, causes
between 25\% and 45\% of the consumed chip energy to be
spent on the instruction memory and fetches therefrom.
This article presents a hardware/software codesign
methodology for such architectures that is able to
reduce both the size required to store the
modulo-scheduled loops and the energy consumed by the
instruction decode logic. The hardware modifications
improve the spatial organization of a CGRA's execution
plan by reorganizing the configuration memory into
separate partitions based on a statistical analysis of
code. A compiler technique optimizes the generated code
in the temporal dimension by minimizing the number of
signal changes. The optimizations achieve, on average,
a reduction in code size of more than 63\% and in
energy consumed by the instruction decode logic by 70\%
for a wide variety of application domains.
Decompression of the compressed loops can be performed
in hardware with no additional latency, rendering the
presented method ideal for low-power CGRAs running at
high frequencies. The presented technique is orthogonal
to dictionary-based compression schemes and can be
combined to achieve a further reduction in code size.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
}
@Article{Luo:2018:ACS,
author = "Wenchang Luo and Yao Xu and Boyuan Gu and Weitian Tong
and Randy Goebel and Guohui Lin",
title = "Algorithms for Communication Scheduling in Data
Gathering Network with Data Compression",
journal = j-ALGORITHMICA,
volume = "80",
number = "11",
pages = "3158--3176",
month = nov,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0373-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:18:57 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/11;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Marchetti:2018:SDC,
author = "Yuliya Marchetti and Hai Nguyen and Amy Braverman and
Noel Cressie",
title = "Spatial data compression via adaptive dispersion
clustering",
journal = j-COMPUT-STAT-DATA-ANAL,
volume = "117",
number = "??",
pages = "138--153",
month = jan,
year = "2018",
CODEN = "CSDADW",
DOI = "https://doi.org/10.1016/j.csda.2017.08.004",
ISSN = "0167-9473 (print), 1872-7352 (electronic)",
ISSN-L = "0167-9473",
bibdate = "Fri Jan 12 09:55:30 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computstatdataanal2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167947317301731",
acknowledgement = ack-nhfb,
fjournal = "Computational Statistics \& Data Analysis",
journal-URL = "http://www.sciencedirect.com/science/journal/01679473",
}
@Article{Pavlichin:2018:QSG,
author = "D. Pavlichin and T. Weissman and G. Mably",
title = "The quest to save genomics: Unless researchers solve
the looming data compression problem, biomedical
science could stagnate",
journal = j-IEEE-SPECTRUM,
volume = "55",
number = "9",
pages = "27--31",
month = sep,
year = "2018",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2018.8449046",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 07:02:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Bioinformatics; biomedical engineering; biomedical
science; data compression; Data compression; DNA;
Genomics; genomics; Sequential analysis; Streaming
media",
}
@Article{Petri:2018:CII,
author = "Matthias Petri and Alistair Moffat",
title = "Compact inverted index storage using general-purpose
compression libraries",
journal = j-SPE,
volume = "48",
number = "4",
pages = "974--982",
month = apr,
year = "2018",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2556",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Aug 4 10:20:32 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2556",
acknowledgement = ack-nhfb,
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "17 January 2018",
}
@Article{Policriti:2018:LCB,
author = "Alberto Policriti and Nicola Prezza",
title = "{LZ77} Computation Based on the Run-Length Encoded
{BWT}",
journal = j-ALGORITHMICA,
volume = "80",
number = "7",
pages = "1986--2011",
month = jul,
year = "2018",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-017-0327-z",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Wed Sep 26 10:19:00 MDT 2018",
bibsource = "http://link.springer.com/journal/453/80/7;
https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Salikhov:2018:ICD,
author = "Kamil Salikhov",
title = "Improved Compression of {DNA} Sequencing Data with
Cascading {Bloom} Filters",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "29",
number = "8",
pages = "??--??",
month = dec,
year = "2018",
DOI = "https://doi.org/10.1142/S0129054118430013",
ISSN = "0129-0541",
ISSN-L = "0129-0541",
bibdate = "Thu Dec 27 05:21:34 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
abstract = "Modern DNA sequencing technologies generate prodigious
volumes of sequence data consisting of short DNA
fragments (reads). Storing and transferring this data
is often challenging. With this motivation, several
specialized compression methods have been developed. In
this paper, we present an improvement of the lossless
reference-free compression algorithm, suggested by
Rozov et al., based on the technique of cascading Bloom
filters. Through computational experiments on real
data, we demonstrate that our method results in a
significant associated memory reduction in practice.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sui:2018:PPC,
author = "Peipei Sui and Xiaoyu Yang",
title = "A Privacy-Preserving Compression Storage Method for
Large Trajectory Data in Road Network",
journal = j-J-GRID-COMP,
volume = "16",
number = "2",
pages = "229--245",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-018-9435-5",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Wed Sep 26 10:02:59 MDT 2018",
bibsource = "http://link.springer.com/journal/10723/16/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "https://link.springer.com/article/10.1007/s10723-018-9435-5",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Vasa:2018:EPC,
author = "L. V{\'a}{\v{s}}a and J. Dvo{\v{r}}{\'a}k",
title = "Error propagation control in {Laplacian} mesh
compression",
journal = j-CGF,
volume = "37",
number = "5",
pages = "61--70",
month = aug,
year = "2018",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.13491",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Thu Mar 28 07:04:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "08 August 2018",
}
@Article{Wang:2018:OQA,
author = "Shiqi Wang and Ke Gu and Kai Zeng and Zhou Wang and
Weisi Lin",
title = "Objective Quality Assessment and Perceptual
Compression of Screen Content Images",
journal = j-IEEE-CGA,
volume = "38",
number = "1",
pages = "47--58",
month = jan # "\slash " # feb,
year = "2018",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/MCG.2016.46",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Thu Mar 15 08:59:53 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeecga.bib",
URL = "https://www.computer.org/csdl/mags/cg/2018/01/mcg2018010047-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Xie:2018:QLC,
author = "Ting Xie and Varun Chandola and Oliver Kennedy",
title = "Query log compression for workload analytics",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "3",
pages = "183--196",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.14778/3291264.3291265",
ISSN = "2150-8097",
bibdate = "Fri Jan 18 05:54:04 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Analyzing database access logs is a key part of
performance tuning, intrusion detection, benchmark
development, and many other database administration
tasks. Unfortunately, it is common for production
databases to deal with millions or more queries each
day, so these logs must be summarized before they can
be used. Designing an appropriate summary encoding
requires trading off between conciseness and
information content. For example: simple workload
sampling may miss rare, but high impact queries. In
this paper, we present L OGR, a lossy log compression
scheme suitable for use in many automated log analytics
tools, as well as for human inspection. We formalize
and analyze the space/fidelity trade-off in the context
of a broader family of ``pattern'' and ``pattern
mixture'' log encodings to which LOGR belongs. We show
through a series of experiments that LOGR compressed
encodings can be created efficiently, come with
provable information-theoretic bounds on their
accuracy, and outperform state-of-art log summarization
strategies.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Yan:2018:SMR,
author = "Yizhou Yan and Lei Cao and Samuel Madden and Elke A.
Rundensteiner",
title = "{SWIFT}: mining representative patterns from large
event streams",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "12",
number = "3",
pages = "265--277",
month = nov,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.14778/3291264.3291271",
ISSN = "2150-8097",
bibdate = "Fri Jan 18 05:54:04 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
abstract = "Event streams generated by smart devices common in
modern Internet of Things applications must be
continuously mined to monitor the behavior of the
underlying system. In this work, we propose a stream
pattern mining system for supporting online IoT
applications. First, to solve the pattern explosion
problem of existing stream pattern mining strategies,
we now design pattern semantics that continuously
produce a compact set of patterns that max-imumly
compresses the dynamic data streams, called MDL-based
Representative Patterns (MRP). We then design a
one-pass SWIFT approach that continuously mines the
up-to-date MRP pattern set for each stream window upon
the arrival or expiration of individual events. We show
that SWIFT is guaranteed to select the update operation
for each individual incoming event that leads to the
most compact encoding of the sequence in the current
window. We further enhance SWIFT to support batch
updates, called B-SWIFT. B-SWIFT adopts a lazy update
strategy that guarantees that only the minimal number
of operations are conducted to process an incoming
event batch for MRP pattern mining. Evaluation by our
industry lighting lab collaborator demonstrates that
SWIFT successfully solves their use cases and finds
more representative patterns than the alternative
approaches adapting the state-of-the-art static
representative pattern mining methods. Our experimental
study confirms that SWIFT outperforms the best existing
method up to 50\% in the compactness of produced
pattern encodings, while providing a 4 orders of
magnitude speedup.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "http://portal.acm.org/citation.cfm?id=J1174",
}
@Article{Zhang:2018:DSD,
author = "Binqi Zhang and Chen Wang and Bing Bing Zhou and Dong
Yuan and Albert Y. Zomaya",
title = "{DCDedupe}: Selective Deduplication and Delta
Compression with Effective Routing for Distributed
Storage",
journal = j-J-GRID-COMP,
volume = "16",
number = "2",
pages = "195--209",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-018-9429-3",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Wed Sep 26 10:02:59 MDT 2018",
bibsource = "http://link.springer.com/journal/10723/16/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib",
URL = "https://link.springer.com/article/10.1007/s10723-018-9429-3",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Zhou:2018:AMR,
author = "Ke Zhou and Wenjie Liu and Kun Tang and Ping Huang and
Xubin He",
title = "Alleviating Memory Refresh Overhead via Data
Compression for High Performance and Energy
Efficiency",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "29",
number = "7",
pages = "1469--1483",
month = jul,
year = "2018",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2017.2763141",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jun 14 08:35:31 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
URL = "https://www.computer.org/csdl/trans/td/2018/07/08068250-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Alakuijala:2019:BGP,
author = "Jyrki Alakuijala and Andrea Farruggia and Paolo
Ferragina and Eugene Kliuchnikov and Robert Obryk and
Zoltan Szabadka and Lode Vandevenne",
title = "{Brotli}: a General-Purpose Data Compressor",
journal = j-TOIS,
volume = "37",
number = "1",
pages = "4:1--4:??",
month = jan,
year = "2019",
CODEN = "ATISET",
DOI = "https://doi.org/10.1145/3231935",
ISSN = "1046-8188",
bibdate = "Sat Sep 21 11:52:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tois.bib",
abstract = "Brotli is an open source general-purpose data
compressor introduced by Google in late 2013 and now
adopted in most known browsers and Web servers. It is
publicly available on GitHub and its data format was
submitted as RFC 7932 in July 2016. Brotli is based on
the Lempel--Ziv compression scheme and planned as a
generic replacement of Gzip and ZLib. The main goal in
its design was to compress data on the Internet, which
meant optimizing the resources used at decoding time,
while achieving maximal compression density. This
article is intended to provide the first thorough,
systematic description of the Brotli format as well as
a detailed computational and experimental analysis of
the main algorithmic blocks underlying the current
encoder implementation, together with a comparison
against compressors of different families constituting
the state-of-the-art either in practice or in theory.
This treatment will allow us to raise a set of new
algorithmic and software engineering problems that
deserve further attention from the scientific
community.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information Systems (TOIS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J779",
}
@Article{Azar:2019:EEI,
author = "Joseph Azar and Abdallah Makhoul and Mahmoud Barhamgi
and Rapha{\"e}l Couturier",
title = "An energy efficient {IoT} data compression approach
for edge machine learning",
journal = j-FUT-GEN-COMP-SYS,
volume = "96",
number = "??",
pages = "168--175",
month = jul,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18331716",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Baker:2019:EIQ,
author = "A. H. Baker and D. M. Hammerling and T. L. Turton",
title = "Evaluating image quality measures to assess the impact
of lossy data compression applied to climate simulation
data",
journal = j-CGF,
volume = "38",
number = "3",
pages = "517--528",
month = jun,
year = "2019",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/cgf.13707",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat Oct 12 15:08:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics World",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "10 July 2019",
}
@Article{Ballester-Ripoll:2019:TDI,
author = "Rafael Ballester-Ripoll and Renato Pajarola",
title = "Tensor Decompositions for Integral Histogram
Compression and Look-Up",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "25",
number = "2",
pages = "1435--1446",
month = feb,
year = "2019",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2018.2802521",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Wed Jan 2 16:40:20 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
URL = "https://www.computer.org/csdl/trans/tg/2019/02/08281540-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Bhardwaj:2019:MCA,
author = "Kartikeya Bhardwaj and Ching-Yi Lin and Anderson
Sartor and Radu Marculescu",
title = "Memory- and Communication-Aware Model Compression for
Distributed Deep Learning Inference on {IoT}",
journal = j-TECS,
volume = "18",
number = "5s",
pages = "82:1--82:??",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3358205",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3358205",
abstract = "Model compression has emerged as an important area of
research for deploying deep learning models on
Internet-of-Things (IoT). However, for extremely
memory-constrained scenarios, even the compressed
models cannot fit within the memory of a single device
and, as a result, must be distributed across multiple
devices. This leads to a distributed inference paradigm
in which memory and communication costs represent a
major bottleneck. Yet, existing model compression
techniques are not communication-aware. Therefore, we
propose Network of Neural Networks (NoNN), a new
distributed IoT learning paradigm that compresses a
large pretrained `teacher' deep network into several
disjoint and highly-compressed `student' modules,
without loss of accuracy. Moreover, we propose a
network science-based knowledge partitioning algorithm
for the teacher model, and then train individual
students on the resulting disjoint partitions.
Extensive experimentation on five image classification
datasets, for user-defined memory/performance budgets,
show that NoNN achieves higher accuracy than several
baselines and similar accuracy as the teacher model,
while using minimal communication among students.
Finally, as a case study, we deploy the proposed model
for CIFAR-10 dataset on edge devices and demonstrate
significant improvements in memory footprint (up to $
24 \times $), performance (up to $ 12 \times $), and
energy per node (up to $ 14 \times $) compared to the
large teacher model. We further show that for
distributed inference on multiple edge devices, our
proposed NoNN model results in up to $ 33 \times $
reduction in total latency w.r.t. a state-of-the-art
model compression baseline.",
acknowledgement = ack-nhfb,
articleno = "82",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Calhoun:2019:EFL,
author = "Jon Calhoun and Franck Cappello and Luke N. Olson and
Marc Snir and William D. Gropp",
title = "Exploring the feasibility of lossy compression for
{PDE} simulations",
journal = j-IJHPCA,
volume = "33",
number = "2",
pages = "397--410",
day = "1",
month = mar,
year = "2019",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342018762036",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 9 14:35:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "https://journals.sagepub.com/doi/full/10.1177/1094342018762036",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "https://journals.sagepub.com/home/hpc",
}
@Article{Cappello:2019:UCL,
author = "Franck Cappello and Sheng Di and Sihuan Li and Xin
Liang and Ali Murat Gok and Dingwen Tao and Chun Hong
Yoon and Xin-Chuan Wu and Yuri Alexeev and Frederic T.
Chong",
title = "Use cases of lossy compression for floating-point data
in scientific data sets",
journal = j-IJHPCA,
volume = "33",
number = "6",
pages = "1201--1220",
day = "1",
month = nov,
year = "2019",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342019853336",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 9 14:35:54 MDT 2019",
bibsource = "http://hpc.sagepub.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "https://journals.sagepub.com/doi/full/10.1177/1094342019853336",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "https://journals.sagepub.com/home/hpc",
}
@Article{Carpentieri:2019:OPL,
author = "Bruno Carpentieri and Arcangelo Castiglione and
Alfredo {De Santis} and Francesco Palmieri and Raffaele
Pizzolante",
title = "One-pass lossless data hiding and compression of
remote sensing data",
journal = j-FUT-GEN-COMP-SYS,
volume = "90",
number = "??",
pages = "222--239",
month = jan,
year = "2019",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2018.07.051",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Tue Sep 18 14:07:59 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18306629",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chang:2019:FPC,
author = "Yeim-Kuan Chang and Han-Chen Chen",
title = "Fast Packet Classification using Recursive
Endpoint-Cutting and Bucket Compression on {FPGA}",
journal = j-COMP-J,
volume = "62",
number = "2",
pages = "198--214",
day = "1",
month = feb,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy052",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Feb 11 10:50:41 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://academic.oup.com/comjnl/article/62/2/198/5026282",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Chen:2019:LAC,
author = "Siguang Chen and Shujun Zhang and Xiaoyao Zheng and
Xiukai Ruan",
title = "Layered adaptive compression design for efficient data
collection in industrial wireless sensor networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "129",
number = "??",
pages = "37--45",
day = "1",
month = mar,
year = "2019",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:30 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804519300025",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Cheng:2019:CBC,
author = "Kin-On Cheng and Ngai-Fong Law and Wan-Chi Siu",
title = "Clustering-Based Compression for Population {DNA}
Sequences",
journal = j-TCBB,
volume = "16",
number = "1",
pages = "208--221",
month = jan,
year = "2019",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2017.2762302",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Mon Mar 11 18:45:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcbb.bib",
abstract = "Due to the advancement of DNA sequencing techniques,
the number of sequenced individual genomes has
experienced an exponential growth. Thus, effective
compression of this kind of sequences is highly
desired. In this work, we present a novel compression
algorithm called Reference-based Compression algorithm
using the concept of Clustering RCC. The rationale
behind RCC is based on the observation about the
existence of substructures within the population
sequences. To utilize these substructures, $k$-means
clustering is employed to partition sequences into
clusters for better compression. A reference sequence
is then constructed for each cluster so that sequences
in that cluster can be compressed by referring to this
reference sequence. The reference sequence of each
cluster is also compressed with reference to a sequence
which is derived from all the reference sequences.
Experiments show that RCC can further reduce the
compressed size by up to 91.0 percent when compared
with state-of-the-art compression approaches. There is
a compromise between compressed size and processing
time. The current implementation in Matlab has time
complexity in a factor of thousands higher than the
existing algorithms implemented in C/C++. Further
investigation is required to improve processing time in
future.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
}
@Article{Damme:2019:CES,
author = "Patrick Damme and Annett Ungeth{\"u}m and Juliana
Hildebrandt and Dirk Habich and Wolfgang Lehner",
title = "From a Comprehensive Experimental Survey to a
Cost-based Selection Strategy for Lightweight Integer
Compression Algorithms",
journal = j-TODS,
volume = "44",
number = "3",
pages = "9:1--9:??",
month = jun,
year = "2019",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/3323991",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 29 10:55:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3323991",
abstract = "Lightweight integer compression algorithms are
frequently applied in in-memory database systems to
tackle the growing gap between processor speed and main
memory bandwidth. In recent years, the vectorization of
basic techniques such as delta coding and null
suppression has considerably enlarged the corpus of
available algorithms. As a result, today there is a
large number of algorithms to choose from, while
different algorithms are tailored to different data
characteristics. However, a comparative evaluation of
these algorithms with different data and hardware
characteristics has never been sufficiently conducted
in the literature. To close this gap, we conducted an
exhaustive experimental survey by evaluating several
state-of-the-art lightweight integer compression
algorithms as well as cascades of basic techniques. We
systematically investigated the influence of data as
well as hardware properties on the performance and the
compression rates. The evaluated algorithms are based
on publicly available implementations as well as our
own vectorized reimplementations. We summarize our
experimental findings leading to several new insights
and to the conclusion that there is no single-best
algorithm. Moreover, in this article, we also introduce
and evaluate a novel cost model for the selection of a
suitable lightweight integer compression algorithm for
a given dataset.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
}
@Article{Diffenderfer:2019:EAZ,
author = "James Diffenderfer and Alyson L. Fox and Jeffrey A.
Hittinger and Geoffrey Sanders and Peter G. Lindstrom",
title = "Error Analysis of {ZFP} Compression for Floating-Point
Data",
journal = j-SIAM-J-SCI-COMP,
volume = "41",
number = "3",
pages = "A1867--A1898",
month = "????",
year = "2019",
CODEN = "SJOCE3",
DOI = "https://doi.org/10.1137/18M1168832",
ISSN = "1064-8275 (print), 1095-7197 (electronic)",
ISSN-L = "1064-8275",
bibdate = "Thu Oct 10 06:58:05 MDT 2019",
bibsource = "http://epubs.siam.org/toc/sjoce3/41/3;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Scientific Computing",
journal-URL = "http://epubs.siam.org/sisc",
onlinedate = "January 2019",
}
@Article{Elgohary:2019:CLA,
author = "Ahmed Elgohary and Matthias Boehm and Peter J. Haas
and Frederick R. Reiss and Berthold Reinwald",
title = "Compressed linear algebra for declarative large-scale
machine learning",
journal = j-CACM,
volume = "62",
number = "5",
pages = "83--91",
month = may,
year = "2019",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 27 18:22:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://cacm.acm.org/magazines/2019/5/236413/fulltext",
abstract = "Large-scale Machine Learning (ML) algorithms are often
iterative, using repeated read-only data access and
I/O-bound matrix-vector multiplications. Hence, it is
crucial for performance to fit the data into
single-node or distributed main memory to enable fast
matrix-vector operations. General-purpose compression
struggles to achieve both good compression ratios and
fast decompression for block-wise uncompressed
operations. Therefore, we introduce Compressed Linear
Algebra (CLA) for lossless matrix compression. CLA
encodes matrices with lightweight, value-based
compression techniques and executes linear algebra
operations directly on the compressed representations.
We contribute effective column compression schemes,
cache-conscious operations, and an efficient
sampling-based compression algorithm. Our experiments
show good compression ratios and operations performance
close to the uncompressed case, which enables fitting
larger datasets into available memory. We thereby
obtain significant end-to-end performance
improvements.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Farruggia:2019:BDC,
author = "Andrea Farruggia and Paolo Ferragina and Antonio
Frangioni and Rossano Venturini",
title = "Bicriteria Data Compression",
journal = j-SIAM-J-COMPUT,
volume = "48",
number = "5",
pages = "1603--1642",
month = "????",
year = "2019",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/17M1121457",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Thu May 28 10:18:17 MDT 2020",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/48/5;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
onlinedate = "January 2019",
}
@Article{Fellner:2019:GPP,
author = "Andreas Fellner and Bruno Woltzenlogel Paleo",
title = "Greedy pebbling for proof space compression",
journal = j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER,
volume = "21",
number = "1",
pages = "71--86",
month = feb,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10009-017-0459-0",
ISSN = "1433-2779 (print), 1433-2787 (electronic)",
ISSN-L = "1433-2779",
bibdate = "Fri Oct 11 15:04:59 MDT 2019",
bibsource = "http://link.springer.com/journal/10009/21/1;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/sttt.bib",
URL = "https://link.springer.com/article/10.1007/s10009-017-0459-0;
https://link.springer.com/content/pdf/10.1007/s10009-017-0459-0.pdf",
acknowledgement = ack-nhfb,
fjournal = "International Journal on Software Tools for Technology
Transfer (STTT)",
journal-URL = "http://link.springer.com/journal/10009",
}
@Article{Goncalves:2019:NRR,
author = "Mateus A. Gon{\c{c}}alves and Lizandro S. Santos and
Fernando C. Peixoto and Teodorico C. Ramalho",
title = "{NMR} relaxation and relaxivity parameters of {MRI}
probes revealed by optimal wavelet signal compression
of molecular dynamics simulations",
journal = j-IJQC,
volume = "119",
number = "10",
pages = "e25896:1--e25896:??",
day = "15",
month = may,
year = "2019",
CODEN = "IJQCB2",
DOI = "https://doi.org/10.1002/qua.25896",
ISSN = "0020-7608 (print), 1097-461X (electronic)",
ISSN-L = "0020-7608",
bibdate = "Thu Mar 28 07:56:20 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijqc2010.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Quantum Chemistry",
journal-URL = "http://www.interscience.wiley.com/jpages/0020-7608/",
onlinedate = "24 January 2019",
}
@Article{Haroune-Belkacem:2019:SES,
author = "Nassima Haroune-Belkacem and Fouzi Semchedine and
Ahmed Al-Shammari and Djamil Aissani",
title = "{SMCA}: an efficient {SOAP} messages compression and
aggregation technique for improving web services
performance",
journal = j-J-PAR-DIST-COMP,
volume = "133",
number = "??",
pages = "149--158",
month = nov,
year = "2019",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Fri Sep 13 10:25:21 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731519304940",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Huybrechs:2019:HFA,
author = "Daan Huybrechs and Peter Opsomer",
title = "High-Frequency Asymptotic Compression of Dense {BEM}
Matrices for General Geometries Without Ray Tracing",
journal = j-J-SCI-COMPUT,
volume = "78",
number = "2",
pages = "710--745",
month = feb,
year = "2019",
CODEN = "JSCOEB",
DOI = "https://doi.org/10.1007/s10915-018-0786-7",
ISSN = "0885-7474 (print), 1573-7691 (electronic)",
ISSN-L = "0885-7474",
bibdate = "Fri Mar 29 16:30:50 MDT 2019",
bibsource = "http://link.springer.com/journal/10915/78/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jscicomput.bib",
URL = "https://link.springer.com/article/10.1007/s10915-018-0786-7;
https://link.springer.com/content/pdf/10.1007/s10915-018-0786-7.pdf",
acknowledgement = ack-nhfb,
fjournal = "Journal of Scientific Computing",
journal-URL = "http://link.springer.com/journal/10915",
}
@Article{Jahannia:2019:PZL,
author = "Marieh Jahannia and Morteza Mohammad-noori and Narad
Rampersad and Manon Stipulanti",
title = "Palindromic {Ziv--Lempel} and {Crochemore}
factorizations of $m$-{Bonacci} infinite words",
journal = j-THEOR-COMP-SCI,
volume = "790",
number = "??",
pages = "16--40",
day = "22",
month = oct,
year = "2019",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Oct 16 07:39:35 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397519303184",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Jellali:2019:BDS,
author = "Zakia Jellali and Le{\"\i}la Najjar Atallah and
Sofiane Cherif",
title = "Bi-dimensional Signal Compression Based on Linear
Prediction Coding: Application to {WSN}",
journal = j-TOSN,
volume = "15",
number = "3",
pages = "29:1--29:??",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3317688",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Wed Oct 2 09:20:26 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3317688",
abstract = "The big data phenomenon has gained much attention in
the wireless communications field. Addressing big data
is a challenging and time-demanding task that requires
a large computational infrastructure to ensure
successful data processing and analysis. In such a
context, data compression helps to reduce the amount of
data required to represent redundant information while
reliably preserving the original content as much as
possible. We here consider Compressed Sensing (CS)
theory for extracting critical information and
representing it with substantially reduced measurements
of the original data. For CS application, it is,
however, required to design a convenient sparsifying
basis or transform. In this work, a large amount of
bi-dimensional (2D) correlated signals are considered
for compression. The envisaged application is that of
data collection in large scale Wireless Sensor
Networks. We show that, using CS, it is possible to
recover a large amount of data from the collection of a
reduced number of sensors readings. In this way, CS use
makes it possible to recover large data sets with
acceptable accuracy as well as reduced global scale
cost. For sparsifying basis search, in addition to
conventional sparsity-inducing methods, we propose a
new transformation based on Linear Prediction Coding
(LPC) that effectively exploits correlation between
neighboring data. The steps of data aggregation using
CS include sparse compression basis design and then
decomposition matrix construction and recovery
algorithm application. Comparisons to the case of
one-dimensional (1D) reading and to conventional 2D
compression methods show the benefit from the better
exploitation of the correlation by herein envisaged 2D
processing. Simulation results on both synthetic and
real WSN data demonstrate that the proposed LPC
approach with 2D scenario realizes significant
reconstruction performance enhancement compared to
former conventional transformations.",
acknowledgement = ack-nhfb,
articleno = "29",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Kim:2019:IED,
author = "Jungwon Kim and Jeffrey S. Vetter",
title = "Implementing efficient data compression and encryption
in a persistent key--value store for {HPC}",
journal = j-IJHPCA,
volume = "33",
number = "6",
pages = "1098--1112",
day = "1",
month = nov,
year = "2019",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342019847264",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 9 14:35:54 MDT 2019",
bibsource = "http://hpc.sagepub.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "https://journals.sagepub.com/doi/full/10.1177/1094342019847264",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "https://journals.sagepub.com/home/hpc",
}
@Article{Lavoue:2019:PET,
author = "Guillaume Lavoue and Michael Langer and Adrien
Peytavie and Pierre Poulin",
title = "A Psychophysical Evaluation of Texture Compression
Masking Effects",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "25",
number = "2",
pages = "1336--1346",
month = feb,
year = "2019",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2018.2805355",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Wed Jan 2 16:40:20 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
URL = "https://www.computer.org/csdl/trans/tg/2019/02/08292880-abs.html",
acknowledgement = ack-nhfb,
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Li:2019:IID,
author = "Rongjia Li and Chenhui Jin and Ruya Fan",
title = "Improved Integral Distinguishers on Compression
Function of {GOST R} Hash Function",
journal = j-COMP-J,
volume = "62",
number = "4",
pages = "535--544",
month = apr,
year = "2019",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxy123",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Apr 2 12:10:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://academic.oup.com/comjnl/article/62/4/535/5224765",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Moffat:2019:HC,
author = "Alistair Moffat",
title = "{Huffman} Coding",
journal = j-COMP-SURV,
volume = "52",
number = "4",
pages = "85:1--85:35",
month = sep,
year = "2019",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3342555",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3342555",
abstract = "Huffman's algorithm for computing minimum-redundancy
prefix-free codes has almost legendary status in the
computing disciplines. Its elegant blend of simplicity
and applicability has made it a favorite example in
algorithms courses, and as a result it is perhaps one
of the most commonly implemented algorithmic
techniques. This article presents a tutorial on Huffman
coding and surveys some of the developments that have
flowed as a consequence of Huffman's original
discovery, including details of code calculation and of
encoding and decoding operations. We also survey
related mechanisms, covering both arithmetic coding and
the recently developed asymmetric numeral systems
approach and briefly discuss other Huffman-coding
variants, including length-limited codes.",
acknowledgement = ack-nhfb,
articleno = "85",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Munoz-Perez:2019:EBS,
author = "Luis F. Mu{\~n}oz-P{\'e}rez and Jos{\'e} A. Guerrero
and Jorge E. Mac{\'\i}as-D{\'\i}az",
title = "Entropy-Based Selection of Cluster Representatives for
Document Image Compression",
journal = j-SIAM-J-IMAGING-SCI,
volume = "12",
number = "4",
pages = "1720--1738",
month = "????",
year = "2019",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/19M1243312",
ISSN = "1936-4954",
bibdate = "Thu May 28 11:09:25 MDT 2020",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2019",
}
@Article{Pavlovic:2019:DCP,
author = "Mirjana Pavlovic and Kai-Niklas Bastian and Hinnerk
Gildhoff and Anastasia Ailamaki",
title = "Dictionary Compression in Point Cloud Data
Management",
journal = j-TSAS,
volume = "5",
number = "1",
pages = "3:1--3:??",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3299770",
ISSN = "2374-0353",
bibdate = "Fri Dec 6 16:16:50 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tsas.bib",
URL = "https://dl.acm.org/citation.cfm?id=3299770",
abstract = "Nowadays, massive amounts of point cloud data can be
collected thanks to advances in data acquisition and
processing technologies such as dense image matching
and airborne LiDAR scanning. With the increase in
volume and precision, point cloud data offers a useful
source of information for natural-resource management,
urban planning, self-driving cars, and more. At the
same time, on the scale that point cloud data is
produced, management challenges are introduced: it is
important to achieve efficiency both in terms of
querying performance and space requirements.
Traditional file-based solutions to point cloud
management offer space efficiency, however, they cannot
scale to such massive data and provide the declarative
power of a DBMS. In this article, we propose a time-
and space-efficient solution to storing and managing
point cloud data in main memory column-store DBMS. Our
solution, Space-Filling Curve Dictionary-Based
Compression (SFC-DBC), employs dictionary-based
compression in the spatial data management domain and
enhances it with indexing capabilities by using
space-filling curves. SFC-DBC does so by constructing
the space-filling curve over a compressed, artificially
introduced dictionary space. Consequently, SFC-DBC
significantly optimizes query execution and yet does
not require additional storage resources, compared to
traditional dictionary-based compression. With respect
to space-filling-curve-based approaches, it minimizes
storage footprint and increases resilience to skew. As
a proof of concept, we develop and evaluate our
approach as a research prototype in the context of SAP
HANA. SFC-DBC outperforms other dictionary-based
compression schemes by up to 61\% in terms of space and
up to $ 9.4 \times $ in terms of query performance.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Spatial Algorithms and Systems
(TSAS)",
journal-URL = "http://dl.acm.org/pub.cfm?id=J1514",
}
@Article{Qiu:2019:DCR,
author = "Han Qiu and Gerard Memmi and Xuan Chen and Jian
Xiong",
title = "{DC} coefficient recovery for {JPEG} images in
ubiquitous communication systems",
journal = j-FUT-GEN-COMP-SYS,
volume = "96",
number = "??",
pages = "23--31",
month = jul,
year = "2019",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Oct 14 16:09:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1832942X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Resende:2019:BMI,
author = "Jo{\~a}o S. Resende and Patr{\'\i}cia R. Sousa and
Rolando Martins and Lu{\'\i}s Antunes",
title = "Breaking {MPC} implementations through compression",
journal = j-INT-J-INFO-SEC,
volume = "18",
number = "4",
pages = "505--518",
month = aug,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-018-0424-2",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Sat Jul 13 14:23:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://link.springer.com/article/10.1007/s10207-018-0424-2",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "multiparty computation (MPC) [a sub-field of
cryptography with the goal of creating methods for
parties to jointly compute a function over their inputs
while keeping those inputs private]",
}
@Article{Ryabko:2019:TUD,
author = "Boris Ryabko",
title = "Time-Universal Data Compression",
journal = j-ALGORITHMS-BASEL,
volume = "12",
number = "6",
month = jun,
year = "2019",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a12060116",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Thu May 28 08:40:45 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/12/6/116",
acknowledgement = ack-nhfb,
articleno = "116",
fjournal = "116",
journal-URL = "https://www.mdpi.com/",
pagecount = "??",
}
@Article{Sun:2019:CFP,
author = "Xiuwen Sun and Hao Li and Dan Zhao and Xingxing Lu and
Kaiyu Hou and Chengchen Hu",
title = "{COIN}: a fast packet inspection method over
compressed traffic",
journal = j-J-NETW-COMPUT-APPL,
volume = "127",
number = "??",
pages = "122--134",
day = "1",
month = feb,
year = "2019",
CODEN = "JNCAF3",
DOI = "https://doi.org/10.1016/j.jnca.2018.12.008",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Mon Oct 14 14:16:29 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804518303904",
acknowledgement = ack-nhfb,
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Tao:2019:OLC,
author = "D. Tao and S. Di and X. Liang and Z. Chen and F.
Cappello",
title = "Optimizing Lossy Compression Rate-Distortion from
Automatic Online Selection between {SZ} and {ZFP}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "8",
pages = "1857--1871",
month = aug,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2019.2894404",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Aug 30 06:09:58 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds",
keywords = "automatic online selection; automatic selection;
best-fit compressor; bestfit compressor; compression
quality; compression ratio; Compressors; data
compression; data distortion; data field; Data models;
data size; Distortion; floating point arithmetic;
floating-point arrays; high-performance computing;
high-performance computing applications; important
statistical quality metric; leading BSD; Lossy
compression; lossy compression rate-distortion;
low-overhead selection algorithm; Measurement; minimal
overhead; open-source library; potential bottlenecks;
Quantization (signal); rate distortion theory;
Rate-distortion; rate-distortion; scientific data;
signal-to-noise ratio; storage space; Transforms; ZFP",
}
@Article{Tao:2019:ZCF,
author = "Dingwen Tao and Sheng Di and Hanqi Guo and Zizhong
Chen and Franck Cappello",
title = "{Z-checker}: a framework for assessing lossy
compression of scientific data",
journal = j-IJHPCA,
volume = "33",
number = "2",
pages = "285--303",
day = "1",
month = mar,
year = "2019",
CODEN = "IHPCFL",
DOI = "https://doi.org/10.1177/1094342017737147",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Wed Oct 9 14:35:53 MDT 2019",
bibsource = "http://hpc.sagepub.com/;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijsa.bib",
URL = "https://journals.sagepub.com/doi/full/10.1177/1094342017737147",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Performance Computing
Applications",
journal-URL = "https://journals.sagepub.com/home/hpc",
}
@Article{Zanon:2019:FKC,
author = "G. H. M. Zanon and M. A. Simplicio and G. C. C. F.
Pereira and J. Doliskani and P. S. L. M. Barreto",
title = "Faster Key Compression for Isogeny-Based
Cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "5",
pages = "688--701",
month = may,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2018.2878829",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 11 09:46:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "decompression; Diffie-Hellman key exchange; Elliptic
curve cryptography; elliptic curve cryptography;
Elliptic curves; Generators; isogeny-based
cryptosystems; key compression; Libraries;
Pohlig-Hellman algorithm; Post-quantum cryptography;
post-quantum proposals; public-key compression; quantum
cryptography; Runtime; supersingular elliptic curves;
supersingular isogeny-based cryptography",
}
@Article{Zhang:2019:CCF,
author = "X. Zhang and Y. Lao",
title = "On the Construction of Composite Finite Fields for
Hardware Obfuscation",
journal = j-IEEE-TRANS-COMPUT,
volume = "68",
number = "9",
pages = "1353--1364",
month = sep,
year = "2019",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2901483",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Fri Aug 30 05:58:40 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "algorithmic modifications; architectural level;
circuit-level techniques; composite finite fields;
Composite finite fields; Computer architecture;
cryptography; Cryptography; cryptography algorithms;
data paths; Decoding; error correction codes;
error-correcting codes; error-correcting coding; Finite
element analysis; finite field arithmetic; finite field
constructions; Hardware; hardware obfuscation; hardware
obfuscation scheme; independent obfuscation key; Logic
gates; primitive element representations; Reed-Solomon
codes; Signal processing algorithms",
}
@Article{Zhang:2019:CCL,
author = "Jeff (Jun) Zhang and Parul Raj and Shuayb Zarar and
Amol Ambardekar and Siddharth Garg",
title = "{CompAct}: On-chip Compression of Activations for Low
Power Systolic Array Based {CNN} Acceleration",
journal = j-TECS,
volume = "18",
number = "5s",
pages = "47:1--47:??",
month = oct,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3358178",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Oct 17 18:16:44 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3358178",
abstract = "This paper addresses the design of systolic array (SA)
based convolutional neural network (CNN) accelerators
for mobile and embedded domains. On- and off-chip
memory accesses to the large activation inputs
(sometimes called feature maps) of CNN layers
contribute significantly to total energy consumption
for such accelerators; while prior has proposed
off-chip compression, activations are still stored
on-chip in uncompressed form, requiring either large
on-chip activation buffers or slow and energy-hungry
off-chip accesses. In this paper, we propose CompAct, a
new architecture that enables on-chip compression of
activations for SA based CNN accelerators. CompAct is
built around several key ideas. First, CompAct
identifies an SA schedule that has nearly regular
access patterns, enabling the use of a modified
run-length coding scheme (RLC). Second, CompAct
improves compression ratio of the RLC scheme using
Sparse-RLC in later CNN layers and Lossy-RLC in earlier
layers. Finally, CompAct proposes look-ahead snoozing
that operates synergistically with RLC to reduce the
leakage energy of activation buffers. Based on detailed
synthesis results, we show that CompAct enables up to
62\% reduction in activation buffer energy, and 34\%
reduction in total chip energy.",
acknowledgement = ack-nhfb,
articleno = "47",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840",
}
@Article{Zhou:2019:RBC,
author = "S. Zhou and Y. He and S. Xiang and K. Li and Y. Liu",
title = "Region-Based Compressive Networked Storage with Lazy
Encoding",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "30",
number = "6",
pages = "1390--1402",
month = jun,
year = "2019",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2018.2883550",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Fri Aug 30 06:09:58 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds",
keywords = "compressed sensing; compressive networked storage;
compressive networked storage solution; Compressive
sensing; compressive sensing theory; Correlation; CS
recovery; data accuracy; data compression; Data
dissemination; data storage; Decoding; dissemination
cost; distributed networked storage; Encoding;
encoding; global data field; inter-region correlation;
lazy-encoding algorithm; local data recovery; local
dissemination strategy; local region; Memory; mobile
radio; region-based reconstruction algorithm; sensor
network; sensor readings; Sparse matrices; Wireless
sensor networks; wireless sensor networks",
}
@Article{Anand:2020:CTE,
author = "Ashima Anand and Amit Kumar Singh and Zhihan Lv and
Guarav Bhatnagar",
title = "Compression-Then-Encryption-Based Secure Watermarking
Technique for Smart Healthcare System",
journal = j-IEEE-MULTIMEDIA,
volume = "27",
number = "4",
pages = "133--143",
year = "2020",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2020.2993269",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 27 16:42:50 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Araujo:2020:ECQ,
author = "Leonardo C. Araujo and Joao P. H. Sansao and Mario C.
S. Junior",
title = "Effects of Color Quantization on {JPEG} Compression",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "20",
number = "03",
pages = "??--??",
month = jul,
year = "2020",
DOI = "https://doi.org/10.1142/S0219467820500266",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Wed May 5 11:23:10 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467820500266",
abstract = "This paper analyzes the effects of color quantization
on standard JPEG compression. Optimized color palettes
were used to quantize natural images, using dithering
and chroma subsampling as optional. The resulting
variations on file size and quantitative quality
measures were analyzed. Preliminary results, using a
small image database, show that file size suffered an
average 20\% increase and a concomitant loss in quality
was perceived ( {\textminus} 6dB PSNR, {\textminus}
0.16 SSIM and {\textminus} 9.6 Butteraugli). Color
quantization present itself as an ineffective tool on
JPEG compression but if necessarily imposed, on high
quality compressed images, it might lead to a
negligible increase in data size and quality loss. In
addition dithering seems to always decrease JPEG
compression ratio.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Ballard:2020:TPC,
author = "Grey Ballard and Alicia Klinvex and Tamara G. Kolda",
title = "{TuckerMPI}: a Parallel {C++\slash MPI} Software
Package for Large-scale Data Compression via the
{Tucker} Tensor Decomposition",
journal = j-TOMS,
volume = "46",
number = "2",
pages = "13:1--13:31",
month = jun,
year = "2020",
CODEN = "ACMSCU",
DOI = "https://doi.org/10.1145/3378445",
ISSN = "0098-3500 (print), 1557-7295 (electronic)",
ISSN-L = "0098-3500",
bibdate = "Fri Jun 12 07:37:53 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib;
https://www.math.utah.edu/pub/tex/bib/toms.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3378445",
abstract = "Our goal is compression of massive-scale
grid-structured data, such as the multi-terabyte output
of a high-fidelity computational simulation. For such
data sets, we have developed a new software package
called TuckerMPI, a parallel C++/MPI software package
for compressing distributed data. The approach is based
on treating the data as a tensor, i.e., a
multidimensional array, and computing its truncated
Tucker decomposition, a higher-order analogue to the
truncated singular value decomposition of a matrix. The
result is a low-rank approximation of the original
tensor-structured data. Compression efficiency is
achieved by detecting latent global structure within
the data, which we contrast to most compression methods
that are focused on local structure. In this work, we
describe TuckerMPI, our implementation of the truncated
Tucker decomposition, including details of the data
distribution and in-memory layouts, the parallel and
serial implementations of the key kernels, and analysis
of the storage, communication, and computational costs.
We test the software on 4.5 and 6.7 terabyte data sets
distributed across 100 s of nodes (1,000 s of MPI
processes), achieving compression ratios between 100
and 200,000$ \times $, which equates to 99--99.999\%
compression (depending on the desired accuracy) in
substantially less time than it would take to even read
the same dataset from a parallel file system. Moreover,
we show that our method also allows for reconstruction
of partial or down-sampled data on a single node,
without a parallel computer so long as the
reconstructed portion is small enough to fit on a
single machine, e.g., in the instance of
reconstructing/visualizing a single down-sampled time
step or computing summary statistics. The code is
available at https://gitlab.com/tensors/TuckerMPI.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Mathematical Software (TOMS)",
journal-URL = "https://dl.acm.org/loi/toms",
}
@Article{Basavarajaiah:2020:SCD,
author = "Madhushree Basavarajaiah and Priyanka Sharma",
title = "Survey of Compressed Domain Video Summarization
Techniques",
journal = j-COMP-SURV,
volume = "52",
number = "6",
pages = "116:1--116:29",
month = jan,
year = "2020",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3355398",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Oct 29 09:52:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://dl.acm.org/ft_gateway.cfm?id=3355398",
abstract = "Video summarization is the method of extracting key
frames or clips from a video to generate a synopsis of
the content of the video. Generally, video is
compressed before storing or transmitting it in most of
the practical applications. Traditional techniques
require the videos to be decoded to summarize them,
which is a tedious job. Instead, compressed domain
video processing can be used for summarizing videos by
partially decoding them. A classification and analysis
of various summarization techniques are presented in
this article with special focus on compressed domain
techniques along with a discussion on
machine-learning-based techniques that can be applied
to summarize the videos.",
acknowledgement = ack-nhfb,
articleno = "116",
fjournal = "ACM Computing Surveys",
journal-URL = "https://dl.acm.org/loi/csur",
}
@Article{Berry:2020:IZP,
author = "C. J. Berry and D. Wolpert and B. Bell and A.
Jatkowski and J. Surprise and G. Strevig and J. Isakson
and O. Geva and B. Deskin and M. Cichanowski and G.
Biran and D. Hamid and C. Cavitt and G. Fredeman and D.
Chidambarrao and B. Bruen and M. Wood and S. Carey and
D. Turner and L. Sigal",
title = "{IBM z15}: Physical design improvements to
significantly increase content in the same technology",
journal = j-IBM-JRD,
volume = "64",
number = "5/6",
pages = "8:1--8:12",
year = "2020",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2020.3008099",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Aug 28 09:26:17 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Bille:2020:ESI,
author = "Philip Bille",
title = "Editorial: Special Issue on Data Compression
Algorithms and Their Applications",
journal = j-ALGORITHMS-BASEL,
volume = "13",
number = "1",
month = jan,
year = "2020",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a13010028",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Thu May 28 08:40:46 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/13/1/28",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "28",
journal-URL = "https://www.mdpi.com/",
pagecount = "??",
}
@Article{Bok:2020:PCS,
author = "Kyoungsoo Bok and Jieun Han and Jongtae Lim and Jaesoo
Yoo",
title = "Provenance compression scheme based on graph patterns
for large {RDF} documents",
journal = j-J-SUPERCOMPUTING,
volume = "76",
number = "8",
pages = "6376--6398",
month = aug,
year = "2020",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-02926-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:59 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/76/8;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Bruni:2020:FLD,
author = "Vittoria Bruni and Mariantonia Cotronei and Francesca
Pitolli",
title = "A family of level-dependent biorthogonal wavelet
filters for image compression",
journal = j-J-COMPUT-APPL-MATH,
volume = "367",
number = "??",
pages = "Article 112467",
day = "15",
month = mar,
year = "2020",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Wed May 13 06:58:30 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2020.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042719304704",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Byun:2020:CSM,
author = "Seokhyun Byun and Seunghyun Yoon and Kyomin Jung",
title = "Comparative studies on machine learning for
paralinguistic signal compression and classification",
journal = j-J-SUPERCOMPUTING,
volume = "76",
number = "10",
pages = "8357--8371",
month = oct,
year = "2020",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-020-03346-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri May 14 09:19:56 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "https://link.springer.com/article/10.1007/s11227-020-03346-3",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
online-date = "Published: 13 June 2020 Pages: 8357 - 8371",
}
@Article{Carpentieri:2020:CNG,
author = "Bruno Carpentieri",
title = "Compression of Next-Generation Sequencing Data and of
{DNA} Digital Files",
journal = j-ALGORITHMS-BASEL,
volume = "13",
number = "6",
month = jun,
year = "2020",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a13060151",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Tue Jun 30 11:54:22 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/13/6/151",
acknowledgement = ack-nhfb,
articleno = "151",
fjournal = "151",
journal-URL = "https://www.mdpi.com/",
pagecount = "??",
}
@Article{Chen:2020:SDC,
author = "Hsing-Chung Chen and Karisma Trinanda Putra and
Shian-Shyong Tseng and Chin-Ling Chen and Jerry
Chun-Wei Lin",
title = "A spatiotemporal data compression approach with low
transmission cost and high data fidelity for an air
quality monitoring system",
journal = j-FUT-GEN-COMP-SYS,
volume = "108",
number = "??",
pages = "488--500",
month = jul,
year = "2020",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2020.02.032",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jun 19 07:44:16 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19324197",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chen:2020:VLC,
author = "Tian Chen and Yongsheng Zuo and Xin An and Fuji Ren",
title = "A variable-length compatible compression scheme based
on tristate signals",
journal = j-J-SUPERCOMPUTING,
volume = "76",
number = "2",
pages = "1020--1033",
month = feb,
year = "2020",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-019-03071-6",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:54 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/76/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Cui:2020:DFR,
author = "Tingting Cui and Wei Wang and Meiqin Wang",
title = "Distinguisher on full-round compression function of
{GOST} {$R$}",
journal = j-INFO-PROC-LETT,
volume = "156",
number = "??",
pages = "Article 105902",
month = apr,
year = "2020",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2019.105902",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Mar 24 11:59:23 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019019301851",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Dunton:2020:PEM,
author = "Alec M. Dunton and Llu{\'\i}s Jofre and Gianluca
Iaccarino and Alireza Doostan",
title = "Pass-efficient methods for compression of
high-dimensional turbulent flow data",
journal = j-J-COMPUT-PHYS,
volume = "423",
number = "??",
pages = "Article 109704",
day = "15",
month = dec,
year = "2020",
CODEN = "JCTPAH",
DOI = "https://doi.org/10.1016/j.jcp.2020.109704",
ISSN = "0021-9991 (print), 1090-2716 (electronic)",
ISSN-L = "0021-9991",
bibdate = "Sat Mar 13 09:06:35 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputphys2020.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0021999120304782",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational Physics",
journal-URL = "http://www.sciencedirect.com/science/journal/00219991",
}
@Article{Fan:2020:ALC,
author = "Q. Fan and D. J. Lilja and S. S. Sapatnekar",
title = "Adaptive-Length Coding of Image Data for Low-Cost
Approximate Storage",
journal = j-IEEE-TRANS-COMPUT,
volume = "69",
number = "2",
pages = "239--252",
month = feb,
year = "2020",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2019.2946795",
ISSN = "2326-3814",
ISSN-L = "0018-9340",
bibdate = "Wed Jan 22 06:44:09 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "Adaptive-length coding; approximate storage; Discrete
cosine transforms; error-resilience; Huffman coding;
Image coding; Reliability; Resilience; Transform
coding",
}
@Article{Feischl:2020:SCE,
author = "Michael Feischl and Daniel Peterseim",
title = "Sparse Compression of Expected Solution Operators",
journal = j-SIAM-J-NUMER-ANAL,
volume = "58",
number = "6",
pages = "3144--3164",
month = "????",
year = "2020",
CODEN = "SJNAAM",
DOI = "https://doi.org/10.1137/20M132571X",
ISSN = "0036-1429 (print), 1095-7170 (electronic)",
ISSN-L = "0036-1429",
bibdate = "Tue Dec 29 07:27:39 MST 2020",
bibsource = "http://epubs.siam.org/http://epubs.siam.org/toc/sjnaam/58/6;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjnumeranal2020.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Numerical Analysis",
journal-URL = "http://epubs.siam.org/sinum",
onlinedate = "January 2020",
}
@Article{Ferragina:2020:PIF,
author = "Paolo Ferragina and Giorgio Vinciguerra",
title = "The {PGM-index}: a fully-dynamic compressed learned
index with provable worst-case bounds",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "13",
number = "8",
pages = "1162--1175",
month = apr,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.14778/3389133.3389135",
ISSN = "2150-8097",
bibdate = "Tue May 5 14:01:14 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
URL = "https://dl.acm.org/doi/abs/10.14778/3389133.3389135",
abstract = "We present the first learned index that supports
predecessor, range queries and updates within provably
efficient time and space bounds in the worst case. In
the (static) context of just predecessor and range
queries these bounds turn out to be optimal. \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "https://dl.acm.org/loi/pvldb",
}
@Article{Fox:2020:SAI,
author = "Alyson Fox and James Diffenderfer and Jeffrey
Hittinger and Geoffrey Sanders and Peter Lindstrom",
title = "Stability Analysis of Inline {ZFP} Compression for
Floating-Point Data in Iterative Methods",
journal = j-SIAM-J-SCI-COMP,
volume = "42",
number = "5",
pages = "A2701--A2730",
month = "????",
year = "2020",
CODEN = "SJOCE3",
DOI = "https://doi.org/10.1137/19M126904X",
ISSN = "1064-8275 (print), 1095-7197 (electronic)",
ISSN-L = "1064-8275",
bibdate = "Fri Mar 12 11:40:01 MST 2021",
bibsource = "http://epubs.siam.org/toc/sjoce3/42/5;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Scientific Computing",
journal-URL = "http://epubs.siam.org/sisc",
keywords = "data-type conversion; error bounds; floating-point
representation; iterative methods; lossy compression",
onlinedate = "January 2020",
}
@Article{Girishwaingankar:2020:PNB,
author = "Poorva Girishwaingankar and Sangeeta Milind Joshi",
title = "The {PHY-NGSC}-Based {ORT} Run Length Encoding Scheme
for Video Compression",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "20",
number = "02",
pages = "??--??",
month = apr,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467820500072",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Mon May 11 09:44:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467820500072",
abstract = "This paper proposes a compression algorithm using
octonary repetition tree (ORT) based on run length
encoding (RLE). Generally, RLE is one type of lossless
data compression method which has duplication problem
as a major issue due to the usage of code word or flag.
Hence, ORT is offered instead of using a flag or code
word to overcome this issue. This method gives better
performance by means of compression ratio, i.e.
99.75\%. But, the functioning of ORT is not good in
terms of compression speed. For that reason,
physical-next generation secure computing (PHY-NGSC) is
hybridized with ORT to raise the compression speed. It
uses an MPI-open MP programming paradigm on ORT to
improve the compression speed of encoder. The planned
work achieves multiple levels of parallelism within an
image such as MPI and OpenMP for parallelism across a
group of pictures level and slice level, respectively.
At the same time, wide range of data compression like
multimedia, executive files and documents are possible
in the proposed method. The performance of the proposed
work is compared with other methods like accordian RLE,
context adaptive variable length coding (CAVLC) and
context-based arithmetic coding (CBAC) through the
implementation in Matlab working platform.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Hameed:2020:LCE,
author = "Mustafa Emad Hameed and Masrullizam Mat Ibrahim and
Nurulfajar Abd Manap and Ali A. Mohammed",
title = "A lossless compression and encryption mechanism for
remote monitoring of {ECG} data using {Huffman} coding
and {CBC--AES}",
journal = j-FUT-GEN-COMP-SYS,
volume = "111",
number = "??",
pages = "829--840",
month = oct,
year = "2020",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.10.010",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jun 19 07:44:21 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19313950",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Han:2020:ADL,
author = "R. Han and C. H. Liu and S. Li and S. Wen and X. Liu",
title = "Accelerating Deep Learning Systems via Critical Set
Identification and Model Compression",
journal = j-IEEE-TRANS-COMPUT,
volume = "69",
number = "7",
pages = "1059--1070",
year = "2020",
CODEN = "ITCOB4",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jul 23 16:03:24 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hsieh:2020:WBQ,
author = "Jui-Hung Hsieh and King-Chu Hung and Je-Hung Liu and
Tsung-Ching Wu",
title = "Wavelet-Based Quality-Constrained {ECG} Data
Compression System Without Decoding Process",
journal = j-IEEE-MULTIMEDIA,
volume = "27",
number = "2",
pages = "33--45",
year = "2020",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2020.2983690",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 27 16:42:50 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Hu:2020:ATL,
author = "Xinjue Hu and Jingming Shan and Yu Liu and Lin Zhang
and Shervin Shirmohammadi",
title = "An Adaptive Two-Layer Light Field Compression Scheme
Using {GNN}-Based Reconstruction",
journal = j-TOMM,
volume = "16",
number = "2s",
pages = "72:1--72:23",
month = jul,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3395620",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sun Jul 19 08:56:56 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3395620",
abstract = "As a new form of volumetric media, Light Field (LF)
can provide users with a true six degrees of freedom
immersive experience because LF captures the scene with
photo-realism, including aperture-limited changes in
viewpoint. But uncompressed LF data is too large for
network transmission, which is the reason why LF
compression has become an important research topic. One
of the more recent approaches for LF compression is to
reduce the angular resolution of the input LF during
compression and to use LF reconstruction to recover the
discarded viewpoints during decompression. Following
this approach, we propose a new LF reconstruction
algorithm based on Graph Neural Networks; we show that
it can achieve higher compression and better quality
compared to existing reconstruction methods, although
suffering from the same problem as those methods ---
the inability to deal effectively with high-frequency
image components. To solve this problem, we propose an
adaptive two-layer compression architecture that
separates high-frequency and low-frequency components
and compresses each with a different strategy so that
the performance can become robust and
controllable. Experiments with multiple datasets show
that our proposed scheme is capable of providing a
decompression quality of above 40 dB, and can
significantly improve compression efficiency compared
with similar LF reconstruction schemes.",
acknowledgement = ack-nhfb,
articleno = "72",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "https://dl.acm.org/loi/tomm",
}
@Article{Jia:2020:SED,
author = "Yichen Jia and Zili Shao and Feng Chen",
title = "{SlimCache}: an Efficient Data Compression Scheme for
Flash-based Key-value Caching",
journal = j-TOS,
volume = "16",
number = "2",
pages = "14:1--14:34",
month = jun,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3383124",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Sun Jun 14 08:20:04 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3383124",
abstract = "Flash-based key-value caching is becoming popular in
data centers for providing high-speed key-value
services. These systems adopt slab-based space
management on flash and provide a low-cost solution for
key-value caching. However, optimizing cache efficiency
for flash-based key-value cache systems is highly
challenging, due to the huge number of key-value items
and the unique technical constraints of flash devices.
In this article, we present a dynamic on-line
compression scheme, called SlimCache, to improve the
cache hit ratio by virtually expanding the usable cache
space through data compression. We have investigated
the effect of compression granularity to achieve a
balance between compression ratio and speed, and we
leveraged the unique workload characteristics in
key-value systems to efficiently identify and separate
hot and cold data. To dynamically adapt to workload
changes during runtime, we have designed an adaptive
hot/cold area partitioning method based on a cost
model. To avoid unnecessary compression, SlimCache also
estimates data compressibility to determine whether the
data are suitable for compression or not. We have
implemented a prototype based on Twitter's Fatcache.
Our experimental results show that SlimCache can
accommodate more key-value items in flash by up to
223.4\%, effectively increasing throughput and reducing
average latency by up to 380.1\% and 80.7\%,
respectively.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Storage",
journal-URL = "https://dl.acm.org/loi/tos",
}
@Article{Jiang:2020:PAD,
author = "Hao Jiang and Chunwei Liu and Qi Jin and John
Paparrizos and Aaron J. Elmore",
title = "{PIDS}: attribute decomposition for improved
compression and query performance in columnar storage",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "13",
number = "6",
pages = "925--938",
month = feb,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.14778/3380750.3380761",
ISSN = "2150-8097",
bibdate = "Thu Apr 2 10:51:28 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
URL = "https://dl.acm.org/doi/abs/10.14778/3380750.3380761",
abstract = "We propose PIDS, Pattern Inference Decomposed Storage,
an innovative storage method for decomposing string
attributes in columnar stores. Using an unsupervised
approach, PIDS identifies common patterns in string
attributes from relational databases, and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "https://dl.acm.org/loi/pvldb",
}
@Article{Joseph:2020:PAN,
author = "V. Joseph and G. L. Gopalakrishnan and S. Muralidharan
and M. Garland and A. Garg",
title = "A Programmable Approach to Neural Network
Compression",
journal = j-IEEE-MICRO,
volume = "40",
number = "5",
pages = "17--25",
year = "2020",
CODEN = "IEMIDZ",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Sep 10 11:06:01 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Klein:2020:DVD,
author = "M. Klein and A. Misra and B. Abali and P. Sethia and
S. Weishaupt and B. Giamei and M. Farrell and T. J.
Slegel",
title = "Design and verification of {DEFLATE} acceleration as
an architected instruction in {z15}",
journal = j-IBM-JRD,
volume = "64",
number = "5/6",
pages = "9:1--9:10",
year = "2020",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/JRD.2020.3008099",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Aug 28 09:26:17 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Article{Kosolobov:2020:LZL,
author = "Dmitry Kosolobov and Daniel Valenzuela and Simon J.
Puglisi",
title = "{Lempel--Ziv}-Like Parsing in Small Space",
journal = j-ALGORITHMICA,
volume = "82",
number = "11",
pages = "3195--3215",
month = nov,
year = "2020",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-020-00722-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
bibdate = "Thu May 13 21:01:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithmica.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://link.springer.com/article/10.1007/s00453-020-00722-6",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica",
journal-URL = "http://link.springer.com/journal/453",
online-date = "Published: 25 May 2020 Pages: 3195 - 3215",
}
@Article{Lasch:2020:FSS,
author = "Robert Lasch and Ismail Oukid and Kai-Uwe Sattler",
title = "Faster \& strong: string dictionary compression using
sampling and fast vectorized decompression",
journal = j-VLDB-J,
volume = "29",
number = "6",
pages = "1263--1285",
month = nov,
year = "2020",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-020-00620-x",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Thu May 13 17:41:40 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
URL = "https://link.springer.com/article/10.1007/s00778-020-00620-x",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
online-date = "Published: 20 July 2020 Pages: 1263 - 1285",
}
@Article{Lin:2020:KPS,
author = "Weiyao Lin and Xiaoyi He and Wenrui Dai and John See
and Tushar Shinde and Hongkai Xiong and Lingyu Duan",
title = "Key-Point Sequence Lossless Compression for
Intelligent Video Analysis",
journal = j-IEEE-MULTIMEDIA,
volume = "27",
number = "3",
pages = "12--22",
year = "2020",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2020.2990863",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 27 16:42:50 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
journal-URL = "http://www.computer.org/multimedia/",
}
@Article{Luo:2020:STS,
author = "Guoliang Luo and Zhigang Deng and Xin Zhao and
Xiaogang Jin and Wei Zeng and Wenqiang Xie and Hyewon
Seo",
title = "Spatio-temporal Segmentation Based Adaptive
Compression of Dynamic Mesh Sequences",
journal = j-TOMM,
volume = "16",
number = "1",
pages = "14:1--14:24",
month = apr,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377475",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Mon Apr 6 09:23:01 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3377475",
abstract = "With the recent advances in data acquisition
techniques, the compression of various dynamic mesh
sequence data has become an important topic in the
computer graphics community. In this article, we
present a new spatio-temporal segmentation-based
\ldots{}",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "https://dl.acm.org/loi/tomm",
}
@Article{Mahammad:2020:PAD,
author = "Farooq Sunar Mahammad and V. Madhu Viswanatham",
title = "Performance analysis of data compression algorithms
for heterogeneous architecture through parallel
approach",
journal = j-J-SUPERCOMPUTING,
volume = "76",
number = "4",
pages = "2275--2288",
month = apr,
year = "2020",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2478-3",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Sat Jul 25 07:17:56 MDT 2020",
bibsource = "http://link.springer.com/journal/11227/76/4;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Mallikarachchi:2020:DCR,
author = "Thanuja Mallikarachchi and Dumidu Talagala and
Hemantha Kodikara Arachchi and Chaminda Hewage and Anil
Fernando",
title = "A Decoding-Complexity and Rate-Controlled Video-Coding
Algorithm for {HEVC}",
journal = j-FUTURE-INTERNET,
volume = "12",
number = "7",
pages = "120",
day = "16",
month = jul,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi12070120",
ISSN = "1999-5903",
bibdate = "Fri Jul 24 13:38:26 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/12/7/120",
abstract = "Video playback on mobile consumer electronic (CE)
devices is plagued by fluctuations in the network
bandwidth and by limitations in processing and energy
availability at the individual devices. Seen as a
potential solution, the state-of-the-art adaptive
streaming mechanisms address the first aspect, yet the
efficient control of the decoding-complexity and the
energy use when decoding the video remain unaddressed.
The quality of experience (QoE) of the end-users'
experiences, however, depends on the capability to
adapt the bit streams to both these constraints (i.e.,
network bandwidth and device's energy availability). As
a solution, this paper proposes an encoding framework
that is capable of generating video bit streams with
arbitrary bit rates and decoding-complexity levels
using a decoding-complexity--rate--distortion model.
The proposed algorithm allocates rate and
decoding-complexity levels across frames and coding
tree units (CTUs) and adaptively derives the CTU-level
coding parameters to achieve their imposed targets with
minimal distortion. The experimental results reveal
that the proposed algorithm can achieve the target bit
rate and the decoding-complexity with 0.4\% and 1.78\%
average errors, respectively, for multiple bit rate and
decoding-complexity levels. The proposed algorithm also
demonstrates a stable frame-wise rate and
decoding-complexity control capability when achieving a
decoding-complexity reduction of 10.11 (\%/dB). The
resultant decoding-complexity reduction translates into
an overall energy-consumption reduction of up to 10.52
(\%/dB) for a 1 dB peak signal-to-noise ratio (PSNR)
quality loss compared to the HM 16.0 encoded bit
streams.",
acknowledgement = ack-nhfb,
journal-URL = "https://www.mdpi.com/1999-5903/",
remark = "Special Issue Multimedia Quality of Experience (QoE):
Current Status and Future Direction.",
}
@Article{Mansouri:2020:NLD,
author = "Deloula Mansouri and Xiaohui Yuan and Abdeldjalil
Saidani",
title = "A New Lossless {DNA} Compression Algorithm Based on A
Single-Block Encoding Scheme",
journal = j-ALGORITHMS-BASEL,
volume = "13",
number = "4",
month = apr,
year = "2020",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a13040099",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Thu May 28 08:40:47 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/13/4/99",
acknowledgement = ack-nhfb,
articleno = "99",
fjournal = "99",
journal-URL = "https://www.mdpi.com/",
pagecount = "??",
}
@Article{Newman:2020:NTP,
author = "Elizabeth Newman and Misha E. Kilmer",
title = "Nonnegative Tensor Patch Dictionary Approaches for
Image Compression and Deblurring Applications",
journal = j-SIAM-J-IMAGING-SCI,
volume = "13",
number = "3",
pages = "1084--1112",
month = "????",
year = "2020",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/19M1297026",
ISSN = "1936-4954",
bibdate = "Fri Mar 12 10:29:45 MST 2021",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2020",
}
@Article{Niemi:2020:BWP,
author = "Arto Niemi and Jukka Teuhola",
title = "{Burrows--Wheeler} post-transformation with effective
clustering and interpolative coding",
journal = j-SPE,
volume = "50",
number = "9",
pages = "1858--1874",
month = sep,
year = "2020",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.2873",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Fri Aug 14 11:05:24 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/spe.bib",
acknowledgement = ack-nhfb,
ajournal = "Softw. Pract. Exp.",
fjournal = "Software --- Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "29 June 2020",
}
@Article{Raja:2020:WBI,
author = "S. P. Raja",
title = "Wavelet-Based Image Compression Encoding Techniques
--- A Complete Performance Analysis",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "20",
number = "02",
pages = "??--??",
month = apr,
year = "2020",
DOI = "https://doi.org/10.1142/S0219467820500084",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Mon May 11 09:44:18 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467820500084",
abstract = "This paper presents a complete analysis of
wavelet-based image compression encoding techniques.
The techniques involved in this paper are embedded
zerotree wavelet (EZW), set partitioning in
hierarchical trees (SPIHT), wavelet difference
reduction (WDR), adaptively scanned wavelet difference
reduction (ASWDR), set partitioned embedded block coder
(SPECK), compression with reversible embedded wavelet
(CREW) and spatial orientation tree wavelet (STW).
Experiments are done by varying level of the
decomposition, bits per pixel and compression ratio.
The evaluation is done by taking parameters like peak
signal to noise ratio (PSNR), mean square error (MSE),
image quality index (IQI) and structural similarity
index (SSIM), average difference (AD), normalized
cross-correlation (NK), structural content (SC),
maximum difference (MD), Laplacian mean squared error
(LMSE) and normalized absolute error (NAE).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Seo:2020:EGS,
author = "Hojin Seo and Kisung Park and Young-Koo Lee",
title = "An effective graph summarization and compression
technique for a large-scaled graph",
journal = j-J-SUPERCOMPUTING,
volume = "76",
number = "10",
pages = "7906--7920",
month = oct,
year = "2020",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-018-2245-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Fri May 14 09:19:56 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "https://link.springer.com/article/10.1007/s11227-018-2245-5",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
online-date = "Published: 15 January 2018 Pages: 7906 - 7920",
}
@Article{Taddei:2020:RMM,
author = "Tommaso Taddei",
title = "A Registration Method for Model Order Reduction: Data
Compression and Geometry Reduction",
journal = j-SIAM-J-SCI-COMP,
volume = "42",
number = "2",
pages = "A997--A1027",
month = "????",
year = "2020",
CODEN = "SJOCE3",
DOI = "https://doi.org/10.1137/19M1271270",
ISSN = "1064-8275 (print), 1095-7197 (electronic)",
ISSN-L = "1064-8275",
bibdate = "Thu May 28 12:20:36 MDT 2020",
bibsource = "http://epubs.siam.org/toc/sjoce3/42/2;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Scientific Computing",
journal-URL = "http://epubs.siam.org/sisc",
onlinedate = "January 2020",
}
@Article{Tschumperle:2020:RSC,
author = "David Tschumperl{\'e} and Christine Porquet and Amal
Mahboubi",
title = "Reconstruction of Smooth {$3$D} Color Functions from
Keypoints: Application to Lossy Compression and
Exemplar-Based Generation of Color {LUTs}",
journal = j-SIAM-J-IMAGING-SCI,
volume = "13",
number = "3",
pages = "1511--1535",
month = "????",
year = "2020",
CODEN = "SJISBI",
DOI = "https://doi.org/10.1137/19M1306798",
ISSN = "1936-4954",
bibdate = "Fri Mar 12 10:29:45 MST 2021",
bibsource = "http://epubs.siam.org/SIIMS/siims_toc.html;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjimagingsci.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Imaging Sciences",
journal-URL = "http://epubs.siam.org/siims",
onlinedate = "January 2020",
}
@Article{Tu:2020:RBS,
author = "Weiping Tu and Yuhong Yang and Bo Du and Wanzhao Yang
and Xiong Zhang and Jiaxi Zheng",
title = "{RNN}-based signal classification for hybrid audio
data compression",
journal = j-COMPUTING,
volume = "102",
number = "3",
pages = "813--827",
month = mar,
year = "2020",
CODEN = "CMPTA2",
DOI = "https://doi.org/10.1007/s00607-019-00713-8",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Tue May 12 18:02:15 MDT 2020",
bibsource = "http://link.springer.com/journal/607/102/3;
https://www.math.utah.edu/pub/tex/bib/computing.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
fjournal = "Computing",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Wang:2020:CRM,
author = "J. Wang and T. Liu and Q. Liu and X. He and H. Luo and
W. He",
title = "Compression Ratio Modeling and Estimation across Error
Bounds for Lossy Compression",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "31",
number = "7",
pages = "1621--1635",
month = jul,
year = "2020",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2019.2938503",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Mar 19 11:19:41 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
keywords = "Compressors; Computational modeling; Data models; data
reduction; Estimation; High-performance computing;
lossy compression; Market research; Measurement;
performance modeling; Predictive models",
}
@Article{Yamagiwa:2020:SBL,
author = "Shinichi Yamagiwa and Eisaku Hayakawa and Koichi
Marumo",
title = "Stream-Based Lossless Data Compression Applying
Adaptive Entropy Coding for Hardware-Based
Implementation",
journal = j-ALGORITHMS-BASEL,
volume = "13",
number = "7",
month = jul,
year = "2020",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a13070159",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri Jul 24 13:34:15 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/algorithms.bib",
URL = "https://www.mdpi.com/1999-4893/13/7/159",
acknowledgement = ack-nhfb,
articleno = "159",
fjournal = "159",
journal-URL = "https://www.mdpi.com/",
pagecount = "??",
}
@Article{Yu:2020:OUR,
author = "Heejung Yu and Taejoon Kim",
title = "Optimization of uplink rate and fronthaul compression
in cloud radio access networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "102",
number = "??",
pages = "465--471",
month = jan,
year = "2020",
CODEN = "FGSEVI",
DOI = "https://doi.org/10.1016/j.future.2019.08.019",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Mon Feb 10 12:55:04 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18318867",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Zhang:2020:IRPb,
author = "Y. Zhang and Y. Yuan and D. Feng and C. Wang and X. Wu
and L. Yan and D. Pan and S. Wang",
title = "Improving Restore Performance for In-Line Backup
System Combining Deduplication and Delta Compression",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "31",
number = "10",
pages = "2302--2314",
year = "2020",
CODEN = "ITDSEO",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Sat Aug 15 14:52:38 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}
@Article{Zheng:2020:SDR,
author = "Qing Zheng and Charles D. Cranor and Ankush Jain and
Gregory R. Ganger and Garth A. Gibson and George
Amvrosiadis and Bradley W. Settlemyer and Gary Grider",
title = "Streaming Data Reorganization at Scale with {DeltaFS}
Indexed Massive Directories",
journal = j-TOS,
volume = "16",
number = "4",
pages = "23:1--23:31",
month = nov,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3415581",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Fri Feb 5 11:10:27 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
URL = "https://dl.acm.org/doi/10.1145/3415581",
abstract = "Complex storage stacks providing data compression,
indexing, and analytics help leverage the massive
amounts of data generated today to derive insights. It
is challenging to perform this computation, however,
while fully utilizing the underlying storage \ldots{}",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Storage",
journal-URL = "https://dl.acm.org/loi/tos",
}
@Article{Zou:2020:POR,
author = "X. Zou and T. Lu and W. Xia and X. Wang and W. Zhang
and H. Zhang and S. Di and D. Tao and F. Cappello",
title = "Performance Optimization for Relative-Error-Bounded
Lossy Compression on Scientific Data",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "31",
number = "7",
pages = "1665--1680",
month = jul,
year = "2020",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2020.2972548",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Mar 19 11:19:41 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
keywords = "Acceleration; compression rate; Compressors; Data
models; Decoding; Distributed databases; Error
correction; high-performance computing; Lossy
compression; Quantization (signal); scientific data",
}
@Article{Akrour:2021:FHI,
author = "Leila Akrour and Soltane Ameur and Mourad Lahdir and
R{\'e}gis Fournier and Amine Nait Ali",
title = "Fast Hyperspectral Image Encoder Based on Supervised
Multimodal Scheme",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "21",
number = "01",
pages = "??--??",
month = jan,
year = "2021",
DOI = "https://doi.org/10.1142/S0219467821500078",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Wed May 5 11:23:12 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467821500078",
abstract = "Many compression methods, lossy or lossless, were
developed for 3D hyperspectral images, and various
standards have emerged and applied to these amounts of
data in order to achieve the best rate-distortion
performance. However, high-dimensional data volume of
hyperspectal images is problematic for compression and
decompression time. Nowadays, fast compression and
especially fast decompression algorithms are of primary
importance in image data applications. In this case, we
present a lossy hyperspectral image compression based
on supervised multimodal scheme in order to improve the
compression results. The supervised multimodal method
is used to reduce the amount of data before their
compression with the 3D-SPIHT encoder based on 3D
wavelet transform. The performance of the Supervised
Multimodal Compression (SMC-3D-SPIHT encoder) has been
evaluated on AVIRIS hyperspectral images. Experimental
results indicate that the proposed algorithm provides
very promising performance at low bit-rates while
reducing the encoding/decoding time.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Arroyuelo:2021:EPL,
author = "Diego Arroyuelo and Rodrigo C{\'a}novas and Johannes
Fischer and Dominik K{\"o}ppl and Marvin L{\"o}bel and
Gonzalo Navarro and Rajeev Raman",
title = "Engineering Practical {Lempel--Ziv} Tries",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "26",
number = "1",
pages = "14:1--14:47",
month = dec,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3481638",
ISSN = "1084-6654",
ISSN-L = "1084-6654",
bibdate = "Tue Nov 9 10:03:24 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/jea.bib",
URL = "https://dl.acm.org/doi/10.1145/3481638",
abstract = "The Lempel--Ziv 78 (LZ78) and Lempel--Ziv--Welch (LZW)
text factorizations are popular, not only for bare
compression but also for building compressed data
structures on top of them. Their regular factor
structure makes them computable within space bounded by
the compressed output size. In this article, we carry
out the first thorough study of low-memory LZ78 and LZW
text factorization algorithms, introducing more
efficient alternatives to the classical methods, as
well as new techniques that can run within less memory
space than the necessary to hold the compressed file.
Our results build on hash-based representations of
tries that may have independent interest.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "Journal of Experimental Algorithmics (JEA)",
journal-URL = "https://dl.acm.org/loi/jea",
}
@Article{Chang:2021:TLR,
author = "Chin-Chen Chang and Jui-Feng Chang and Wei-Jiun Kao
and Ji-Hwei Horng",
title = "Two-Layer Reversible Data Hiding for {VQ}-Compressed
Images Based on {De}-Clustering and Indicator-Free
Search-Order Coding",
journal = j-FUTURE-INTERNET,
volume = "13",
number = "8",
pages = "215",
day = "20",
month = aug,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.3390/fi13080215",
ISSN = "1999-5903",
bibdate = "Thu Aug 26 10:44:38 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/future-internet.bib",
URL = "https://www.mdpi.com/1999-5903/13/8/215",
abstract = "During transmission of digital images, secret messages
can be embedded using data hiding techniques. Such
techniques can transfer private secrets without drawing
the attention of eavesdroppers. To reduce the amount of
transmitted data, image compression methods are widely
applied. Hiding secret data in compressed images is a
hot issue recently. In this paper, we apply the
de-clustering concept and the indicator-free
search-order coding (IFSOC) technique to hide
information into vector quantization (VQ) compressed
images. Experimental results show that the proposed
two-layer reversible data hiding scheme for
IFSOC-encoded VQ index table can hide a large amount of
secret data among state-of-the-art methods with a
relatively lower bit rate and high security.",
acknowledgement = ack-nhfb,
journal-URL = "https://www.mdpi.com/1999-5903/",
}
@Article{Dua:2021:PLH,
author = "Yaman Dua and Vinod Kumar and Ravi Shankar Singh",
title = "Parallel lossless {HSI} compression based on {RLS}
filter",
journal = j-J-PAR-DIST-COMP,
volume = "150",
number = "??",
pages = "60--68",
month = apr,
year = "2021",
CODEN = "JPDCER",
DOI = "https://doi.org/10.1016/j.jpdc.2020.12.004",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Wed May 26 16:11:05 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0743731520304202",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Ehrlacher:2021:AHS,
author = "Virginie Ehrlacher and Laura Grigori and Damiano
Lombardi and Hao Song",
title = "Adaptive Hierarchical Subtensor Partitioning for
Tensor Compression",
journal = j-SIAM-J-SCI-COMP,
volume = "43",
number = "1",
pages = "A139--A163",
month = "????",
year = "2021",
CODEN = "SJOCE3",
DOI = "https://doi.org/10.1137/19M128689X",
ISSN = "1064-8275 (print), 1095-7197 (electronic)",
ISSN-L = "1064-8275",
bibdate = "Fri Mar 12 11:40:06 MST 2021",
bibsource = "http://epubs.siam.org/toc/sjoce3/43/1;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/siamjscicomput.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Scientific Computing",
journal-URL = "http://epubs.siam.org/sisc",
keywords = "compression; CP and Tucker formats; HOSVD; tensors",
onlinedate = "January 2021",
}
@Article{Fulber-Garcia:2021:LDF,
author = "Vinicius Fulber-Garcia and S{\'e}rgio Luis Sardi
Mergen",
title = "{LUISA}: Decoupling the Frequency Model From the
Context Model in Prediction-Based Compression",
journal = j-COMP-J,
volume = "64",
number = "9",
pages = "1437--1450",
month = sep,
year = "2021",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxaa074",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Sep 20 06:30:47 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://academic.oup.com/comjnl/article/64/9/1437/5868170",
abstract = "Prediction-based compression methods, like prediction
by partial matching, achieve a remarkable compression
ratio, especially for texts written in natural
language. However, they are not efficient in terms of
speed. Part of the problem concerns the usage of
dynamic entropy encoding, which is considerably slower
than the static alternatives. In this paper, we propose
a prediction-based compression method that decouples
the context model from the frequency model. The
separation allows static entropy encoding to be used
without a significant overhead in the meta-data
embedded in the compressed data. The result is a
reasonably efficient algorithm that is particularly
suited for small textual files, as the experiments
show. We also show it is relatively easy to built
strategies designed to handle specific cases, like the
compression of files whose symbols are only locally
frequent",
acknowledgement = ack-nhfb,
fjournal = "Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Guan:2021:CER,
author = "Hui Guan and Shaoshan Liu and Xiaolong Ma and Wei Niu
and Bin Ren and Xipeng Shen and Yanzhi Wang and Pu
Zhao",
title = "{CoCoPIE}: enabling real-time {AI} on off-the-shelf
mobile devices via compression-compilation co-design",
journal = j-CACM,
volume = "64",
number = "6",
pages = "62--68",
month = jun,
year = "2021",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/3418297",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue May 25 16:39:05 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://dl.acm.org/doi/10.1145/3418297",
abstract = "A new framework allows intelligence on mainstream end
devices without special hardware.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "https://dl.acm.org/loi/cacm",
}
@Article{Kim:2021:CCA,
author = "Jinkwon Kim and Seokin Hong and Jeongkyu Hong and
Soontae Kim",
title = "{CID}: Co-Architecting Instruction Cache and
Decompression System for Embedded Systems",
journal = j-IEEE-TRANS-COMPUT,
volume = "70",
number = "7",
pages = "1132--1145",
month = jul,
year = "2021",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2020.3010062",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Thu Jun 10 15:51:57 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Klein:2021:OSR,
author = "Shmuel T. Klein and Jakub Radoszewski and Tamar C.
Serebro and Dana Shapira",
title = "Optimal skeleton and reduced {Huffman} trees",
journal = j-THEOR-COMP-SCI,
volume = "852",
number = "??",
pages = "157--171",
day = "8",
month = jan,
year = "2021",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2020.11.025",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Mar 12 06:53:51 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2020.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397520306605",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
keywords = "data compression; Huffman tree; reduced skeleton;
skeleton tree",
}
@Article{Ko:2021:LCL,
author = "Yousun Ko and Alex Chadwick and Daniel Bates and
Robert Mullins",
title = "Lane Compression: a Lightweight Lossless Compression
Method for Machine Learning on Embedded Systems",
journal = j-TECS,
volume = "20",
number = "2",
pages = "16:1--16:26",
month = mar,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3431815",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Sat Mar 20 17:37:34 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
URL = "https://dl.acm.org/doi/10.1145/3431815",
abstract = "This article presents Lane Compression, a lightweight
lossless compression technique for machine learning
that is based on a detailed study of the statistical
properties of machine learning data. The proposed
technique profiles machine learning data \ldots{}",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "https://dl.acm.org/loi/tecs",
}
@Article{Koppl:2021:RLZ,
author = "Dominik K{\"o}ppl",
title = "Reversed {Lempel--Ziv} Factorization with Suffix
Trees",
journal = j-ALGORITHMS-BASEL,
volume = "14",
number = "6",
month = jun,
year = "2021",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a14060161",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Thu Jun 24 08:56:22 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://www.mdpi.com/1999-4893/14/6/161",
acknowledgement = ack-nhfb,
articleno = "161",
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pagecount = "??",
}
@Article{Lakshmi:2021:ECT,
author = "T. C. Subbu Lakshmi and D. Gnanadurai and I.
Muthulakshmi",
title = "Energy conserving texture-based adaptable compressive
sensing scheme for {WVSN}",
journal = j-CCPE,
volume = "33",
number = "3",
pages = "e5178:1--e5178:??",
day = "10",
month = feb,
year = "2021",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5178",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue May 18 08:31:20 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "07 February 2019",
}
@Article{Li:2021:RGL,
author = "Ke Li and Gang Wu",
title = "A randomized generalized low rank approximations of
matrices algorithm for high dimensionality reduction
and image compression",
journal = j-NUM-LIN-ALG-APPL,
volume = "28",
number = "1",
pages = "e2338:1--e2338:??",
month = jan,
year = "2021",
CODEN = "NLAAEM",
DOI = "https://doi.org/10.1002/nla.2338",
ISSN = "1070-5325 (print), 1099-1506 (electronic)",
ISSN-L = "1070-5325",
bibdate = "Tue Dec 29 08:59:24 MST 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/numlinaa.bib",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Numerical Linear Algebra with Applications",
journal-URL = "http://www3.interscience.wiley.com/cgi-bin/jhome/5957",
onlinedate = "30 September 2020",
}
@Article{Li:2021:TAE,
author = "Yang Li and Guangcan Liu and Yubao Sun and Qingshan
Liu and Shengyong Chen",
title = "{$3$D} Tensor Auto-encoder with Application to Video
Compression",
journal = j-TOMM,
volume = "17",
number = "2",
pages = "48:1--48:18",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3431768",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Jun 5 07:35:45 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tomccap.bib",
URL = "https://dl.acm.org/doi/10.1145/3431768",
abstract = "Auto-encoder has been widely used to compress
high-dimensional data such as the images and videos.
However, the traditional auto-encoder network needs to
store a large number of parameters. Namely, when the
input data is of dimension n, the number of \ldots{}",
acknowledgement = ack-nhfb,
articleno = "48",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "https://dl.acm.org/loi/tomm",
}
@Article{Li:2021:TRT,
author = "Tianyi Li and Lu Chen and Christian S. Jensen and
Torben Bach Pedersen",
title = "{TRACE}: real-time compression of streaming
trajectories in road networks",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "14",
number = "7",
pages = "1175--1187",
month = mar,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.14778/3450980.3450987",
ISSN = "2150-8097",
bibdate = "Tue Apr 13 13:43:39 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
URL = "https://dl.acm.org/doi/10.14778/3450980.3450987",
abstract = "The deployment of vehicle location services generates
increasingly massive vehicle trajectory data, which
incurs high storage and transmission costs. A range of
studies target offline compression to reduce the
storage cost. However, to enable online \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "https://dl.acm.org/loi/pvldb",
}
@Article{Lin:2021:EBL,
author = "Xuelian Lin and Shuai Ma and Jiahao Jiang and Yanchen
Hou and Tianyu Wo",
title = "Error Bounded Line Simplification Algorithms for
Trajectory Compression: an Experimental Evaluation",
journal = j-TODS,
volume = "46",
number = "3",
pages = "11:1--11:44",
month = sep,
year = "2021",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/3474373",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Sep 29 06:47:23 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "https://dl.acm.org/doi/10.1145/3474373",
abstract = "Nowadays, various sensors are collecting, storing, and
transmitting tremendous trajectory data, and it is well
known that the storage, network bandwidth, and
computing resources could be heavily wasted if raw
trajectory data is directly adopted. Line \ldots{}",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "https://dl.acm.org/loi/tods",
}
@Article{Liu:2021:DBF,
author = "Chunwei Liu and Hao Jiang and John Paparrizos and
Aaron J. Elmore",
title = "Decomposed bounded floats for fast compression and
queries",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "14",
number = "11",
pages = "2586--2598",
month = jul,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.14778/3476249.3476305",
ISSN = "2150-8097",
bibdate = "Fri Oct 29 18:05:40 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/vldbe.bib",
URL = "https://dl.acm.org/doi/10.14778/3476249.3476305",
abstract = "Modern data-intensive applications often generate
large amounts of low precision float data with a
limited range of values. Despite the prevalence of such
data, there is a lack of an effective solution to
ingest, store, and analyze bounded, low-precision,
numeric data. To address this gap, we propose Buff, a
new compression technique that uses a decomposed
columnar storage and encoding methods to provide
effective compression, fast ingestion, and high-speed
in-situ adaptive query operators with SIMD support.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
journal-URL = "https://dl.acm.org/loi/pvldb",
}
@Article{Liu:2021:LRD,
author = "Xinqian Liu and Jiadong Ren and Haitao He and Qian
Wang and Chen Song",
title = "Low-rate {DDoS} attacks detection method using data
compression and behavior divergence measurement",
journal = j-COMPUT-SECUR,
volume = "100",
number = "??",
pages = "Article 102107",
month = jan,
year = "2021",
CODEN = "CPSEDU",
DOI = "https://doi.org/10.1016/j.cose.2020.102107",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Wed Mar 10 08:25:08 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0167404820303801",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Oswald:2021:END,
author = "C. Oswald and E. Haritha and A. Akash Raja and B.
Sivaselvan",
title = "An efficient and novel data clustering and run length
encoding approach to image compression",
journal = j-CCPE,
volume = "33",
number = "10",
pages = "e6185:1--e6185:??",
day = "25",
month = may,
year = "2021",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.6185",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue May 18 08:31:25 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "25 January 2021",
}
@Article{Perry:2021:CCW,
author = "Tekla S. Perry",
title = "Conjurer of Compression: From {WinZips} to cat {GIFs},
{Jacob Ziv}'s algorithms have been making data
disappear and reappear for decades",
journal = j-IEEE-SPECTRUM,
volume = "58",
number = "5",
pages = "48--53",
month = may,
year = "2021",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2021.9423817",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Thu May 6 10:10:21 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2020.bib",
abstract = "Its cousin, lossy compression, is easier to
comprehend. Lossy algorithms are used to get music into
the popular MP3 format and turn a digital image into a
standard JPEG file. They do this by selectively
removing bits, taking what scientists know about the
way we see and hear to determine which bits we'd least
miss. But no one can make the case that the resulting
file is a perfect replica of the original.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}
@Article{Pibiri:2021:TII,
author = "Giulio Ermanno Pibiri and Rossano Venturini",
title = "Techniques for Inverted Index Compression",
journal = j-COMP-SURV,
volume = "53",
number = "6",
pages = "125:1--125:36",
month = feb,
year = "2021",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/3415148",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Fri Feb 5 10:42:27 MST 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "https://dl.acm.org/doi/10.1145/3415148",
abstract = "The data structure at the core of large-scale search
engines is the inverted index, which is essentially a
collection of sorted integer sequences called inverted
lists. Because of the many documents indexed by such
engines and stringent performance \ldots{}",
acknowledgement = ack-nhfb,
articleno = "125",
fjournal = "ACM Computing Surveys",
journal-URL = "https://dl.acm.org/loi/csur",
}
@Article{Rema:2021:EHC,
author = "N. R. Rema and P. Mythili",
title = "Extremely High Compression and Identification of
Fingerprint Images Using {SA4} Multiwavelet Transform",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "21",
number = "03",
pages = "??--??",
month = jul,
year = "2021",
DOI = "https://doi.org/10.1142/S0219467821500376",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Mon Jul 5 15:21:12 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467821500376",
abstract = "The aim of any fingerprint image compression technique
is to achieve a maximum amount of compression with an
adequate quality compressed image which is suitable for
fingerprint recognition. Currently available techniques
in the literature provide 100\% recognition only up to
a compression ratio of 180:1. The performance of any
identification technique inherently depends on the
techniques with which images are compressed. To improve
the identification accuracy while the images are highly
compressed, a multiwavelet-based identification
approach is proposed in this paper. Both decimated and
undecimated coefficients of SA4 (Symmetric
Antisymmetric) multiwavelet are used as features for
identification. A study is conducted on the
identification performance of the multiwavelet
transform with various sizes of images compressed using
both wavelets and multiwavelets for fair comparison. It
was noted that for images with size power of 2, the
decimated multiwavelet-based compression and
identification give a better performance compared to
other combinations of compression/identification
techniques whereas for images with size not a power of
2, the undecimated multiwavelet transform gives a
better performance compared to other techniques. A
100\% identification accuracy was achieved for the
images from NIST-4, NITGEN, FVC2002DB3_B, FVC2004DB2_B
and FVC2004DB1_B databases for compression ratios up to
520:1, 210:1, 445:1, 545:1 and 1995:1, respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{RodriguesCarvalho:2021:UCC,
author = "Daniel {Rodrigues Carvalho} and Andr{\'e} Seznec",
title = "Understanding Cache Compression",
journal = j-TACO,
volume = "18",
number = "3",
pages = "36:1--36:27",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457207",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Tue Jun 29 08:21:11 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
URL = "https://dl.acm.org/doi/10.1145/3457207",
abstract = "Hardware cache compression derives from
software-compression research; yet, its implementation
is not a straightforward translation, since it must
abide by multiple restrictions to comply with area,
power, and latency constraints. This study sheds light
on the challenges of adopting compression in cache
design ---from the shrinking of the data until its
physical placement. The goal of this article is not to
summarize proposals but to put in evidence the
solutions they employ to handle those challenges. An
in-depth description of the main characteristics of
multiple methods is provided, as well as criteria that
can be used as a basis for the assessment of such
schemes. It is expected that this article will ease the
understanding of decisions to be taken for the design
of compressed systems and provide directions for future
work.",
acknowledgement = ack-nhfb,
articleno = "36",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "https://dl.acm.org/loi/taco",
}
@Article{Sharma:2021:RIB,
author = "Urvashi Sharma and Meenakshi Sood and Emjee
Puthooran",
title = "Region of Interest-Based Coding Technique of Medical
Images Using Varying Grading of Compression",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "21",
number = "02",
pages = "??--??",
month = apr,
year = "2021",
DOI = "https://doi.org/10.1142/S0219467821500212",
ISSN = "0219-4678",
ISSN-L = "0219-4678",
bibdate = "Wed May 5 11:23:13 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ijig.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S0219467821500212",
abstract = "A region of interest (ROI)-based compression method
for medical image datasets is a requirement to maintain
the quality of the diagnostically important region of
the image. It is always a better option to compress the
diagnostic important region in a lossless manner and
the remaining portion of the image with a near-lossless
compression method to achieve high compression
efficiency without any compromise of quality. The
predictive ROI-based compression on volumetric CT
medical image is proposed in this paper;
resolution-independent gradient edge detection (RIGED)
and block adaptive arithmetic encoding (BAAE) are
employed to ROI part for prediction and encoding that
reduce the interpixel and coding redundancy. For the
non-ROI portion, RIGED with an optimal threshold value,
quantizer with optimal q -level and BAAE with optimal
block size are utilized for compression. The volumetric
8-bit and 16-bit standard CT image dataset is utilized
for the evaluation of the proposed technique, and
results are validated on real-time CT images collected
from the hospital. Performance of the proposed
technique in terms of BPP outperforms existing
techniques such as JPEG 2000, M-CALIC, JPEG-LS, CALIC
and JP3D by 20.31\%, 19.87\%, 17.77\%, 15.58\% and
13.66\%, respectively.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Stein:2021:LAA,
author = "Charles M. Stein and Dinei A. Rockenbach and Dalvan
Griebler and Massimo Torquati and Gabriele Mencagli and
Marco Danelutto and Luiz G. Fernandes",
title = "Latency-aware adaptive micro-batching techniques for
streamed data compression on graphics processing
units",
journal = j-CCPE,
volume = "33",
number = "11",
pages = "e5786:1--e5786:??",
day = "10",
month = jun,
year = "2021",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.5786",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Tue May 18 08:31:25 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Concurrency and Computation: Practice and Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "04 May 2020",
}
@Article{Tomei:2021:BSC,
author = "Matthew Tomei and Shomit Das and Mohammad Seyedzadeh
and Philip Bedoukian and Bradford Beckmann and Rakesh
Kumar and David Wood",
title = "Byte-Select Compression",
journal = j-TACO,
volume = "18",
number = "4",
pages = "49:1--49:27",
month = dec,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3462209",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Mon Oct 4 07:14:07 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/taco.bib",
URL = "https://dl.acm.org/doi/10.1145/3462209",
abstract = "Cache-block compression is a highly effective
technique for both reducing accesses to lower levels in
the memory hierarchy (cache compression) and minimizing
data transfers (link compression). While many effective
cache-block compression algorithms have been proposed,
the design of these algorithms is largely ad hoc and
manual and relies on human recognition of patterns. In
this article, we take an entirely different approach.
We introduce a class of ``byte-select'' compression
algorithms, as well as an automated methodology for
generating compression algorithms in this class. We
argue that, based on upper bounds within the class, the
study of this class of byte-select algorithms has
potential to yield algorithms with better performance
than existing cache-block compression algorithms. The
upper bound we establish on the compression ratio is 2X
that of any existing algorithm. We then offer a
generalized representation of a subset of byte-select
compression algorithms and search through the resulting
space guided by a set of training data traces. Using
this automated process, we find efficient and effective
algorithms for various hardware applications. We find
that the resulting algorithms exploit novel patterns
that can inform future algorithm designs. The generated
byte-select algorithms are evaluated against a separate
set of traces and evaluations show that Byte-Select has
a 23\% higher compression ratio on average. While no
previous algorithm performs best for all our data sets
which include CPU and GPU applications, our generated
algorithms do. Using an automated hardware generator
for these algorithms, we show that their decompression
and compression latency is one and two cycles
respectively, much lower than any existing algorithm
with a competitive compression ratio.",
acknowledgement = ack-nhfb,
articleno = "49",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "https://dl.acm.org/loi/taco",
}
@Article{Tsai:2021:LST,
author = "Po-An Tsai and Andres Sanchez and Christopher W.
Fletcher and Daniel Sanchez",
title = "Leaking Secrets Through Compressed Caches",
journal = j-IEEE-MICRO,
volume = "41",
number = "3",
pages = "27--33",
month = may # "\slash " # jun,
year = "2021",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2021.3069158",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu May 27 07:44:43 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Zhang:2021:TTA,
author = "Feng Zhang and Jidong Zhai and Xiaoyong Du",
title = "{TADOC}: Text analytics directly on compression",
journal = j-VLDB-J,
volume = "30",
number = "2",
pages = "163--188",
month = mar,
year = "2021",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-020-00636-3",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Thu May 13 17:41:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
URL = "https://link.springer.com/article/10.1007/s00778-020-00636-3",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
online-date = "Published: 19 September 2020 Pages: 163 - 188",
}
@Article{Pan:2022:EDA,
author = "Zaifeng Pan and Feng Zhang and Yanliang Zhou and
Jidong Zhai and Xipeng Shen and Onur Mutlu and Xiaoyong
Du",
title = "Exploring Data Analytics Without Decompression on
Embedded {GPU} Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "33",
number = "7",
pages = "1553--1568",
month = jul,
year = "2022",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2021.3119402",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Tue Nov 9 11:11:37 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}
@Article{Zhang:2022:PHP,
author = "Feng Zhang and Jidong Zhai and Xipeng Shen and Onur
Mutlu and Xiaoyong Du",
title = "{POCLib}: a High-Performance Framework for Enabling
Near Orthogonal Processing on Compression",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "33",
number = "2",
pages = "459--475",
month = feb,
year = "2022",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2021.3093234",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jul 29 06:48:53 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71",
}
@Misc{Anonymous:20xx:IDM,
author = "Anonymous",
title = "{Ingrid Daubechies}, mother of the wavelet",
howpublished = "Web story",
year = "20xx",
bibdate = "Mon Mar 12 11:26:30 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://focusonbelgium.be/en/Do%20you%20know%20these%20Belgians/ingrid-daubechies-mother-wavelet",
abstract = "Ingrid Daubechies is an internationally renowned
physicist and mathematician who thanks to her
pioneering research into `wavelets' has made an
essential contribution to various practical
applications such as the JPEG2000-standard for digital
images.",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
remark = "Undated Web story; most recent date mentioned is
2014.",
}
@Proceedings{ACM:1978:CRT,
editor = "ACM",
booktitle = "Conference record of the tenth annual {ACM} Symposium
on Theory of Computing: papers presented at the
Symposium, San Diego, California, May 1--3, 1978",
title = "Conference record of the tenth annual {ACM} Symposium
on Theory of Computing: papers presented at the
Symposium, San Diego, California, May 1--3, 1978",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "iv + 346",
year = "1978",
LCCN = "QA76.6.A13 1978",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/stoc1970.bib",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses; electronic
digital computers --- programming --- congresses",
xxISBN = "none",
}
@Proceedings{ACM:1979:CRE,
editor = "{ACM}",
booktitle = "Conference record of the eleventh annual {ACM}
Symposium on Theory of Computing: papers presented at
the Symposium, Atlanta, Georgia, April 30--May 2,
1979",
title = "Conference record of the eleventh annual {ACM}
Symposium on Theory of Computing: papers presented at
the Symposium, Atlanta, Georgia, April 30--May 2,
1979",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "vii + 368",
year = "1979",
LCCN = "QA75.5.A14 1979",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/stoc1970.bib",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses",
xxISBN = "none",
}
@Proceedings{Rosenfeld:1981:IM,
editor = "Azriel Rosenfeld",
booktitle = "Image Modeling",
title = "Image Modeling",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xiii + 445",
year = "1981",
ISBN = "0-12-597320-9",
ISBN-13 = "978-0-12-597320-5",
LCCN = "T385 .I45",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Papers originally presented at a workshop held in
Rosemont, Ill., Aug. 6--7, 1979.",
subject = "Computer graphics; Congresses; Image processing",
tableofcontents = "Mosaic models for textures / Narendra Ahuja \\
Image segmentation as an estimation problem / P. C.
Chen and T. Pavlidis \\
Toward a structural textural analyzer based on
statistical methods / Richard W. Conners and Charles A.
Harlow \\
Stochastic boundary estimation and object recognition /
D. B. Cooper \ldots{} [et al.] \\
Edge detection in textures / Larry S. Davis and Amar
Mitiche \\
Comparative analysis of line-drawing modeling schemes /
H. Freeman and J. A. Saghri \\
Statistical models for the image restoration problem /
B. Roy Frieden \\
Syntactic image modeling using stochastic tree grammars
/ K. S. Fu \\
Edge and region analysis for digital image data /
Robert M. Haralick \\
The use of Markov random fields as models of texture /
Martin Hassner and Jack Sklansky \\
On the noise in images produced by computed tomography
/ Gabor T. Herman \\
Mathematical models of graphics / Thomas S. Huang \\
Nonstationary statistical image models and their
application to image data compression / B. R. Hunt \\
Markov mesh models / Laveen N. Kanal \\
Univariate and multivariate random field models for
images / R. L. Kashyap \\
Image models in pattern theory / Donald E. McClure \\
A survey of geometrical probability in the plane, with
emphasis on stochastic image modeling / R. E. Miles \\
Stochastic image models generated by random
tessellations of the plane / J. W. Modestino, R. W.
Fries, and A. L. Vickers \\
Long crested wave models / Bruce Schachter \\
The Boolean model and random sets / J. Serra \\
Scene modeling, a structural basis for image
description / Jay M. Tenenbaum, Martin A. Fischler, and
Harry G. Barrow \\
Pictorial feature extraction and recognition via image
modeling / Julius T. Tou \\
Finding structure in co-occurrence matrices for texture
analysis / Steven W. Zucker and Demetri Terzopoulos",
}
@Proceedings{Zaniolo:1981:VLD,
editor = "Carlo Zaniolo and C. Delobel",
booktitle = "Very large data bases: proceedings: seventh
International Conference on Very Large Data Bases,
Cannes, France, September 9--11, 1981",
title = "Very large data bases: proceedings: seventh
International Conference on Very Large Data Bases,
Cannes, France, September 9--11, 1981",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 570",
year = "1981",
LCCN = "QA76.9.D3 I559 1981",
bibdate = "Sat Dec 7 13:05:35 MST 1996",
bibsource = "DBLP; http://dblp.uni-trier.de;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib",
note = "IEEE catalog no. 81CH1701-2.",
acknowledgement = ack-nhfb,
keywords = "data base management -- congresses",
}
@Proceedings{IEEE:1984:ASF,
editor = "{IEEE}",
booktitle = "25th annual Symposium on Foundations of Computer
Science, October 24--26, 1984, Singer Island, Florida",
title = "25th annual Symposium on Foundations of Computer
Science, October 24--26, 1984, Singer Island, Florida",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 518",
year = "1984",
CODEN = "ASFPDV",
ISBN = "0-8186-8591-3, 0-8186-0591-X (paperback),
0-8186-4591-1 (microfiche)",
ISBN-13 = "978-0-8186-8591-0, 978-0-8186-0591-8 (paperback),
978-0-8186-4591-4 (microfiche)",
ISSN = "0272-5428",
LCCN = "QA 76 S979 1984",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/focs1980.bib",
note = "IEEE catalog no. 84CH2085-9.",
acknowledgement = ack-nhfb,
keywords = "electronic data processing --- congresses; electronic
digital computers --- programming --- congresses;
machine theory --- congresses",
}
@Proceedings{Yu:1987:RDI,
editor = "C. T. Yu and C. J. Rijsbergen",
booktitle = "{Research and Development in Information Retrieval:
Proceedings of the Tenth Annual International {ACM}
{SIGIR} Conference}",
title = "{Research and Development in Information Retrieval:
Proceedings of the Tenth Annual International {ACM}
{SIGIR} Conference}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "vii + 317",
year = "1987",
ISBN = "0-89791-232-2",
ISBN-13 = "978-0-89791-232-7",
LCCN = "Z 699 A1 I58 1987",
bibdate = "Sat Nov 12 21:04:23 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
price = "US\$19",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:1988:DTS,
editor = "{IEEE}",
booktitle = "Digital technology --- spanning the universe: IEEE
International Conference on Communications '88:
Philadelphia, PA, June 12--15, 1988, Wyndham Franklin
Plaza Hotel: conference record",
title = "Digital technology --- spanning the universe: {IEEE}
International Conference on Communications '88:
Philadelphia, {PA}, June 12--15, 1988, Wyndham Franklin
Plaza Hotel: conference record",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xxx + 1783",
year = "1988",
ISBN = "????",
ISBN-13 = "????",
LCCN = "TK5101.A1 I34 1988",
bibdate = "Sat Apr 19 11:18:01 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE catalog number 88CH2538-7.",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:1988:PSN,
editor = "{IEEE}",
booktitle = "Proceedings, Supercomputing '88: November 14--18,
1988, Orlando, Florida",
title = "Proceedings, Supercomputing '88: November 14--18,
1988, Orlando, Florida",
volume = "1",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 458",
year = "1988",
ISBN = "0-8186-0882-X (v. 1; paper), 0-8186-8882-3 (v. 1;
case), 0-8186-4882-1 (v. 1: microfiche) 0-8186-8923-4
(v. 2), 0-8186-5923-X (v. 2: microfiche), 0-8186-8923-4
(v. 2: case)",
ISBN-13 = "978-0-8186-0882-7 (v. 1; paper), 978-0-8186-8882-9 (v.
1; case), 978-0-8186-4882-3 (v. 1: microfiche)
978-0-8186-8923-9 (v. 2), 978-0-8186-5923-2 (v. 2:
microfiche), 978-0-8186-8923-9 (v. 2: case)",
LCCN = "QA76.5 .S894 1988",
bibdate = "Fri Aug 23 13:34:23 1996",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Two volumes. Available from IEEE Service Center
(Catalog number 88CH2617-9), Piscataway, NJ, USA.",
acknowledgement = ack-nhfb,
classification = "C5220 (Computer architecture); C5440 (Multiprocessor
systems and techniques); C5470 (Performance evaluation
and testing); C5540 (Terminals and graphic displays);
C6150C (Compilers, interpreters and other processors);
C6150J (Operating systems)",
keywords = "algorithms; architecture; benchmarking; compiler
evaluation; compiler technology; computer graphic
equipment; data-flow systems; Horizon superconducting
system; mass storage systems; operating systems;
operating systems (computers); parallel algorithms;
parallel architectures; parallel machines; performance
evaluation; program compilers; program development;
supercomputer performance; supercomputing center
management; visualization",
}
@Proceedings{Wegman:1988:CSS,
editor = "Edward J. Wegman and Donald T. Gantz and John J.
Miller",
booktitle = "{Computing Science and Statistics Proceedings of the
20th Symposium on the Interface Fairfax, Virginia,
April 1988}",
title = "{Computing Science and Statistics Proceedings of the
20th Symposium on the Interface Fairfax, Virginia,
April 1988}",
publisher = "American Statistical Association",
address = "Alexandria, VA, USA",
pages = "xxxvii + 860",
year = "1988",
bibdate = "Wed Nov 12 16:41:33 2014",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/macsyma.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.dtic.mil/dtic/tr/fulltext/u2/a208838.pdf",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:1990:CSSa,
editor = "{USENIX}",
booktitle = "Computing Systems, Spring, 1990",
title = "Computing Systems, Spring, 1990",
publisher = pub-USENIX,
address = pub-USENIX:adr,
month = "Spring",
year = "1990",
bibdate = "Fri Oct 18 07:24:24 MDT 1996",
bibsource = "ftp://ftp.uu.net/library/bibliography;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/usenix1990.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:1991:PAS,
editor = "{IEEE}",
booktitle = "{Proceedings: 32nd annual Symposium on Foundations of
Computer Science, San Juan, Puerto Rico, October 1--4,
1991}",
title = "{Proceedings: 32nd annual Symposium on Foundations of
Computer Science, San Juan, Puerto Rico, October 1--4,
1991}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xi + 824",
year = "1991",
CODEN = "ASFPDV",
ISBN = "0-8186-2445-0",
ISBN-13 = "978-0-8186-2445-2",
ISSN = "0272-5428",
LCCN = "TK7885.A1 S92 1991",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/focs1990.bib",
note = "IEEE Catalog no. 91CH3062-7. Computer Society order
no. 2445.",
acknowledgement = ack-nhfb,
keywords = "electronic data processing --- congresses; machine
theory --- congresses; switching theory ---
congresses",
}
@Proceedings{Storer:1991:DDC,
editor = "James A. (James Andrew) Storer and J. H. (John H.)
Reif",
key = "DCC'91",
booktitle = "{DCC '91: Data Compression Conference: April 8--11,
1991, Cliff Lodge, Snowbird, Utah}",
title = "{DCC '91: Data Compression Conference: April 8--11,
1991, Cliff Lodge, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 478",
year = "1991",
DOI = "https://doi.org/10.1109/DCC.1991.213364",
ISBN = "0-8186-9202-2 (case), 0-8186-6202-6 (microfiche)",
ISBN-13 = "978-0-8186-9202-4 (case), 978-0-8186-6202-7
(microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 1990",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clas.caltech.edu:210/INNOPAC;
clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Press order number 2202. IEEE
catalog number 91TH0373-1.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=213364",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Storer:1992:DCC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'92",
booktitle = "{Data Compression Conference: DDC '92, March 24--27,
1992 at Cliff Lodge, Snowbird, Utah}",
title = "{Data Compression Conference: DDC '92, March 24--27,
1992 at Cliff Lodge, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 449",
year = "1992",
ISBN = "0-8186-2717-4",
ISBN-13 = "978-0-8186-2717-0",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE catalog number 91TH0436-6.",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (2nd: 1992: Snowbird,
Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "data compression (computer science); congresses;
information retrieval; data processing; coding; data
compression",
}
@Proceedings{Korfhage:1993:PSA,
editor = "Robert R. Korfhage and Edie M. Rasmussen and Peter
Willett and others",
booktitle = "{Proceedings of the sixteenth Annual International ACM
SIGIR Conference on Research and Development in
Information Retrieval: Pittsburgh, PA, USA, June
27--July 1, 1993}",
title = "{Proceedings of the sixteenth Annual International ACM
SIGIR Conference on Research and Development in
Information Retrieval: Pittsburgh, PA, USA, June
27--July 1, 1993}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xi + 361",
year = "1993",
ISBN = "0-89791-605-0",
ISBN-13 = "978-0-89791-605-9",
LCCN = "????",
bibdate = "Sat Jan 26 15:50:37 MST 2013",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
meetingname = "International ACMSIGIR Conference on Research and
Development in Information Retrieval (16th: 1993:
Pittsburgh, Pa.)",
remark = "``SIGIR '93''.. ``Special issue of the SIGIR
forum.''.. At head of title: ACM Press.",
subject = "Information retrieval; Congresses; Information storage
and retrieval systems; Information science",
}
@Proceedings{Meyer:1993:PWA,
editor = "Yves Meyer and Sylvie Roques",
booktitle = "Progress in Wavelet Analysis and Applications",
title = "Progress in Wavelet Analysis and Applications",
organization = "Observatoire Midi-Pyr{\'e}n{\'e}es de l'Universit{\'e}
Paul Sabatier",
publisher = pub-FRONTIERES,
address = pub-FRONTIERES:adr,
year = "1993",
ISBN = "2-86332-130-7",
ISBN-13 = "978-2-86332-130-0",
bibdate = "Fri Mar 31 11:11:22 MST 1995",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Proceedings of the International Conference ``Wavelets
and Applications,'' Toulouse, France, 8--13 June 1992",
}
@Proceedings{Storer:1993:DDC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'93",
booktitle = "{DCC '93: Data Compression Conference: [March
30--April 2, 1993, Snowbird, Utah: proceedings]}",
title = "{DCC '93: Data Compression Conference: [March
30--April 2, 1993, Snowbird, Utah: proceedings]}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 505",
year = "1993",
DOI = "https://doi.org/10.1109/DCC.1993.253151",
ISBN = "0-8186-3391-3 (microfiche), 0-8186-3392-1
(casebound)",
ISBN-13 = "978-0-8186-3391-1 (microfiche), 978-0-8186-3392-8
(casebound)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 1993",
bibdate = "Sat Jan 26 15:55:24 MST 2013",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/super.bib",
note = "IEEE Computer Society Press order number 3392-02. IEEE
catalog number 93TH0536-3.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=452",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (3rd: 1993: Snowbird,
Utah)",
remark = "Cover title: Data Compression Conference,
proceedings.",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
sponsor = "IEEE; Computer Society Technical Committee on Computer
Communications.",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{USENIX:1993:PWU,
editor = "{USENIX}",
booktitle = "Proceedings of the Winter 1993 {USENIX} Conference:
January 25--29, 1993, San Diego, California, {USA}",
title = "Proceedings of the Winter 1993 {USENIX} Conference:
January 25--29, 1993, San Diego, California, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "x + 530",
year = "1993",
ISBN = "1-880446-48-0",
ISBN-13 = "978-1-880446-48-5",
LCCN = "QA 76.76 O63 U84 1993",
bibdate = "Sun Feb 18 07:46:09 MST 1996",
bibsource = "ftp://ftp.uu.net/library/bibliography;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/usenix1990.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sd93/",
acknowledgement = ack-nhfb,
annote = "Spine title: USENIX San Diego conference proceedings,
winter 1993. Running title: 1993 winter USENIX, January
25--29, 1993, San Diego, CA.",
keywords = "Computer networks --- Congresses; Operating systems
(Computers) --- Congresses; Programming (Electronic
computers) --- Congresses; UNIX (Computer file) ---
Congresses",
}
@Proceedings{Bocca:1994:ICV,
editor = "Jorge B. Bocca and Matthias Jarke and Carlo Zaniolo",
booktitle = "20th International Conference on Very Large Data
Bases, September 12--15, 1994, Santiago, Chile
proceedings",
title = "20th International Conference on Very Large Data
Bases, September 12--15, 1994, Santiago, Chile
proceedings",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xv + 758",
year = "1994",
ISBN = "1-55860-153-8",
ISBN-13 = "978-1-55860-153-6",
LCCN = "QA76.9.D3 I559 1994",
bibdate = "Sat Dec 7 13:05:35 MST 1996",
bibsource = "DBLP; http://dblp.uni-trier.de;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib",
acknowledgement = ack-nhfb,
keywords = "database management -- congresses; databases --
congresses",
xxnote = "Check year: some catalogs have 1994, others 1995??",
}
@Book{Byrnes:1994:WTA,
editor = "James S. Byrnes and Jennifer L. Byrnes and Kathryn A.
Hargreaves and Karl Berry",
booktitle = "Wavelets and Their Applications",
title = "Wavelets and Their Applications",
volume = "442",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
year = "1994",
ISBN = "0-7923-3078-1",
ISBN-13 = "978-0-7923-3078-3",
bibdate = "Fri Mar 31 11:11:22 MST 1995",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Proceedings of the NATO Advanced Study Institute at Il
Ciocco, Barga, Italy in August, 1992",
series = "NATO ASI Series C: Mathematical and Physical
Sciences",
}
@Proceedings{Chui:1994:WTA,
editor = "Charles K. Chui and Laura Montefusco and Luigia
Puccio",
booktitle = "Wavelets: Theory, Algorithms, and Applications",
title = "Wavelets: Theory, Algorithms, and Applications",
organization = "University of Messina",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
year = "1994",
ISBN = "0-12-174575-9",
ISBN-13 = "978-0-12-174575-2",
bibdate = "Fri Mar 31 11:11:22 MST 1995",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wickerhauser-m-victor.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Proceedings of the International Conference in
Chui:1994:WTA, Sicily, 14--20 October 1993",
}
@Proceedings{Storer:1994:DDC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'94",
booktitle = "{DCC '94: Data Compression Conference, proceedings:
March 29--31, 1994, Snowbird, Utah}",
title = "{DCC '94: Data Compression Conference, proceedings:
March 29--31, 1994, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 549",
year = "1994",
DOI = "https://doi.org/10.1109/DCC.1994.305899",
ISBN = "0-8186-5636-0, 0-8186-5637-9 (case)",
ISBN-13 = "978-0-8186-5636-1, 978-0-8186-5637-8 (case)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 1994",
bibdate = "Tue Feb 5 05:42:21 MST 2013",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Catalog Number 93TH0626-2. IEEE Computer Society
Press Order Number 5637-02.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=961",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (4th 1994: Snowbird,
Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{vanLeeuwen:1994:GTC,
editor = "Jan van Leeuwen",
booktitle = "{Graph-theoretic concepts in computer science: 19th
International Workshop, WG '93, Utrecht, The
Netherlands, June 16--18, 1993: proceedings}",
title = "{Graph-theoretic concepts in computer science: 19th
International Workshop, WG '93, Utrecht, The
Netherlands, June 16--18, 1993: proceedings}",
volume = "790",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 429",
year = "1994",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-57899-4",
ISBN = "0-86636-292-4 (New York), 3-540-57899-4 (Berlin)",
ISBN-13 = "978-0-86636-292-4 (New York), 978-3-540-57899-4
(Berlin)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA75.5 .I647 1993",
bibdate = "Wed Jan 30 10:02:55 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t0790.htm;
http://www.springerlink.com/content/978-0-86636-292-4;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=790",
acknowledgement = ack-nhfb,
keywords = "computer science --- congresses; graph theory ---
congresses",
}
@Proceedings{ACM:1995:PTS,
editor = "{ACM}",
booktitle = "Proceedings of the twenty-seventh annual {ACM}
Symposium on Theory of Computing: Las Vegas, Nevada,
May 29--June 1, 1995",
title = "Proceedings of the twenty-seventh annual {ACM}
Symposium on Theory of Computing: Las Vegas, Nevada,
May 29--June 1, 1995",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 763",
year = "1995",
ISBN = "0-89791-718-9",
ISBN-13 = "978-0-89791-718-6",
LCCN = "QA 76.6 A13 1995",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/stoc1990.bib",
note = "ACM order no. 508950.",
acknowledgement = ack-nhfb,
keywords = "computational complexity --- congresses",
}
@Proceedings{Brown:1995:PSI,
editor = "Allen Brown and Anne Br{\"u}ggemann-Klein and An
Feng",
booktitle = "Proceedings of the Sixth International Conference on
Electronic Publishing, Document Manipulation and
Typography, 24--26 September, 1996, Palo Alto, CA,
USA",
title = "Proceedings of the Sixth International Conference on
Electronic Publishing, Document Manipulation and
Typography, 24--26 September, 1996, Palo Alto, {CA},
{USA}",
volume = "8(2)",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "iv + 49--273",
year = "1995",
ISSN = "0894-3982",
bibdate = "Mon Apr 27 08:08:18 MDT 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/ep.bib",
series = j-EPODD,
acknowledgement = ack-nhfb,
xxnote = "Although the conference was held in 1996, the
(delayed) journal was still dated 1995.",
}
@Proceedings{Fisher:1995:NAF,
editor = "Yuval Fisher",
booktitle = "{NATO ASI on Fractal Image Encoding and Analysis: July
8--17, 1995, Trondheim, Norway}",
title = "{NATO ASI on Fractal Image Encoding and Analysis: July
8--17, 1995, Trondheim, Norway}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 368",
year = "1995",
ISBN = "3-540-63196-8",
ISBN-13 = "978-3-540-63196-5",
LCCN = "TA1637 .N38 1998",
bibdate = "Sat Apr 19 11:43:49 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
bookpages = "xiii + 368",
}
@Proceedings{IEEE:1995:HCV,
editor = "{IEEE}",
booktitle = "Hot chips VII: symposium record: Stanford University,
Stanford, California, August 1995",
title = "Hot chips {VII}: symposium record: Stanford
University, Stanford, California, August 1995",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "1995",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Sat Jan 6 19:21:12 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hot-chips.bib;
OCLC Proceedings database",
acknowledgement = ack-nhfb,
keywords = "hot chips",
}
@Proceedings{IEEE:1995:IPIa,
editor = "{IEEE}",
booktitle = "{ICASSP '95: Proceedings of the 1995 IEEE
International Conference on Acoustics, Speech, and
Signal Processing, May 9--12, 1995, Detroit,
Michigan}",
title = "{ICASSP '95: Proceedings of the 1995 IEEE
International Conference on Acoustics, Speech, and
Signal Processing, May 9--12, 1995, Detroit,
Michigan}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "3662",
year = "1995",
CODEN = "IPRODJ",
ISBN = "0-7803-2431-5",
ISBN-13 = "978-0-7803-2431-2",
ISSN = "0736-7791",
LCCN = "TK7882.S65 .I16 1995",
bibdate = "Sun Jan 5 07:37:43 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib",
note = "Five volumes. IEEE Catalog No. 95CH35732.",
acknowledgement = ack-nhfb,
confdate = "9--12 May 1995",
conflocation = "Detroit, MI, USA",
confsponsor = "Signal Process. Soc. IEEE",
}
@Proceedings{IEEE:1995:IPIb,
editor = "{IEEE}",
booktitle = "{ICIP'95: Proceedings, International Conference on
Image Processing: October 23--26, 1995, Washington, DC,
USA}",
title = "{ICIP}'95: Proceedings, International Conference on
Image Processing: October 23--26, 1995, Washington,
{DC}, {USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "various",
year = "1995",
ISBN = "0-7803-3122-2 (casebound), 0-8186-7310-9 (softbound),
0-7803-3123-0 (microfiche), 0-7803-2749-7 (CD-ROM)",
ISBN-13 = "978-0-7803-3122-8 (casebound), 978-0-8186-7310-8
(softbound), 978-0-7803-3123-5 (microfiche),
978-0-7803-2749-8 (CD-ROM)",
LCCN = "TK8315.I222 1995",
bibdate = "Sat Apr 19 12:16:07 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/mandelbrot-benoit.bib;
https://www.math.utah.edu/pub/bibnet/subjects/fractal-image-comp.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Three volumes. IEEE catalog number 95CB35819.",
acknowledgement = ack-nhfb,
}
@Proceedings{Prasanna:1995:FIP,
editor = "Viktor K. Prasanna and V. P. Bhatkar and L. M. Patnaik
and S. K. Tripathi",
booktitle = "{First IWPP parallel processing: proceedings of the
First International Workshop on Parallel Processing
(IWPP-94): December 26--31, 1994, Bangalore, India}",
title = "{First IWPP parallel processing: proceedings of the
First International Workshop on Parallel Processing
(IWPP-94): December 26--31, 1994, Bangalore, India}",
publisher = "Taka McGraw-Hill Pub. Co",
address = "New Delhi; New York",
pages = "xxiii + 736",
year = "1995",
ISBN = "0-07-462332-X",
ISBN-13 = "978-0-07-462332-9",
LCCN = "QA 76.58 I587 1994",
bibdate = "Wed Apr 16 14:07:03 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:1995:DDC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'95",
booktitle = "{DCC '95, Data Compression Conference: March 28--30,
1995, Snowbird, Utah}",
title = "{DCC '95, Data Compression Conference: March 28--30,
1995, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xv + 503",
year = "1995",
DOI = "https://doi.org/10.1109/DCC.1995.515489",
ISBN = "0-8186-7012-6",
ISBN-13 = "978-0-8186-7012-1",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 5 05:42:24 MST 2013",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE catalog number 95TH8037. IEEE Computer Society
Press order number PR07010.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=3874",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (5th: 1995: Snowbird,
Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Alefeld:1996:SCV,
editor = "G{\"o}tz Alefeld and Andreas Frommer and Bruno Lang",
booktitle = "Scientific computing and validated numerics:
proceedings of the International Symposium on
Scientific Computing, Computer Arithmetic and Validated
Numerics SCAN-95 held in Wuppertal, Germany, September
26--29, 1995",
title = "Scientific computing and validated numerics:
proceedings of the International Symposium on
Scientific Computing, Computer Arithmetic and Validated
Numerics {SCAN}-95 held in Wuppertal, Germany,
September 26--29, 1995",
volume = "90",
publisher = "Akademie Verlag",
address = "Berlin, Germany",
pages = "340",
year = "1996",
ISBN = "3-05-501737-4",
ISBN-13 = "978-3-05-501737-7",
ISSN = "0138-3019",
LCCN = "QA76.95 .I575 1995",
bibdate = "Fri Mar 27 09:56:17 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
series = "Mathematical Research",
acknowledgement = ack-nhfb,
}
@Proceedings{Bode:1996:PVM,
editor = "Arndt Bode and Jack Dongarra and T. Ludwig and V.
Sunderam",
booktitle = "{Parallel virtual machine, EuroPVM '96: third European
PVM conference, Munich, Germany, October 7--9, 1996:
proceedings}",
title = "{Parallel virtual machine, EuroPVM '96: third European
PVM conference, Munich, Germany, October 7--9, 1996:
proceedings}",
volume = "1156",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 362",
year = "1996",
ISBN = "3-540-61779-5",
ISBN-13 = "978-3-540-61779-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.58.E975 1996",
bibdate = "Sat Apr 19 16:34:54 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pvm.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
conflocation = "Munich, Germany; 7-9 Oct. 1996",
conftitle = "Parallel Virtual Machine - EuroPVM '96. Third European
PVM Conference. Proceedings",
corpsource = "Computations and Commun. Res. Labs., NEC Europe Ltd.,
Sankt Augustin, Germany",
keywords = "Parallel computers -- Congresses; Virtual computer
systems -- Congresses.",
pubcountry = "Germany",
treatment = "P Practical",
}
@Proceedings{IEEE:1996:ASF,
editor = "{IEEE}",
booktitle = "37th Annual Symposium on Foundations of Computer
Science: October 14--16, 1996, Burlington, Vermont",
title = "37th Annual Symposium on Foundations of Computer
Science: October 14--16, 1996, Burlington, Vermont",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 638",
year = "1996",
CODEN = "ASFPDV",
ISBN = "0-7803-3762-X (casebound), 0-8186-7594-2 (softbound),
0-8186-7596-9 (microfiche)",
ISBN-13 = "978-0-7803-3762-6 (casebound), 978-0-8186-7594-2
(softbound), 978-0-8186-7596-6 (microfiche)",
ISSN = "0272-5428",
LCCN = "TK7885.A1 S92 1996",
bibdate = "Thu Dec 3 07:11:18 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/focs.bib",
note = "IEEE catalog number 96CH35973. IEEE Computer Society
Press order number PR07594.",
acknowledgement = ack-nhfb,
keywords = "electronic data processing --- congresses; machine
theory --- congresses",
}
@Proceedings{Storer:1996:DDC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'96",
booktitle = "{DCC '96: Data Compression Conference, March 31--April
3, 1996, Snowbird, Utah}",
title = "{DCC '96: Data Compression Conference, March 31--April
3, 1996, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 474",
year = "1996",
ISBN = "0-8186-7358-3 (case), 0-8186-7359-1 (microfiche)",
ISBN-13 = "978-0-8186-7358-0 (case), 978-0-8186-7359-7
(microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 1996",
bibdate = "Tue Feb 5 05:42:26 MST 2013",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Order Plan catalog number 96TB100013. IEEE
Computer Society Press order number PR07358",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=3509",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (6th: 1996: Snowbird,
Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{ACM:1997:PEA,
editor = "{ACM}",
booktitle = "{Proceedings of the Eighth Annual ACM-SIAM Symposium
on Discrete Algorithms, New Orleans, Louisiana, January
5--7, 1997}",
title = "{Proceedings of the Eighth Annual ACM-SIAM Symposium
on Discrete Algorithms, New Orleans, Louisiana, January
5--7, 1997}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "788",
year = "1997",
CODEN = "PAAAF2",
ISBN = "0-89871-390-0",
ISBN-13 = "978-0-89871-390-9",
LCCN = "????",
bibdate = "Thu Sep 11 18:03:49 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "http://www.acm.org/pubs/contents/proceedings/soda/314161/",
acknowledgement = ack-nhfb,
}
@Book{Houghton:1997:EEC,
author = "A. D. Houghton",
booktitle = "The Engineer's Error Coding Handbook",
title = "The Engineer's Error Coding Handbook",
publisher = pub-SV,
address = pub-SV:adr,
pages = "272",
year = "1997",
DOI = "https://doi.org/10.1007/978-1-4613-0447-0",
ISBN = "1-4613-0447-4",
ISBN-13 = "978-1-4613-0447-0",
LCCN = "TK7888.4",
bibdate = "Mon Aug 6 11:47:36 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "This book is designed both for advanced undergraduate
and postgraduate students in electronic engineering,
computer science and communications and for practising
engineers engaged in the communications and software
industries. It treats the subject from a practical
standpoint and presents the underlying mathematics ---
which in some treatments of the subject can be daunting
--- in a way which makes them accessible and always
directly relevant. Written by an author with extensive
experience of the applications of the techniques to a
wide range of practical engineering problems, the book
presents the reader with systematic explanation of the
techniques and methods of error coding. The work is
supplemented by software-based experiments enabling the
reader to verify the results and to carry out further
investigation of the subject. All of the software used
in the book can be obtained free of charge from the
author's web site on
uni/academic/D-H/eee/esg/staff/adh-prof.html.",
acknowledgement = ack-nhfb,
tableofcontents = "One Error Detection \\
1 Introduction \\
2 Parity checking \\
3 Cyclic redundancy checking \\
Two Error Correction, An Introduction \\
4 Hamming codes \\
5 Error correction using the CRC \\
Three Time Domain Reed \\
Solomon Coding \\
6 Correcting errors in the time domain \\
7 Correcting two symbols \\
Four Frequency Domain Reed \\
Solomon Coding \\
8 Frequency domain coding \\
9 Mixed domain error coding \\
Five Packaging the Data \\
10 Block-interleaving \\
11 Multi-dimensional data structures \\
12 Convolutional coding \\
13 Manipulating elements with hardware \\
14 Applications \\
Seven Exercises \\
15 Questions \\
16 Solutions \\
Appendix A Some primitive polynomials \\
Appendix B Solutions to some key equations \\
Appendix C Frequency domain example \\
Appendix D Time domain error correction in three
dimensions \\
Appendix E Correcting two-dimensional data in the
frequency domain \\
Appendix F Example of mixed domain error correction",
xxpages = "258",
}
@Book{Mitchell:1997:MVC,
editor = "Joan L. Mitchell and W. B. Pennebaker and C. E. Fogg
and D. J. LeGall",
booktitle = "{MPEG} Video Compression Standard",
title = "{MPEG} Video Compression Standard",
publisher = "Chapman and Hall and International Thomson
Publishing",
address = "New York, NY, USA",
pages = "??",
year = "1997",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-ds,
rawdata = "Mitchell, Joan L., W. B. Pennebaker, C. E. Fogg, and
D. J. LeGall, eds. (1997) {\it MPEG Video Compression
Standard}, New York, Chapman and Hall and International
Thomson Publishing.",
}
@Proceedings{Storer:1997:DDC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'97",
booktitle = "{DCC '97: Data Compression Conference, March 25--27,
1997, Snowbird, Utah}",
title = "{DCC '97: Data Compression Conference, March 25--27,
1997, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xv + 487",
year = "1997",
DOI = "https://doi.org/10.1109/DCC.1997.581948",
ISBN = "0-8186-7761-9 (case), 0-8186-7763-5 (microfiche)",
ISBN-13 = "978-0-8186-7761-8 (case), 978-0-8186-7763-2
(microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D232 1997",
bibdate = "Tue Feb 5 05:59:19 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Press order number PR07761. IEEE
Order Plan catalog number 96TB100108.",
URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4456",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (7th: 1997: Snowbird,
Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Aucsmith:1998:IHI,
editor = "David Aucsmith",
booktitle = "{Information hiding II: Second International Workshop,
IH'98: Portland, Oregon, USA, April 1998:
Proceedings}",
title = "{Information hiding II: Second International Workshop,
IH'98: Portland, Oregon, USA, April 1998:
Proceedings}",
volume = "1525",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 368",
year = "1998",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-65386-4",
ISBN-13 = "978-3-540-65386-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA76.9.A25I48 1998",
bibdate = "Sat Jan 9 14:35:31 MST 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1525.htm;
http://www.springerlink.com/content/978-3-540-65386-8;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1525",
acknowledgement = ack-nhfb,
keywords = "Computer security --- Congresses.; Data protection --
Congresses.",
}
@Proceedings{Matthews:1998:CRT,
editor = "Michael B. Matthews and others",
booktitle = "{Conference record of the Thirty-Second Asilomar
Conference on Signals, Systems and Computers: November
1--4, 1998, Pacific Grove, California}",
title = "{Conference record of the Thirty-Second Asilomar
Conference on Signals, Systems and Computers: November
1--4, 1998, Pacific Grove, California}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "1998",
ISBN = "0-7803-5148-7, 0-7803-5149-5, 0-7803-5150-9",
ISBN-13 = "978-0-7803-5148-6, 978-0-7803-5149-3,
978-0-7803-5150-9",
LCCN = "TK5101.A1 A85 1998; TK454.2 .A8 1998",
bibdate = "Mon Mar 5 15:56:18 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
meetingname = "Asilomar Conference on Signals, Systems and Computers
(32nd: 1998: Pacific Grove, Calif.)",
remark = "IEEE Catalog Number 98CH36284.",
subject = "Signal processing; Digital techniques; Congresses;
Electronic digital computers",
}
@Proceedings{Storer:1998:PDD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC'98",
booktitle = "{Proceedings: DCC '98: Data Compression Conference:
March 30--April 1, 1998, Snowbird, Utah}",
title = "{Proceedings: DCC '98: Data Compression Conference:
March 30--April 1, 1998, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 589",
year = "1998",
DOI = "https://doi.org/10.1109/DCC.1998.672118",
ISBN = "0-8186-8406-2 (case), 0-8186-8408-9 (microfiche)",
ISBN-13 = "978-0-8186-8406-7 (case), 978-0-8186-8408-1
(microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D232 1998",
bibdate = "Tue Feb 5 05:28:57 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
note = "IEEE Computer Society Press order number PR08406. IEEE
order plan catalog number 98TB100225.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=672118",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference. 1998. Snowbird, Utah",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Storer:1999:DPD,
editor = "James A. Storer and Martin Cohn",
key = "DCC'99",
booktitle = "{DCC '99: proceedings: Data Compression Conference:
March 29--31, 1999, Snowbird, Utah}",
title = "{DCC '99: proceedings: Data Compression Conference:
March 29--31, 1999, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xv + 566",
year = "1999",
DOI = "https://doi.org/10.1109/DCC.1999.755647",
ISBN = "0-7695-0096-X, 0-7695-0098-6 (microfiche)",
ISBN-13 = "978-0-7695-0096-6, 978-0-7695-0098-0 (microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 1999",
bibdate = "Tue Feb 5 05:59:32 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number PR00096. IEEE Order
Plan Catalog Number PR00096.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=755647",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (1999: Snowbird, Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Book{Welstead:1999:FWI,
author = "Stephen Welstead",
booktitle = "Fractal and Wavelet Image Compression Techniques",
title = "Fractal and Wavelet Image Compression Techniques",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "xv + 232",
year = "1999",
DOI = "https://doi.org/10.1117/3.353798",
ISBN = "0-8194-3503-1 (print), 0-8194-7859-8 (e-PDF),
1-61583-713-2 (e-book)",
ISBN-13 = "978-0-8194-3503-3 (print), 978-0-8194-7859-7 (e-PDF),
978-1-61583-713-7 (e-book)",
LCCN = "TA1637 .W45 1999",
bibdate = "Sat Mar 10 14:29:20 2018",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "Interest in image compression for internet and other
multimedia applications has spurred research into
compression techniques that will increase storage
capabilities and transmission speed. This tutorial
provides a practical guide to fractal and wavelet
approaches--two techniques with exciting potential. It
is intended for scientists, engineers, researchers, and
students. It provides both introductory information and
implementation details. Three Windows-compatible
software systems are included so that readers can
explore the new technologies in depth. Complete C/C++
source code is provided, enabling readers to go beyond
the accompanying software. The mathematical
presentation is accessible to advanced undergraduate or
beginning graduate students in technical fields.",
acknowledgement = ack-nhfb,
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
tableofcontents = "1. Introduction \\
Images \\
The image compression problem \\
Information, entropy, and data modeling \\
Scalar and vector quantization \\
Transform methods \\
Color images \\
The focus of this book \\
Part I: Fractal image compression. 2. Iterated Function
Systems \\
Iterated function systems as the motivation for fractal
image compression \\
Metric spaces \\
Iterated function systems \\
Implementation of an iterated function system \\
Examples \\
3. Fractal encoding of grayscale images \\
A metric space for grayscale images \\
Partitioned iterated function systems (PIFS) \\
Fractal image encoding \\
Image decoding \\
Storing the encoded image \\
Resolution independence \\
Operator representation of fractal image encoding \\
4. Speeding up fractal encoding \\
Feature extraction \\
Domain classification \\
Other approaches for speeding up fractal encoding \\
Part II. Wavelet image compression. 5. Simple wavelets
\\
Introduction \\
Averaging and detail \\
Scaling functions and wavelet functions \\
Multiresolution analysis \\
Normalization \\
Wavelet transform \\
Inverse wavelet transform \\
Wavelet transform in two dimensions \\
6. Daubechies wavelets \\
Weighted averages and differences \\
Properties and conditions on the coefficients \\
Wavelet transform \\
Scaling functions and wavelet functions \\
Daubechies wavelets \\
Simple image compression with Daubechies wavelets \\
Other wavelet systems \\
7. Wavelet image compression techniques \\
Introduction \\
Wavelet zerotrees \\
Hybrid fractal-wavelet coding \\
8. Comparison of fractal and wavelet image compression
\\
Rate distortion \\
Encoding speed \\
Larger images \\
Conclusions \\
Appendix A: Using the accompanying software \\
IFS System \\
IMG System: fractal image compression \\
WAV System: wavelet image compression \\
Appendix B: Utility Windows Library (UWL) \\
Windows programming \\
Utility Windows Library (UWL) \\
Windows programming references \\
Appendix C: Organization of the accompanying software
source code \\
IFS System \\
IMG System \\
WAV System",
}
@Proceedings{Storer:2000:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2000",
booktitle = "{DCC 2000: Proceedings, Data Compression Conference,
March 28--30, 2000, Snowbird, Utah}",
title = "{DCC 2000: Proceedings, Data Compression Conference,
March 28--30, 2000, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xv + 586",
year = "2000",
DOI = "https://doi.org/10.1109/DCC.2000.838139",
ISBN = "0-7695-0592-9, 0-7695-0594-5 (microfiche)",
ISBN-13 = "978-0-7695-0592-3, 978-0-7695-0594-7 (microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 2000",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib",
note = "This millennial edition of the DCC proceedings is
dedicated to the memory of David A. Huffman,
1925--1999. IEEE Computer Society order number
PR00592.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=838139",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (2000: Snowbird, Utah)",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Sellis:2001:PAS,
editor = "Timos Sellis and Sharad Mehrotra",
booktitle = "{Proceedings of the 2001 ACM SIGMOD International
Conference on Management of Data 2001, Santa Barbara,
California, United States, May 21--24, 2001}",
title = "{Proceedings of the 2001 ACM SIGMOD International
Conference on Management of Data 2001, Santa Barbara,
California, United States, May 21--24, 2001}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xv + 630",
year = "2001",
ISBN = "????",
ISBN-13 = "????",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
LCCN = "????",
bibdate = "Fri Oct 31 08:06:56 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib",
note = "ACM order number 472010.",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2001:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2001",
booktitle = "{DCC 2001: proceedings, Data Compression Conference,
March 27--29, 2001, Snowbird, Utah}",
title = "{DCC 2001: proceedings, Data Compression Conference,
March 27--29, 2001, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 533",
year = "2001",
DOI = "https://doi.org/10.1109/DCC.2001.917130",
ISBN = "0-7695-1031-0",
ISBN-13 = "978-0-7695-1031-6",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 2001",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE CSP number 01PR1031.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=917130",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Barth:2002:MMM,
editor = "Timothy J. Barth and Tony Chan and Robert Haimes",
booktitle = "Multiscale and Multiresolution Methods: Theory and
Applications",
title = "Multiscale and Multiresolution Methods: Theory and
Applications",
volume = "20",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 389",
year = "2002",
CODEN = "LNCSA6",
DOI = "https://doi.org/10.1007/978-3-642-56205-1",
ISBN = "3-540-42420-2 (print), 3-642-56205-1 (e-book)",
ISBN-13 = "978-3-540-42420-8 (print), 978-3-642-56205-1
(e-book)",
ISSN = "1439-7358",
ISSN-L = "1439-7358",
LCCN = "QA403.3 .M85 2002",
bibdate = "Thu Dec 20 14:36:12 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncse.bib",
note = "Papers from the Yosemite Educational Symposium (YES),
Yosemite valley, California, Fall 2000.",
series = ser-LNCSE,
URL = "http://link.springer.com/book/10.1007/978-3-642-56205-1;
http://www.springerlink.com/content/978-3-642-56205-1",
acknowledgement = ack-nhfb,
bookpages = "x + 389",
series-URL = "http://link.springer.com/bookseries/3527",
}
@Proceedings{Storer:2002:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2002",
booktitle = "{DCC 2002: proceedings: Data Compression Conference:
April 2--4, 2002, Snowbird, Utah}",
title = "{DCC 2002: proceedings: Data Compression Conference:
April 2--4, 2002, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xi + 487",
year = "2002",
DOI = "https://doi.org/10.1109/DCC.2002.999937",
ISBN = "0-7695-1477-4, 0-7695-1478-2 (case), 0-7695-1479-0
(microfiche)",
ISBN-13 = "978-0-7695-1477-2, 978-0-7695-1478-9 (case),
978-0-7695-1479-6 (microfiche)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 2002",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/bibnet/authors/d/daubechies-ingrid.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number PR01477.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=999937",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (2002: Snowbird, Utah)",
ORCID-numbers = "Daubechies, Ingrid/0000-0002-6472-1056",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{ACM:2003:PAS,
editor = "{ACM}",
booktitle = "{Proceedings of the 2003 ACM SIGMOD International
Conference on Management of Data 2003, San Diego,
California, June 09--12, 2003}",
title = "{Proceedings of the 2003 ACM SIGMOD International
Conference on Management of Data 2003, San Diego,
California, June 09--12, 2003}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xvi + 687",
year = "2003",
ISBN = "1-58113-634-X",
ISBN-13 = "978-1-58113-634-0",
LCCN = "????",
bibdate = "Fri Oct 31 08:24:52 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Anonymous:2003:CCV,
editor = "Anonymous",
booktitle = "Cool Chips VI:An International Symposium on Low-Power
and High-Speed Chips, Yokohama Joho Bunka Center,
Yokohama, Japan (Yokohama Media \& Communications
Center, Yokohama, Japan) April 16--18, 2003",
title = "Cool Chips {VI}:An International Symposium on
Low-Power and High-Speed Chips, Yokohama Joho Bunka
Center, Yokohama, Japan (Yokohama Media \&
Communications Center, Yokohama, Japan) April 16--18,
2003",
publisher = "????",
address = "????",
pages = "????",
year = "2003",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Fri Jan 09 16:53:37 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cool-chips.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Freytag:2003:VPI,
editor = "Johann Christoph Freytag and Peter C. Lockemann and
Serge Abiteboul and Michael J. Carey and Patricia
G. Selinger and Andreas Heuer",
booktitle = "{VLDB 2003}: Proceedings of 29th International
Conference on Very Large Data Bases, September 9--12,
2003, Berlin, Germany",
title = "{VLDB 2003}: Proceedings of 29th International
Conference on Very Large Data Bases, September 9--12,
2003, Berlin, Germany",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
year = "2003",
ISBN = "0-12-722442-4",
ISBN-13 = "978-0-12-722442-8",
LCCN = "????",
bibdate = "Mon Dec 22 18:35:48 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/vldb.bib",
acknowledgement = ack-nhfb,
}
@Book{Sayood:2003:LCH,
editor = "Khalid Sayood",
booktitle = "Lossless Compression Handbook",
title = "Lossless Compression Handbook",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xx + 455",
year = "2003",
ISBN = "0-12-620861-1",
ISBN-13 = "978-0-12-620861-0",
LCCN = "TK5102.5 .L69 2003",
bibdate = "Mon Jan 28 07:06:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
jenson.stanford.edu:2210/unicorn",
series = "Academic Press series in communications, networking
and multimedia",
URL = "http://proquest.safaribooksonline.com/?uiCode=stanford\%26xmlId=9780126208610;
http://www.loc.gov/catdir/description/els031/2002104270.html;
http://www.loc.gov/catdir/toc/els031/2002104270.html;
http://www.myilibrary.com?id=104988;
http://www.sciencedirect.com/science/book/9780126208610",
acknowledgement = ack-nhfb,
tableofcontents = "Part I: Theory \\
Information theory behind source coding / Frans M. J.
Willems, Tjalling J. Tjalkens \\
Complexity measures / Stephen R. Tate \\
Part II: Compression Techniques \\
Universal codes / Peter Fenwick \\
Huffman coding / Steven Pigeon \\
Arithmetic coding / Amir Said \\
Dictionary-based data compression: an algorithmic
perspective / S. Cenk Sahinalp, Nasir M. Rajpoot \\
Burrows--Wheeler compression; Symbol-ranking and ACB
compression / Peter Fenwick \\
Part III: Applications \\
Lossless image compression / K. P. Subbalakshmi \\
Text compression / Amar Mukherjee, Fauzia Awan \\
Compression telemetry / Sheila Horan \\
Lossless compression of audio data / Robert C. Maher
\\
Algorithms for delta compression and remote file
synchronization / Torsten Suel, Nasir Memon \\
Compression of Unicode files / Peter Fenwick \\
Part IV: Standards \\
JPEG-LS lossless and near lossless image compression /
Michael W. Hoffman \\
CCSDS lossless data compression recommendation for
space applications / Pen-Shu Yeh \\
Lossless bilevel image compression / Michael W. Hoffman
\\
JPEG2000: highly scalable image compression / Ali
Bilgin, Michael W. Marcellin \\
PNG lossless image compression / Greg Roelofs \\
Facsimile compression / Khalid Sayood \\
Part V: Hardware \\
Hardware implementation of data compression / Sanjukta
Bhanja, N. Ranganathan",
}
@Proceedings{Schmalz:2003:MDI,
editor = "Mark S. Schmalz",
booktitle = "Mathematics of data\slash image coding, compression,
and encryption {VI}, with applications, {5--7 August
2003, San Diego, California, USA}",
title = "Mathematics of data\slash image coding, compression,
and encryption {VI}, with applications, {5--7 August
2003, San Diego, California, USA}",
volume = "5208",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "viii + 236",
year = "2003",
ISBN = "0-8194-5081-2",
ISBN-13 = "978-0-8194-5081-4",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
series = "Proceedings of SPIE",
acknowledgement = ack-nhfb,
xxyear = "2004",
}
@Proceedings{Storer:2003:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2003",
booktitle = "{DCC 2003: proceedings: Data Compression Conference:
March 25--27, 2003, Snowbird, Utah}",
title = "{DCC 2003: proceedings: Data Compression Conference:
March 25--27, 2003, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 461",
year = "2003",
DOI = "https://doi.org/10.1109/DCC.2003.1193990",
ISBN = "0-7695-1896-6",
ISBN-13 = "978-0-7695-1896-1",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D37 2003",
bibdate = "Mon Jan 28 15:18:45 MST 2013",
bibsource = "clio-db.cc.columbia.edu:7090/Voyager;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order number PR01896.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1193990",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (2003: Snowbird, Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{IEEE:2004:IIC,
editor = "{IEEE}",
booktitle = "{2004 IEEE International Conference on Acoustics,
Speech, and Signal Processing: proceedings: May 17--21,
2004, Fairmont Queen Elizabeth Hotel, Montreal, Quebec,
Canada (ICASSP '04)}",
title = "{2004 IEEE International Conference on Acoustics,
Speech, and Signal Processing: proceedings: May 17--21,
2004, Fairmont Queen Elizabeth Hotel, Montreal, Quebec,
Canada (ICASSP '04)}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2004",
ISBN = "0-7803-8484-9",
ISBN-13 = "978-0-7803-8484-2",
LCCN = "TK7882.S65 I61 2004",
bibdate = "Sun Feb 20 11:05:28 MST 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "IEEE Catalog Number: 04CH37568",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=9248",
acknowledgement = ack-nhfb,
remark = "Vol. 1. Speech processing. Vol. 2. Sensor array and
Multichannel signal processing; signal processing
theory and methods. Vol. 3. Image and multidimensional
processing; special sessions. Vol. 4. Audio and
electroacoustics signal processing for communications.
Vol. 5. Design and implementation of signal processing
systems; industry technology tracks; machine learning
for signal processing; multimedia signal processing;
signal processing for education",
subject = "speech processing systems; congresses; signal
processing systems; electro-acoustics; underwater
acoustics; integrated circuits; very large scale
integration",
}
@Proceedings{Schmalz:2004:MDI,
editor = "Mark S. Schmalz",
booktitle = "Mathematics of data\slash image coding, compression,
and encryption {VII}, with applications: {4--5 August
2004, Denver, Colorado, USA}",
title = "Mathematics of data\slash image coding, compression,
and encryption {VII}, with applications: {4--5 August
2004, Denver, Colorado, USA}",
volume = "5561",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "viii + 176",
year = "2004",
ISBN = "0-8194-5499-0",
ISBN-13 = "978-0-8194-5499-7",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
series = "Proceedings of SPIE",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2004:DCC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2004",
booktitle = "{Data Compression Conference, 2004. Proceedings. DCC
2004: Snowbird, Utah, USA: 23--25 March 2004}",
title = "{Data Compression Conference, 2004. Proceedings. DCC
2004: Snowbird, Utah, USA: 23--25 March 2004}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 579",
year = "2004",
DOI = "https://doi.org/10.1109/DCC.2004.1281440",
ISBN = "0-7695-2082-0",
ISBN-13 = "978-0-7695-2082-7",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 5 05:59:42 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number: P2082.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1281440",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Book{Huang:2005:SDC,
editor = "Bormin Huang and Roger W. Heymann and Charles C.
Wang",
booktitle = "{Satellite data compression, communications, and
archiving: 31 July--1 August, 2005, San Diego,
California, USA}",
title = "{Satellite data compression, communications, and
archiving: 31 July--1 August, 2005, San Diego,
California, USA}",
volume = "5889",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2005",
ISBN = "0-8194-5894-5 (paperback)",
ISBN-13 = "978-0-8194-5894-0 (paperback)",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TK5102.92 .S37 2005",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of SPIE",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{IEEE:2005:ICI,
editor = "{IEEE}",
booktitle = "{2005 International Conference on Image Processing
(ICIP): September 11--14, 2005, Genova, Italy}",
title = "{2005 International Conference on Image Processing
(ICIP): September 11--14, 2005, Genova, Italy}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xxxiv + 3668 + A-13",
year = "2005",
ISBN = "0-7803-9134-9",
ISBN-13 = "978-0-7803-9134-5",
LCCN = "????",
bibdate = "Sat Jan 26 15:45:58 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.gbv.de:20011/gvk",
note = "Five volumes. IEEE catalog number 05CH37687.",
acknowledgement = ack-nhfb,
bookpages = "xxxiv + 3668 + A-13",
}
@Proceedings{Storer:2005:DCC,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2005",
booktitle = "{Data Compression Conference, 2005. Proceedings. DCC
2005}",
title = "{Data Compression Conference, 2005. Proceedings. DCC
2005}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2005",
DOI = "https://doi.org/10.1109/DCC.2005.28",
ISBN = "0-7695-2309-9",
ISBN-13 = "978-0-7695-2309-5",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 5 05:59:42 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=9633;
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1402158",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Heymann:2006:SDC,
editor = "Roger W. Heymann and Charles Chien-Yao Wang and
Timothy J. Schmit",
booktitle = "{Satellite data compression, communications, and
archiving II: 13--14 August, 2006, San Diego,
California, USA}",
title = "{Satellite data compression, communications, and
archiving II: 13--14 August, 2006, San Diego,
California, USA}",
volume = "6300",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2006",
ISBN = "0-8194-6379-5",
ISBN-13 = "978-0-8194-6379-1",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TK5102.92 .S37 2006",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of SPIE",
URL = "http://www.loc.gov/catdir/toc/fy0708/2007270591.html",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{Ritter:2006:MDI,
editor = "G. X. Ritter and others",
booktitle = "{Mathematics of data\slash image pattern recognition,
compression, and encryption with applications IX:
15--16 August 2006, San Diego, California, USA}",
title = "{Mathematics of data\slash image pattern recognition,
compression, and encryption with applications IX:
15--16 August 2006, San Diego, California, USA}",
volume = "6315",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2006",
ISBN = "0-8194-6394-9",
ISBN-13 = "978-0-8194-6394-4",
LCCN = "TA1637 .M389 2006; TS510 .S62 V.6315",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Proceedings of SPIE",
acknowledgement = ack-nhfb,
subject = "Image processing; Mathematics; Congresses; Digital
techniques; Image compression; Data encryption
(Computer science)",
}
@Proceedings{Storer:2006:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2006",
booktitle = "{DCC 2006: Proceedings Data Compression Conference:
28--30 March 2006, Snowbird, Utah}",
title = "{DCC 2006: Proceedings Data Compression Conference:
28--30 March 2006, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2006",
DOI = "https://doi.org/10.1109/DCC.2006.20",
ISBN = "0-7695-2545-8",
ISBN-13 = "978-0-7695-2545-7",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1607232",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Heymann:2007:SDC,
editor = "Roger W. Heymann and Bormin Huang and Irina
Gladkova",
booktitle = "{Satellite data compression, communications, and
archiving III: 29--30 August 2007, San Diego,
California, USA}",
title = "{Satellite data compression, communications, and
archiving III: 29--30 August 2007, San Diego,
California, USA}",
volume = "6683",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2007",
ISBN = "0-8194-6831-2",
ISBN-13 = "978-0-8194-6831-4",
LCCN = "TK5102.92 .S372 2007",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{Ritter:2007:MDI,
editor = "G. X. Ritter and others",
booktitle = "{Mathematics of data\slash image pattern recognition,
compression, coding, and encryption X, with
applications: 26--27 August, 2007, San Diego,
California, USA}",
title = "{Mathematics of data\slash image pattern recognition,
compression, coding, and encryption X, with
applications: 26--27 August, 2007, San Diego,
California, USA}",
volume = "6700",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2007",
ISBN = "0-8194-6848-7",
ISBN-13 = "978-0-8194-6848-2",
LCCN = "TS510 .S62 V.6700",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
series = "Proceedings of SPIE",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2007:DPD,
editor = "James A. (James Andrew) Storer and Martin Cohn",
key = "DCC 2007",
booktitle = "{DCC 2007: Proceedings: Data Compression Conference:
27--29 March 2007, Snowbird, Utah}",
title = "{DCC 2007: Proceedings: Data Compression Conference:
27--29 March 2007, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2007",
DOI = "https://doi.org/10.1109/DCC.2007.27",
ISBN = "0-7695-2791-4",
ISBN-13 = "978-0-7695-2791-8",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 5 05:59:46 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number P2791.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=4148731",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Heymann:2008:SDC,
editor = "Roger W. Heymann and Bormin Huang and Joan
Serra-Sagrist{\`a}",
booktitle = "{Satellite data compression, communications, and
processing IV: 10--11 August 2008, San Diego,
California, USA}",
title = "{Satellite data compression, communications, and
processing IV: 10--11 August 2008, San Diego,
California, USA}",
volume = "7084",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2008",
ISBN = "0-8194-7304-9 (paperback)",
ISBN-13 = "978-0-8194-7304-2 (paperback)",
LCCN = "TK5102.92 .S3739 2008",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{Lenzerini:2008:PTS,
editor = "Maurizio Lenzerini and Domenico Lembo",
booktitle = "{Proceedings of the Twenty-Seventh ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS'08, Vancouver, BC, Canada, June
9--11, 2008}",
title = "{Proceedings of the Twenty-Seventh ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS'08, Vancouver, BC, Canada, June
9--11, 2008}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xi + 320 (est.)",
year = "2008",
ISBN = "1-605-60932-3",
ISBN-13 = "978-1-605-60932-4",
LCCN = "????",
bibdate = "Fri Jun 20 13:10:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
xxISBN = "1-59593-685-8",
xxisbn-13 = "978-1-59593-685-1",
xxnote = "There is library confusion about the ISBN: I found
1-60558-152-6 (tagged invalid in catalog),
1-605-60932-3, 1-59593-685-9, 1-59593-685-X (invalid
checksum).",
}
@Proceedings{Storer:2008:DDC,
editor = "James A. (James Andrew) Storer and Michael W.
Marcellin",
key = "DCC 2008",
booktitle = "{DCC 2008: 2008 Data Compression Conference: March
25--27, 2008, Snowbird, Utah: proceedings}",
title = "{DCC 2008: 2008 Data Compression Conference: March
25--27, 2008, Snowbird, Utah: proceedings}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2008",
DOI = "https://doi.org/10.1109/DCC.2008.112",
ISBN = "0-7695-3121-0",
ISBN-13 = "978-0-7695-3121-2",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "QA76.9.D33 D372 2008; QA76.9.D33 INTERNET",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4483271",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference (2008: Snowbird, Utah)",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
subject = "Data compression (Computer science); Congresses",
}
@Proceedings{Huang:2009:SDC,
editor = "Bormin Huang and Antonio J. Plaza and Raffaele
Vitulli",
booktitle = "{Satellite data compression, communication, and
processing V: 4--5 August 2009, San Diego, California,
United States}",
title = "{Satellite data compression, communication, and
processing V: 4--5 August 2009, San Diego, California,
United States}",
volume = "7455",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2009",
ISBN = "0-8194-7745-1",
ISBN-13 = "978-0-8194-7745-3",
LCCN = "TK5102.92 .S374 2009",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Previous conferences entitled: Satellite data
compression, communications, and processing.",
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{IEEE:2009:DCC,
editor = "{IEEE}",
booktitle = "{2009 Data Compression Conference, January 2009}",
title = "{2009 Data Compression Conference, January 2009}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2009",
ISBN = "1-4244-3753-9 (paperback)",
ISBN-13 = "978-1-4244-3753-5",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2009:DPD,
editor = "James A. (James Andrew) Storer and Michael W.
Marcellin",
key = "DCC 2009",
booktitle = "{DCC 2009: Proceedings Data Compression Conference:
Snowbird, Utah, USA, 16--28 March 2011}",
title = "{DCC 2009: Proceedings Data Compression Conference:
Snowbird, Utah, USA, 16--28 March 2011}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2009",
DOI = "https://doi.org/10.1109/DCC.2009.93",
ISBN = "0-7695-3592-5",
ISBN-13 = "978-0-7695-3592-0",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 05 12:50:20 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number P3592. BMS Part
Number CFP09DCC-PRT.",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4976436",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Huang:2010:SDC,
editor = "Bormin Huang and others",
booktitle = "{Satellite data compression, communications, and
processing VI: 3--5 August 2010, San Diego, California,
United States}",
title = "{Satellite data compression, communications, and
processing VI: 3--5 August 2010, San Diego, California,
United States}",
volume = "7810",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2010",
ISBN = "0-8194-8306-0",
ISBN-13 = "978-0-8194-8306-5",
LCCN = "TK5102.92 .S3744 2010",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{IEEE:2010:DCCa,
editor = "{IEEE}",
booktitle = "{2010 Data Compression Conference, January 2010}",
title = "{2010 Data Compression Conference, January 2010}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2010",
ISBN = "1-4244-6425-0 (paperback)",
ISBN-13 = "978-1-4244-6425-8",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2010:DPD,
editor = "James A. (James Andrew) Storer and Michael W.
Marcellin",
key = "DCC 2010",
booktitle = "{DDC 2010: proceedings: Data Compression Conference:
24--26 March 2010, Snowbird, Utah}",
title = "{DDC 2010: proceedings: Data Compression Conference:
24--26 March 2010, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.105",
ISBN = "0-7695-3994-7",
ISBN-13 = "978-0-7695-3994-2",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Mon Jan 28 15:10:39 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453521",
acknowledgement = ack-nhfb,
meetingname = "Data Compression Conference",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Yang:2010:PII,
editor = "Yixian Yang",
booktitle = "{Proceedings 2010 {IEEE} International Conference on
Information Theory and Information Security: December
17--19, 2010, Beijing, China}",
title = "{Proceedings 2010 {IEEE} International Conference on
Information Theory and Information Security: December
17--19, 2010, Beijing, China}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "various",
year = "2010",
ISBN = "1-4244-6942-2",
ISBN-13 = "978-1-4244-6942-0",
LCCN = "QA76.9.A25",
bibdate = "Fri Mar 13 10:55:54 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5680738",
acknowledgement = ack-nhfb,
meetingname = "International Conference on Information Theory and
Information Security (2010: Beijing, China)",
subject = "Data protection; Congresses; Information retrieval;
Information theory; Data protection; Information
retrieval; Information theory",
}
@Book{Huang:2011:SDCa,
editor = "Bormin Huang",
booktitle = "Satellite Data Compression",
title = "Satellite Data Compression",
publisher = "Springer Science+Business Media, LLC",
address = "New York, NY",
pages = "ix + 309",
year = "2011",
ISBN = "1-4614-1182-3, 1-4614-1183-1",
ISBN-13 = "978-1-4614-1182-6, 978-1-4614-1183-3",
LCCN = "QA76.9.D33 .S35 2011; QA76.9.D33 INTERNET",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.bibsys.no:2100/BIBSYS;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy1208/2011939205-d.html;
http://www.loc.gov/catdir/enhancements/fy1208/2011939205-t.html",
acknowledgement = ack-nhfb,
subject = "Astronautics; Computer science; Telecommunication;
Computer Communication Networks; Geographical
information systems",
}
@Proceedings{Huang:2011:SDCb,
editor = "Bormin Huang and Antonio J. Plaza and Carole
Thi{\'e}baut",
booktitle = "{Satellite data compression, communications, and
processing VII: 23--24 August 2011, San Diego,
California, United States}",
title = "{Satellite data compression, communications, and
processing VII: 23--24 August 2011, San Diego,
California, United States}",
volume = "8157",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2011",
ISBN = "0-8194-8767-8",
ISBN-13 = "978-0-8194-8767-4",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "QC371 .S67 v. 8157; TK5102.92 .S3745 2011",
bibdate = "Mon Jan 28 15:19:07 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data compression (Telecommunication); Congresses;
Digital mapping; Artificial satellites in
telecommunication; Data libraries",
}
@Proceedings{IEEE:2011:DCC,
editor = "{IEEE}",
booktitle = "{2011 Data Compression Conference, March 2011}",
title = "{2011 Data Compression Conference, March 2011}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2011",
ISBN = "1-61284-279-8 (paperback)",
ISBN-13 = "978-1-61284-279-0 (paperback)",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2011:FIC,
editor = "{IEEE}",
booktitle = "{2011 First International Conference on Data
Compression, Communications and Processing, September
2011}",
title = "{2011 First International Conference on Data
Compression, Communications and Processing, September
2011}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2011",
ISBN = "1-4577-1458-2 (paperback)",
ISBN-13 = "978-1-4577-1458-0 (paperback)",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Storer:2011:DDC,
editor = "James A. (James Andrew) Storer and Michael W.
Marcellin",
key = "DCC 2011",
booktitle = "{DCC 2011: Data Compression Conference: Snowbird,
Utah, USA, 29--31 March 2011}",
title = "{DCC 2011: Data Compression Conference: Snowbird,
Utah, USA, 29--31 March 2011}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "493",
year = "2011",
DOI = "https://doi.org/10.1109/DCC.2011.99",
ISBN = "1-61284-279-8",
ISBN-13 = "978-1-61284-279-0",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Tue Feb 5 05:59:51 MST 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society Order Number P4352; BMS Part
Number: CFP11DCC-PRT",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5749456",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Proceedings{Chunfeng:2012:ICA,
editor = "Liu Chunfeng and Wang Leizhen and Yang Aimin",
booktitle = "Information computing and applications: {Third
International Conference, ICICA 2012, Chengde, China,
September 14--16, 2012}. {Proceedings Part II}",
title = "Information computing and applications: {Third
International Conference, ICICA 2012, Chengde, China,
September 14--16, 2012}. {Proceedings Part II}",
volume = "308",
publisher = pub-SV,
address = pub-SV:adr,
year = "2012",
DOI = "https://doi.org/10.1007/978-3-642-34041-3",
ISBN = "3-642-34040-7, 3-642-34041-5 (e-book)",
ISBN-13 = "978-3-642-34040-6, 978-3-642-34041-3 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Communications in computer and information science",
acknowledgement = ack-nhfb,
subject = "Computer science; Congresses; Internet; Information
technology",
tableofcontents = "Part 1 \\
Internet Computing and Applications \\
Research on User Authentication Scheme against the
Man-in-the-Middle Attack / Xiancun Zhou, Yan Xiong and
Renjin Liu \\
Study on Network Security Proactive Defense Model Based
on Honey Pot Technology / Haicheng Zhang \\
Framework of Server and Storage Virtualization / Song
Yibing and Cheng Jian \\
Efficient Management Scheme of Campus Information / Jun
Zheng, Fukai Cao and Jiansheng Gao \\
Web Service Technology in College Financial Information
Service System / Jun Zheng, Jundong Tang and Luyang Gao
\\
Efficient Network Monitoring System / Jiantao Gu, Yan
Wu and Zhao Gu \\
Software Design for Network Monitoring System / Jiantao
Gu, Benluo Xiao and Zhao Gu \\
Network Content Safety Design of Monitoring System /
Jiantao Gu, Benluo Xiao and Zhao Gu \\
Improvement Intrusion Detection Based on SVM / Jian-hua
Zhao and Wei-hua Li \\
Research on Subject Information Service Platform of
University Library / Lian Lijun \\
Networks Intrusion Behavior Prediction Based on Threat
Model / Dong Ma, Yongjun Wang, Feng Huang and Zhenlong
Fu \\
An Requirement-Aware Approach for Composing Web
Services / Xiangbing Zhou, Hongjiang Ma and Fang Mao
\\
Efficient Modeling Scheme Based on Smart Neural Network
/ Yaping Yu, Jian Zhang and Ying Li \\
Programming Design of Device Driver Based on Windows
CE.Net / Qiuhong Fan, Hao Zhang, Peng Li and Jiongzhao
Yang \\
Part 2 \\
Multimedia Networking and Computing \\
Contourlet-Based Fusion Method for Video Surveillance
Using the Pulse Coupled Neural Networks Model / Xi Cai,
Guang Han and Jinkuan Wang \\
Consensus-Based Detection Method for Visible and
Thermal Videos / Guang Han, Xi Cai and Jinkuan Wang \\
M-Learning English Course Design in Chinese Local
University / Lin Hu \\
Multi-objective Optimization for Data Placement
Strategy in Cloud Computing / Lizheng Guo, Zongyao He,
Shuguang Zhao, Na Zhang and Junhao Wang, et al \\
Web-Based Teaching System of Tourism English / Xiaohua
Zhu \\
Explore Sharing Platform of Medical Educational
Teaching Resources with IT Technology / Deliang Wen and
Xiaodan Ma \\
Groundwater Prediction Based on Time Series Model and
Wavelet De-nosing / Wei Yongxia, Qu Mingyang and Wang
Xiaoyan \\
Efficient Image Watermarking Algorithm Using
Non-negative Matrix Factorization and Discrete Wavelet
Transform / Song Liang, Jinhui Lai and Delong Cui \\
Study on Sleep Quality and Learning Outcomes of College
Students / Tian Jia-Li, Li Ji-Lin and Niu Jian-Zhao \\
Study on Digital Library and User Interaction Platform
/ Nan Pang \\
Extracurricular Reading of College Students Based on
Statistics / Jianying Miao \\
Part 3 \\
Intelligent Computing and Applications \\
Code-Controlled Hardware Trojan Horse / Hongbo Gao,
Qingbao Li, Yu Zhu and Yong Liu \\
Support Vector Machine Classification Algorithm and Its
Application / Yongli Zhang \\
A Flatness Pattern Recognition Model Based on Wavelet
Transform and Probabilistic Neural Network / Jiawei
Wang, Ruicheng Zhang and Wentao Song \\
Research on EEG Classification with Neural Networks
Based on the Levenberg-Marquardt Algorithm / Yue Chen
and Shaobai Zhang \\
Research on Reduction Algorithm Based on Variable
Precision Rough Set / Wang Zongjiang \\
SOA Based MRO Planning System with Knowledge Repository
/ Minglun Ren and Panpan Yang \\
A Modified Group Search Optimizer Algorithm for High
Dimensional Function Optimization / Lijin Wang, Xinxin
Hu, Jing Ning and Lin Jing \\
Research on Intelligence Optimization of Web Service
Composition for QoS / Jianjun Li, Bin Yu and Wuping
Chen \\
Decision-Making Scheme Based on LIOWAD / Meihua Cheng
and Shouzhen Zeng \\
Intuitionistic Fuzzy Decision Making Based on OWA and
Distance Measures / Shouzhen Zeng and Jiaqin Chen \\
Research on Fingerprint Identification in Mobile
Telephone / Fukai Cao, Zheng Zheng and Yao Zhao \\
Autonomous Vision-Based Safe Area Selection Algorithm
for UAV Emergency Forced Landing / Aiying Lu, Wenrui
Ding, Jiaxing Wang and Hongguang Li \\
Part 4 \\
Computational Statistics and Applications \\
Non-extensive Statistical Mechanics and Statistical
Distribution for Completely Open Systems / Bin Yang,
Heling Li and Ying Xiong \\
The Convergence Theorems of Fixed Points for Nearly
Uniformly L-Lipschitz Mappings / Jian Zhang, Yaping Yu
and Yanli Liu \\
Explicit Iteration Scheme with Perturbed Mapping for
Common Xed Points of a Nite Family of I -Asymptotically
Nonexpansive Mappings / Lingmin Zhang, Suhong Li, Xin
Xiao and Huijuan Zhao \\
On Distance Regular Graph of Valency 10 and a1=1 /
Junhong Ma and Nan Ji \\
Lie Symmetry Analysis for the Degasperis-Procesi
Equation Based on Maple / Qing Wang and Tao Wang \\
Oscillation Criteria for Nonlinear Neutral Perturbed
Dynamic Equations on Time Scales / Xiuping Yu, Hongkai
Sun, Hongyu Yang and Haibin Jing \\
An Analytical Method for Parameter Estimation Errors /
Qiuhong Fan, Qun Wei, Peng Li and Baoxiang Liu \\
Inverse Signed Total Domination Numbers of Some Kinds
of Graphs / Zhongsheng Huang, Zhifang Feng and Huaming
Xing \\
Dynamic Construction of Additively Weighted Network
Voronoi Diagram / Xin Liu, Yili Tan and Hongmei Yang
\\
(k,d)*-Choosability of K5-Minor-Free Graphs / Wenjing
Miao \\
Approximation Theoretic Aspects of Probabilistic
Representations for Bi-continuous Semigroups / Dingbang
Cang and Shigang Ge \\
Ruin Probability of Double Type Insurance Compound
Negative Binomial Risk Model / Wei Jing, Liu Haisheng
and Gui Wenyong \\
On a Class of Locally Dually Flat Isotropic Berwald
Metrics / Wenjing Zhao, Bochao Qu, Li Li and Linan Shi
\\
PDEs Solution Based on Two-Stage MFS-MPS and One-Stage
MFS-MPS / Xiaolei Wang, Tongsong Jiang and Ziwu Jiang
\\
On Explicit Determinants of RFPLR and RFPLL Circulant
Matrices Involving Pell Numbers in Information Theory /
Zhao-Lin Jiang, Juan Li and Nuo Shen \\
Solutions for One-Dimensional Time-Dependent
Schr{\"o}dinger Equations / Tongsong Jiang, Xiaolei
Wang and Zhaozhong Zhang \\
Contact Relation and Way-Below Relation in Fuzzy
Setting \\
Part 5 \\
Cloud and Evolutionary Computing \\
Integrated Model of Support Vector Machine Based on
Optimization of Artificial Fish Algorithm / Yong Ye,
Lichuan Gu and Shaowen Li \\
Improved Strategies of Ant Colony Optimization
Algorithms / Ping Guo, Zhujin Liu and Lin Zhu \\
Improved Ant Colony Optimization for Detecting
Functional Modules in Protein-Protein Interaction
Networks / Junzhong Ji, Zhijun Liu, Aidong Zhang, Lang
Jiao and Chunnian Liu \\
Trimmed Estimator of Multiple Linear Errors in
Variables Model Based on Decimal Integer Encoding
Genetic Algorithm / Huirong Cao and Mengtian Yue \\
Cryptanalysis of Wang's Auditing Protocol for Data
Storage Security in Cloud Computing / Chunxiang Xu,
Xiaohu He and Daniel Abraha-Weldemariam \\
ADRC of Displacement Delayed Feedback System for the
Rolling Mill Main Drive System / Ruicheng Zhang,
Pingping Yang, Peipei Wang and Mingduo Li \\
Intrusion Detection Based on BP Neural Network and
Genetic Algorithm / Zhao Jian-hua and Li Wei-hua \\
Township Health Center Information System Based on
Cloud Computing / Huaiyong Nie and Lina Yue \\
Heuristic Algorithms of Single-Machine Multi-criteria
Scheduling / Shuming Guan, Junhong Ma, Xiaoqing Lu and
Wenyi Zhang \\
AIB-SPMDM: A Smartphone Malware Detection Model Based
on Artificial Immunology / Min Zhao, Tao Zhang,
Jinshuang Wang and Zhijian Yuan \\
Local Stable Mechanism for Particle Swarm Optimization
Algorithm / Bo Wei, Yuanxiang Li, Dingcai Shen, Fei Yu
and Xing Xu \\
Mode of Regional Library Alliance under Cloud Computing
Environment / Ye Suping and Yang Jing \\
Research of Grid Resource Scheduling Based on Improved
Ant Colony Algorithm / Dan Liu, Shi-xia Ma, Zu-hua Guo
and Xiu-lan Wang \\
Network Security Evaluation Model Based on Cloud
Computing / Jin Yang, Cilin Wang, Le Yu, Caiming Liu
and Lingxi Peng \\
A Quantum Potential Strategy by Quantum Genetic
Algorithm / Han Bing, Wang Shujun and Ma Junhong \\
Circle-Based Improvement Strategy of Simulated
Annealing Genetic Algorithm / Han Bing \\
Part 6 \\
Computational Genomics and Proteomics \\
High-Speed Multi-hop AMCP Algorithm in MWSN / Dengyuan
Xu and Hong Wang \\
Prediction of Rheumatoid Arthritis-Associated Antigen
Peptides Using a Novel Mixed Algorithm / Tao Liu,
Jiuyun Zhang and Tianyu Lei \\
Numerical Simulation Method for the SIV Epidemic Model
with Impulsive Vaccination and Infection-Age / Wei Wei
\\
Dynamics and Simulations of Impulsive
Semi-Ratio-Dependent Predator-Prey System with
Functional Responses / Wenxiang Zhang, Zhanji Gui and
Kaihua Wang \\
Orthogonal Design of Pharmaceutical Experiment Based on
SPSS / Ji Zhou, Ran An, Heng Zhang and Yongqiong Liu
\\
Optimization of Corn Furrow Irrigation Modes Based on
RAGA-PPC Model / Wei Yongxia, Zhao Yuyu and Wang
Xiaoyan \\
Research on Chinese Medicine Syndrome of Sleep
Disorders of College Students / Tian Jia-Li, Zhao
Huiqin and Li Cheng \\
Study on Treatment for Subhealth-Induced Insomnia among
Student Patients by Self Point Massage / Tian Jia-li,
Zhang Ye-qing and Han Jian \\
Evaluating System of Treatment of Quercetin and
Resveratrol Mixture in Type 2 Diabetic Rats / Yan
Jiang, Zhilu Wang, Jinxiu Chu, Hong Yu and Ting Han, et
al \\
Medical Image Analysis in Treatment of Quercetin and
Resveratrol Mixture on Type 2 Diabetic Cardiomyopathy
Rats / Yan Jiang, Jian Chang, Jing Bai, Hong Yu and
Jinxiu Chu, et al \\
Progressive Relaxation Training Assisted Cognitive
Therapy of Insomnia / Tian Jia-li, Zhao Hui-qin and Xu
Yan-mei \\
TCM Dyspnea Syndrome Experience Mining Based on Rough
Set Theory / Huixia Ma, Ya Wang, Wenjing Gong and Jutai
Bao \\
Part 7 \\
Knowledge Management and Applications \\
Fault Diagnosis of NPC Inverter Based on Multi-layer
SVM / Danjiang Chen, Yinzhong Ye and Rong Hua \\
Study on Cashier Work of the Information Age / Yinqiu
Wang \\
Human-Computer Interaction in Ubiquitous Computing
Environments / Xianquan Zeng and Hongwen Pei \\
Research on Collaborative Decision Theory / Aimin Wang,
Xia Zheng, Ruihong Zhang and Jie Li \\
Research on Knowledge Discovery Service System in the
University Library / Zhijiang Liao and Min Gao \\
A TNC Protocol for 3GPP-WLAN Integrated Environment /
Jun Ma and Yuanbo Guo \\
Risk Information Management of Complex Weapons System
Development Based on Interpretative Structure Modeling
/ Gao Shanqing, Wu Xiaoyun, Xing Lixin and Wang Qiang
\\
Demand Forecast of Regional Tourism Based on Variable
Weight Combination Model / Lijuan Liu \\
Optimal Algorithm for Maintaining Equipment Loading /
Su Yan, Pengcheng Yan, Jiangsheng Sun, Lianwu Zhang and
Shaoguang Wang \\
Document Modeling of PDM Based on STEP in Integrated
Environment / Wei Qun, Fan Qiuhong and Zhang Hao \\
Part 8 \\
Engineering Management and Applications \\
Research on Copper Electroforming Based on Using of
Nano-La2O3 / Zhiyong Li, Zhipeng Duan and Hongli Liu
\\
A Memetic Algorithm Applied to Allocation Problem of
the Concrete Mixing Plants / Hao Zhi-feng, Wang Ai-Jing
and Huang Han \\
Research on Gascut-While-Drilling Volume Calculation
Model during Underbalanced Drilling / Jun He, Jing Li,
Zhaoming Zhou and Dong Zhang \\
Abhesion Mechanics Model of Horizontal Well
Cement-Formation Interface / Zhang Jinan, Wang Yinlong,
Ai Chi, Yin Jindan and Feng Fuping \\
Mechanical Behaviors of Shape Memory Alloys Concerning
Small-Strain and Large-Strain Methods / Jie Yao,
Yong-hong Zhu and Yun-zhang Wu \\
Orebody Model Compression Research Based on Decimal
Morton Code / Yajing Liu and Mei Li \\
Performance Analysis of Transcritical CO2 Compression
Cycle / Hongli Wang, Jingrui Tian and Huiqin Liu \\
Research on Speed Estimation of PMSM Based on Radial
Basis Function and MARS / Wei Gao, Xiaojun Hua and
Zhirong Guo \\
Research on EEG Based on SVM and EMD / Xinxin Wang and
Jianlin Zhao \\
Digital and Analog Compatible TV Transmitter Power
Measurement / Sujuan Zhang, Yanli Zhang, Yongchang Liu
and Jun Ma \\
Evidence Theory-Based Safety Evaluation in Coalmine /
Liu Wensheng \\
Part 9 \\
Control Engineering and Applications \\
Study on Hopf Bifurcation of Displacement Delayed
Feedback System for the Rolling Mill Main Drive System
/ Ruicheng Zhang, Pingping Yang, Mingduo Li and Xulei
Hu \\
Quantitative and Spatial Layout Evolvement Model of
Land Use Based on Fuzzy System / Zuohua Miao, Yong Chen
and Xiangyang Zeng \\
Research on Web Text Mining / Ruan Guangce \\
The Algorithmic Complexity of Reverse Signed Domination
in Graphs / Wensheng Li, Zhongsheng Huang, Zhifang
Feng, Huaming Xing and Yuejing Fang \\
SVM Classification Algorithm in ECG Classification /
Yanwei Zhu \\
Research on Flexible Management of Business Process /
Jiangjing Wang and Jiulei Jiang \\
The Research of Matrix Converter Space Vector
Modulation / Xu Zhuo, Zhao Shan, Chen Rui Min and Xiao
Yong \\
Optimization of Wheel Positioning Parameters of
Automotive Front Suspension Based on ADAMS / Lijun Qian
and Qin Shi \\
Research on Equipment Failure Risk Control System Based
on the Knowledge Integration / Chen Yan-guang \\
Flow Control System Performance Optimization Base-On
Zero-Copy / Sujuan Zhang, Wei Li, Yanli Zhang and Tao
Wu",
}
@Proceedings{Storer:2012:DDC,
editor = "James A. Storer and Michael W. Marcellin",
key = "DCC 2012",
booktitle = "{DCC 2012: 2012 Data Compression Conference:
proceedings, 10--12 April 2012, Snowbird, Utah}",
title = "{DCC 2012: 2012 Data Compression Conference:
proceedings, 10--12 April 2012, Snowbird, Utah}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xv + 417",
year = "2012",
DOI = "https://doi.org/10.1109/DCC.2012.75",
ISBN = "1-4673-0715-7 (paperback)",
ISBN-13 = "978-1-4673-0715-4 (paperback)",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
LCCN = "????",
bibdate = "Mon Jan 28 15:18:26 MST 2013",
bibsource = "clavis.ucalgary.ca:2200/UNICORN;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "IEEE Computer Society order number P4656.",
URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6189093",
acknowledgement = ack-nhfb,
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
@Book{Wang:2012:ACA,
editor = "Xiaoyun Wang and Kazue Sako",
booktitle = "{Advances in Cryptology --- ASIACRYPT 2012: 18th
International Conference on the Theory and Application
of Cryptology and Information Security, Beijing, China,
December 2--6, 2012. Proceedings}",
title = "{Advances in Cryptology --- ASIACRYPT 2012: 18th
International Conference on the Theory and Application
of Cryptology and Information Security, Beijing, China,
December 2--6, 2012. Proceedings}",
volume = "7658",
publisher = pub-SV,
address = pub-SV:adr,
pages = "330 (est.)",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-34961-4",
ISBN = "3-642-34960-9 (print), 3-642-34961-7 (e-book)",
ISBN-13 = "978-3-642-34960-7 (print), 978-3-642-34961-4
(e-book)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "????",
bibdate = "Wed Dec 19 15:18:20 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib;
z3950.kb.dk:2100/KGL01",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-34961-4",
acknowledgement = ack-nhfb,
subject = "Cryptography; Congresses; Computer security",
tableofcontents = "Pairing-Based Cryptography: Past, Present, and
Future / Dan Boneh \\
Some Mathematical Mysteries in Lattices / Chuanming
Zong \\
Constant-Size Structure-Preserving Signatures: Generic
Constructions and Simple Assumptions / Masayuki Abe,
Melissa Chase, Bernardo David, Markulf Kohlweiss and
Ryo Nishimaki, et al \\
Dual Form Signatures: An Approach for Proving Security
from Static Assumptions / Michael Gerbush, Allison
Lewko, Adam O'Neill and Brent Waters \\
Breaking Pairing-Based Cryptosystems Using $\eta T$
Pairing over ${\rm GF}(397)$ / Takuya Hayashi, Takeshi
Shimoyama, Naoyuki Shinohara and Tsuyoshi Takagi \\
On the (Im)possibility of Projecting Property in
Prime-Order Setting / Jae Hong Seo \\
Optimal Reductions of Some Decisional Problems to the
Rank Problem / Jorge Luis Villar \\
Signature Schemes Secure against Hard-to-Invert Leakage
/ Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen,
Peter Sebastian Nordholt and Angela Zottarel \\
Completeness for Symmetric Two-Party Functionalities
--- Revisited / Yehuda Lindell, Eran Omri and Hila
Zarosim \\
Adaptively Secure Garbling with Applications to One ---
Time Programs and Secure Outsourcing / Mihir Bellare,
Viet Tung Hoang and Phillip Rogaway \\
The Generalized Randomized Iterate and Its Application
to New Efficient Constructions of {UOWHFs} from Regular
One - Way Functions / Scott Ames, Rosario Gennaro and
Muthuramakrishnan Venkitasubramaniam \\
Perfect Algebraic Immune Functions / Meicheng Liu, Yin
Zhang and Dongdai Lin \\
Differential Analysis of the {LED} Block Cipher /
Florian Mendel, Vincent Rijmen, Deniz Toz and Kerem
Varici \\
{PRINCE} --- A Low-Latency Block Cipher for Pervasive
Computing Applications --- Extended Abstract / Julia
Borghoff, Anne Canteaut, Tim G{\"u}neysu, Elif Bilge
Kavun and Miroslav Knezevic, et al \\
Analysis of Differential Attacks in {ARX} Constructions
/ Ga{\"e}tan Leurent \\
Integral and Multidimensional Linear Distinguishers
with Correlation Zero / Andrey Bogdanov, Gregor
Leander, Kaisa Nyberg and Meiqin Wang \\
Differential Attacks against Stream Cipher {ZUC} /
Hongjun Wu, Tao Huang, Phuong Ha Nguyen, Huaxiong Wang
and San Ling \\
An Asymptotically Tight Security Analysis of the
Iterated Even-Mansour Cipher / Rodolphe Lampe, Jacques
Patarin and Yannick Seurin \\
3kf9: Enhancing {3GPP}-{MAC} beyond the Birthday Bound
/ Liting Zhang, Wenling Wu, Han Sui and Peng Wang \\
Understanding Adaptivity: Random Systems Revisited /
Dimitar Jetchev, Onur {\"O}zen and Martijn Stam \\
{RKA} Security beyond the Linear Barrier: {IBE},
Encryption and Signatures / Mihir Bellare, Kenneth G.
Paterson and Susan Thomson \\
Fully Secure Unbounded Inner-Product and
Attribute-Based Encryption / Tatsuaki Okamoto and
Katsuyuki Takashima \\
Computing on Authenticated Data: New Privacy
Definitions and Constructions / Nuttapong Attrapadung,
Beno{\^\i}t Libert and Thomas Peters \\
A Coding-Theoretic Approach to Recovering Noisy {RSA}
Keys / Kenneth G. Paterson, Antigoni Polychroniadou and
Dale L. Sibborn \\
Certifying {RSA} / Saqib A. Kakvi, Eike Kiltz and
Alexander May \\
Faster Gaussian Lattice Sampling Using Lazy
Floating-Point Arithmetic / L{\v{o}} Ducas and Phong Q.
Nguyen \\
Learning a Zonotope and More: Cryptanalysis of
{NTRUSign} Countermeasures / L{\v{o}} Ducas and Phong
Q. Nguyen \\
On Polynomial Systems Arising from a Weil Descent /
Christophe Petit and Jean-Jacques Quisquater \\
{ECM} at Work / Joppe W. Bos and Thorsten Kleinjung \\
{IND}-{CCA} Secure Cryptography Based on a Variant of
the {LPN} Problem / Nico D{\"o}ttling, J{\"o}rn
M{\"u}ller-Quade and Anderson C. A. Nascimento \\
Provable Security of the Knudsen - Preneel Compression
Functions / Jooyoung Lee \\
Optimal Collision Security in Double Block Length
Hashing with Single Length Key / Bart Mennink \\
Bicliques for Permutations: Collision and Preimage
Attacks in Stronger Settings / Dmitry Khovratovich \\
Investigating Fundamental Security Requirements on
Whirlpool: Improved Preimage and Collision Attacks / Yu
Sasaki, Lei Wang, Shuang Wu and Wenling Wu \\
Generic Related-Key Attacks for {HMAC} / Thomas Peyrin,
Yu Sasaki and Lei Wang \\
The Five-Card Trick Can Be Done with Four Cards /
Takaaki Mizuki, Michihito Kumamoto and Hideaki Sone \\
A Mix-Net from Any {CCA2} Secure Cryptosystem / Shahram
Khazaei, Tal Moran and Douglas Wikstr{\"o}m \\
How Not to Prove Yourself: Pitfalls of the Fiat-Shamir
Heuristic and Applications to Helios / David Bernhard,
Olivier Pereira and Bogdan Warinschi \\
Sequential Aggregate Signatures with Lazy Verification
from Trapdoor Permutations --- (Extended Abstract) /
Kyle Brogle, Sharon Goldberg and Leonid Reyzin \\
Commitments and Efficient Zero - Knowledge Proofs from
Learning Parity with Noise / Abhishek Jain, Stephan
Krenn, Krzysztof Pietrzak and Aris Tentes \\
Calling Out Cheaters: Covert Security with Public
Verifiability / Gilad Asharov and Claudio Orlandi \\
A Unified Framework for {UC} from Only {OT} / Rafael
Pass, Huijia Lin and Muthuramakrishnan
Venkitasubramaniam \\
Four - Dimensional Gallant - Lambert - Vanstone Scalar
Multiplication / Patrick Longa and Francesco Sica \\
Shuffling against Side-Channel Attacks: a Comprehensive
Study with Cautionary Note / Nicolas Veyrat -
Charvillon, Marcel Medwed, St{\v{p}}hanie Kerckhof and
Fran{\c{c}}ois - Xavier Standaert \\
Theory and Practice of a Leakage Resilient Masking
Scheme / Josep Balasch, Sebastian Faust, Benedikt
Gierlichs and Ingrid Verbauwhede",
}
@Proceedings{ACM:2013:SPF,
editor = "{ACM}",
booktitle = "{STOC '13: Proceedings of the Forty-fifth Annual ACM
Symposium on Theory of Computing: June 1--4, 2013, Palo
Alto, California, USA}",
title = "{STOC '13: Proceedings of the Forty-fifth Annual ACM
Symposium on Theory of Computing: June 1--4, 2013, Palo
Alto, California, USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "980 (est.)",
year = "2013",
ISBN = "1-4503-2029-5",
ISBN-13 = "978-1-4503-2029-0",
bibdate = "Mon Mar 3 06:36:05 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stoc.bib;
https://www.math.utah.edu/pub/tex/bib/stoc2010.bib",
acknowledgement = ack-nhfb,
remark = "45th annual STOC meeting.",
}
@Book{Borgelt:2013:TAD,
editor = "Christian Borgelt and others",
booktitle = "Towards advanced data analysis by combining soft
computing and statistics",
title = "Towards advanced data analysis by combining soft
computing and statistics",
volume = "285",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-30278-7",
ISBN = "016194883, 3-642-30278-5 (e-book)",
ISBN-13 = "016194883, 978-3-642-30278-7 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Studies in fuzziness and soft computing",
acknowledgement = ack-nhfb,
subject = "Mathematical statistics; Data processing; Soft
computing",
tableofcontents = "Arithmetic and Distance-Based Approach to the
Statistical Analysis of Imprecisely Valued Data /
Angela Blanco-Fern{\'a}ndez, Mar{\'\i}a Rosa Casals,
Ana Colubi, Renato Coppi and Norberto Corral, et al \\
Linear Regression Analysis for Interval-valued Data
Based on Set Arithmetic: A Review / Angela
Blanco-Fern{\'a}ndez, Ana Colubi and Gil
Gonz\`lez-Rodr{\'\i}guez \\
Bootstrap Confidence Intervals for the Parameters of a
Linear Regression Model with Fuzzy Random Variables /
Maria Brigida Ferraro, Renato Coppi and Gil
Gonz{\'a}lez-Rodr{\'\i}guez \\
On the Estimation of the Regression Model M for
Interval Data / Marta Garc{\'\i}a-B{\'a}rzana, Ana
Colubi and Erricos J. Kontoghiorghes \\
Hybrid Least-Squares Regression Modelling Using
Confidence Bounds / B{\"u}lent T{\"u}tmez and Uzay
Kaymak \\
Testing the Variability of Interval Data: An
Application to Tidal Fluctuation / Ana Bel{\'e}n
Ramos-Guajardo and Gil Gonz{\'a}lez-Rodr{\'\i}guez \\
Comparing the Medians of a Random Interval Defined by
Means of Two Different L1 Metrics / Beatriz Sinova and
Stefan Van Aelst \\
Comparing the Representativeness of the 1-norm Median
for Likert and Free-response Fuzzy Scales / Sara de la
Rosa de S{\'a}a and Stefan Van Aelst \\
Fuzzy Probability Distributions in Reliability
Analysis, Fuzzy HPD-regions, and Fuzzy Predictive
Distributions / Reinhard Viertl and Shohreh Mirzaei
Yeganeh \\
SAFD --- An R Package for Statistical Analysis of Fuzzy
Data / Wolfgang Trutschnig, Mar{\'\i}a Asunci{\'o}n
Lubiano and Julia Lastra \\
Statistical Reasoning with Set-Valued Information:
Ontic vs. Epistemic Views / Didier Dubois \\
Pricing of Catastrophe Bond in Fuzzy Framework / Piotr
Nowak and Maciej Romaniuk \\
Convergence of Heuristic-based Estimators of the GARCH
Model / Alexandru Mandes, Cristian Gatu and Peter
Winker \\
Lasso-type and Heuristic Strategies in Model Selection
and Forecasting / Ivan Savin and Peter Winker \\
Streaming-Data Selection for Gaussian-Process Modelling
/ Dejan Petelin and Jus Kocijan \\
Change Detection Based on the Distribution of p-Values
/ Katharina Tschumitschew and Frank Klawonn \\
Advanced Analysis of Dynamic Graphs in Social and
Neural Networks / Pascal Held, Christian Moewes,
Christian Braune, Rudolf Kruse and Bernhard A. Sabel
\\
Fuzzy Hyperinference-Based Pattern Recognition / Mario
Rosario Guarracino, Raimundas Jasinevicius, Radvile
Krusinskiene and Vytautas Petrauskas \\
Dynamic Data-Driven Fuzzy Modeling of Software
Reliability Growth / Olga Georgieva \\
Dynamic Texture Recognition Based on Compression
Artifacts / Dubravko {\'C}ulibrk, Matei Mancas and
Vladimir {\'C}rnojevic \\
The Hubness Phenomenon: Fact or Artifact? / Thomas Low,
Christian Borgelt, Sebastian Stober and Andreas
N{\"u}rnberger \\
Proximity-Based Reference Resolution to Improve Text
Retrieval / Shima Gerani, Mostafa Keikha and Fabio
Crestani \\
Derivation of Linguistic Summaries is Inherently
Difficult: Can Association Rule Mining Help? / Janusz
Kacprzyk and S{\l}awomir Zadro{\.z}ny \\
Mining Local Connectivity Patterns in fMRI Data /
Kristian Loewe, Marcus Grueschow and Christian Borgelt
\\
Fuzzy Clustering based on Coverings / Didier Dubois and
Daniel S{\'a}nchez \\
Decision and Regression Trees in the Context of
Attributes with Different Granularity Levels / Kemal
Ince and Frank Klawonn \\
Stochastic Convergence Analysis of Metaheuristic
Optimisation Techniques / Nikos S. Thomaidis and
Vassilios Vassiliadis \\
Comparison of Multi-objective Algorithms Applied to
Feature Selection / {\"O}zlem T{\"u}rk{\c{s}}en, Susana
M. Vieira, Jos{\'e} F. A. Madeira, Ay{\c{s}}en Apaydin
and Jo{\~a}o M. C. Sousa",
}
@Book{Khaled:2013:IAC,
editor = "Elleithy Khaled and Sobh Tarek",
booktitle = "Innovations and advances in computer, information,
systems sciences, and engineering",
title = "Innovations and advances in computer, information,
systems sciences, and engineering",
volume = "152",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-1-4614-3535-8",
ISBN = "1-4614-3534-X, 1-4614-3535-8 (e-book)",
ISBN-13 = "978-1-4614-3534-1, 978-1-4614-3535-8 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Lecture notes in electrical engineering",
acknowledgement = ack-nhfb,
subject = "Computer science; Congresses; Computer architecture;
Software engineering; Computer networks",
tableofcontents = "Change Rate Concepts and their Realization in the
MM and S: A Computer Program for Modeling and
Simulation of Dynamic Systems / Nguyen Van Sinh \\
A Software Architecture for Inventory Management System
/ Taner Arsan, Emrah Ba{\c{s}}kan, Emrah Ar and Zeki
Bozku{\c{s}} \\
Libraries Opt for More Online Sources / Zeenath Reza
Khan and Sreejith Balasubramanian \\
Emerging Threats, Risk and Attacks in Distributed
Systems: Cloud Computing / Isabel Del C. Legu{\'\i}as
Ayala, Manuel Vega and Miguel Vargas-Lombardo \\
Cognitive Antenna System for Sustainable Adaptive Radio
Interfaces / Ligia Cremene and Nicolae Cri{\c{s}}an \\
Introducing the Concept of Information Pixels and the
Storing Information Pixels Addresses Method as an
Efficient Model for Document Storage / Mohammad A.
ALGhalayini \\
Introducing the Concept of Back-Inking as an Efficient
Model for Document Retrieval (Image Reconstruction) /
Mohammad A. ALGhalayini \\
Automating the Transformation From a Prototype to a
Method of Assembly / Yuval Cohen, Gonen Singer, Maya
Golan and Dina Goren-Bar \\
Collaborative and Non-Collaborative Dynamic Path
Prediction Algorithm for Mobile Agents Collision
Detection with Dynamic Obstacles in 3D Space / Elmir
Babovic \\
Website Analysis of Top 100 Most Valuable Companies in
Romania / Lavinia D. Rusu and Liciniu A. Kov\`cs \\
Comparison of PI and Fractional PI Controllers on a
Hydraulic Canal Using Pareto Fronts / Y. Chang \\
Remote Sensing Investigation of Red Mud Catastrophe and
Results of Image Processing Assessment / J. Berke, V.
Kozma-Bogn\`r, P. Burai, L. D. Kov\`ts and T. Tomor, et
al \\
802.11e QoS Performance Evaluation / Yunus Simsek and
Hetal Jasani \\
Evaluation of Different Designs to Represent Missing
Information in SQL Databases / Erki Eessaar and Elari
Saal \\
Mobile English Learning System: A Conceptual Framework
for Malaysian Primary School / Saipunidzam Mahamad,
Fatimah Annor Ahmad Rashid, Mohammad Noor Ibrahim and
Rozana Kasbon \\
Dynamic Cache Miss-Rate Reduction / Mazen AbuZaher,
Bayan Alayoubi, Basma Alefeshat and Abdelwadood Mesleh
\\
Agent Simulation Group on the Robocup 3D Realization of
Basic Motions / Min Zhou, Jia Wu, Hao Zheng, Xiaoming
Liu and Renhao Zhou \\
Key Generations Model for Mobile Cryptosystems / Rushdi
Hamamreh \\
Development of Stakeholder Oriented Corporate
Information Security Objectives / Margareth Stoll \\
Stakeholder Oriented Information Security Reporting /
Margareth Stoll \\
Experimenting with Watchdog Implementation on a
Real-Life Ad hoc Network: Monitoring Selfish Behavior /
Tirthankar Ghosh and Tian Hou \\
Power Consumption Evaluation for Cooperative
Localization Services / Patrick Seeling \\
A Modified Banker's Algorithm / Youming Li \\
Courses Enrollment Pattern Analysis / Nur Fatihah Abdul
Rahim, Shakirah Mohd Taib and Saipunidzam Mahamad \\
Integration of Safety and Smartness Using Cloud
Services: An Insight to Future / Neha Tekriwal,
Madhumita and P. Venkata Krishna \\
A Versioning Subsystem of Metamodeling System /
R{\"u}nno Sgirka \\
Difficulties in Understanding Object Oriented
Programming Concepts / Soly Mathew Biju \\
Real-Time System for Monitoring and Analyzing
Electrocardiogram on Cell Phone / O. Mu{\~n}oz-Ramos,
O. Starostenko, V. Alarcon-Aquino and C. Cruz-Perez \\
Research of Camera Track Based on Image Matching / Yuan
Wang \\
Curriculum Design Change of the Industrial Engineering
BA Program / Eszter Bogd{\'a}ny, {\'A}gnes Balogh,
Gabriella Cerh\`ti, Tibor Csizmadia and R\v ka
Pol\`k-Weldon \\
Comparing Two Methods of Sound Spatialization:
Vector-Based Amplitude Panning (VBAP) Versus Linear
Panning (LP) / Jonathan Cofino, Armando Barreto and
Malek Adjouadi \\
Contrast Enhancement in Image Pre-Compensation for
Computer Users with Visual Aberrations / Jian Huang,
Armando Barreto, Malek Adjouadi and Miguel Alonso \\
Interaction with 3D Environments Using Multi-Touch
Screens / Francisco Ortego, Naphtali Rishe, Armando
Barreto and Melek Adjouadi \\
TCP with Extended Window Scaling / Michal Olsovsk{\'y}
and Margar{\'e}ta Koto{\v{c}}ov{\'a} \\
Offering SaaS as SOA Services / Ali Bou Nassif and
Miriam A. M. Capretz \\
Using Conceptual Mini Games for Learning: The Case of
``The Numbers' Race'' (TNR) Application / C. T.
Panagiotakopoulos and M. E. Sarris \\
Visual Cryptography Based on Optical Image Projection /
Rita Palivonaite, Algiment Aleksa and Minvydas
Ragulskis \\
A New Service Offered by Digital Radio for Vehicle
Drivers / Cabani Adnane and Mouzna Joseph \\
Separation of Concerns in Extensible Control Systems /
Martin Rytter and Bo N{\o}rregaard J{\o}rgensen \\
Illicit Image Detection: An MRF Model Based Stochastic
Approach / Mofakharul Islam, Paul Watters, John
Yearwood, Mazher Hussain and Lubaba A. Swarna \\
Illicit Image Detection Using Erotic Pose Estimation
Based on Kinematic Constraints / Mofakharul Islam, Paul
Watters, John Yearwood, Mazher Hussain and Lubaba A.
Swarna \\
Energy Efficient Public Key Cryptography in Wireless
Sensor Networks / Vladimir Cervenka, Dan Komosny, Lukas
Malina and Lubomir Mraz \\
Implementation of VLSB Steganography Using Modular
Distance Technique / Sahib Khan and Muhammad Haroon
Yousaf \\
A Graphic User Interface for H-Infinity Static Output
Feedback Controller Design / J. Gadewadikar, K. Horvat
and O. Kuljaca \\
Active Contour Texture Segmentation in Modulus Wavelet
Feature Spaces / Ashoka Jayawardena and Paul Kwan \\
A Framework for Verification of Fuzzy Rule Bases
Representing Clinical Guidelines / M. Esposito and D.
Maisto \\
Communication Impact on Project Oriented Teaching in
Technology Supported Education / Martin Misut and
Katarina Pribilova \\
A Failure Modes and Effects Analysis of Mobile Health
Monitoring Systems / Marcello Cinque, Antonio Coronato
and Alessandro Testa \\
SemFus: Semantic Fusion Framework Based on JDL / Havva
Alizadeh Noughabi, Mohsen Kahani and Behshid Behkamal
\\
Development of GUI Based Test and Measurement
Facilities for Studying Properties of MOS Devices in
Clean Room Environment / Shaibal Saha and Supratic
Chakraborty \\
Prediction of Failure Risk Through Logical Decision
Trees in Web Service Compositions / Byron
Portilla-Rosero, Jaime A. Guzm{\'a}n and Giner
Alor-Hern{\'a}ndez \\
SEC-TEEN: A Secure Routing Protocol for Enhanced
Efficiency in Wireless Sensor Networks / Alkore
Alshalabi Ibrahim, Abu Khalil Tamer and Abuzneid
Abdelshakour \\
An Integration of UML-B and Object-Z in Software
Development Process / Mehrnaz Najafi and Hassan
Haghighi \\
Algorithm for Dynamic Traffic Rerouting and Congestion
Prevention in IP Networks / Martin Hrub{\'y}, Margar\v
ta Koto{\v{c}}ov{\'a} and Michal Olsovsk{\'y} \\
Fovea Window for Wavelet-Based Compression / J. C.
Galan-Hernandez, V. Alarcon-Aquino, O. Starostenko and
J. M. Ramirez-Cortes \\
Energy Aware Data Compression in WSN / Roshanak Izadian
and Mohammad Taghi Manzuri \\
Energy Consumption Text and Image Data Compression in
WSNs / Roshanak Izadian and Mohammad Taghi Manzuri \\
New QoS Framework for Mobile Ad hoc Networks Based on
the Extension of Existing QoS Models / Peter Magula and
Margar{\'e}ta Koto{\v{c}}ov{\'a} \\
Method for Data Collection and Integration into 3D
Architectural Model / L. Kurik, V. Sinivee, M. Lints
and U. Kallavus \\
Statistical Analysis to Export an Equation in Order to
Determine Heat of Combustion in Blends of Diesel Fuel
with Biodiesel / C. G. Tsanaktsidis, V. M. Basileiadis,
K. G. Spinthoropoulos, S. G. Christidis and A.
[Epsilon]. Garefalakis \\
The Retail Banking Adverse Selection: RCBS Calculator
Solution / M. Hedvicakova, I. Soukal and J. Nemecek \\
Project Management in Public Administration Sector / M.
Hedvicakova \\
Access Point Checking to Improve Security in Wireless
Infrastructure Networks / Ammar Odeh and Miad Faezipour
\\
Comparison of Fractional PI Controller with Classical
PI using Pareto Optimal Fronts / O. J. Moraka \\
A Pattern-Based Approach for Representing
Condition-Action Clinical Rules into DSSs / A.
Minutolo, M. Esposito and G. De Pietro \\
Authorization of Proxy Digital Signature in Workflow
Systems / Samir Fazlagic and Narcis Behlilovic \\
Semi-Agile Approach to Software Development Process /
Deniss Kumlander \\
The Influence of Student Body-Talk Reaction in
Formulating Effective Teaching Strategy / Ahmad Sofian
Shminan and Runhe Huang \\
Interactive Mind Map Desktop Widget: A Proposed Concept
/ Tan Wei Xuan, Shakirah Mohd Taib and Saipunidzam
Mahamad \\
An Algorithm for Replication in Distributed Databases /
Adrian Runceanu and Marian Popescu \\
General Dispatching of Lignite Mining Pit / Constantin
Cercel and Florin Grofu \\
Towards Improving the Statscan[TM] X-Ray Image Quality
through Sliding-Mode Control of the C-Arm / M. Esmail,
M. Tsoeu and L. John \\
Mechanical Energy Conversion to Electromagnetic Energy
for Magnetic Fluids: Theoretical Fundaments and
Applications / Aurel-George Popescu and Adrian Runceanu
\\
Initial Steps Towards Distributed Implementation of
M-Urgency / Shivsubramani Krishnamoorthy, Arun
Balasubramanian and Ashok K. Agrawala \\
Optimal Selection of Components in Fault Detection
Based on Principal Component Analysis / Patricia Helen
Khwambala \\
E-Learning Environment Identification System: Error
Injection and Patterns Dynamics / Deniss Kumlander \\
Energy Consumption by Deploying a Reactive Multi-Agent
System Inside Wireless Sensor Networks / Alcides
Montoya and Demetrio Ovalle \\
Network Intrusion Detection System Based on SOA
(NIDS-SOA): Enhancing Interoperability Between IDS /
Wagner Elvio de Loiola Costa, Denivaldo Lopes, Zair
Abdelouahab and Bruno Froz \\
Lyrebird: A Learning Object Repository Based on a
Domain Taxonomy Model / Ingrid Durley Torres, Jaime
Alberto Guzman Luna and Jovani Alberto Jimenez Builes
\\
Design Process and Building Simulation / Heitor da
Costa Silva, Clarissa SartoriZiebell, Lennart Bertram
P{\"o}hls and Mariana Moura Bagnati \\
Behavioral Models with Alternative Alphabets / Mohammed
Lafi and Jackson Carvalho \\
Watermark Singular-Values Encryption and Embedding in
the Frequency Domain / Chady El Moucary and Bachar El
Hassan \\
Business Intelligence Made Simple / Vasso Stylianou,
Andreas Savva and Spyros Spyrou \\
A Process Model for Supporting the Management of
Distance Learning Courses Through an Agile Approach /
Am\v lia Ac\`cia M. Batista, Zair Abdelouahab,
Denivaldo Lopes and Pedro Santos Neto \\
Numerical Modeling of Electromagnetic Induction Heating
Process Using an Inductor with Constant Step Between
Turns / Mihaela Novac, Ovidiu Novac, Mircea Gordan and
Cornelia Gordan \\
Satisficing-Based Approach to Resolve Feature
Interactions in Control Systems / Jan Corfixen
S{\o}rensen and Bo N{\o}rregaard J{\o}rgensen \\
Properties Evaluation of an Approach Based on
Probability-Possibility Transformation / M. Pota, M.
Esposito and G. De Pietro \\
Functional Verification of Class Invariants in
CleanJava / Carmen Avila and Yoonsik Cheon \\
Normalization Rules of the Object-Oriented Data Model /
Vojt{\v{e}}ch Merunka and Jakub T\ocirc{u}ma \\
Location Based Overlapping Mobility Aware Network Model
/ Abdul Razaque, Aziz Alotaibi and Khaled Elliethy \\
Expert System for Evaluating Learning Management
Systems Based on Traceability / E. Valdez-Silva, P. Y.
Reyes, M. A. Alvarez, J. Rojas and V.
Menendez-Dominguez \\
How Variability Helps to Make Components More Flexible
and Reusable / Yusuf Altunel and Abd{\"u}l Halim Zaim
\\
Computing and Automation in the AEC Industry: Early
Steps Towards a Mass Customized Architecture / Neander
Silva, Diogo Santos and Ecilamar Lima \\
Three Dimensional SPMD Matrix-Matrix Multiplication
Algorithm and a Stacked Many-Core Processor
Architecture / Ahmed S. Zekri \\
Face: Fractal Analysis in Cell Engineering / K. P. Lam,
D. J. Collins and J. B. Richardson \\
A First Implementation of the Delay Based Routing
Protocol / Eric Gamess, Daniel G\`mez and Paul Marrero
\\
Different Aspects of Data Stream Clustering / Madjid
Khalilian, Norwati Mustapha, Md Nasir Sulaiman and Ali
Mamat \\
Teaching Computer Ethics Via Current News Articles /
Reva Freedman \\
Designing and Integrating a New Model of Semi-Online
Vehicle's Fines Control System / Anas Al-okaily, Qassim
Bani Hani, Laiali Almazaydeh, Omar Abuzaghleh and Zenon
Chaczko \\
State Diagnosis of a Lignite Deposit by Monitoring its
Surface Temperature with a Thermovision Camera / Alina
Dinca \\
A Framework Intelligent Mobile for Diagnosis Contact
Lenses by Applying Case Based Reasoning / Eljilani
Mohammed",
}
@Book{Lumban:2013:RPD,
editor = "Gaol Ford Lumban",
booktitle = "Recent progress in data engineering and {Internet}
technology. {Volume 1}",
title = "Recent progress in data engineering and {Internet}
technology. {Volume 1}",
volume = "156",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-28807-4",
ISBN = "3-642-28806-5, 3-642-28807-3 (e-book)",
ISBN-13 = "978-3-642-28806-7, 978-3-642-28807-4 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Lecture notes in electrical engineering",
acknowledgement = ack-nhfb,
subject = "Data mining; Congresses; Internet; Database
management; Information technology",
tableofcontents = "Design of Fault Detection Filter for T-S Fuzzy
Time-Delay Systems / Wu Di, Hou Jiuyang and Li Qiang
\\
Autonomous and Pervasive Computing-Based Knowledge
Service / Keedong Yoo \\
Short-Term Traffic Flow Forecasting Based on
Periodicity Similarity Characteristics / Chunjiao Dong,
Chunfu Shao, Dan Zhao and Yinhong Liu \\
An Eigenvector-Based Kernel Clustering Approach to
Detecting Communities in Complex Networks / Lidong Fu
and Lin Gao \\
Distributed Gaussian Mixture Learning Based on
Variational Approximations / Behrouz Safarinejadian \\
The Function and Relationship of Verbal and Nonverbal
Cues in IM Interpersonal Communication / Lu Xiaoyan and
Yao Jinyun \\
Using Version Control System to Construct Ownership
Architecture Documentations / Po-Han Huang, Dowming Yeh
and Wen-Tin Lee \\
DF-ReaL2Boost: A Hybrid Decision Forest with Real
L2Boosted Decision Stumps / Zaman Md. Faisal, Sumi S.
Monira and Hideo Hirose \\
Magazine Image Retrieval with Camera-Phone / Cheng
Yang, Jie Yang and Deying Feng \\
Statistical Clustering and Times Series Analysis for
Bridge Monitoring Data / Man Nguyen, Tan Tran and Doan
Phan \\
Towards Smart Advisor's Framework Based on Multi Agent
Systems and Data Mining Methods / Madjid Khalilian \\
Automatic LSA-Based Retrieval of Synonyms (for Search
Space Extension) / Kamil Ek{\v{s}}tein and Lubom{\'\i}r
Kr{\v{c}}m{\'a}{\v{r}} \\
Research on Method of Wavelet Function Selection to
Vibration Signal Filtering / Xiangzhong Meng and
Jianghong Wang \\
Time Series Subsequence Matching Based on Middle Points
and Clipping / Nguyen Thanh Son and Duong Tuan Anh \\
Effects of Spatial Scale in Cellular Automata Model for
Land Use Change / Guanwei Zhao \\
Prediction Model Based on PCA - DRKM-RBF / Wang Zhe,
Sun Wen-wen, Zhou Tong and Zhou Chun-guang \\
A Topic Detection and Tracking System with TF-Density /
Shu-Wei Liu and Hsien-Tsung Chang \\
Community Identification of Financial Market Based on
Affinity Propagation / Lei Hong, Shi-Min Cai,
Zhong-Qian Fu and Pei-Ling Zhou \\
Research on Optimization of Target Oil Wells for CO2
Huff and Puff in Yushulin Oil Well / Erlong Yang,
Huaidong He and Lei Wang \\
A Secret Embedding Scheme by Means of Re-indexing VQ
Codebook upon Image Processing / Cheng-Ta Huang,
Wei-Jen Wang, Shiuh-Jeng Wang and Jonathan C. L. Liu
\\
Knowledge Management System: Combination of Experts'
Knowledge and Automatic Improvement / Hiroshi Sugimura
and Kazunori Matsumoto \\
Evaluating Recommender System Using Multiagent-Based
Simulator / Case Study of Collaborative Filtering
Simulation / Ryosuke Saga, Kouki Okamoto, Hiroshi Tsuji
and Kazunori Matsumoto \\
On the Constraint Satisfaction Method for University
Personal Course Scheduling / Yukio Hori, Takashi
Nakayama and Yoshiro Imai \\
Factors Affecting Productivity of Fractured Horizontal
Wells / Li Tiejun, Guo Dali, Tang Zhihao and Ke Xijun
\\
Informal Lightweight Knowledge Extraction from
Documents / Francesco Colace, Massimo De Santo and
Paolo Napoletano \\
A Classification Model Using Emerging Patterns
Incorporating Item Taxonomy / Hiroyuki Morita and
Yukinobu Hamuro \\
Synchronised Data Logging, Processing and Visualisation
Framework for Heterogeneous Sensor Networks / Matthias
Vodel, Rene Bergelt, Matthias Glockner and Wolfram
Hardt \\
Design of SENIOR: A Case Study Using / Per
Karlstr{\"o}m, Wenbiao Zhou and Dake Liu \\
GWDL: A Graphical Workflow Definition Language for
Business Workflows / M. Sultan Mahmud, Saad Abdullah
and Shazzad Hosain \\
A Feature Representation and Extraction Method for
Malicious Code Detection Based on LZW Compression
Algorithm / Yingxu Lai, Hongnan Liu and Zhen Yang \\
CASM: Coherent Automated Schema Matcher / Rudraneel
Chakraborty, Faiyaz Ahmed and Shazzad Hosain \\
Research on Constructing 3D Geological Model of the
Construction Layers in Daxing New City Area of Beijing
City / Xiao Huang, Yingshuang Wang, Naiqi Shen, Yufeng
Liu and Gang Chen \\
Preliminary Study of HGML-Based Virtual Scene
Construction and Interaction Display / Yang Wenhui, Xie
Yan and Miao Fang \\
The Next-Generation Search Engine: Challenges and Key
Technologies / Bo Lang, Xianglong Liu and Wei Li \\
An Efficient k-Anonymization Algorithm with Low
Information Loss / Md. Nurul Huda, Shigeki Yamada and
Noboru Sonehara \\
Design and Realization of Data Gateway for Large-Scale
Alternately Supervisory System / Yong Bai, Zhangli Lan
and Yi Zhou \\
Research on Mass Geospatial Raster Data Processing
Based on Map/Reduce Model / Fang Yin, Min Feng and Jia
Song \\
A Parallel-Enabled Frequency Offset Estimation Scheme
for Optical Coherent Receivers / Zhi-Yu Li, Xiao-Bo
Meng, Xian Zhou, Xue Chen and Yang-Yang Fan, et al \\
Process-Driven Integrated Product Design Platform / Bo
Zhao, Jun Luo, Rongmei Nie, Xiaojun Hu and Hui Zhao \\
Segmentation of Audio Visual Malay Digit Utterances
Using Endpoint Detection / Mohd Ridzuwary Mohd Zainal,
Aini Hussain and Salina Abdul Samad \\
Data Mining in Clinical Decision Support Systems /
Liljana Aleksovska-Stojkovska and Suzana Loskovska \\
Spatial Influence Index Effects in the Analysis of
Epidemic Data / Fatima F. Santos and Nelson F. F.
Ebecken \\
EPON's Research on Transmission of Sampling Value in
Process Level of Digital Substation / Qiu Ming-yi and
Xu Xi-dong \\
Intelligent Clinical Information Systems for the
Cardiovascular Diseases / Nan-Chen Hsieh, Huan-Chao
Keh, Chung-Yi Chang and Chien-Hui Chan \\
Forecast the Foreign Exchange Rate between Rupiah and
US Dollar by Applying Grey Method / Tien-Chin Wang,
Su-Hui Kuo, Truong Ngoc Anh and Li Li \\
Simulating Patent Knowledge Contexts / Jussi Kantola
and Aviv Segev \\
Apply Data Mining on Location-Based Healthcare System /
Chen-Yang Cheng, Ja-Hao Chen, Tsuo-Hung Lan, Chin-Hong
Chan and Yu-Hsun Huang \\
Using Fuzzy Logic in Virus-Mediated Gene Therapy / Arie
H. Tan and Fabian H. Tan \\
Towards Using Cached Data Mining for Large Scale
Recommender Systems / Swapneel Sheth and Gail Kaiser
\\
BAX-SET PLUS: A Taxonomic Navigation Model to
Categorize, Search and Retrieve Semantic Web Services /
Jaime Alberto Guzm{\'a}n Luna, Ingrid Durley Torres
Pardo and Jovani Alberto Jim\v nez Builes \\
Text-Transformed Image Classification Based on Data
Compression / Nuo Zhang and Toshinori Watanabe \\
Numerical Analysis of Touch Mode Capacitive Pressure
Sensor Using Graphical User Interface / Moon Kyu Lee,
Jeongho Eom and Bumkyoo Choi \\
Multithreading Embedded Multimedia Application for
Vehicle Blackbox / Jajin Koo, Jeongheon Choi, Youjip
Won and Seongjin Lee \\
An EMD-Oriented Hiding Scheme for Reversible Data
Embedding in Images / Chi-Yao Weng, Hung-Min Sun,
Cheng-Hsing Yang and Shiuh-Jeng Wang \\
Gait Control for Guide Dog Robot to Walk and Climb a
Step / Manabu Kosaka \\
Artificial Neural Network-Based Lot Number Recognition
for Cadastral Map / Dave E. Marcial, Ed Darcy Dy,
Silvin Federic Maceren and Erivn Rygl Sarno \\
The Novel Virtual Reality Fixture Design and Assembly
System (VFDAS) / Qian Cao and Qiang Li \\
Multi-phenomenon Oriented Embedded Software Fault
Diagnosis / Shunkun Yang, Ge Lin and Lu Minyan \\
Asymptotic Behavior of Random Walks with Resting State
in Ergodic Environments / Xiang-dong Liu and Li-ye Zhu
\\
Research on the Spatio-temporal Pass Index Model in
Emergency Evacuation / Liu Yi, Zhu Haiguo, Huang
Quanyi, Zhao Yunxiu and Yuan Shengcheng, et al \\
On Issues of Multi-path Routing in Overlay - Networks
Using Optimization Algorithms / Sameer Qazi and Tim
Moors \\
Reviews on Intelligent Building Systems in China / Feng
Jiang, Min Gao and Zhijun Wang \\
XBeGene: Scalable XML Documents Generator by Example
Based on Real Data / Manami Harazaki, Joe Tekli, Shohei
Yokoyama, Naoki Fukuta and Richard Chbeir, et al \\
A Preliminary Activity Recognition of WSN Data on
Ubiquitous Health Care for Physical Therapy / S.-Y.
Chiang, Y.-C. Kan, Y.-C. Tu and H.-C. Lin \\
Development and Evaluation of Question Templates for
Text Mining / Norio Ishii, Yuri Suzuki, Takashi Fujii
and Hironobu Fujiyoshi \\
Segmentation of Fibro-Glandular Discs in Digital
Mammograms Using Log-Normal Distribution / Y. A. Reyad,
A. El-Zaart, H. Mathkour, M. Al-Zuair and H. Al-Salman
\\
An OOAD Model of Program Understanding System's Parser
/ Norazimah Rosidi, Nor Fazlida Mohd Sani and Abdul
Azim Abd Ghani \\
The Unified Modeling Language Model of an Object
Oriented Debugger System / Noor Afiza Mohd Ariffin, Nor
Fazlida Mohd Sani and Rodziah Atan \\
A FPGA-Based Real Time QRS Complex Detection System
Using Adaptive Lifting Scheme / Hang Yu, Lixiao Ma, Ru
Wang, Lai Jiang and Yan Li, et al \\
A Novel Temporal-Spatial Color Descriptor
Representation for Video Analysis / Xiang-wei Li, Gang
Zheng and Kai Zhao",
}
@Proceedings{Natarajan:2013:ACIb,
editor = "Meghanathan Natarajan and Nagamalai Dhinaharan and
Chaki Nabendu",
booktitle = "Advances in computing and information technology:
{Proceedings of the Second International Conference on
Advances in Computing and Information Technology
(ACITY), July 13--15, 2012, Chennai, India, Volume 2}",
title = "Advances in computing and information technology:
{Proceedings of the Second International Conference on
Advances in Computing and Information Technology
(ACITY), July 13--15, 2012, Chennai, India, Volume 2}",
volume = "177",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-31552-7",
ISBN = "3-642-31551-8, 3-642-31552-6 (e-book)",
ISBN-13 = "978-3-642-31551-0, 978-3-642-31552-7 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Advances in intelligent systems and computing",
acknowledgement = ack-nhfb,
subject = "Computer networks; Congresses; Computer science;
Information technology; Computer vision; Data mining",
tableofcontents = "Analysis, Control and Synchronization of
Hyperchaotic Zhou System via Adaptive Control /
Sundarapandian Vaidyanathan \\
Secured Ontology Matching Using Graph Matching / K.
Manjula Shenoy, K. C. Shet and U. Dinesh Acharya \\
Image Restoration Using Knowledge from the Image / S.
Padmavathi, K. P. Soman and R. Aarthi \\
Harmony-Based Feature Weighting to Improve the Nearest
Neighbor Classification / Ali Adeli, Mehrnoosh Sinaee,
M. Javad Zomorodian and Ali Hamzeh \\
Effectiveness of Different Partition Based Clustering
Algorithms for Estimation of Missing Values in
Microarray Gene Expression Data / Shilpi Bose, Chandra
Das, Abirlal Chakraborty and Samiran Chattopadhyay \\
MACREE - A Modern Approach for Classification and
Recognition of Earthquakes and Explosions / K. Vijay
Krishnan, S. Viginesh and G. Vijayraghavan \\
Building Concept System from the Perspective of
Development of the Concept / Cheng Xian-yi, Shen
Xue-hua and Shi Quan \\
E-Government Adoption: A Conceptual Demarcation /
Rahmath Safeena and Abdullah Kammani \\
Expert Webest Tool: A Web Based Application, Estimate
the Cost and Risk of Software Project Using Function
Points / Ajay Jaiswal and Meena Sharma \\
A Web-Based Adaptive and Intelligent Tutor by Expert
Systems / Hossein Movafegh Ghadirli and Maryam
Rastgarpour \\
Traffic Light Synchronization / K. Sankara Nayaki, N.
U. Nithin Krishnan, Vivek Joby and R. Sreelakshmi \\
Partition Sort versus Quick Sort: A Comparative Average
Case Analysis with Special Emphasis on Parameterized
Complexity / Niraj Kumar Singh and Soubhik Chakraborty
\\
Removal of Inconsistent Training Data in Electronic
Nose Using Rough Set / Anil Kumar Bag, Bipan Tudu,
Nabarun Bhattacharyya and Rajib Bandyopadhyay \\
A Decentralised Routing Algorithm for Time Critical
Applications Using Wireless Sensor Networks / R. A.
Roseline and P. Sumathi \\
Application Security in Mobile Devices Using Unified
Communications / Ramakrishna Josyula \\
Iterative Image Fusion Using Fuzzy Logic with
Applications / Srinivasa Rao Dammavalam, Seetha Maddala
and M. H. M. Krishna Prasad \\
A Review on Clustering of Web Search Result / Mansaf
Alam and Kishwar Sadaf \\
Application of Information Theory for Understanding of
HLA Gene Regulation in Leukemia / Durjoy Majumder \\
Improving Security in Digital Images through
Watermarking Using Enhanced Histogram Modification /
Vidya Hari and A. Neela Madheswari \\
Survey on Co-operative P2P Information Exchange in
Large P2P Networks / S. Nithya and K. Palanivel \\
SNetRS: Social Networking in Recommendation System /
Jyoti Pareek, Maitri Jhaveri, Abbas Kapasi and Malhar
Trivedi \\
Linguistic Conversion of Syntactic to Semantic Web Page
/ G. Nagarajan and K. K. Thyagarajan \\
Two-Stage Rejection Algorithm to Reduce Search Space
for Character Recognition in OCR / Srivardhini
Mandipati, Gottumukkala Asisha, S. Preethi Raj and S.
Chitrakala \\
Transforming Election Polling from Electronic Voting to
Cloud as a Software Service in India / P. Vidhya \\
Area Efficient Architecture for Frequency Domain Multi
Channel Digital Down Conversion for Randomly Spaced
Signals / Latha Sahukar and M. Madhavi Latha \\
New Distances for Improving Progressive Alignment
Algorithm / Ahmed Mokaddem and Mourad Elloumi \\
Service-Oriented Architecture (SOA) and Semantic Web
Services for Web Portal Integration / T. G. K. Vasista
and Mohammed A. T. AlSudairi \\
Evolutionary Multi-Objective Optimization for Data-Flow
Testing of Object-Oriented Programs / P. Maragathavalli
and S. Kanmani \\
The Simulation of the Assembling Production Process /
R{\'o}bert Pauli{\v{c}}ek, Tom{\`a}s Haluska and Pavel
Va{\v{z}}can \\
Parallel Performance of Numerical Algorithms on
Multi-core System Using OpenMP / Sanjay Kumar Sharma
and Kusum Gupta \\
Efficiency Improvement of a-Si:H/[mu]c-Si:H Tandem
Solar Cells by Adding a-SiOx:H Layer between Ag Nano
Particles and the Active Layer / Ozcan Abdulkadir and
Dhinaharan Nagamalai \\
Unsupervised Hidden Topic Framework for Extracting
Keywords (Synonym, Homonym, Hyponymy and Polysemy) and
Topics in Meeting Transcripts / J. I. Sheeba, K.
Vivekanandan, G. Sabitha and P. Padmavathi \\
Comprehensive Study of Estimation of Path Duration in
Vehicular Ad Hoc Network / R. S. Raw, Vikas Toor and N.
Singh \\
Securing DICOM Format Image Archives Using Improved
Chaotic Cat Map Method / M. Arun Fera and Suresh
Jaganathan \\
Brain Tumor Segmentation Using Genetic Algorithm and
Artificial Neural Network Fuzzy Inference System
(ANFIS) / Minakshi Sharma and Sourabh Mukharjee \\
Model Oriented Security Requirements Engineering
(MOSRE) Framework for Web Applications / P. Salini and
S. Kanmani \\
Axial T2 Weighted MR Brain Image Retrieval Using Moment
Features / Abraham Varghese, Reji Rajan Varghese,
Kannan Balakrishnan and J. S. Paul \\
Securing Data from Black Hole Attack Using AODV Routing
for Mobile Ad Hoc Networks / V. Kamatchi, Rajeswari
Mukesh and Rajakumar \\
ISim: A Novel Power Aware Discrete Event Simulation
Framework for Dynamic Workload Consolidation and
Scheduling in Infrastructure Clouds / R. Jeyarani, N.
Nagaveni, S. Srinivasan and C. Ishwarya \\
Processing RDF Using Hadoop / Mehreen Ali, K. Sriram
Bharat and C. Ranichandra \\
An Ant Colony Optimization Based Load Sharing Technique
for Meta Task Scheduling in Grid Computing / T.
Kokilavani and D. I. George Amalarethinam \\
Optimum Sub-station Positioning Using Hierarchical
Clustering / Shabbiruddin, Sandeep Chakravorty and
Amitava Ray \\
Comparison of PCA, LDA and Gabor Features for Face
Recognition Using Fuzzy Neural Network / Dhanya S.
Pankaj and M. Wilscy \\
Investigations on Object Constraints in Unified
Software Development Process / Meena Sharma and Rajeev
G. Vishwakarma \\
Vehicle Safety Device (Airbag) Specific Classification
of Road Traffic Accident Patterns through Data Mining
Techniques / S. Shanthi and R. Geetha Ramani \\
Design of Video Conferencing Solution in Grid /
Soumilla Sen and Ajanta De Sarkar \\
Survey of Computer-Aided Diagnosis of Thyroid Nodules
in Medical Ultrasound Images / Deepika Koundal, Savita
Gupta and Sukhwinder Singh \\
A Brief Review of Data Mining Application Involving
Protein Sequence Classification / Suprativ Saha and
Rituparna Chaki \\
Hybrid Algorithm for Job Scheduling: Combining the
Benefits of ACO and Cuckoo Search / R. G. Babukarthik,
R. Raju and P. Dhavachelvan \\
Hybrid Ant Colony Optimization and Cuckoo Search
Algorithm for Job Scheduling / R. Raju, R. G.
Babukarthik and P. Dhavachelvan \\
Particle Based Fluid Animation Using CUDA / Uday A.
Nuli and P. J. Kulkarni \\
A Novel Model for Encryption of Telugu Text Using
Visual Cryptography Scheme / G. Lakshmeeswari, D. Rajya
Lakshmi, Y. Srinivas and G. Hima Bindu \\
Frequent Queries Selection for View Materialization /
T. V. Vijay Kumar, Gaurav Dubey and Archana Singh \\
HURI - A Novel Algorithm for Mining High Utility Rare
Itemsets / Jyothi Pillai, O. P. Vyas and Maybin Muyeba
\\
SMOTE Based Protein Fold Prediction Classification / K.
Suvarna Vani and S. Durga Bhavani \\
Conceptual Application of List Theory to Data
Structures / B. K. Tripathy and S. S. Gantayat \\
A Comprehensive Study on Multifactor Authentication
Schemes / Kumar Abhishek, Sahana Roshan, Prabhat Kumar
and Rajeev Ranjan \\
Quality Assessment Based Fingerprint Segmentation /
Kumud Arora and Poonam Garg \\
Improved Algorithms for Anonymization of Set-Valued
Data / B. K. Tripathy, A. Jayaram Reddy, G. V. Manusha
and G. S. Mohisin \\
An Efficient Flash Crowd Attack Detection to Internet
Threat Monitors (ITM) Using Honeypots / K. Munivara
Prasad, M. Ganesh Karthik and E. S. Phalguna Krishna
\\
Hierarchical Directed Acyclic Graph (HDAG) Based
Preprocessing Technique for Session Construction / S.
Chitra and B. Kalpana \\
Extending Application of Non-verbal Communication to
Effective Requirement Elicitation / Md. Rizwan Beg, Md.
Muqeem and Md. Faizan Farooqui \\
A Critical Review of Migrating Parallel Web Crawler /
Md. Faizan Farooqui, Md. Rizwan Beg and Md. Qasim Rafiq
\\
Parallel Character Reconstruction Expending Compute
Unified Device Architecture / Anita Pal, Kamal Kumar
Srivastava and Atul Kumar \\
A Novel Algorithm for Obstacle Aware RMST Construction
during Routing in 3D ICs / Prasun Ghosal, Satrajit Das
and Arindam Das - 530 00 \\
Study of the EEG Signals of Human Brain for the
Analysis of Emotions / Ashish R. Panat and Anita S.
Patil \\
A Dynamic Approach for Mining Generalised Sequential
Patterns in Time Series Clinical Data Sets / M.
Rasheeda Shameem, M. Razia Naseem, N. K. Subanivedhi
and R. Sethukkarasi \\
Motion Correction in Physical Action of Human Body
Applied to Yogasana / Geetanjali Kale and Varsha Patil
\\
Improvement the Bag of Words Image Representation Using
Spatial Information / Mohammad Mehdi Farhangi, Mohsen
Soryani and Mahmood Fathy \\
Left Object Detection with Reduced False Positives in
Real-Time / Aditya Piratla, Monotosh Das and
Jayalakshmi Surendran \\
Adaptive Fusion Based Hybrid Denoising Method for
Texture Images / Preety D. Swami and Alok Jain \\
An Efficient De-noising Technique for Fingerprint Image
Using Wavelet Transformation / Ashish Kumar Dass and
Rabindra Kumar Shial \\
Detection of Optic Disc by Line Filter Operator
Approach in Retinal Images / R. Murugan and Reeba Korah
\\
An Extension of FFT Based Image Registration / P.
Thangavel and R. Kokila \\
Scene Text Extraction from Videos Using Hybrid Approach
/ A. Thilagavathy, K. Aarthi and A. Chilambuchelvan --
530 00 \\
MSB Based New Hybrid Image Compression Technique for
Wireless Transmission / S. N. Muralikrishna, Meghana
Ajith and K. B. Ajitha Shenoy \\
Multi-temporal Satellite Image Analysis Using
Unsupervised Techniques / C. S. Arvind, Ashoka Vanjare,
S. N. Omkar, J. Senthilnath and V. Mani, et al \\
Separable Discrete Hartley Transform Based Invisible
Watermarking for Color Image Authentication (SDHTIWCIA)
/ J. K. Mandal and S. K. Ghosal \\
Normalised Euclidean Distance Based Image Retrieval
Using Coefficient Analysis / Nilofar Khan and Wasim
Khan \\
SoC Modeling for Video Coding with Superscalar
Projection / S. K. Fairooz and B. K. Madhavi \\
Invisible Image Watermarking Using Z Transforms (IIWZT)
/ J. K. Mandal and Rakesh Kanji \\
Region Identification of Infected Rice Images Using the
Concept of Fermi Energy / Santanu Phadikar, Jaya Sil
and Asit KumarDas \\
Unsymmetrical Trimmed Midpoint as Detector for Salt and
Pepper Noise Removal / K. Vasanth, V. Jawahar Senthil
Kumar and V. Elanangai \\
Identification of Handwritten Text in Machine Printed
Document Images / Sandipan Banerjee \\
Optimization of Integration Weights for a
Multibiometric System with Score Level Fusion / S. M.
Anzar and P. S. Sathidevi \\
A Two Stage Combinational Approach for Image Encryption
/ H. S. Sharath Kumar, H. T. Panduranga and S. K.
Naveen Kumar \\
Wavelet SIFT Feature Descriptors for Robust Face
Recognition / Nerella Arun Mani Kumar and P. S.
Sathidevi \\
Image Denoising Based on Neutrosophic Wiener Filtering
/ J. Mohan, A. P. Thilaga Shri Chandra, V. Krishnaveni
and Yanhui Guo \\
Modified Difference Expansion for Reversible
Watermarking Using Fuzzy Logic Based Distortion Control
/ Hirak Kumar Maity, Santi P. Maity and Debashis Maity
\\
A Novel Genetic Algorithm Based Data Embedding
Technique in Frequency Domain Using Z Transform
(ANGAFDZT) / J. K. Mandal, A. Khamrui, S. Chakraborty,
P. Sur and S. K. Datta, et al \\
Speckle Noise Reduction Using Fourth Order Complex
Diffusion Based Homomorphic Filter / Jyothisha J. Nair
and V. K. Govindan \\
A New Hybrid Approach for Denoising Medical Images /
Deepa Bharathi and Sumithra Manimegalai Govindan \\
Detection of Cerebral Aneurysm by Performing
Thresholding-Spatial Filtering-Thresholding Operations
on Digital Subtraction Angiogram / Jubin Mitra and
Abhijit Chandra",
}
@Proceedings{Natarajan:2013:ACIc,
editor = "Meghanathan Natarajan and Nagamalai Dhinaharan and
Chaki Nabendu",
booktitle = "Advances in computing and information technology:
{Proceedings of the Second International Conference on
Advances in Computing and Information Technology
(ACITY), July 13--15, 2012, Chennai, India, Volume 3}",
title = "Advances in computing and information technology:
{Proceedings of the Second International Conference on
Advances in Computing and Information Technology
(ACITY), July 13--15, 2012, Chennai, India, Volume 3}",
volume = "178",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-31600-5",
ISBN = "3-642-31599-2, 3-642-31600-X (e-book)",
ISBN-13 = "978-3-642-31599-2, 978-3-642-31600-5 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Advances in intelligent systems and computing",
acknowledgement = ack-nhfb,
subject = "Computer science; Congresses; Information technology;
Artificial intelligence",
tableofcontents = "Soft Computing Approach for Modeling Genetic
Regulatory Networks / Khalid Raza and Rafat Parveen \\
A Novel Algorithm for Hub Protein Identification in
H.Sapiens Using Global Amino Acid Features / B. L.
Aswathi, Baharak Goli and Achuthsankar S. Nair \\
Rough Set Based Classification on Electronic Nose Data
for Black Tea Application / Anil Kumar Bag, Bipan Tudu,
Nabarun Bhattacharyya and Rajib Bandyopadhyay \\
Hybrid Technique for Effective Knowledge Representation
/ Poonam Tanwar, T. V. Prasad and Kamlesh Datta \\
A Language Independent Approach to Develop Urdu Stemmer
/ Mohd. Shahid Husain, Faiyaz Ahamad and Saba Khalid
\\
The Role of Empirical Mode Decomposition on Emotion
Classification Using Stimulated EEG Signals / Anwesha
Khasnobish, Saugat Bhattacharyya, Garima Singh, Arindam
Jati and Amit Konar, et al \\
Discovering Dispathcing Rules for Job Shop Scheduling
Using Data Mining / R. Balasundaram, N. Baskar and R.
Siva Sankar \\
Gene Selection and Classification Rule Generation for
Microarray Dataset / Soumen Kumar Pati and Asit Kumar
Das \\
A Novel Rule Based Classifier for Mining Temporal
Medical Databases Using Fuzzy Rough Set Approach / U.
Keerthika, R. Sethukkarasi and A. Kannan \\
Implanted CPW Fed Monopole Antenna for Biomedical
Applications / S. Ashok Kumar and T. Shanmuganantham
\\
Mining of Association Patterns in Social Network Data
(Face Book 100 Universities) through Data Mining
Techniques and Methods / P. Nancy, R. Geetha Ramani and
Shomona Gracia Jacob \\
An Analysis of Privacy Preservation Techniques in Data
Mining / Abhishek Sachan, Devshri Roy and P. V. Arun
\\
Discovery of Knowledge Patterns in Lymphographic
Clinical Data through Data Mining Methods and
Techniques / Shomona Gracia Jacob, R. Geetha Ramani and
P. Nancy \\
Rule Discovery with a Multi Objective Cultural
Algorithm / Sujatha Srinivasan and Sivakumar
Ramakrishnan \\
Electro-oculogram Based Classification of Eye Movement
Direction / Anwesha Banerjee, Amit Konar, R. Janarthana
and D. N. Tibarewala \\
Review on Off-Line Signature Verification Techniques
for Reducing Forgeries/Fraud / Natasha Sharma and
Munish Kumar \\
Analyzing the Performance of Watermarking Based on
Swarm Optimization Methods / A. Lavanya and V.
Natarajan \\
Chemical Sensors Employed in Electronic Noses: A Review
/ Syeda Erfana Zohora, A. M. Khan and Nisar Hundewale
\\
Psycho-analysis Using Natural Language Processing and
Neural Networks / Agam Goyal, Rashi Kacker and Hima
Bindu Maringanti \\
A Naive Approach for Prediction of Sectorial Stock
Market / Neeraj Kharya and Jyothi Pillai \\
Materialized View Selection Using Iterative Improvement
/ T. V. Vijay Kumar and Santosh Kumar \\
Oil Spill Cleaning Up Using Swarm of Robots / Emaad
Mohamed H. Zahugi, Mohamed M. Shanta and T. V. Prasad
\\
Dependency Driven Semantic Approach to Product Features
Extraction and Summarization Using Customer Reviews /
V. Ravi Kumar and K. Raghuveer \\
Fuzzy Driven Multi-issue Agent Negotiation on
Electronic Marketplace / Mohammed S. Karim and Joseph
Pierluissi \\
Fuzzy Terrain-Based Navigation on Urban Terrains / Wong
Kit Yee, S. Parasuraman and V. Ganapathy \\
Mobile Robot Navigation: Neural Q-Learning / Soh Chin
Yun, S. Parasuraman and V. Ganapathy \\
Word Spotting in Cursive Handwritten Documents Using
Modified Character Shape Codes / Sayantan Sarkar \\
A Theoretical Process Model for Smartphones / Frances
Chevonne Dancer, David A. Dampier, Jacqueline M.
Jackson and Natarajan Meghanathan \\
A Visualization Tool for Analyzing the Design of
Physical and Network Layers Parameters of a Wireless
Network / Jasmine Ara{\'u}jo, Josiane Rodrigues, Simone
Fraiha, Herm{\'\i}nio Gomes and Nandamudi Lankalapalli
Vijaykumar, et al \\
Rough Set Model for Prediction of Trustworthy Web
Services / Sankaranarayanan Murugan and Veilumuthu
Ramachandran \\
A Unified Framework for Pervasive Healthcare Medical
Computing Based on SOA / K. M. Anandkumar and C.
Jayakumar \\
KM System Evaluation - A Hybrid Approach Using Four
Dimension Metric Database and WAM / D. Venkata
Subramanian, Angelina Geetha, K. M. Mehata and K.
Mohammed Hussain \\
An Effective Approach to Detect DDos Attack / R. Manoj
and C. Tripti \\
An Intensified Approach for Privacy Preservation in
Incremental Data Mining / V. Rajalakshmi and G. S.
Anandha Mala \\
A Novel Approach for Dynamic Web Service Composition
through Network Analysis with Backtracking / M. Suresh
Kumar and P. Varalakshmi \\
A Cryptographic Algorithm Analysis for Security Threats
of Semantic E-Commerce Web (SECW) for Electronic
Payment Transaction System / Akhilesh Dwivedi, Abhishek
Dwivedi, Suresh Kumar, Satish Kumar Pandey and Priyanka
Dabra \\
Query Optimization over Web Services Using a Mixed
Approach / Debajyoti Mukhopadhyay, Dhaval Chandarana,
Rutvi Dave, Sharyu Page and Shikha Gupta \\
Composition of Location Based Services in Decentralized
Registry Based Architecture / Kavita Kumari, Melwyn
D'Souza and V. S. Ananthanarayana \\
Development of Agro-tagger and Recommendation
Generation Using Social Network for Agro-produce
Marketing / Priyanka Joshi, Sanjay Chaudhary and Vikas
Kumar \\
Strategic Composition of Semantic Web Services Using
SLAKY Composer / P. Sandhya and M. Lakshmi \\
An Ontology Based Model for User Profile Building Using
Web Page Segment Evaluation / K. S. Kuppusamy and G.
Aghila \\
Physical Abstraction Method (RBIR) for OFDM System /
Banda Sreenivas and R. Jawahar Lal \\
Dynamic Ontology Construction for E-Trading / K.
AnithaKumari, G. SudhaSadasivam, T. Aruna and S.
Christie Sajitha \\
Sense Disambiguation Technique for Information
Retrieval in Web Search / Rekha Jain and G. N. Purohit
\\
A New Approach for Noise Removal and Video Object
Segmentation Using Color Based Fuzzy C-Means Technique
/ R. Revathi and M. Hemalatha \\
Comparative Study on Strengths and Weaknesses of Trust
Algorithms in Semantic Web Based Networks / Prachi
Girdhar, Suresh Kumar and Manjeet Singh \\
Performance Comparison of Rectangular and Circular
Patch Microstrip Yagi Antenna / K. RamaDevi, A. Jhansi
Rani and A. Mallikarjuna Prasad \\
Semantic Based Image Retrieval System for Web Images /
K. K. Umesh and Suresha \\
SPARQLGen: Generation of SPARQL from Pseudo BGP /
Dipendra Singh Mandloi, Pokhar Mal Jat and Sanjay
Chaudhary \\
Preprocessing of Automated Blood Cell Counter Data and
Discretization of Data Using Chi Merge Algorithm in
Clinical Pathology / D. Minnie and S. Srinivasan \\
Building OWL Ontology: LMSO-Library Management System
Ontology / Ayesha Banu, Syeda Sameen Fatima and Khaleel
Ur Rahman Khan \\
M-ADTCP: An Approach for Congestion Control in MANET /
B. C. Sreenivas, G. C. Bhanu Prakash and K. V.
Ramakrishnan \\
VCR: Vehicular Cloud for Road Side Scenarios / Dimal
Baby, R. D. Sabareesh, R. A. K. Saravanaguru and
Arunkumar Thangavelu \\
Improved Autonomous Power Control MAC Protocol for
MANETs / Sohan Kumar Yadav and D. K. Lobiyal \\
Reconfigurable RNS FIR Filter Using Higher Radix
Multiplier / J. Britto Pari and S. P. Joy Vasantha Rani
\\
Design of Efficient Reversible Multiplier / H. G.
Rangaraju, Aakash Babu Suresh and K. N. Muralidhara \\
CAD for Delay Optimization of Symmetrical FPGA
Architecture through Hybrid LUTs/PLAs / Sunil Kr.
Singh, R. K. Singh, M. P. S. Bhatia and Saurabh P.
Singh \\
Analysis on Impact of Behavioral Modeling in
Performance of Synthesis Process / R. Uma and P.
Dhavachelvan \\
A VLSI Architecture for Wavelet Based Image Compression
/ Jayaraj U. Kidav, P. A. Ajeesh, Drisya Vasudev, V. S.
Deepak and Aiswarya Menon \\
CMOS 8-Bit Current-Steering Digital Random Return to
Zero DAC / Piyush K. Mathurkar and Madan B. Mali \\
Design of a Novel Reversible Full Adder and Reversible
Full Subtractor / A. V. AnanthaLakshmi and G. F. Sudha
\\
Operator Scheduling Revisited: A Multi-objective
Perspective for Fine-Grained DVS Architecture / Rajdeep
Mukherjee, Priyankar Ghosh, Pallab Dasgupta and Ajit
Pal \\
A Scheme for Improving Bit Efficiency for Residue
Number System / Chaitali Biswas Dutta, Partha Garai and
Amitabha Sinha \\
Obstacle Aware RMST Generation Using Non-Manhattan
Routing for 3D ICs / Prasun Ghosal, Arindam Das and
Satrajit Das \\
A Novel Routing Algorithm for On-Chip Communication in
NoC on Diametrical 2D Mesh Interconnection Architecture
/ Prasun Ghosal and Tuhin Subhra Das \\
Reduction of Crosstalk Noise and Delay in VLSI
Interconnects Using Schmitt Trigger as a Buffer and
Wire Sizing / Shikha Singh and V. Sulochana Verma \\
Low Power Design Analysis of PLL Components in
Submicron Technology / Kanika Garg and V. Sulochana
Verma \\
A New Class of Obstacle Aware Steiner Routing in 3D
Integrated Circuits / Prasun Ghosal, Satrajit Das and
Arindam Das \\
Comparative Study and Analysis of Short Channel Effects
for 180nm and 45nm Transistors / Kiran Agarwal Gupta,
Dinesh K. Anvekar and V. Venkateswarlu",
}
@Book{Pan:2013:RAI,
editor = "Jeng-Shyang Pan and others",
booktitle = "Recent advances in information hiding and
applications",
title = "Recent advances in information hiding and
applications",
volume = "40",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-3-642-28580-6",
ISBN = "3-642-28579-1, 3-642-28580-5 (e-book)",
ISBN-13 = "978-3-642-28579-0, 978-3-642-28580-6 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
series = "Intelligent systems reference library",
acknowledgement = ack-nhfb,
subject = "Data protection",
tableofcontents = "An Image Data Hiding Scheme Based on Vector
Quantization and Graph Coloring / Shuai Yue, Zhi-Hui
Wang and Chin-Chen Chang \\
The Copyright Protection System for Android Platform /
Yueh-Hong Chen and Hsiang-Cheh Huang \\
Reversible Data Hiding by Coefficient Adjustment
Algorithm / Ching-Yu Yang and Wu-Chih Hu \\
ICA-Based Image and Video Watermarking / Jiande Sun and
Ju Liu \\
Content Based Invariant Image Watermarking with High
Capacity / Leida Li, Jianying Zhang and Baolong Guo \\
Single Bitmap Block Truncation Coding of Color Images
Using Cat Swarm Optimization / Shi-Yu Cui, Zhi-Hui
Wang, Pei-Wei Tsai, Chin-Chen Chang and Shuai Yue \\
Application of Genetic-Based Wavelet Packet
Watermarking for Copyright Protection / Hsiang-Cheh
Huang and Yueh-Hong Chen \\
Lossless Text Steganography in Compression Coding /
Chin-Feng Lee and Hsing-Ling Chen \\
A Fast and Low-Distortion Capacity Adaptive
Synchronized Acoustic-to-Acoustic Steganography Scheme
/ Xuping Huang, Yoshihiko Abe and Isao Echizen \\
Video Watermarking with Shot Detection",
}
@Book{Shen:2013:MSA,
editor = "Xiaoping Shen and Ahmed I. Zayed",
booktitle = "Multiscale Signal Analysis and Modeling",
title = "Multiscale Signal Analysis and Modeling",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvii + 378",
year = "2013",
DOI = "https://doi.org/10.1007/978-1-4614-4145-8",
ISBN = "1-4614-4144-7, 1-4614-4145-5 (e-book)",
ISBN-13 = "978-1-4614-4144-1, 978-1-4614-4145-8 (e-book)",
LCCN = "TA342 .M855 2013",
bibdate = "Fri Nov 7 06:43:00 MST 2014",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/bibnet/authors/s/stenger-frank.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
abstract = "\booktitle{Multiscale Signal Analysis and Modeling}
presents recent advances in multiscale analysis and
modeling using wavelets and other systems. This book
also presents applications in digital signal processing
using sampling theory and techniques from various
function spaces, filter design, feature extraction and
classification, signal and image
representation/transmission, coding, nonparametric
statistical signal processing, and statistical learning
theory. This book also: (1) Discusses recently
developed signal modeling techniques, such as the
multiscale method for complex time series modeling,
multiscale positive density estimations, Bayesian
Shrinkage Strategies, and algorithms for data adaptive
statistics; (2) Introduces new sampling algorithms for
multidimensional signal processing; (3) Provides
comprehensive coverage of wavelets with presentations
on waveform design and modeling, wavelet analysis of
ECG signals and wavelet filters; (4) Reviews features
extraction and classification algorithms for multiscale
signal and image processing using Local Discriminant
Basis (LDB); (5) Develops multi-parameter regularized
extrapolating estimators in statistical learning
theory. \booktitle{Multiscale Signal Analysis and
Modeling} is an ideal book for graduate students and
practitioners, especially those working in or studying
the field of signal/image processing, telecommunication
and applied statistics. It can also serve as a
reference book for engineers, researchers and educators
interested in mathematical and statistical modeling.",
acknowledgement = ack-nhfb,
remark = "This monograph is a collection of chapters authored or
coauthored by friends and colleagues of Professor
Gilbert Walter in celebration of his 80th birthday.",
subject = "Multiscale modeling; Signal processing; Digital
techniques; Mathematics; Sampling (Statistics);
Multiscale modeling.; Sampling (Statistics);
Mathematics.",
tableofcontents = "Part 1: Sampling \\
Convergence of Classical Cardinal Series / W. R. Madych
\\
Improved Approximation via Use of Transformations /
Frank Stenger, Maha Youssef and Jenny Niebsch \\
Generalized Sampling in $L^2(R^d)$ Shift-Invariant
Subspaces with Multiple Stable Generators / H. R.
Fern{\'a}ndez-Morales, A. G. Garc{\'i}a and G.
P{\'e}rez-Villal{\'o}n \\
Function Spaces for Sampling Expansions / M. Zuhair
Nashed and Qiyu Sun \\
Coprime Sampling and Arrays in One and Multiple
Dimensions / P. P. Vaidyanathan and Piya Pal \\
Chromatic Expansions and the Bargmann Transform / Ahmed
I. Zayed \\
Representation Formulas for Hardy Space Functions
Through the Cuntz Relations and New Interpolation
Problems / Daniel Alpay, Palle Jorgensen, Izchak
Lewkowicz and Itzik Marziano \\
Constructions and a Generalization of Perfect
Autocorrelation Sequences on $\mathbb{Z}$ / John J.
Benedetto and Somantika Datta \\
Part 2: Multiscale Analysis \\
On the Application of the SDLE to the Analysis of
Complex Time Series / Jianbo Gao, Jing Hu and Wen-wen
Tung \\
Wavelet Analysis of ECG Signals / En-Bing Lin, Megan
Haske, Marilyn Smith and Darren Sowards \\
Multiscale Signal Processing with Discrete Hermite
Functions / Dale H. Mugler and Anandi Mahadevan \\
Earth Mover's Distance-Based Local Discriminant Basis /
Bradley Marchand and Naoki Saito \\
Part 3: Statistical Analysis \\
Characterizations of Certain Continuous Distributions /
G. G. Hamedani \\
Bayesian Wavelet Shrinkage Strategies: A Review /
Norbert Rem{\'e}nyi and Brani Vidakovic \\
Multiparameter Regularization for Construction of
Extrapolating Estimators in Statistical Learning Theory
/ Shuai Lu, Sergiy Pereverzyev Jr. and Sivananthan
Sampath",
}
@Book{Zhu:2013:TSD,
editor = "Ce Zhu and others",
booktitle = "{$3$D-TV} system with depth-image-based rendering",
title = "{$3$D-TV} system with depth-image-based rendering",
publisher = pub-SV,
address = pub-SV:adr,
year = "2013",
DOI = "https://doi.org/10.1007/978-1-4419-9964-1",
ISBN = "1-4419-9963-9, 1-4419-9964-7 (e-book)",
ISBN-13 = "978-1-4419-9963-4, 978-1-4419-9964-1 (e-book)",
LCCN = "????",
bibdate = "Mon Jan 28 15:23:14 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.kb.dk:2100/KGL01",
acknowledgement = ack-nhfb,
subject = "3-D television; Image processing; Digital techniques;
Computer vision; Multimedia systems",
tableofcontents = "Part 1 \\
system overview \\
An Overview of 3D-TV System Using Depth-Image-Based
Rendering / Yin Zhao, Ce Zhu, Lu Yu and Masayuki
Tanimoto \\
Part 2 \\
Content generation \\
Generic Content Creation for 3D Displays / Frederik
Zilly, Marcus M{\"u}ller and Peter Kauff \\
Stereo Matching and Viewpoint Synthesis FPGA
Implementation / Chao-Kang Liao, Hsiu-Chi Yeh, Ke
Zhang, Vanmeerbeeck Geert and Tian-Sheuan Chang, et al
\\
DIBR-Based Conversion from Monoscopic to Stereoscopic
and Multi-View Video / Liang Zhang, Carlos V\`zquez,
Gr\v gory Huchet and Wa James Tam \\
Virtual View Synthesis and Artifact Reduction
Techniques / Yin Zhao, Ce Zhu and Lu Yu \\
Hole Filling for View Synthesis / Ismael Daribo, Hideo
Saito, Ismael Daribo, Ryo Furukawa and Shinsaku Hiura,
et al \\
LDV Generation from Multi-View Hybrid Image and Depth
Video / Anatol Frick and Reinhard Koch \\
Part 3 \\
Data compression and transmission \\
3D Video Compression / Karsten M{\"u}ller, Philipp
Merkle and Gerhard Tech \\
Depth Map Compression for Depth-Image-Based Rendering /
Gene Cheung, Antonio Ortega, Woo-Shik Kim, Vladan
Velisavljevic and Akira Kubota \\
Effects of Wavelet-Based Depth Video Compression /
Ismael Daribo, Hideo Saito, Ryo Furukawa, Shinsaku
Hiura and Naoki Asada \\
Transmission of 3D Video over Broadcasting / Pablo
Angueira, David de la Vega, Javier Morgade and Manuel
Mar{\'\i}a V\v lez \\
Part 4 \\
3D visualization and quality assessment \\
The Psychophysics of Binocular Vision / Philip M. Grove
\\
Stereoscopic and Autostereoscopic Displays / Phil
Surman \\
Subjective and Objective Visual Quality Assessment in
the Context of Stereoscopic 3D-TV / Marcus Barkowsky,
Kjell Brunnstr{\"o}m, Touradj Ebrahimi, Lina Karam and
Pierre Lebreton, et al \\
Visual Quality Assessment of Synthesized Views in the
Context of 3D-TV / Emilie Bosc, Patrick Le Callet, Luce
Morin and Muriel Pressigout",
}
@Proceedings{Storer:20xx:DXD,
editor = "James A. Storer and Martin Cohn",
key = "DCC 20xx",
booktitle = "{DCC 'XX}: Data Compression Conference",
title = "{DCC 'XX}: Data Compression Conference",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "??",
year = "20xx",
ISSN = "1068-0314 (print), 2375-0359 (electronic)",
ISSN-L = "1068-0314",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib",
note = "Annual conference proceedings series, mostly held at
Snowbird, UT, USA.",
URL = "",
acknowledgement = ack-ds,
rawdata = "Storer, James A., and Martin Cohn (eds.) (annual) {\it
DCC 'XX: Data Compression Conference}, Los Alamitos,
CA, IEEE Computer Society Press.",
series-URL = "http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000177",
}
