3206 search results - page 261 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
201
click to vote
MST
2002
15 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
191
click to vote
COLING
2010
15 years 1 months ago
2010
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
187
click to vote
IPL
1998
15 years 6 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
153
click to vote
JSW
2006
15 years 6 months ago
2006
A novel hybrid genetic algorithm (GA) for jointly optimizing source and channel codes is presented in this paper. The algorithm first uses GA for the coarse search of source and ch...
164
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
The problem of multiple sequence alignment is important for bioinformatics. This problem is widely studied and a popular tool to solve this problem is Clustal X. This work introdu...