We present an application of formal concept analysis aimed at creating and representing a meaningful structure of knowledge communities under the form of a lattice-based taxonomy ...
Camille Roth, Sergei A. Obiedkov, Derrick G. Kouri...
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
Network intruders try to hide their identity by relaying their traf c through a number of intermediate hosts, called stepping stones. Network ow watermarks have been used to detec...
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...