Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
Emilio Maggio, Elisa Piccardo, Carlo S. Regazzoni,...
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...