Sciweavers

2157 search results - page 150 / 432
» Binary ant algorithm
Sort
View
106
Voted
ISCIS
2009
Springer
15 years 5 months ago
Calculating the VC-dimension of decision trees
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin
84
Voted
SIGIR
2010
ACM
15 years 4 months ago
A ranking approach to target detection for automatic link generation
We focus on the task of target detection in automatic link generation with Wikipedia, i.e., given an N-gram in a snippet of text, find the relevant Wikipedia concepts that explai...
Jiyin He, Maarten de Rijke
EMNLP
2009
14 years 10 months ago
Better Synchronous Binarization for Machine Translation
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
121
Voted
JBCB
2010
138views more  JBCB 2010»
14 years 7 months ago
Hierarchical Classification of Gene Ontology Terms Using the Gostruct Method
Protein function prediction is an active area of research in bioinformatics. And yet, transfer of annotation on the basis of sequence or structural similarity remains widely used ...
Artem Sokolov, Asa Ben-Hur
119
Voted
LION
2009
Springer
210views Optimization» more  LION 2009»
15 years 7 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...