Classification algorithms typically induce population-wide models that are trained to perform well on average on expected future instances. We introduce a Bayesian framework for l...
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
Background: Users of microarray technology typically strive to use universally acceptable data analysis strategies to determine significant expression changes in their experiments...
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...