Sciweavers

1399 search results - page 188 / 280
» Multi-party Finite Computations
Sort
View
CC
2006
Springer
147views System Software» more  CC 2006»
15 years 4 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
CORR
2006
Springer
122views Education» more  CORR 2006»
15 years 4 months ago
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13, 14] showed how, in principle, one can explicit...
Guangyue Han, Brian Marcus
IJNSEC
2006
98views more  IJNSEC 2006»
15 years 4 months ago
Comment on Improvement of the Miyazaki-Takaragi Threshold Digital Signature Scheme
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
Zuhua Shao
JALC
2008
72views more  JALC 2008»
15 years 4 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
IVC
2006
112views more  IVC 2006»
15 years 4 months ago
A comparison between BEM and FEM for elastic registration of medical images
The aim of medical image registration is to bring different images into the best possible spatial correspondence in order to obtain complementary information for clinical applicat...
Evgeny Gladilin, Vladimir Pekar, Karl Rohr, H. Sie...