We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone...
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...
Marco Dalai, Riccardo Leonardi, Pierangelo Miglior...
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...