1554 search results - page 89 / 311 » Parameterized Complexity and Approximation Algorithms |
130
click to vote
ISCAS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
126
click to vote
JC
1998
15 years 2 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
121
click to vote
ICIP
2010
IEEE
15 years 29 days ago
2010
IEEE
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
138
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
170
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...