Sciweavers

808 search results - page 110 / 162
» What Is Answer Set Programming
Sort
View
126
Voted
JMLR
2012
13 years 4 months ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...
108
Voted
ICALP
2010
Springer
15 years 4 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
FUIN
2010
109views more  FUIN 2010»
15 years 22 days ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva
132
Voted
UM
2007
Springer
15 years 8 months ago
The Effect of Model Granularity on Student Performance Prediction Using Bayesian Networks
A standing question in the field of Intelligent Tutoring Systems and User Modeling in general is what is the appropriate level of model granularity (how many skills to model) and h...
Zachary A. Pardos, Neil T. Heffernan, Brigham Ande...
120
Voted
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 2 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata