Results 61 to 70 of about 23,418,736 (380)
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
On preemptive scheduling on unrelated machines using linear programming
We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time.
Nodari Vakhania
doaj +1 more source
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis [PDF]
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al.
D. Lau +14 more
core +2 more sources
The Time Complexity of Consensus Under Oblivious Message Adversaries
We study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message adversary that picks the communication graph to be used in a round from a fixed set of graphs D\documentclass[
Kyrill Winkler +4 more
semanticscholar +1 more source
A Perceptually-Motivated Approach for Low-Complexity, Real-Time Enhancement of Fullband Speech [PDF]
Over the past few years, speech enhancement methods based on deep learning have greatly surpassed traditional methods based on spectral subtraction and spectral estimation.
J. Valin +5 more
semanticscholar +1 more source
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Data structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications.
Wei-Chang Yeh, Majid Forghani-elahabad
doaj +1 more source
Recognizing sparse perfect elimination bipartite graphs [PDF]
When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into non-zeros to preserve the sparsity. The class of perfect elimination bipartite graphs is closely related to square matrices that Gaussian elimination can ...
Bomhoff, Matthijs
core +6 more sources
ABSTRACT We sought to identify potential early risk biomarkers for lung disease in children post‐allogeneic HCT. Patients with pulmonary function tests 3 months post‐transplant and plasma samples between days 7 and 14 post‐HCT were included. Six of 27 subjects enrolled had reduced forced expiratory volume 1 (FEV1) z scores.
Isabella S. Small +3 more
wiley +1 more source
ABSTRACT The pediatric hematology‐oncology fellowship training curriculum has not substantially changed since its inception. The first year of training is clinically focused, and the second and third years are devoted to scholarship. However, this current structure leaves many fellows less competitive in the current job market, resulting in ...
Scott C. Borinstein +3 more
wiley +1 more source
Prototype implementation of segment assembling software [PDF]
IT education is very important and a lot of effort is put into the development of tools for helping students to acquire programming knowledge and for helping teachers in automating the examination process. This paper describes a prototype of the
Pešić Đorđe +3 more
doaj +1 more source

