70 citations · 207 across the 23 of their papers we have counts for
4 papers · 1 filter
Accurate Computation of Survival Statistics in Genome-wide Studies
Fabio Vandin, Alexandra Papoutsaki, Benjamin J. Raphael +1
A key challenge in genomics is to identify genetic variants that distinguish patients with different survival time following diagnosis or treatment. While the log-rank test is wide…
Communication Lower Bounds for Distributed-Memory Computations
Michele Scquizzato, Francesco Silvestri
We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplicatio…
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri +1
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an -…
Finding the True Frequent Itemsets
Matteo Riondato, Fabio Vandin
Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It requires to identify all itemsets appearing in at least a fraction of a transactional dataset $\mat…