Sciweavers

1913 search results - page 213 / 383
» Group Input Machine
Sort
View
ICML
1996
IEEE
16 years 4 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
SIGSOFT
2009
ACM
16 years 4 months ago
Refactoring for reentrancy
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...
Jan Wloka, Manu Sridharan, Frank Tip
RECOMB
2004
Springer
16 years 4 months ago
A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
Haifeng Li, Tao Jiang
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 months ago
Feature Weighted SVMs Using Receiver Operating Characteristics.
Support Vector Machines (SVMs) are a leading tool in classification and pattern recognition and the kernel function is one of its most important components. This function is used...
Shaoyi Zhang, M. Maruf Hossain, Md. Rafiul Hassan,...
ALT
2006
Springer
16 years 28 days ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber