2526 search results - page 16 / 506 » A Comparative Evaluation of Name-Matching Algorithms |
GECCO
2010
Springer
14 years 12 days ago
2010
Springer
In this paper, we compare the (1+1)-CMA-ES to the (1+2s m)CMA-ES, a recently introduced quasi-random (1+2)-CMAES that uses mirroring as derandomization technique as well as a sequ...
SC
2000
ACM
13 years 12 months ago
2000
ACM
Hierarchical algorithms such as multigrid applications form an important cornerstone for scientific computing. In this study, we take a first step toward evaluating parallel lan...
NIPS
2003
13 years 9 months ago
2003
Despite the popularity of connectionist models in cognitive science, their performance can often be difficult to evaluate. Inspired by the geometric approach to statistical model ...
LREC
2008
13 years 9 months ago
2008
In this paper we present two experiments conducted for comparison of different language identification algorithms. Short words-, frequent words- and n-gram-based approaches are co...
ISPA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...