Results 51 to 60 of about 5,946 (233)

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, Chenggang Lu, Rui Zhang, Haijun Yan, Yesong Xu   +4 more
wiley   +1 more source

Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra

International Journal of Applied Mathematics and Computer Science
This 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, Freeda Lourdusamy Packiammal Anto   +1 more
doaj   +1 more source

Open trails in digraphs [PDF]

Opuscula Mathematica, 2011
It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
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, Suresha G. Prabhu, Lizna M. Ali, Vineeta N. Pillai, Farah Mustafa, Tahir A. Rizvi   +5 more
wiley   +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, Xingchen Li, Zhijun Gong, Yang Hu, Yongjiu Cai, Keqiang Shao, Guang Gao, Robbie M. Martin, Xiangming Tang   +8 more
wiley   +1 more source

Terminal-pairability in complete bipartite graphs

Discrete Applied Mathematics, 2018
8 pages, several typos ...
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei   +3 more
openaire   +3 more sources

Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs

Theory and Applications of Graphs, 2020
In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m + 1 copies of T .
Sethuraman, G., Sujasree, M.
openaire   +4 more sources

Conditional Randomization Tests for the Specification of Interference Structure

Journal of Applied Econometrics, EarlyView.
ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley   +1 more source

Completing partial packings of bipartite graphs

Journal of Combinatorial Theory, Series A, 2011
Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \rightarrow \infty$.
Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn   +2 more
openaire   +2 more sources

Higher matching complexes of complete graphs and complete bipartite graphs [PDF]

Discrete Mathematics, 2022
For $r\geq 1$, the $r$-matching complex of a graph $G$, denoted $M_r(G)$, is a simplicial complex whose faces are the subsets $H \subseteq E(G)$ of the edge set of $G$ such that the degree of any vertex in the induced subgraph $G[H]$ is at most $r$. In this article, we give a closed form formula for the homotopy type of the $(n-2)$-matching complex of ...
openaire   +2 more sources