18.2k citations
- University of Applied Sciences and Arts of Southern SwitzerlandCH65 papers
- Università della Svizzera italianaCH39 papers
- ETH ZurichCH9 papers
- Data61AU8 papers
- Politecnico di MilanoIT7 papers
- University of BolognaIT7 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- Ghent UniversityBE3 papers
- Google (United States)US3 papers
- Hokkaido UniversityJP3 papers
- IMT School for Advanced Studies LuccaIT3 papers
- King Abdullah University of Science and TechnologySA3 papers
7 papers · 1 filter
Descriptor learning for omnidirectional image matching
Jonathan Masci, Davide Migliore, Michael M. Bronstein +1
Feature matching in omnidirectional vision systems is a challenging problem, mainly because complicated optical systems make the theoretical modelling of invariance and constructio…
The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem
Monaldo Mastrolilli
We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with…
POWERPLAY: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem
Jürgen Schmidhuber
Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful…
Steiner Forest Orientation Problems
Marek Cygan, Guy Kortsarz, Zeev Nutov
We consider connectivity problems with orientation constraints. Given a directed graph and a collection of ordered node pairs let $P[D]=\{(u,v) \in P: D {contains a} uv{-pa…
Improving parameter learning of Bayesian nets from incomplete data
Giorgio Corani, Cassio P. De Campos
This paper addresses the estimation of parameters of a Bayesian network from incomplete data. The task is usually tackled by running the Expectation-Maximization (EM) algorithm sev…
Solving Limited Memory Influence Diagrams
Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon
We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity;…