Virtualization technology enables multiple virtual machines (VMs) to run on a single physical
server. VMs that run on the same physical server can share memory pages that have …

Fuzzy similarity join is an important database operator widely used in practice. So far the
research community has focused exclusively on optimizing fuzzy joinscalability. However …

Cloud operators increasingly need many fine-grained rules to better control individual
network flows for various management tasks. While previous approaches have advocated …

Abstract Recently, Khuller, Moss and Naor presented a greedy algorithm for the budgeted
maximum coverage problem. In this note, we observe that this algorithm also approximates …

Complex Event Processing (CEP) is a stream processing model that focuses on detecting
event patterns in continuous event streams. While the CEP model has gained popularity in …

We study an extension of the bin packing problem, where packing together two or more
items may make them occupy less volume than the sum of their individual sizes. To achieve …

In the partially ordered knapsack problem (POK) we are given a set N of items and a partial
order≺ P on N. Each item has a size and an associated weight. The objective is to pack a set …

We study a constrained version of the knapsack problem in which dependencies between
items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an …

Abstract 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 D. Often …

A covering problem is an integer linear program of type\min {c^ Tx ∣ Ax ≥ D,\0 ≤ x ≤ d,\x
∈ Z\} min c T x∣ A x≥ D, 0≤ x≤ d, x∈ Z where A ∈ Z^ m * n _+ A∈ Z+ m× n, D ∈ Z _+^ m …