Sciweavers

38 search results - page 4 / 8
» On Computing the Distinguishing Numbers of Trees and Forests
Sort
View
TCSV
2008
150views more  TCSV 2008»
13 years 7 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
RECOMB
2010
Springer
13 years 5 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
COLING
2010
13 years 2 months ago
Joint Parsing and Translation
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
Yang Liu, Qun Liu
ACL
2009
13 years 5 months ago
Forest-based Tree Sequence to String Translation Model
This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string tr...
Hui Zhang, Min Zhang, Haizhou Li, AiTi Aw, Chew Li...
ICONIP
2008
13 years 8 months ago
An Evaluation of Machine Learning-Based Methods for Detection of Phishing Sites
In this paper, we present the performance of machine learning-based methods for detection of phishing sites. We employ 9 machine learning techniques including AdaBoost, Bagging, S...
Daisuke Miyamoto, Hiroaki Hazeyama, Youki Kadobaya...