1554 search results - page 40 / 311 » Parameterized Complexity and Approximation Algorithms |
120
click to vote
IJCV
2000
15 years 4 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
154
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
161
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
131
click to vote
JDA
2011
14 years 11 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
122
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...