Results 51 to 60 of about 10,447 (245)
Ore Image Segmentation by Bipartite Graph Based on Collaborative Representation [PDF]
Jisuanji gongcheng, 2016 Image segmentation algorithm by bipartite graph considers the spatial organization relation between superpixels as well as pixel and superpixels,which is robust for ore image segmentation.This paper proposes a bipartite graph algorithm based on ...
ZHOU Jing,YANG Fan,SHI Lingyi,ZHENG Zhonglong
doaj +1 more source
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Advanced Intelligent Systems, EarlyView.Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
RNA‐centric world of retroviruses: unravelling the molecular strategies of genomic RNA packaging
Biological Reviews, EarlyView.ABSTRACT Retroviruses constitute a unique group of RNA viruses that have profoundly influenced both evolutionary trajectories and biomedical research. Their ability to reverse transcribe and integrate into host genomes has shaped genomic architecture across species and contributed to our understanding of oncogenes, gene regulation, and RNA biology ...
Mohammad Abdullah Jehad +5 more
wiley +1 more source
Discrete Applied Mathematics, 1987 It is shown that bipartite permutation graphs have good algorithmic properties in contrast to general bipartite or permutation graphs. Two characterizations of these graphs are presented which lead to a linear time recognition algorithm and also to polynomial algorithms for Hamiltonian problems, a variant of the crossing number problem and the minimum ...
Jeremy P. Spinrad +2 more
openaire +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study systematizes the literature on eco‐innovation and economic complexity, aiming to understand how the sophistication of productive structures shapes countries' capacity to develop environmentally responsible innovations, and how eco‐innovation may, in turn, influence productive sophistication.
Gregory Matheus Pereira de Moraes +1 more
wiley +1 more source
Domination in bipartite graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jochen Harant, Dieter Rautenbach
openaire +2 more sources
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Warm‐wet transition restructures arid lake microbiomes and functional potential
iMetaOmics, EarlyView.This study summarizes how a long‐term warm‐dry to warm‐wet transition restructures microbiomes and functional potential in Lake Bosten, an arid lake in northwestern China. Warm‐wet hydroclimatic change increased water level and hydrological connectivity, while decreasing salinity and total nitrogen.
Zhen Shen +8 more
wiley +1 more source
International Journal of Applied Mathematics and Computer ScienceThis paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source