Sciweavers

188 search results - page 35 / 38
» Web question answering: is more always better
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 7 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
A comparison study on algorithms of detecting long forms for short forms in biomedical text
Motivation: With more and more research dedicated to literature mining in the biomedical domain, more and more systems are available for people to choose from when building litera...
Manabu Torii, Zhang-Zhi Hu, Min Song, Cathy H. Wu,...
IJCNN
2007
IEEE
14 years 1 months ago
Agnostic Learning vs. Prior Knowledge Challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
BMCBI
2007
121views more  BMCBI 2007»
13 years 7 months ago
e-Science and biological pathway semantics
Background: The development of e-Science presents a major set of opportunities and challenges for the future progress of biological and life scientific research. Major new tools a...
Joanne S. Luciano, Robert D. Stevens
NN
2008
Springer
152views Neural Networks» more  NN 2008»
13 years 7 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...