Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Campagna, Andrea"'
Publikováno v:
In Transportation Research Procedia 2020 46:269-276
We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for "consistent" parallel processing of sparse outer
Externí odkaz:
http://arxiv.org/abs/1210.0461
A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is "close" to having the property, provides oracle access to the adjacency matrix of a "correction" of the graph, i.e
Externí odkaz:
http://arxiv.org/abs/1208.2956
Autor:
Campagna, Andrea, Pagh, Rasmus
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similarity measures. This paper is a first attempt at dealing with this, argua
Externí odkaz:
http://arxiv.org/abs/1010.2371
Autor:
Campagna, Andrea, Pagh, Rasmus
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum length m). Since the number of paths can be huge, we propose novel algor
Externí odkaz:
http://arxiv.org/abs/1010.2358
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse boolean matrix product. This problem has applications in databases and computer algebra. Let n denote the total number of non-zero entries in
Externí odkaz:
http://arxiv.org/abs/1006.4173
Autor:
Campagna, Andrea, Pagh, Rasmus
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some maximum length m). Since the number of paths can be huge, we propose novel algor
Externí odkaz:
http://arxiv.org/abs/1005.0239
Autor:
Campagna, Andrea, Pagh, Rasmus
This version is ***superseded*** by a full version that can be found at http://www.itu.dk/people/pagh/papers/mining-jour.pdf, which contains stronger theoretical results and fixes a mistake in the reporting of experiments. Abstract: Sampling-based me
Externí odkaz:
http://arxiv.org/abs/0910.0112
Publikováno v:
In Transportation Research Procedia 2017 24:354-361
Autor:
Buonacera, Agata, Boukhris, Marouane, Tomasello, Salvatore D., Campagna, Andrea, Cilia, Chiara, Tripepi, Giovanni, Di Marca, Salvatore, Terranova, Valentina, Pisano, Marcella, Mastrosimone, Gianluca, Galassi, Alfredo R., Stancanelli, Benedetta, Cataliotti, Alessandro, Malatino, Lorenzo
Publikováno v:
In European Journal of Internal Medicine April 2016 29:71-77