409 search results - page 31 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
CISC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
106
click to vote
RTAS
2006
IEEE
15 years 3 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...