1568 search results - page 16 / 314 » The problem of examination questions in algorithmics |
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
EWCBR
2004
Springer
2004
Springer
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
14 years 3 months ago
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
BMCBI
2007
13 years 9 months ago
2007
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
AAAI
1990
13 years 11 months ago
1990
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
RECOMB
2007
Springer
14 years 10 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...