Sciweavers

220 search results - page 21 / 44
» Discovering Test Set Regularities in Relational Domains
Sort
View
AAAI
2010
14 years 11 months ago
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Lin Xu, Holger Hoos, Kevin Leyton-Brown
SIGSOFT
2006
ACM
15 years 10 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
15 years 4 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni
LREC
2008
136views Education» more  LREC 2008»
14 years 11 months ago
A Coreference Corpus and Resolution System for Dutch
We present the main outcomes of the COREA project: a corpus annotated with coreferential relations and a coreference resolution system for Dutch. We discuss the annotation of the ...
Iris Hendrickx, Gosse Bouma, Frederik Coppens, Wal...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 10 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...