139 search results - page 21 / 28 » Computing crossing numbers in quadratic time |
BMCBI
2010
13 years 8 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Speech recognition is usually based on Hidden Markov Models (HMMs), which represent the temporal dynamics of speech very efficiently, and Gaussian mixture models, which do non-opt...
RECOMB
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
SIBGRAPI
2008
IEEE
14 years 3 months ago
2008
IEEE
We describe a procedure to solve the basic problem of Variable Lighting Photometric Stereo – namely, recovering the normal directions and intrinsic albedos at all visible points...
ICPP
2003
IEEE
14 years 1 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...