activity
20102026
most citedSpace-Round Tradeoffs for MapReduce Computations

39 citations · 129 across the 23 of their papers we have counts for

collaborators
Showing 2010Show all

5 papers · 1 filter

cs.DM2010★ 12 cited

Infectious Random Walks

Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci +1

We study the dynamics of information (or virus) dissemination by mobile agents performing independent random walks on an -node grid. We formulate our results in terms of two…

cs.DS2010★ 35 cited

Mining Top-K Frequent Itemsets Through Progressive Sampling

Andrea Pietracaprina, Matteo Riondato, Eli Upfal +1

We study the use of sampling for efficiently mining the top-K frequent itemsets of cardinality at most w. To this purpose, we define an approximation to the top-K frequent itemsets…

cs.CE2010★ 5 cited

An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree

Sara Nasso, Francesco Silvestri, Francesco Tisiot +3

As an emerging field, MS-based proteomics still requires software tools for efficiently storing and accessing experimental data. In this work, we focus on the management of LC-MS d…

cs.DB2010

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets

Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina +3

As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is be…

cs.DS2010

MADMX: A Novel Strategy for Maximal Dense Motif Extraction

Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti +3

We develop, analyze and experiment with a new tool, called MADMX, which extracts frequent motifs, possibly including don't care characters, from biological sequences. We introduce…