Results 121 to 130 of about 129,306 (313)
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to the investigation of several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and fast robber.
Fedor V. Fomin +2 more
openaire +2 more sources
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito +14 more
wiley +1 more source
Outer Approximation Algorithms for DC Programs and Beyond
We consider the well-known Canonical DC (CDC) optimization problem, relying on an alternative equivalent formulation based on a polar characterization of the constraint, and a novel generalization of this problem, which we name Single Reverse Polar ...
ZHANG, QINGHUA
core
Functional and Structural Evidence of Neurofluid Circuit Aberrations in Huntington Disease
ABSTRACT Objective Disrupted neurofluid regulation may contribute to neurodegeneration in Huntington disease (HD). Because neurofluid pathways influence waste clearance, inflammation, and the distribution of central nervous system (CNS)–delivered therapeutics, understanding their dysfunction is increasingly important as targeted treatments emerge.
Kilian Hett +8 more
wiley +1 more source
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equivalent to the existence of a linear time-invariant system that fits the data ...
Markovsky, Ivan
core
Set-Valued Approximation—Revisited and Improved
We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions.
David Levin
doaj +1 more source
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
Faster Algorithms for Schatten-p Low Rank Approximation [PDF]
We study algorithms for the Schatten-p Low Rank Approximation (LRA) problem. First, we show that by using fast rectangular matrix multiplication algorithms and different block sizes, we can improve the running time of the algorithms in the recent work of
Woodruff, David P., Kacham, Praneeth
core +1 more source
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems have appeared.
Nodari Vakhania +2 more
doaj +1 more source

