Search Results for author:
Found 3 papers, 1 papers with code
Near-Optimal Resilient Aggregation Rules for Distributed Learning Using 1-Center and 1-Mean Clustering with Outliers
Our analysis show that constant approximations to the 1-center and 1-mean clustering problems with outliers provide near-optimal resilient aggregators for metric-based criteria, which have been proven to be crucial in the homogeneous and heterogeneous cases respectively.
A Sample-Based Algorithm for Approximately Testing $r$-Robustness of a Digraph
In this paper, we propose a sample-based algorithm to approximately test $r$-robustness of a digraph with $n$ vertices and $m$ edges.
Edge corona product as an approach to modeling complex simplical networks
Many graph products have been applied to generate complex networks with striking properties observed in real-world systems.
Discrete Mathematics Social and Information Networks
