Zobrazeno 1 - 10
of 3 170
pro vyhledávání: '"Graph reconstruction"'
Multi-view clustering is an important machine learning task for multi-media data, encompassing various domains such as images, videos, and texts. Moreover, with the growing abundance of graph data, the significance of multi-view graph clustering (MVG
Externí odkaz:
http://arxiv.org/abs/2410.22983
Filamentary structures (topologically embedded graphs with a metric structure) are ubiquitous in science and engineering. A challenging problem in topological data analysis (TDA) is to reconstruct the topology and geometry of such an underlying (usua
Externí odkaz:
http://arxiv.org/abs/2410.19410
Autor:
Azogagh, Sofiane, Birba, Zelma Aubin, Desharnais, Josée, Gambs, Sébastien, Killijian, Marc-Olivier, Tawbi, Nadia
Cryptographic approaches, such as secure multiparty computation, can be used to compute in a secure manner the function of a distributed graph without centralizing the data of each participant. However, the output of the protocol itself can leak sens
Externí odkaz:
http://arxiv.org/abs/2412.02329
Autor:
Raghaw, Chandravardhan Singh, Sharma, Arnav, Bansal, Shubhi, Rehman, Mohammad Zia Ur, Kumar, Nagendra
Publikováno v:
Computers in Biology and Medicine 179C (2024) 108821
Swift and accurate blood smear analysis is an effective diagnostic method for leukemia and other hematological malignancies. However, manual leukocyte count and morphological evaluation using a microscope is time-consuming and prone to errors. Conven
Externí odkaz:
http://arxiv.org/abs/2410.08797
Publikováno v:
Jisuanji kexue yu tansuo, Vol 18, Iss 10, Pp 2750-2761 (2024)
Multi-view clustering algorithm based on graph learning has been widely concerned in recent years because of its simplicity and high efficiency. Most of multi-view clustering algorithms only consider the consistent part of each view and ignore the di
Externí odkaz:
https://doaj.org/article/5cb2ad212c6a48dcae5b00d38c10c47d
Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new condition for th
Externí odkaz:
http://arxiv.org/abs/2408.02488
We study a problem of reconstruction of connected graphs where the input gives all subsets of size k that induce a connected subgraph. Originally introduced by Bastide et al. (WG 2023) for triples ($k=3$), this problem received comprehensive attentio
Externí odkaz:
http://arxiv.org/abs/2407.07500
Autor:
McGregor, Andrew, Sengupta, Rik
We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or "traces". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the resulting induced
Externí odkaz:
http://arxiv.org/abs/2405.04261
Autor:
Michel, Lukas, Scott, Alex
We investigate the number of maximal independent set queries required to reconstruct the edges of a hidden graph. We show that randomised adaptive algorithms need at least $\Omega(\Delta^2 \log(n / \Delta) / \log \Delta)$ queries to reconstruct $n$-v
Externí odkaz:
http://arxiv.org/abs/2404.03472
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.