The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
This paper reports on results from a pilot study that used Bloom’s Taxonomy to observe cognition levels during software inspections conducted by undergraduate computer science a...
David A. McMeekin, Brian R. von Konsky, Elizabeth ...
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Abstract. In this paper we argue why it is necessary to associate linguistic information with ontologies and why more expressive models, beyond RDFS, OWL and SKOS, are needed to ca...
Paul Buitelaar, Philipp Cimiano, Peter Haase, Mich...