Results 121 to 130 of about 1,864,097 (296)

Parameterized complexity for the database theorist

open access: yes, 2002
Parameterized complexity theory provides a framework for a fine-grain complexity analysis of algorithmic problems that are intractable in general. In recent years, ideas from parameterized complexity theory have found their way into various areas of ...
Martin Grohe
core   +1 more source

Consensus Formation and Change are Enhanced by Neutrality

open access: yesAdvanced Science, EarlyView.
Neutral agents are shown to enhance both the formation and overturning of consensus in collective decision‐making. A general mathematical model and experiments with locusts and humans reveal that neutrality enables robust consensus via simple interactions and accelerates consensus change by reducing effective population size.
Andrei Sontag   +3 more
wiley   +1 more source

Thermodynamics of Concomitant Charge‐Transfer, Antiferromagnetic, and Isostructural Phase Transitions in Barocaloric ACu3Fe4O12 Quadruple Perovskites

open access: yesAdvanced Science, EarlyView.
A copper‐iron charge transfer instability drives concomitant electronic, magnetic, and isostructural phase transitions in ACu3Fe4O12${\rm ACu}_3{\rm Fe}_4{\rm O}_{12}$, with an inverse barocaloric effect. A minimal Landau theory ties these thermodynamic signatures together, revealing a pressure‐independent transition entropy with comparable charge and ...
Jefferson Delgado‐Quesada   +1 more
wiley   +1 more source

Parameterized and approximation complexity of the detection pair problem in graphs

open access: yesJournal of Graph Algorithms and Applications, 2017
We study the complexity of the problem ${\rm D{\small ETECTION}~P{\small AIR}}$. A detection pair of a graph $G$ is a pair $(W,L)$ of sets of detectors with $W\subseteq V(G)$, the watchers, and $L\subseteq V(G)$, the listeners, such that for every pair ...
Florent Foucaud, Ralf Klasing
doaj   +1 more source

On the Space Complexity of Parameterized Problems

open access: yes, 2012
Parameterized complexity theory measures the complexity of compu-tational problems predominantly in terms of their parameterized time complexity. The purpose of the present paper is to demonstrate that the study of parameterized space complexity can give
Till Tantau   +2 more
core   +1 more source

Solid Harmonic Wavelet Bispectrum for Image Analysis

open access: yesAdvanced Science, EarlyView.
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown   +3 more
wiley   +1 more source

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

open access: yesTsinghua Science and Technology, 2014
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck   +5 more
doaj   +1 more source

Parameterized Complexity of Directed Spanner Problems. [PDF]

open access: yesAlgorithmica, 2022
Fomin FV   +5 more
europepmc   +1 more source

Neural Fields for Highly Accelerated 2D Cine Phase Contrast MRI

open access: yesAdvanced Science, EarlyView.
ABSTRACT 2D cine phase contrast (CPC) MRI provides quantitative information on blood velocity and flow within the human vasculature. However, data acquisition is time‐consuming, motivating the reconstruction of the velocity field from undersampled measurements to reduce scan times. In this work, neural fields are proposed as a continuous spatiotemporal
Pablo Arratia   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy