2069 search results - page 37 / 414 » Linear time algorithms for Clobber |
143
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
120
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Linear discriminant analysis (LDA) is a wellknown dimension reduction approach, which projects highdimensional data into a low-dimensional space with the best separation...
151
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
143
Voted
CPM
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
159
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...