1 citations · 1 across the 2 of their papers we have counts for
4 papers
The Power of Bidegeneracy for Hypergraph Data Structures
Marco Bressan, Stefano Clemente, Giacomo Fumagalli +2
A hypergraph describes a set system over a vertex universe . Hypergraphs are increasingly popular in network science, as they represent interactions between subsets…
Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
Marco Bressan, Stefano Clemente, Giacomo Fumagalli
We study the problem of counting -hypergraphlets, an interesting but surprisingly ignored primitive, with the aim of understanding whether efficient algorithms exist. To this en…
A Critical Analysis of Classifier Selection in Learned Bloom Filters
Dario Malchiodi, Davide Raimondi, Giacomo Fumagalli +2
Learned Bloom Filters, i.e., models induced from data via machine learning techniques and solving the approximate set membership problem, have recently been introduced with the aim…
On the Choice of General Purpose Classifiers in Learned Bloom Filters: An Initial Analysis Within Basic Filters
Giacomo Fumagalli, Davide Raimondi, Raffaele Giancarlo +2
Bloom Filters are a fundamental and pervasive data structure. Within the growing area of Learned Data Structures, several Learned versions of Bloom Filters have been considered, yi…