Výsledky vyhľadávania - "graph algorithm"

Unreliable Estimation of Aortic Pulse Wave Velocity Provided by the Mobil‐O‐Graph Algorithm‐Based System in Marfan Syndrome Autor Salvi, Paolo, Furlanis, Giulia, Grillo, Andrea, Pini, Alessandro, Salvi, Lucia, Marelli, Susan, Rovina, Matteo, Moretti, Francesco, Gaetano, Raffaella, Pintassilgo, Inês, Faini, Andrea, Fabris, Bruno, Carretta, Renzo, Parati, Gianfranco

“… in patients with Marfan syndrome (ie, in subjects characterized…”
Získať plný text

Optimal Power Allocation and Delay Minimization Based on Conflict Graph Algorithm for Device-to-Device Communications Autor de Melo, Leonardo Alves Moreira, Ferreira, Marcus Vinícius Gonzaga, Vieira, Flávio Henrique Teles

“…) remains a major challenge in D2D communications. In this paper, we aim to maximize the throughput of D2D users and cellular users subject to QoS requirements and signal-to-interference-plus-noise ratio (SINR…”
Získať plný text

Universal law in the crude oil market based on visibility graph algorithm and network structure Autor Wang, Fan, Tian, Lixin, Du, Ruijin, Dong, Gaogao

“… By using visibility graph algorithm (VG), the time series of 32-year crude oil price is converted to a corresponding single spot and futures price network respectively…”
Získať plný text

Study on a Controlled Splitting Scheme Based on Layer Expanding Graph Algorithm Autor Wang, Yi Fei, Liao, Qing Fen, Yang, Jian, Tang, Fei

“… A controlled splitting scheme based on layer expanding graph algorithm is presented in this paper…”
Získať plný text

Full Matching in an Observational Study of Coaching for the SAT Autor Hansen, Ben B

“…Among matching techniques for observational studies, full matching is in principle the best, in the sense that its alignment of comparable treated and control subjects is as good as that of…”
Získať plný text

Robustness of First- and Second-Order Consensus Algorithms for a Noisy Scale-Free Small-World Koch Network Autor Yi, Yuhao, Zhang, Zhongzhi, Shan, Liren, Chen, Guanrong

“…In this brief, we study first- and second-order consensus algorithms for the scale-free small-world Koch network, where vertices are subject to white noise…”
Získať plný text

Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness Autor Gorbunov, Konstantin, Lyubetsky, Vassily

“…The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc…”
Získať plný text

Maintaining balanced trees for structured distributed streaming systems Autor Giroire, F., Modrzejewski, R., Nisse, N., Pérennes, S.

“… Such systems are subject to a high churn, peers frequently joining and leaving the system. It is thus crucial to be able to repair the diffusion tree to allow an efficient data distribution…”
Získať plný text

Nonparametrically estimating dynamic bivariate correlation using visibility graph algorithm Autor John, Aparna, Ikuta, Toshikazu, Ferbinteanu, Janina D, Majnu, John

“…Dynamic conditional correlation (DCC) is a method that estimates the correlation between two time series across time. Although used primarily in finance so…”
Získať plný text

Analysing epileptic EEGs with a visibility graph algorithm Autor Zhu, Guohun, Li, Yan, Wen, Peng

“…This paper analyzes the human epileptic electroencephalogram (EEG) based on a visibility graph algorithm…”
Získať plný text

Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks Autor Panda, B. S., Pushparaj Shetty, D.

“… of all the sensors is minimum subject to the constraint that the resulting topology containing…”
Získať plný text

Fully Automated Segmentation of Fluid/Cyst Regions in Optical Coherence Tomography Images With Diabetic Macular Edema Using Neutrosophic Sets and Graph Algorithms Autor Rashno, Abdolreza, Koozekanani, Dara D., Drayna, Paul M., Nazari, Behzad, Sadri, Saeed, Rabbani, Hossein, Parhi, Keshab K.

“… (OCT) retina images of subjects with diabetic macular edema. The OCT image is segmented using a novel neutrosophic transformation and a graph-based shortest path method…”
Získať plný text

Integrating transformer and autoencoder techniques with spectral graph algorithms for the prediction of scarcely labeled molecular data Autor Hayes, Nicole, Merkurjev, Ekaterina, Wei, Guo-Wei

“…In molecular and biological sciences, experiments are expensive, time-consuming, and often subject to ethical constraints…”
Získať plný text

Eigenvector Centrality Dynamics From Resting-State fMRI: Gender and Age Differences in Healthy Subjects Autor Wink, Alle Meije

“…With the increasing use of functional brain network properties as markers of brain disorders, efficient visualization and evaluation methods have become…”
Získať plný text

Local certification of graphs with bounded genus Autor Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan

“…Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed…”
Získať plný text

Complexity and variability analyses of motor activity distinguish mood states in bipolar disorder Autor Jakobsen, Petter, Stautland, Andrea, Riegler, Michael Alexander, Côté-Allard, Ulysse, Sepasdar, Zahra, Nordgreen, Tine, Torresen, Jim, Fasmer, Ole Bernt, Oedegaard, Ketil Joachim

“… Lastly, the recordings were analyzed with the similarity graph algorithm and graph theory concepts such as edges, bridges…”
Získať plný text

Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms Autor Abboud, Amir, Dahlgaard, Soren

“… nodes u, v subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades…”
Získať plný text

Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint Autor Fujii, Kaito

“… Maximizing a monotone submodular function subject to a b-matching constraint is increasing in importance due to its application to the content spread maximization problem, but few practical…”
Získať plný text

Harmonic functions of general graph Laplacians Autor Hua, Bobo, Keller, Matthias

“…We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an L p Liouville type theorem which is a…”
Získať plný text

Introduction to local certification Autor Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output…”
Získať plný text