Platt’s probabilistic outputs for Support Vector Machines (Platt, 2000) has been popular for applications that require posterior class probabilities. In this note, we propose an ...
We propose the demonstration of Keymantic, a system for keyword-based searching in relational databases that does not require a-priori knowledge of instances held in a database. I...
Sonia Bergamaschi, Elton Domnori, Francesco Guerra...
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...