6365 search results - page 239 / 1273 » Fast Local Computation Algorithms |
184
click to vote
PAMI
2010
15 years 4 months ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
147
click to vote
ICPP
1989
IEEE
15 years 10 months ago
1989
IEEE
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...
137
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
157
click to vote
CAP
2010
15 years 1 months ago
2010
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
164
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...