Sciweavers

790 search results - page 57 / 158
» Subexponential Parameterized Algorithms
Sort
View
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 5 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
OPODIS
2010
15 years 29 days ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
ICASSP
2010
IEEE
15 years 1 months ago
Learning in Gaussian Markov random fields
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
Thomas J. Riedl, Andrew C. Singer, Jun Won Choi
ICTAI
2007
IEEE
15 years 9 months ago
Ant Colony Optimization for Multi-Objective Optimization Problems
We propose in this paper a generic algorithm based on Ant Colony Optimization to solve multi-objective optimization problems. The proposed algorithm is parameterized by the number...
Inès Alaya, Christine Solnon, Khaled Gh&eac...
DCC
2001
IEEE
16 years 2 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler