Results 51 to 60 of about 87,394 (276)
We address the challenging application of 3D pore scale reactive flow under varying geometry parameters. The task is to predict time-dependent integral quantities, i.e., breakthrough curves, from the given geometries.
Robin Herkert +5 more
doaj +1 more source
Sparse Ultrasound Imaging via Manifold Low-Rank Approximation and Non-Convex Greedy Pursuit
Model-based image reconstruction has improved contrast and spatial resolution in imaging applications such as magnetic resonance imaging and emission computed tomography.
Thiago Alberto Rigo Passarin +2 more
doaj +1 more source
Sparsest Input Selection for Controllability of Singular Systems via a Two-Step Greedy Algorithm
In this paper, the problem of determining the sparsest input matrices to ensure controllability of linear singular systems is investigated. Firstly, it is shown that, determining the sparsest input matrices to ensure reachable controllability or complete
Yan Zhang, Wanhong Zhang
doaj +1 more source
Most critical infrastructure networks often suffer malicious attacks, which may result in network failures. Therefore, how to design more robust defense measures to minimize the loss is a great challenge. In recent years, defense strategies for enhancing
Zhen Wang +4 more
doaj +1 more source
Greedy Bayesian Posterior Approximation with Deep Ensembles
Published in the Transactions on Machine Learning Research: https://openreview.net/forum?id ...
Tiulpin, Aleksei, Blaschko, Matthew
openaire +3 more sources
We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
The subject matter of the article is the efficiency analysis of greedy optimization algorithms for subset selection in distributed systems under delta-matroid constraints.
Inessa Kulakovska
doaj +1 more source
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection [PDF]
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the context of both feature selection and sparse approximation.
Das, Abhimanyu, Kempe, David
core
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Greedy Kernel Methods for Center Manifold Approximation [PDF]
AbstractFor certain dynamical systems it is possible to significantly simplify the study of stability by means of the center manifold theory. This theory allows to isolate the complicated asymptotic behavior of the system close to a non-hyperbolic equilibrium point, and to obtain meaningful predictions of its behavior by analyzing a reduced dimensional
Haasdonk B. +3 more
openaire +2 more sources

