Sciweavers

20066 search results - page 4013 / 4014
» T Spaces
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
13 years 7 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
EMNLP
2009
13 years 4 months ago
Toward Completeness in Concept Extraction and Classification
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
Eduard H. Hovy, Zornitsa Kozareva, Ellen Riloff
BMCBI
2011
13 years 2 months ago
ASPDock: protein-protein docking algorithm using atomic solvation parameters model
Background: Atomic Solvation Parameters (ASP) model has been proven to be a very successful method of calculating the binding free energy of protein complexes. This suggests that ...
Lin Li, Dachuan Guo, Yangyu Huang, Shiyong Liu, Yi...
NETGAMES
2006
ACM
14 years 1 months ago
Cheat detection for MMORPG on P2P environments
In recent years, MMORPG has become popular. In order to improve scalability of game system, several P2P-based architectures have been proposed. However, in P2P-based gaming archit...
Takato Izaiku, Shinya Yamamoto, Yoshihiro Murata, ...
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 9 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
« Prev « First page 4013 / 4014 Last » Next »