Sciweavers

52 search results - page 10 / 11
» The implementation of a computational grammar of French usin...
Sort
View
BMCBI
2005
162views more  BMCBI 2005»
13 years 5 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
ASIAMS
2007
IEEE
14 years 3 days ago
On Syntactic Composability and Model Reuse
Composability, the capability to select and assemble offthe-shelf model components in various combinations to satisfy user requirements, is an appealing approach in reducing the t...
Claudia Szabo, Yong Meng Teo
KRMED
2008
13 years 7 months ago
Essential SNOMED: Simplifying SNOMED-CT and supporting Integration with Health Information Models
SNOMED CT (SCT) has been designed and implemented in an era when health computer systems generally required terminology representations in the form of singular precoordinated conc...
Peter MacIsaac, Donald Walker, Rachel L. Richesson...
COLING
1992
13 years 7 months ago
The Kant System: Fast, Accurate, High-Quality Translation In Practical Domains
Knowledge-based interlingual machine translation systems produce semantically accurate translations, but typically require massive knowledge acquisition. Ongoing research and deve...
Eric Nyberg, Teruko Mitamura
SAC
2009
ACM
14 years 16 days ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...