Sciweavers

2436 search results - page 366 / 488
» Comonadic Notions of Computation
Sort
View
KR
2004
Springer
15 years 9 months ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler
OTM
2004
Springer
15 years 9 months ago
Domain Ontology as a Resource Providing Adaptivity in eLearning
Abstract. This paper presents a knowledge-based approach to eLearning, where the domain ontology plays central role as a resource structuring the learning content and supporting ï¬...
Galia Angelova, Ognian Kalaydjiev, Albena Strupcha...
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
15 years 9 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 9 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 9 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao