1789 search results - page 86 / 358 » Genetic Algorithms for Component Analysis |
136
click to vote
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
109
click to vote
IWANN
1995
Springer
15 years 6 months ago
1995
Springer
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
161
click to vote
ECRTS
2005
IEEE
15 years 9 months ago
2005
IEEE
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
123
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new tech...
NIPS
1993
15 years 4 months ago
1993
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...