decoding problem
An Algorithmic Framework for Solving the Decoding Problem in Statistical Machine Translation
... The decoding problem in Statistical Ma- chine Translation (SMT) is a computation- ally hard combinatorial optimization prob- ...ing problem and demonstrate its ...ing problem can be solved ...
7
Fast Decoding and Optimal Decoding for Machine Translation
... MT decoding to finding optimal tours in the Traveling Salesman Prob- lem (Garey and Johnson, 1979)—choosing a good word order for decoder output is similar to choosing a good TSP ...TSP problem instance can ...
8
Multi-path Summation for Decoding 2D Topological Codes
... the decoding problem to that of finding a likely set of connecting errors which join the vertices in pairs (we will call these connecting errors paths for the remainder of this work, and refer to abstract ...
20
2 Slave Dual Decomposition for Generalized Higher Order CRFs
... the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic ...
12
Assessing Phrase Based Translation Models with Oracle Decoding
... oracle decoding problem, and present a series of ILP problems of increas- ing complexity designed so as to deliver accurate lower- bounds of oracle ...
11
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
... case decoding problem whose hardness reduces to that of solving the Learning Parity with Noise (LPN) problem, in some parameter ...case problem is only mildly hard and in particular admits a ...
16
Practical Attack on RaCoSS-R
... RaCoSS is a signature scheme based on the syndrome decoding problem over the random linear code and proposed by Fukushima, Roy, Xu, Kiyomoto, Morozov, and Takagi.. This scheme is cryptan[r] ...
6
Phrase Based Statistical Machine Translation as a Traveling Salesman Problem
... efficient decoding algorithm is a cru- cial element of any statistical machine translation ...SMT decoding and the famous Traveling Sales- man Problem; in particular (Knight, 1999) has shown that any ...
9
SPACE-AGE APPROACH TO TRANSMIT MEDICAL IMAGE WITH CODEBASE CRYPTOSYSTEM OVER NOISY CHANNEL
... McEliece proposed the first public-key cryptosystem (the McEliece Scheme) based on algebraic coding theory in 1978[1] . The idea behind McEliece public-key cryptosystem is based on the fact that the decoding ...
6
Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding
... search problem, and thus equivalent to decoding a random linear ...LWE problem of Regev [26] is a generalization of LPN to codes over a larger ...Our decoding algorithm could be adjusted to ...
21
Towards Decoding as Continuous Optimisation in Neural Machine Translation
... Cho (2016) proposed to perturb the neural model by injecting noise(s) in the hidden transi- tion function of the conditional recurrent neural language model during greedy or beam search, and execute multiple parallel ...
11
Fuzzy Methods for Soft Hidden Markov Modelling
... This can be solved by the EM algorithm. The same is also possible by fuzzy logic techniques, but in our work, only the decoding problem is concentrated upon. The details of the method are given below in ...
11
Faster Decoding for Subword Level Phrase based SMT between Related Languages
... stack decoding, two decoder parameters which impact the decode time are: (1) beam size of the hypothesis stack, and (2) table-limit: the number of translation options for each source phrase considered by the ...
7
Improving Decoding Generalization for Tree to String Translation
... We choose the tree-to-string paradigm in our study because this is the simplest and fastest among syn- tax-based models, and has been shown to be one of the state-of-the-art syntax-based models. Typically, by using the ...
6
INDOOR GLOBAL PATH PLANNING BASED ON CRITICAL CELLS USING DIJKSTRA ALGORITHM
... Information hiding is the most important method in hiding secret information from unauthorized party. The purpose of information hiding is to protect the secret information. One of the method commonly used is ...
7
Low Complexity Decoding Algorithms and Architectures for Non Binary LDPC Codes
... address of the APP and Check memories. For each layer’s sub-iteration, it takes about 2wr clock cycles to process, so the decoding throughput is where R is the code rate and E is the total number of edges between ...
5
Creative Language Encoding under Censorship
... People often create obfuscated language for online communication to avoid Internet censorship, share sensitive information, express strong sentiment or emotion, plan for secret actions, trade il- legal products, or ...
11
Cryptography from Post-Quantum Assumptions
... hard problem from lattices called the Isomteric Lattice Problem ...only problem known from integer lattices to have a Perfect Zero-Knowledge interactive proof system with an efficient ...this ...
79
NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme
... hard problem. That is why, in the decisional variant of BDD problem in our scheme, the reuse of the secret is ...BDD problem that we use is similar to Ring-LWE where all secrets and errors are ...
20
The Min-max Decoding Algorithm of Nonbinary LDPC Codes Based on Early Stopping
... min-max decoding algorithm of nonbinary LDPC code based on early stopping 、 traditional min-max decoding algorithm of nonbinary LDPC codes and traditional minsum decoding algorithm of nonbinary LDPC ...
5