Results 91 to 100 of about 197,409 (310)
VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER [PDF]
The article deals with the problem of very large-scale integration circuit partitioning. A graph is selected as a mathematical model describing integrated circuit.
P. N. Filippenko
doaj
Chronological and Spatial Distribution of Skeletal Muscle Fat Replacement in FHL1‐Related Myopathies
ABSTRACT Objectives Variants in the FHL1 gene cause FHL1‐related myopathies (FHL1‐RMs), a group of neuromuscular disorders with diverse clinical presentations. This study aimed to comprehensively characterize the spatial and temporal patterns of skeletal muscle fat replacement throughout the whole body in FHL1‐RMs, to examine disease progression over ...
Rui Shimazaki +8 more
wiley +1 more source
Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]
In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj
Graph partitioning by Eigenvectors
Given a graph G on n vertices and \(z\in R^ n\), we say that a vertex of G is positive, nonnegative, null, etc. if the corresponding entry of z has that property. For z such that Az\(\geq \alpha z\) (A is the adjacency matrix of G) the number of components of the subgraph induced by positive vertices is bounded.
openaire +2 more sources
Age‐Related Characteristics of SYT1‐Associated Neurodevelopmental Disorder
ABSTRACT Objectives We describe the clinical manifestations and developmental abilities of individuals with SYT1‐associated neurodevelopmental disorder (Baker‐Gordon syndrome) from infancy to adulthood. We further describe the neuroradiological and electrophysiological characteristics of the condition at different ages, and explore the associations ...
Sam G. Norwitz +3 more
wiley +1 more source
Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
Whole‐Body Pattern of Muscle Degeneration and Progression in Sarcoglycanopathies
ABSTRACT Objective To characterize whole‐body intramuscular fat distribution pattern in patients with sarcoglycanopathies and explore correlations with disease severity, duration and age at onset. Methods Retrospective, cross‐sectional, multicentric study enrolling patients with variants in one of the four sarcoglycan genes who underwent whole‐body ...
Laura Costa‐Comellas +39 more
wiley +1 more source
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
Objective This study examined the global and regional temporal changes in cross‐country inequalities of site‐specific osteoarthritis (OA) burden from 1990 to 2021. Methods Age‐standardized years lived with disability rates (ASYRs) for site‐specific OA across 204 countries and territories were obtained from the Global Burden of Diseases, Injuries, and ...
Haowei Chen +14 more
wiley +1 more source

