Sciweavers

3502 search results - page 179 / 701
» From Machine Learning to Machine Reasoning
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...
CLEF
2001
Springer
15 years 11 months ago
iCLEF 2001 at Maryland: Comparing Term-for-Term Gloss and MT
For the first interactive Cross-Language Evaluation Forum, the Maryland team focused on comparison of term-for-term gloss translation with full machine translation for the documen...
Jianqiang Wang, Douglas W. Oard
ECTEL
2006
Springer
15 years 10 months ago
From the Analysis of Community Activity to the Appropriation of New Tools. A Methodological Approach for the Development of Info
More and more CoPs have chosen virtual environments and services to support their activities. However, recent research has underlined several problems: the lack of adequate scaffol...
Bernadette Charlier, France Henri, Amaury Daele, M...

Book
545views
17 years 2 months ago
Artificial Intelligence: A Modern Approach
"Artificial Intelligence (AI) is a big field, and this is a big book. We have tried to explore the full breadth of the field, which encompasses logic, probability, and continu...
Stuart Russell and Peter Norvig