1709 search results - page 259 / 342 » Comparing the Performance of Database Selection Algorithms |
163
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Word sense disambiguation (WSD) algorithms attempt to select the proper sense of ambiguous terms in text. Resources like the UMLS provide a reference thesaurus to be u...
251
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
145
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...
150
click to vote
IPMI
2005
Springer
15 years 10 months ago
2005
Springer
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
138
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...