Sciweavers

589 search results - page 24 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
MT
2006
106views more  MT 2006»
14 years 9 months ago
Example-based machine translation based on tree-string correspondence and statistical generation
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
Zhan-yi Liu, Haifeng Wang, Hua Wu
CIDM
2009
IEEE
15 years 4 months ago
Evolving decision trees using oracle guides
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...
Ulf Johansson, Lars Niklasson
POPL
2011
ACM
14 years 15 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
BMCBI
2007
147views more  BMCBI 2007»
14 years 9 months ago
Predicting combinatorial binding of transcription factors to regulatory elements in the human genome by association rule mining
Background: Cis-acting transcriptional regulatory elements in mammalian genomes typically contain specific combinations of binding sites for various transcription factors. Althoug...
Xochitl C. Morgan, Shulin Ni, Daniel P. Miranker, ...
79
Voted
COMAD
2008
14 years 11 months ago
Native Multidimensional Indexing in Relational Databases
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
David Hoksza, Tomás Skopal