Sciweavers

26354 search results - page 116 / 5271
» How we refactor, and how we know it
Sort
View
ASIACRYPT
2001
Springer
14 years 2 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...
MM
2000
ACM
112views Multimedia» more  MM 2000»
14 years 2 months ago
How to bypass the Wassenaar arrangement: a new application for watermarking
The scope of this article is to clarify the current legal and political situation related to electronic surveillance on the one hand, and to export regulations for encryption soft...
Franck Leprévost, Raphaël Erard, Toura...
SIGIR
1998
ACM
14 years 2 months ago
How Reliable Are the Results of Large-Scale Information Retrieval Experiments?
Two stages in measurement of techniques for information retrieval are gathering of documents for relevance assessment and use of the assessments to numerically evaluate effective...
Justin Zobel
KI
1992
Springer
14 years 2 months ago
How to Construct a Logic for Your Application
Abstract. The purpose of this note is to present and evaluate the options available to a researcher wishing to use logic for representation, reasoning and computation in his applic...
Dov M. Gabbay
EKAW
2006
Springer
14 years 1 months ago
Ontology Selection for the Real Semantic Web: How to Cover the Queen's Birthday Dinner?
Robust mechanisms for ontology selection are crucial for the evolving Semantic Web characterized by rapidly increasing numbers of online ontologies and by applications that automat...
Marta Sabou, Vanessa Lopez, Enrico Motta