Mauro Sozio
|
Articles
STREamRHF: Tree-Based Unsupervised Anomaly Detection for Data Streams,
AICCSA 2022, Abu Dhabi, United Arab Emirates
AICCSA 2022, Abu Dhabi, United Arab Emirates
AutoAD: an Automated Framework for Unsupervised Anomaly Detection,
DSAA 2022 - IEEE International Conference on Data Science and Advanced Analytics 2022, Paris / Virtual Event, France
DSAA 2022 - IEEE International Conference on Data Science and Advanced Analytics 2022, Paris / Virtual Event, France
EviDense: a Graph-based Method for Finding Unique High-impact Events with Succinct Keyword-based Descriptions,
CoRR 2019, Stanford, United States
CoRR 2019, Stanford, United States
Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search,
WWW 2019, San Francisco, United States
WWW 2019, San Francisco, United States
Scalable Facility Location for Massive Graphs on Pregel-like Systems,
CIKM 2015, Melbourne, Australia
CIKM 2015, Melbourne, Australia
Query-Time Reasoning in Uncertain RDF Knowledge Bases with Soft and Hard Rules,
VLDS (Very large data search) 2012
VLDS (Very large data search) 2012
Journal articles
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs,
ACM Transactions on Knowledge Discovery from Data (TKDD) 2024
ACM Transactions on Knowledge Discovery from Data (TKDD) 2024
AutoML: state of the art with a focus on anomaly detection, challenges, and research directions,
International Journal of Data Science and Analytics 2022
International Journal of Data Science and Analytics 2022
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search,
ACM Trans. Knowl. Discov. Data 2022
ACM Trans. Knowl. Discov. Data 2022
Fully Dynamic $k$k-Center Clustering With Improved Memory Efficiency,
IEEE Trans. Knowl. Data Eng. 2022
IEEE Trans. Knowl. Data Eng. 2022
Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier,
J. Parallel Distributed Comput. 2021, Rio de Janeiro, Brazil
J. Parallel Distributed Comput. 2021, Rio de Janeiro, Brazil
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs,
Proceedings of the VLDB Endowment (PVLDB) 2020
Proceedings of the VLDB Endowment (PVLDB) 2020
Finding events in temporal networks: segmentation meets densest subgraph discovery,
Knowl. Inf. Syst. 2020, Singapour, Singapore
Knowl. Inf. Syst. 2020, Singapour, Singapore
A Distributed Algorithm for Large-Scale Generalized Matching,
PVLDB (Proceedings of the VLDB Endowment) 2013
PVLDB (Proceedings of the VLDB Endowment) 2013
Fast primal-dual distributed algorithms for scheduling and matching problems,
Distributed Comput. 2010
Distributed Comput. 2010
Patent
Generated using
minifold
and minifold-lincs
at 2025-03-31 17:01.