Sciweavers

860 search results - page 157 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
LICS
2002
IEEE
14 years 17 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
BCS
2008
13 years 9 months ago
A Customisable Multiprocessor for Application-Optimised Inductive Logic Programming
This paper describes a customisable processor designed to accelerate execution of inductive logic programming, targeting advanced field-programmable gate array (FPGA) technology. ...
Andreas Fidjeland, Wayne Luk, Stephen Muggleton
BMCBI
2008
133views more  BMCBI 2008»
13 years 7 months ago
LocateP: Genome-scale subcellular-location predictor for bacterial proteins
Background: In the past decades, various protein subcellular-location (SCL) predictors have been developed. Most of these predictors, like TMHMM 2.0, SignalP 3.0, PrediSi and Phob...
Miaomiao Zhou, Jos Boekhorst, Christof Francke, Ro...
ESWA
2006
122views more  ESWA 2006»
13 years 7 months ago
Transmembrane segments prediction and understanding using support vector machine and decision tree
In recent years, there have been many studies focusing on improving the accuracy of prediction of transmembrane segments, and many significant results have been achieved. In spite...
Jieyue He, Hae-Jin Hu, Robert W. Harrison, Phang C...
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu