Sciweavers

44651 search results - page 8928 / 8931
» Generalized
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
14 years 9 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
CCR
2005
103views more  CCR 2005»
14 years 9 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
NAR
1998
70views more  NAR 1998»
14 years 9 months ago
Haemophilia B: database of point mutations and short additions and deletions--eighth edition
The eighth edition of the haemophilia B database (http://www.umds.ac.uk/molgen/haemBdatabase.htm ) lists in an easily accessible form all known factor IX mutations due to small ch...
F. Giannelli, P. M. Green, S. S. Sommer, M.-C. Poo...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 9 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
ECAI
2010
Springer
14 years 8 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
« Prev « First page 8928 / 8931 Last » Next »