18306 search results - page 420 / 3662 » Algorithmics in Exponential Time |
193
click to vote
ISSAC
2004
Springer
16 years 26 days 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...
173
click to vote
MICAI
2004
Springer
16 years 26 days ago
2004
Springer
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
204
click to vote
GECCO
2003
Springer
16 years 21 days ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
238
click to vote
COCO
2000
Springer
15 years 12 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
161
Voted
KDD
1998
ACM
15 years 11 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...