Results 41 to 50 of about 6,062,625 (214)
Relativization and Interactive Proof Systems in Parameterized Complexity Theory [PDF]
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized complexity classes ...
Bottesch, Ralph, Bottesch, R.C. (Ralph)
core +1 more source
Autonomous laboratories can now synthesize materials faster than experts can interpret the resulting diffraction data. A probabilistic framework combines refinement‐fit metrics with large language model‐derived chemical reasoning to rank competing phase interpretations and flag those unsuitable for autonomous use.
Olympia Dartsi +7 more
wiley +1 more source
09511 Open Problems – Parameterized complexity and approximation algorithms [PDF]
The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern ...
Marx, Dániel +2 more
core +1 more source
Conceptual illustration of a Global Ecosystem Methane Observing System (GEM‐OS) integrating satellites, aircraft, atmospheric networks, and ecosystem measurements to quantify methane emissions from anthropogenic and natural sources. The multi‐scale observing framework improves source attribution, reduces uncertainty in regional methane budgets, and ...
P. Ciais +32 more
wiley +1 more source
Distributed synthesis for parameterized temporal logics
We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT–LTL, which extends LTL by temporal operators equipped with parameters that bound their scope.
Martin Zimmermann (126927) +2 more
core +1 more source
Technical limitations often let dominant signals overshadow rare cell types and fine‐grained heterogeneity in spatial transcriptomics. SemanticST, a graph neural network using multi‐semantic graph fusion and a novel min‐cut loss, recovers these subtle patterns.
Roxana Zahedi +7 more
wiley +1 more source
Optimizing construction of scheduled data flow graph for on-line testability [PDF]
The objective of this work is to develop a new methodology for behavioural synthesis using a flow of synthesis, better suited to the scheduling of independent calculations and non-concurrent online testing.
Simeu, Emmanuel, Kamsu-Foguem, Bernard
core
Machine Learning of Temperature‐Dependent Chemical Kinetics Using Parallel Droplet Microreactors
An integrated droplet microfluidics and machine learning framework enables high‐throughput characterization of temperature‐dependent reaction kinetics. Time‐resolved measurements from thousands of droplets train Neural ODE models that accurately predict nonlinear reaction dynamics across diverse thermal environments, bridging large‐scale ...
Mamoru Saita, Yutaka Hori
wiley +1 more source
On the Parameterized Complexity of Clique Elimination Distance [PDF]
Bulian and Dawar [Algorithmica, 2016] introduced the notion of elimination distance in an effort to define new tractable parameterizations for graph problems and showed that deciding whether a given graph has elimination distance at most k to any minor ...
Agrawal, Akanksha, Ramanujan, M. S.
core +1 more source
A schematic illustrating the fabrication process and ferroptosis‐mediated therapeutic mechanism of carrier‐free self‐assembled BBR/NC‐SAPs for overcoming bortezomib resistance in multiple myeloma. ABSTRACT Therapeutic relapse driven by bortezomib resistance represents a formidable clinical barrier in the management of multiple myeloma (MM).
Yiwen Lv +16 more
wiley +1 more source

