Results 71 to 80 of about 1,615,193 (298)

The Parameter Report: An Orientation Guide for Data-Driven Parameterization

Journal of Graph Algorithms and Applications
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, Nils Morawietz, Frank Sommer, Luca Pascal Staus   +3 more
doaj   +1 more source

Integer Programming in Parameterized Complexity: Three Miniatures [PDF]

, 2019
Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra's algorithm for solving integer linear programming in fixed dimension ...
Koutecký, Martin, Knop, Dusan, Gavenciak, Tomás   +2 more
core   +1 more source

Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein

FEBS Letters, EarlyView.
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, Christian Lévêque, Fodil Azzaz, Marion Sangiardi, Sarosh R Irani, Michael Seagar, Jacques Fantini, Oussama El Far   +7 more
wiley   +1 more source

Parameterized Complexity of Simultaneous Planarity

, 2023
Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all drawings coincide on $G$.
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter   +2 more
openaire   +2 more sources

On the Parameterized Complexity of Reconfiguration Problems [PDF]

Algorithmica, 2013
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence of {\em reconfiguration steps} that can be applied to transform $S$ into $T$ such that each step results in a ...
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman 0001, Narges Simjour, Akira Suzuki 0001   +4 more
openaire   +3 more sources

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

FEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei, Fredrik Orädd, Konstantinos Magkakis, Magnus Andersson   +3 more
wiley   +1 more source

The Parameterized Complexity Of Extending Stack Layouts

Journal of Graph Algorithms and Applications
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack ...
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg   +3 more
doaj   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

FEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong, Yuhei Hosokawa, Lars Oliver Essen, Manuel Maestre‐Reyna   +3 more
wiley   +1 more source

Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals

IEEE Access, 2022
In this paper, we study the impact of computational complexity on the throughput limits of the fast Fourier transform (FFT) algorithm for orthogonal frequency division multiplexing (OFDM) waveforms.
Saulo Queiroz, Joao P. Vilela, Edmundo Monteiro   +2 more
doaj   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

International Journal of Adaptive Control and Signal Processing, EarlyView.
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, Marco Forgione, Dario Piga, Marco Zaffalon   +3 more
wiley   +1 more source