Sciweavers

4860 search results - page 306 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
111
Voted
NAACL
2010
15 years 1 months ago
Two monolingual parses are better than one (synchronous parse)
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...
Chris Dyer
CORR
2006
Springer
182views Education» more  CORR 2006»
15 years 3 months ago
Cryptanalysis of the CFVZ cryptosystem
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
Joan-Josep Climent, E. Gorla, J. Rosenthal
120
Voted
ICCSA
2010
Springer
15 years 10 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
100
Voted
UAI
1996
15 years 4 months ago
Bucket elimination: A unifying framework for probabilistic inference
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
Rina Dechter
EMNLP
2009
15 years 1 months ago
Statistical Bistratal Dependency Parsing
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
Richard Johansson