1.4k citations
- Centre National de la Recherche ScientifiqueFR33 papers
- University of ViennaAT33 papers
- Heidelberg UniversityDE20 papers
- European Organization for Nuclear ResearchCH14 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR12 papers
- CEA Paris-SaclayFR10 papers
- Max Planck Institute for Solid State ResearchDE10 papers
- ETH ZurichCH9 papers
- Austrian Academy of SciencesAT8 papers
- Charles UniversityCZ8 papers
- Oak Ridge National LaboratoryUS8 papers
- Universität InnsbruckAT8 papers
19 papers · 1 filter
Backdoors to Abduction
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, an…
Meta-Kernelization with Structural Parameters
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
Meta-kernelization theorems are general results that provide polynomial kernels for large classes of parameterized problems. The known meta-kernelization theorems, in particular th…
Minimum Variance Estimation of a Sparse Vector within the Linear Gaussian Model: An RKHS Approach
Alexander Jung, Sebastian Schmutzhard, Franz Hlawatsch +2
We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian…
Neutron capture cross section of unstable 63Ni: implications for stellar nucleosynthesis
C. Lederer, C. Massimi, S. Altstadt +102
The Ni() cross section has been measured for the first time at the neutron time-of-flight facility n\_TOF at CERN from thermal neutron energies up to 200 keV. In total…
Modeling double slit interference via anomalous diffusion: independently variable slit widths
Johannes Mesa Pascasio, Siegfried Fussy, Herbert Schwabl +1
Based on a re-formulation of the classical explanation of quantum mechanical Gaussian dispersion (Groessing et al. 2010) as well as interference of two Gaussians (Groessing et al.…
On the Subexponential Time Complexity of CSP
Iyad Kanj, Stefan Szeider
A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper…