122 search results - page 15 / 25 » Evolutionary Search for Matrix Multiplication Algorithms |
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
101
click to vote
EVOW
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
141
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
BMCBI
2005
14 years 11 months ago
2005
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
GECCO
2008
Springer
15 years 21 days ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...