We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Ontology, an explicit specification of shared conceptualization, has been increasingly used to define formal data semantics and improve data reusability and interoperability in en...
To be able to enlarge a digital image from a single frame preserving the perceptive cues is a relevant research issue. The best algorithms take into account the presence of edges ...
Sebastiano Battiato, Giovanni Gallo, Filippo Stanc...
In this paper we demonstrate a framework for efficient development of textual domain specific languages and supporting tools. We use a redundance-free and compact definition of le...