Optimal Trellis-Based Buffered Compression and Fast Approximations

IEEE Transactions on Image Processing - United States
doi 10.1109/83.265978
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Fast LP-based Approximations for Geometric Packing and Covering Problems

2020English

Fast Approximations for Boundary Element Based Brittle Fracture Simulation

ACM Transactions on Graphics
Computer GraphicsComputer-Aided Design
2016English

Partitions for Optimal Approximations

International Journal of Mathematical Analysis
2013English

Fast Buffered Delay Estimation Considering Process Variations

2007English

Fast Embedding Technique for Dirty Paper Trellis Watermarking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Effective and Fast Near Duplicate Detection via Signature-Based Compression Metrics

Mathematical Problems in Engineering
MathematicsEngineering
2016English

A Fast Fractal Image Compression Method Based on Entropy

Progress in Computer Vision and Image Analysis
2009English

Fast Weighted Universal Transform Coding: Toward Optimal, Low Complexity Bases for Image Compression

English

An Optimal Seed Based Compression Algorithm for DNA Sequences

Advances in Bioinformatics
BiochemistryBiomedical EngineeringComputer Science ApplicationsGeneticsMolecular Biology
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy