Mauro Mezzini

发表

Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs

Mauro Mezzini, 2018, Theor. Comput. Sci..

On the geodetic iteration number of the contour of a graph

Mauro Mezzini, 2016, Discret. Appl. Math..

Fast minimal triangulation algorithm using minimum degree criterion

Mauro Mezzini, 2011, Theor. Comput. Sci..

Tracking Museum Visitors through Convolutional Object Detectors

Carlo De Medio, Giuseppe Sansonetti, Mauro Mezzini, 2020, UMAP.

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Mauro Mezzini, M. Mezzini, 2007, J. Graph Algorithms Appl..

University Dropout Prediction through Educational Data Mining Techniques: A Systematic Review

Mauro Mezzini, Francesco Agrusti, Gianmarco Bonavolonta, 2019 .

On the geodeticity of the contour of a graph

Marina Moscarini, Mauro Mezzini, 2015, Discret. Appl. Math..

Minimal invariant sets in a vertex-weighted graph

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2006, Theor. Comput. Sci..

Auditing sum-queries to make a statistical database secure

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2006, TSEC.

On the hardness of protecting sensitive information in a statistical database

Francesco M. Malvestuto, Mauro Mezzini, F. M. Malvestuto, 2001 .

A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph

Francesco M. Malvestuto, Mauro Mezzini, F. M. Malvestuto, 2002, SIAM J. Comput..

Computing simple-path convex hulls in hypergraphs

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2011, Inf. Process. Lett..

PREDICTING UNIVERSITY DROPOUT BY USING CONVOLUTIONAL NEURAL NETWORKS

Mauro Mezzini, Francesco Agrusti, Gianmarco Bonavolonta, 2019, INTED2019 Proceedings.

Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2012, Discret. Math. Algorithms Appl..

Correcting measurement errors with Bayesian networks when the variables are continuous and discrete

Daniela Marella, Paola Vicard, Mauro Mezzini, 2014 .

Empirical study on label smoothing in neural networks

Mauro Mezzini, M. Mezzini, 2018 .

On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs

Mauro Mezzini, M. Mezzini, 2010, Theor. Comput. Sci..

Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type

Francesco M. Malvestuto, Mauro Mezzini, 2004, Privacy in Statistical Databases.

An analytical approach to the inference of summary data of additive type

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2007, Theor. Comput. Sci..

Auditing Sum Queries

Francesco M. Malvestuto, Mauro Mezzini, 2003, ICDT.

Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network

Marina Moscarini, Mauro Mezzini, 2010, Theor. Comput. Sci..

Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n2) update-time

Mauro Mezzini, 2012, Theor. Comput. Sci..

The contour of a bridged graph is geodetic

Marina Moscarini, Mauro Mezzini, 2016, Discret. Appl. Math..

Quantum algorithm for doubling the amplitude of the search problem's solution states pdf

Mauro Mezzini, Fernando Cuartero, Fernando L. Pelayo, 2021, ArXiv.

Exploiting Micro Facial Expressions for More Inclusive User Interfaces

Carla Limongelli, Giuseppe Sansonetti, Mauro Mezzini, 2021, IUI Workshops.

Equivalence between Hypergraph Convexities

Marina Moscarini, Francesco M. Malvestuto, Mauro Mezzini, 2011 .