17366 search results - page 320 / 3474 » New Revision Algorithms |
175
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
208
Voted
BMVC
2010
15 years 4 months ago
2010
In this paper, we propose a framework for predicting the performance of a vision algorithm given the input image or video so as to maximize the algorithm's ability to provide...
197
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
166
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
159
click to vote
ISSAC
2005
Springer
16 years 6 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...