Results 81 to 90 of about 193,029 (263)

Loom: Query-aware Partitioning of Online Graphs

open access: yes, 2017
As with general graph processing systems, partitioning data over a cluster of machines improves the scalability of graph database management systems. However, these systems will incur additional network cost during the execution of a query workload, due ...
Aiston, Jack   +2 more
core   +1 more source

Age‐Related Characteristics of SYT1‐Associated Neurodevelopmental Disorder

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

GRAPHS OF PARTIAL PARTITIONS

open access: yesDemonstratio Mathematica, 1984
The author considers two kinds of graphs whose vertices are partial partitions. Let A be a set. A family \(\{A_ i\}_{i\in I}\), \(A_ i\subset A\), is called a partial partition of A (or p-partition) if \(A_ i\cap A_ j=\emptyset\) for any i,j\(\in I\), \(i\neq j\). It is studied the so-called intersection graph of p-partitions of a given set A, i.e.
openaire   +2 more sources

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

Partitioning technique for a discrete quantum system

open access: yes, 2011
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one.
I. Hubač   +5 more
core   +1 more source

Whole‐Body Pattern of Muscle Degeneration and Progression in Sarcoglycanopathies

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

Diffusion Spectrum Imaging Maps Early Axonal Loss and a Unique Progressive Signal in Neuronal Intranuclear Inclusion Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

Experimental Validation of Graph Theory-Based Leak Detection Algorithm

open access: yesEngineering Proceedings
In this paper, we present results from a study on leak detection based on graph partitioning. Leaks are isolated using graph partitioning and performing mass balances over the partitions.
Lisa Saboo   +4 more
doaj   +1 more source

VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER [PDF]

open access: yesНаучно-технический вестник информационных технологий, механики и оптики, 2013
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  

Some NP-complete edge packing and partitioning problems in planar graphs [PDF]

open access: yes, 2014
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges ...
Yang, Jed
core  

Home - About - Disclaimer - Privacy