10.9k citations
- Centre National de la Recherche ScientifiqueFR128 papers
- Université Clermont AuvergneFR88 papers
- Institut PascalFR65 papers
- Aix-Marseille UniversitéFR57 papers
- Czech Technical University in PragueCZ54 papers
- Lyon 1 UniversitéFR54 papers
- University of ManchesterGB54 papers
- Brookhaven National LaboratoryUS53 papers
- Charles UniversityCZ53 papers
- Czech Academy of SciencesCZ53 papers
- Johannes Gutenberg University MainzDE53 papers
- Joint Institute for Nuclear ResearchRU53 papers
11 papers · 1 filter
Using SVDD in SimpleMKL for 3D-Shapes Filtering
Gaëlle Loosli, Hattoibe Aboubacar
This paper proposes the adaptation of Support Vector Data Description (SVDD) to the multiple kernel case (MK-SVDD), based on SimpleMKL. It also introduces a variant called Slim-MK-…
Finite-dimensional Gaussian approximation with linear inequality constraints
Andrés F. López-Lopera, François Bachoc, Nicolas Durrande +1
Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the fini…
On the tractability of optimization problems on H-graphs
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
For a graph , a graph is an -graph if it is an intersection graph of connected subgraphs of some subdivision of . -graphs naturally generalize several important gra…
Properties and comparison of some Kriging sub-model aggregation methods
François Bachoc, Nicolas Durrande, Didier Rullière +1
Kriging is a widely employed technique, in particular for computer experiments, in machine learning or in geostatistics. An important challenge for Kriging is the computational bur…
Fast exact algorithms for some connectivity problems parametrized by clique-width
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Given a clique-width -expression of a graph , we provide time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted…
Towards Learned Clauses Database Reduction Strategies Based on Dominance Relationship
Jerry Lonlac, Engelbert Mephu Nguifo
Clause Learning is one of the most important components of a conflict driven clause learning (CDCL) SAT solver that is effective on industrial instances. Since the number of learne…