Results 61 to 70 of about 1,864,097 (296)
Towards exact structural thresholds for parameterized complexity [PDF]
Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them are optimal ...
Hegerfeld, Falko, Kratsch, Stefan
core +1 more source
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.
Michael Ralph Fellows
doaj +1 more source
Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein
Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux +7 more
wiley +1 more source
The Parameter Report: An Orientation Guide for Data-Driven Parameterization
A strength of parameterized algorithmics is that each problem can be parameterized by an essentially inexhaustible set of parameters. Usually, the choice of the considered parameter is informed by the theoretical relations between parameters with the ...
Christian Komusiewicz +3 more
doaj +1 more source
The Parameterized Complexity of the Equidomination Problem [PDF]
A graph $G=(V,E)$ is called equidominating if there exists a value $t \in \mathbb{N}$ and a weight function $ω: V \rightarrow \mathbb{N}$ such that the total weight of a subset $D\subseteq V$ is equal to $t$ if and only if $D$ is a minimal dominating set.
Oliver Schaudt, Fabian Senger
openaire +3 more sources
The Parameterized Complexity of Graph Cyclability [PDF]
The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a nonnegative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is NP-hard. We study the parametrized complexity of this problem. We prove that this problem, parameterized by $
Golovach, Petr A. +3 more
openaire +6 more sources
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
The Parameterized Complexity of Dependency Detection in Relational Databases [PDF]
We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion ...
Schirneck, Martin +2 more
core +1 more source
On the Parameterized Complexity of Pooling Design [PDF]
Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m x n binary matrix and a positive integer d, to decide whether the matrix is d-separable (d-separable, or d ...
Yongxi Cheng +3 more
openaire +2 more sources
A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi +3 more
wiley +1 more source

