Sciweavers

2107 search results - page 229 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
INTERSPEECH
2010
13 years 4 months ago
Deep-structured hidden conditional random fields for phonetic recognition
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
Dong Yu, Li Deng
BMCBI
2006
95views more  BMCBI 2006»
13 years 9 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
NAACL
2007
13 years 10 months ago
Analysis and System Combination of Phrase- and N-Gram-Based Statistical Machine Translation Systems
In the framework of the Tc-Star project, we analyze and propose a combination of two Statistical Machine Translation systems: a phrase-based and an N-gram-based one. The exhaustiv...
Marta R. Costa-Jussà, Josep Maria Crego, Da...
MOC
2002
185views more  MOC 2002»
13 years 9 months ago
Repunit R49081 is a probable prime
The Repunit R49081 = (1049081 - 1)/9 is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included. Rep...
Harvey Dubner
AIPS
2010
13 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...