1554 search results - page 214 / 311 » Parameterized Complexity and Approximation Algorithms |
121
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
AbstractInteractive evolutionary algorithms (IEA) often suffer from what is called the “user bottleneck.” In this paper, we propose and analyse a method to limit the user inter...
104
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
110
click to vote
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
116
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
103
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...