Sciweavers

7215 search results - page 1069 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
AAAI
2004
15 years 8 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
AAAI
2006
15 years 8 months ago
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
ACID
2006
236views Algorithms» more  ACID 2006»
15 years 8 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
DAGSTUHL
2004
15 years 8 months ago
Knowledge-Based Sampling for Subgroup Discovery
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
Martin Scholz
ACL
2003
15 years 8 months ago
Learning to Predict Pitch Accents and Prosodic Boundaries in Dutch
We train a decision tree inducer (CART) and a memory-based classifier (MBL) on predicting prosodic pitch accents and breaks in Dutch text, on the basis of shallow, easy-to-comput...
Erwin Marsi, Martin Reynaert, Antal van den Bosch,...
« Prev « First page 1069 / 1443 Last » Next »