Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Our main interest research is focused on reaching a decentralized form of social order through the usage of social norms in virtual communities. In this paper, we analyze the effe...
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...