activity
20242026
most citedMaintaining -MinHash Signatures over Fully-Dynamic Data Streams with Recovery

1 citations · 1 across the 4 of their papers we have counts for

collaborators

7 papers

cs.LG2026

Single-Layer MeMo as a Randomized Hamming-Kernel Classifier

Alessandro Straziota

MeMo (Zanzotto et al., 2025) is a recent language-model architecture that stores associations between token contexts and next tokens in a correlation matrix memory. In this work, w…

cs.DS2026

Detecting Large Quasi-cliques on Dynamic Networks

Luciano Gualà, Simone Pellegrini, Luca Pepè Sciarria +1

Motivated by the problem of detecting large and cohesive groups of vertices in real networks, the task of finding large \emph{quasi-cliques} has attracted considerable attention ac…

cs.DS2026

A Tour of Locality Sensitive Filtering on the Sphere

Luca Becchetti, Andrea Clementi, Luciano Gualà +3

The Approximate Near Neighbor (ANN) problem is a cornerstone of high-dimensional data analysis. While Locality Sensitive Hashing (LSH) has been the classical paradigm, recent work…

cs.DS2025

Approximate -hop neighborhoods on incremental graphs: An efficient lazy approach

Luca Becchetti, Andrea Clementi, Luciano Gualà +3

In this work, we propose, analyze and empirically validate a lazy-update approach to maintain accurate approximations of the -hop neighborhoods of dynamic graphs resulting from…

cs.DS2024

Temporal queries for dynamic temporal forests

Davide Bilò, Luciano Gualà, Stefano Leucci +2

In a temporal forest each edge has an associated set of time labels that specify the time instants in which the edges are available. A temporal path from vertex to vertex i…

cs.DS2024★ 1 cited

Maintaining -MinHash Signatures over Fully-Dynamic Data Streams with Recovery

Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria +1

We consider the task of performing Jaccard similarity queries over a large collection of items that are dynamically updated according to a streaming input model. An item here is a…

cs.DS2024

Graph Spanners for Group Steiner Distances

Davide Bilò, Luciano Gualà, Stefano Leucci +1

A spanner is a sparse subgraph of a given graph which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses th…