Skip to search formSkip to main contentSkip to account menu

Iterative compression

In computer science, iterative compression is an algorithmic technique for the design of fixed-parameter tractable algorithms, in which one element… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AlgorithmAlgorithmic paradigmComputer scienceExponential search

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Lossless Image Compression using Proposed Equations and JPEG-LS Prediction
This paper proposes a new lossless image compression technique which makes use of simple mathematical equations along with Joint… 
2016
2016
Live Prototyping
The technical skills required to effect functional and material changes to high fidelity prototypes can create barriers to the… 
2015
2015
User-centric base station clustering and sparse beamforming for cache-enabled cloud RAN
Cloud radio access network (Cloud RAN) is able to significantly improve the network capacity and energy efficiency through… 
2014
2014
ROCKAFELLAR'S PROXIMAL POINT ALGORITHM FOR A FINITE FAMILY OF MONOTONE OPERATORS
In this paper, we consider Rockafellar’s proximal point algorithm with viscosity method for a finite family of monotone operators… 
2013
2013
Assessing the quality of multilevel graph clustering
“Lifting up” a non-hierarchical approach to handle hierarchical clustering by iteratively applying the approach to hierarchically… 
2011
2011
H∞ Bounded Resilient state-feedback design for linear continuous-time systems – A robust control approach
The quadratic stabilization of LTI systems by bounded resilient state-feedback controllers is addressed. The controllers are… 
2011
2011
Fast high-order algorithms and well-conditioned integral equations for high-frequency sound-hard scattering problems
This text introduces 1) New Regularized Combined Field Integral Equations (CFIE-R) for the solution of frequency-domain sound… 
Review
2009
Review
2009
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed… 
2009
2009
Accumulate codes based on 1+D convolutional outer codes
A new construction of good, easily encodable, and soft-decodable codes is proposed in this paper. The construction is based on… 
2005
2005
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)