Sciweavers

269 search results - page 12 / 54
» random 2001
Sort
View
ICN
2001
Springer
14 years 2 months ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun
IJCAI
2001
13 years 11 months ago
Search on High Degree Graphs
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
Toby Walsh
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
13 years 11 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot
ICDAR
2007
IEEE
14 years 4 months ago
Using Random Forests for Handwritten Digit Recognition
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
Simon Bernard, Sébastien Adam, Laurent Heut...
AE
2001
Springer
14 years 2 months ago
Markov Random Field Modelling of Royal Road Genetic Algorithms
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
Deryck F. Brown, A. Beatriz Garmendia-Doval, John ...