We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Remote Direct Memory Access (RDMA) is a technology to update a remote machine’s memory without intervention at the receiver side. We evaluate where RDMA can be usefully applied a...
For decades transnational communities of immigrants have used various forms of communication to maintain ties with their places of origin. The Internet constitutes an alternative ...
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...