-
2
-
-
84858383770
-
Bayesian inference for finite-state transducers
-
David Chiang, Jonathan Graehl, Kevin Knight, Adam Pauls, and Sujith Ravi. 2010. Bayesian inference for finite-state transducers. In Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics - Human Language Technologies (NAACL/HLT), pages 447-455.
-
(2010)
Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics - Human Language Technologies (NAACL/HLT)
, pp. 447-455
-
-
Chiang, D.1
Graehl, J.2
Knight, K.3
Pauls, A.4
Ravi, S.5
-
4
-
-
0002629270
-
Maximum likelihood from incomplete data via the em algorithm
-
Arthur P. Dempster, Nan M. Laird, and Donald B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38.
-
(1977)
Journal of the Royal Statistical Society, Series B
, vol.39
, Issue.1
, pp. 1-38
-
-
Dempster, A.P.1
Laird, N.M.2
Rubin, D.B.3
-
7
-
-
0000953388
-
Statistical techniques for language recognition: An introduction and guide for cryptanalysts
-
Ravi Ganesan and Alan T. Sherman. 1993. Statistical techniques for language recognition: An introduction and guide for cryptanalysts. Cryptologia, 17(4):321-366.
-
(1993)
Cryptologia
, vol.17
, Issue.4
, pp. 321-366
-
-
Ganesan, R.1
Sherman, A.T.2
-
8
-
-
0021518209
-
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images
-
Stuart Geman and Donald Geman. 1984. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721-741. (Pubitemid 15453722)
-
(1984)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.PAMI-6
, Issue.6
, pp. 721-741
-
-
Geman Stuart1
Geman Donald2
-
10
-
-
34248350860
-
A fast method for cryptanalysis of substitution ciphers
-
Thomas Jakobsen. 1995. A fast method for cryptanalysis of substitution ciphers. Cryptologia, 19(3):265-274.
-
(1995)
Cryptologia
, vol.19
, Issue.3
, pp. 265-274
-
-
Jakobsen, T.1
-
13
-
-
35248822118
-
Robust dictionary attack of short simple substitution ciphers
-
Edwin Olson. 2007. Robust dictionary attack of short simple substitution ciphers. Cryptologia, 31(4):332-342.
-
(2007)
Cryptologia
, vol.31
, Issue.4
, pp. 332-342
-
-
Olson, E.1
-
14
-
-
57349157848
-
Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems
-
David Oranchak. 2008. Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems. In Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pages 1717-1718.
-
(2008)
Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation
, pp. 1717-1718
-
-
Oranchak, D.1
-
15
-
-
0018542506
-
Breaking substitution ciphers using a relaxation algorithm
-
DOI 10.1145/359168.359174
-
Shmuel Peleg and Azriel Rosenfeld. 1979. Breaking substitution ciphers using a relaxation algorithm. Comm. ACM, 22(11):598-605. (Pubitemid 10431336)
-
(1979)
Communications of the ACM
, vol.22
, Issue.11
, pp. 598-605
-
-
Peleg Shmuel1
Rosenfeld Azriel2
|