2 papers
cs.DS2010
Better size estimation for sparse matrix products
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
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 c…
cs.DS2010
On Finding Frequent Patterns in Directed Acyclic Graphs
Andrea Campagna, Rasmus Pagh
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 le…