Sciweavers

5363 search results - page 796 / 1073
» Building the Cerebellum in a Computer
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
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...
Adam R. Day
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
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...
CSEE
2009
Springer
16 years 1 months ago
Evaluating Software Inspection Cognition Levels Using Bloom's Taxonomy
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 ...
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
16 years 1 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
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...
Elliot Anshelevich, Bugra Caskurlu
ESWS
2009
Springer
16 years 1 months ago
Towards Linguistically Grounded Ontologies
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...