Sciweavers

AAAI
2010
13 years 4 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
IKE
2004
13 years 6 months ago
Analogy and Deduction for Knowledge Discovery
Analogy-based hypothesis generation is a promising technique for knowledge discovery. However, some hypotheses generated are nonsensical. This paper describes a two-phased method ...
Jim Reynolds, Adam Pease, John Li
DMIN
2006
125views Data Mining» more  DMIN 2006»
13 years 6 months ago
Biomedical Hypothesis Generation and Testing by Evolutionary Computation
- Filtering the immense amount of data available electronically over the World Wide Web is an important task of search engines in data mining applications. Users when performing se...
Robert Kozma, Anna L. Buczak
LREC
2008
90views Education» more  LREC 2008»
13 years 6 months ago
Yet another Platform for Extracting Knowledge from Corpora
The research field of "extracting knowledge bases from text collections" seems to be mature: its target and its working hypotheses are clear. In this paper we propose a ...
Francesca Fallucchi, Fabio Massimo Zanzotto
ICMLA
2007
13 years 6 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
FLAIRS
2008
13 years 6 months ago
CANDEL: An Algorithm for Same-Sentence Pronominal Resolution
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
Cristina Nicolae, Gabriel Nicolae
ATAL
2007
Springer
13 years 8 months ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
13 years 9 months ago
Separation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
Aduri Pavan, Alan L. Selman
CVPR
2010
IEEE
13 years 9 months ago
Object Recognition as Ranking Holistic Figure-Ground Hypotheses
We present an approach to visual object-class recognition and segmentation based on a pipeline that combines multiple, holistic figure-ground hypotheses generated in a bottom-up,...
Fuxin Li, JoãCarreira, Cristian Sminchisescu
FSTTCS
2004
Springer
13 years 10 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan