Results 71 to 80 of about 190,109 (292)
Faster Algorithms for Rectangular Matrix Multiplication [PDF]
, 2012 Let {\alpha} be the maximal value such that the product of an n x n^{\alpha} matrix by an n^{\alpha} x n matrix can be computed with n^{2+o(1)} arithmetic operations.
Gall, François Le
core +1 more source
Discovery and Targeted Proteomic Studies Reveal Striatal Markers Validated for Huntington's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Clinical trials for Huntington's disease (HD) enrolling persons before clinical motor diagnosis (CMD) lack validated biomarkers. This study aimed to conduct an unbiased discovery analysis and a targeted examination of proteomic biomarkers scrutinized by clinical validation. Methods Cerebrospinal fluid was obtained from PREDICT‐HD and
Daniel Chelsky +8 more
wiley +1 more source
Parallel Eclipse-Aware Routing on FPGA for SpaceWire-Based OBC in LEO Satellite Networks
Journal of Sensor and Actuator NetworksLow Earth orbit (LEO) satellite networks deliver superior real-time performance and responsiveness compared to conventional satellite networks, despite technical and economic challenges such as high deployment costs and operational complexity ...
Jin Hyung Park +2 more
doaj +1 more source
Applied Network Science, 2018 ■■■ We describe a methodology for characterizing the relative structural importance of an arbitrary network edge by exploiting the properties of a k-shortest path algorithm.
Mary E. Helander, Sarah McAllister
doaj +1 more source
Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective [PDF]
, 2003 Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach.
Lozada, Eleazar G. Madrid +2 more
core +1 more source
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs [PDF]
, 2017 We show that, for any graph optimization problem in which the feasible solutions can be expressed by a formula in monadic second-order logic describing sets of vertices or edges and in which the goal is to minimize the sum of the weights in the selected ...
Eppstein, David, Kurz, Denis
core +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
Dynamic Path Planning of Emergency Vehicles Based on Travel Time Prediction
Journal of Advanced Transportation, 2017 The dynamic paths planning problem of emergency vehicles is usually constrained by the factors including time efficiency, resources requirement, and reliability of the road network.
Jiandong Zhao, Yujie Guo, Xiaohong Duan
doaj +1 more source
Faster Shortest Paths in Dense Distance Graphs, with Applications [PDF]
, 2014 We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94].
Mozes, Shay +2 more
core
Arthritis Care &Research, EarlyView.Objective We aimed to compare clinical outcomes between patients in the Allegheny Health Network rheumatoid arthritis (RA) care pathway and patients receiving usual care. Methods The care pathway initiative implements guideline‐based best practice alongside multidisciplinary team‐based care.
Tarun Sharma +7 more
wiley +1 more source