Multi-robot stochastic patrolling via graph partitioning

W Wang, X Duan, J He - IEEE Transactions on Control of …, 2024 - ieeexplore.ieee.org
We study a multi-robot stochastic patrolling problem by employing graph partitioning
techniques, where each robot adopts a Markov chain-based strategy over its assigned …

Chromatic correlation clustering, revisited

Q **u, K Han, J Tang, S Cui… - Advances in Neural …, 2022 - proceedings.neurips.cc
Abstract Chromatic Correlation Clustering (CCC)(introduced by Bonchi et al.[6]) is a natural
generalization of the celebrated Correlation Clustering (CC) problem, introduced by Bonchi …

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+

Y Huang, DF Gleich - arxiv preprint arxiv:2406.10407, 2024 - arxiv.org
Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in
machine learning and data science. Designing scalable SDP solvers is challenging …

Finding and Removing Infected T-Trees in IoT Networks

M Severt, R Casado-Vara, AM del Rey, E Jove… - … Intelligence in Security …, 2023 - Springer
Abstract The Internet of Things (IoT) is filling cities and buildings. It provides continuous
monitoring and control to the point where a large proportion of everyday processes can be …

Applications and Analysis of NLP Deep Learning Models for Antibiotic's Side Effects Classifications

A Ly - 2024 - search.proquest.com
I introduce a novel recursive modification to the classical Goemans-Williamson MaxCut
algorithm, offering improved performance in vectorized data clustering tasks. Focusing on …

Data Clustering and Visualization with Recursive Goemans-Williamson MaxCut Algorithm

A Ly, R Sawhney, M Chugunova - … International Conference on …, 2023 - ieeexplore.ieee.org
In this article, we introduce a novel recursive modification to the classical Goemans-
Williamson MaxCut algorithm, offering improved performance in vectorized data clustering …