This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
The discovery and extraction of general lists on the Web continues to be an important problem facing the Web mining community. There have been numerous studies that claim to autom...
Tim Weninger, Fabio Fumarola, Rick Barber, Jiawei ...
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...