Sciweavers

2687 search results - page 383 / 538
» Formal Analysis of PKCS
Sort
View
ISCI
2006
72views more  ISCI 2006»
15 years 6 months ago
A study of particle swarm optimization particle trajectories
Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analys...
F. Van den Bergh, Andries Petrus Engelbrecht
JMM2
2008
116views more  JMM2 2008»
15 years 6 months ago
Multi-Scale Criteria for the Evaluation of Image Segmentation Algorithms
Abstract-- This paper deals with evaluation of image segmentation methods. We start with a state-of-the art of the evaluation criteria, involving a reference segmentation or not. B...
Sylvie Philipp-Foliguet, Laurent Guigues
JSW
2008
101views more  JSW 2008»
15 years 6 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza
JSAT
2006
69views more  JSAT 2006»
15 years 6 months ago
The SAT 2005 Solver Competition on Random Instances
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
Oliver Kullmann
TC
2008
15 years 6 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...