227 search results - page 3 / 46 » Complexity Results for Compressing Optimal Paths |
TIP
2002
14 years 10 months ago
2002
Abstract--This paper deals with the design and implementation of an image transform coding algorithm based on the integer wavelet transform (IWT). First of all, criteria are propos...
TIT
2008
14 years 11 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
107
click to vote
ESA
2005
Springer
15 years 4 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
TMM
2002
14 years 10 months ago
2002
In this paper a hybrid fractal and Discrete Cosine transform (DCT) coder is developed. Drawing on the ability of DCT to remove inter-pixel redundancies and on the ability of fracta...
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...