1763 search results - page 63 / 353 » Dependent random choice |
IJSN
2006
13 years 9 months ago
2006
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
IJNSEC
2011
13 years 4 months ago
2011
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper presents Markov random fields (MRFs) to segment strokes of Chinese characters. The distortions caused by the thinning process make the thinning-based stroke segmentatio...
ICML
1998
IEEE
14 years 10 months ago
1998
IEEE
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...
AIIA
2009
Springer
14 years 3 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...