Suchergebnisse - "Graph algorithms"

Fully Automated Segmentation of Fluid/Cyst Regions in Optical Coherence Tomography Images With Diabetic Macular Edema Using Neutrosophic Sets and Graph Algorithms von 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 …”
Volltext

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

“… In molecular and biological sciences, experiments are expensive, time-consuming, and often subject to ethical constraints …”
Volltext

Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms von 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 …”
Volltext

Local certification of graphs with bounded genus von 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 …”
Volltext

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

“… With the increasing use of functional brain network properties as markers of brain disorders, efficient visualization and evaluation methods have become …”
Volltext

Stackelberg packing games von Böhnlein, Toni, Schaudt, Oliver, Schauer, Joachim

“… Stackelberg pricing games are pricing problems over a set of items. One player, the leader, sets prices for the items and the second player, the follower, buys a subset of items at minimal total cost subject to feasibility constraints …”
Volltext

A faster parameterized algorithm for temporal matching von Zschoche, Philipp

“… —describing a graph topology which is subject to discrete changes over time. A Δ-temporal matching M is a set of time edges (e …”
Volltext

Gaussian Graphical Model Selection Using Graph Compression von Abolfazli, Mojtaba, Høst-Madsen, Anders, Zhang, June, Bratincsak, Andras

“… Conditional independence between variables in Gaussian graphical models (also known as Gaussian Markov random fields) is represented by the conditional …”
Volltext

Parallel Graph Algorithms Through Approximation von Khan, Md Ariful Hasan

“… We consider the problem of computing a b-MATCHING and a b-EDGE COVER, which are subgraphs of a graph with specific properties. Although there are …”
Volltext

The topology of local computing in networks von Fraigniaud, Pierre, Paz, Ami

“… For more than three decades, distributed systems have been described and analyzed using topological tools, primarily using two techniques: protocol complexes …”
Volltext

Harmonic functions of general graph Laplacians von 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 …”
Volltext

A survey on dynamic graph processing on GPUs: concepts, terminologies and systems von GAO, Hongru, LIAO, Xiaofei, SHAO, Zhiyuan, LI, Kexin, CHEN, Jiajie, JIN, Hai

“… In most real-world scenarios, entities and their relationships are subject to constant changes …”
Volltext

Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs von Qian, Haoran, Zheng, Weiguo, Zhang, Zhijie, Fu, Bo

“… The constrained shortest path problem is a fundamental and challenging task in applications built on graphs. In this paper, we formalize and study the …”
Volltext

Ratio-balanced maximum flows von Akrami, Hannaneh, Mehlhorn, Kurt, Odland, Tommy

“… When a loan is approved for a person or company, the bank is subject to credit risk; the risk that the lender defaults …”
Volltext

Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint von 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 …”
Volltext

Oracles for Distances Avoiding a Failed Node or Link von Demetrescu, Camil, Thorup, Mikkel, Chowdhury, Rezaul Alam, Ramachandran, Vijaya

“… $ to any given vertex $y$ avoiding any given vertex or edge. As a natural application, this problem models routing in networks subject to node or link failures …”
Volltext

Wildlife corridors as a connected subgraph problem von Conrad, Jon M., Gomes, Carla P., van Hoeve, Willem-Jan, Sabharwal, Ashish, Suter, Jordan F.

“… , subject to a constraint on the funds available for land acquisition. To solve this challenging computational problem, we propose a hybrid approach that combines graph algorithms with Mixed Integer Programming-based optimization …”
Volltext

Multimedia applications: Graph algorithms visualization von Sevcikova, Andrea, Milkova, Eva

“… This paper focuses on two important tools, program GrAlg and program A-DIMA developed at our university to enhance the Applied Informatics education, namely the area dealing with graph algorithms …”
Volltext

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem von Leitner, Markus

“… ) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path …”
Volltext

New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application von Boeckmann, Jan, Thielen, Clemens

“… Adapting to the consequences of climate change is one of the central challenges faced by humanity in the next decades. One of these consequences are intense …”
Volltext