Sciweavers

595 search results - page 77 / 119
» Languages Of Analogical Strings
Sort
View
ECAI
2004
Springer
15 years 3 months ago
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
IFIP
2004
Springer
15 years 3 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
IPPS
2002
IEEE
15 years 2 months ago
Compile/Run-Time Support for Thread Migration
This paper describes a generic mechanism to migrate threads in heterogeneous distributed environments. To maintain high portability and flexibility, thread migration is implement...
Hai Jiang, Vipin Chaudhary
NAACL
2007
14 years 11 months ago
Bayesian Inference for PCFGs via Markov Chain Monte Carlo
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an altern...
Mark Johnson, Thomas L. Griffiths, Sharon Goldwate...
NAACL
2004
14 years 11 months ago
Minimum Bayes-Risk Decoding for Statistical Machine Translation
We present Minimum Bayes-Risk (MBR) decoding for statistical machine translation. This statistical approach aims to minimize expected loss of translation errors under loss functio...
Shankar Kumar, William J. Byrne