2930 search results - page 167 / 586 » The optimal sequence compression |
119
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
Pre-processing algorithms improve the quality of a compression system by removing unimportant data before encoding. This enhances both the visual quality and coding efficiency of ...
122
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We present theoretical results pertaining to the ability of ℓp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we ...
137
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
144
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
166
Voted
MICRO
1993
IEEE
15 years 8 months ago
1993
IEEE
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...