Results 91 to 100 of about 10,447 (245)

Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang, Hongxu Chen, Xiangyu Zhao, Sixiao Zhang, Xiangguo Sun, Qian Li, Hongzhi Yin, Guandong Xu   +7 more
wiley   +1 more source

Modeling the ribosome as a bipartite graph. [PDF]

PLoS One, 2022
Calvet LE.
europepmc   +1 more source

A Note on the Existence of All (g,f)-Factors

Journal of Graph Algorithms and Applications, 2017
This paper is devoted to the problem of existence of all $(g,f)$-factors in a bipartite graph. We present an algorithm to test if a given bipartite graph contains all $(g,f)$-factors.
Radosław Cymer
doaj   +1 more source

Boosting Embodied Visual Localisation Through Multi‐Granular Semantics and Multi‐Robot Consensus

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Achieving high accuracy and synergy remains extremely difficult for multi‐robot embodied visual localisation, which suffers from persistent real‐world challenges such as viewpoint ambiguity, appearance variation and dynamic occlusion. Conventional optimisation‐based methods often lead to incorrect feature matching without domain adaptation ...
Wenshuai Wang, Shiyu Liu, Peifeng Jiang, Hong Liu, Runwei Ding   +4 more
wiley   +1 more source

A Bipartite Graph That Is Not the $\gamma$-Graph of a Bipartite Graph

, 2020
Comment: 4 ...
openaire   +1 more source

On the determinant of bipartite graphs

Discrete Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Relations between ordinary energy and energy of a self-loop graph

Heliyon
Let G be a graph on n vertices with vertex set V(G) and let S⊆V(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S.
B.R. Rakshith, Kinkar Chandra Das, B.J. Manjunatha, Yilun Shang   +3 more
doaj   +1 more source

Optimising daily sampling of plant–bee interaction networks

Journal of Animal Ecology, EarlyView.
Daily variation in ecological interaction networks is rarely quantified due to limited temporal sampling, yet network structure may change substantially within a single day. We show that plant–bee networks exhibit strong intraday shifts in composition and structure, and that sampling distributed across key daily periods better captures network ...
Caio S. Ballarin, Jorge Isla, Blanca Arroyo‐Correa, Elena Quintero, Leandro Hachuy‐Filho, Felipe W. Amorim, Pedro Jordano   +6 more
wiley   +1 more source

Drivers of Host–Pathogen Community Assemblages in European Forests and Urban Green Spaces

Integrative Zoology, EarlyView.
ABSTRACT Despite advances in understanding infectious diseases, the persistence and re‐emergence of wildlife pathogens continue to raise public and veterinary health concerns. This study investigates the relationship between biodiversity and rodent‐borne diseases in Europe, focusing on habitat alterations and their impact on rodent diversity.
Vincent Sluydts, Marie Bouilloud, Maxime Galan, Hussein Alburkat, Anaïs Bordes, Vincent Bourret, Valeria Colombo, Luc DeBruyn, Lara Dutra, Jana Eccard, Jasmin Firozpoor, Romain Gallet, Maciej Grzybek, Heikki Henttonen, Jens Jacob, Andrew McManus, Tarja Sironen, Peter Stuart, Caroline Tatard, Benjamin Roche, Herwig Leirs, Nathalie Charbonnel   +21 more
wiley   +1 more source

Nearly bipartite graphs

Discrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ervin Györi, Vladimir Nikiforov 0001, Richard H. Schelp   +2 more
openaire   +2 more sources