Results 221 to 230 of about 10,822,126 (305)

From Offline to Inline Without Pain: A Practical Framework for Translating Offline MR Reconstructions to Inline Deployment Using the Gadgetron Platform

open access: yesMagnetic Resonance in Medicine, Volume 96, Issue 1, Page 448-459, July 2026.
ABSTRACT Purpose To develop and validate a practical, open‐source framework to overcome common issues in inline deployment of established offline MR reconstruction, including (1) scan disruption from lengthy reconstructions, (2) limited support for multi‐scan input reconstructions, (3) needs to adapt scripts for different raw‐data formats, and (4 ...
Zihan Ning   +26 more
wiley   +1 more source

Building centaur responders: is emergency management ready for artificial intelligence?

open access: yesDisasters, Volume 50, Issue 3, July 2026.
Abstract This article examines the preparedness of emergency management (EM) for addressing questions pertaining to artificial intelligence (AI), encompassing its benefits to EM missions, the potential biases, the societal impacts, and more. We pinpoint two key shortcomings in early EM research on AI: (i) insufficient discussion of both AI's history ...
Christopher Whyte   +1 more
wiley   +1 more source

User‐Based Evaluation of Explainability Techniques for Misogyny Detection in Code‐Mixed Hindi–English

open access: yesApplied AI Letters, Volume 7, Issue 2, June 2026.
In this work, we have performed human‐based evaluation of three post hoc explainability techniques, Local Interpretable Model Agnostic Explanations (LIME), Shapely Additive Explanations (SHAP), and integrated Gradients (IG) for a multilingual Bidirectional Encoder Representations from Transformers (mBERT) based binary and multi‐label misogyny ...
Sargam Yadav   +2 more
wiley   +1 more source

An Exact Method for Reliable Shortest Path Problems With Correlation

open access: yesNetworks, Volume 87, Issue 4, Page 372-389, June 2026.
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva   +3 more
wiley   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, Volume 87, Issue 4, Page 404-427, June 2026.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy