Results 1 - 10 of 16,233

Minimum Error Rate Training in Statistical Machine Translation

by Franz Josef Och , 2003
"... Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training cri ..."
Abstract - Cited by 757 (7 self) - Add to MetaCart
Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training

Space/Time Trade-offs in Hash Coding with Allowable Errors

by Burton H. Bloom - Communications of the ACM , 1970
"... this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional h ..."
Abstract - Cited by 2097 (0 self) - Add to MetaCart
this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional

Analyzing Error Types in English-Czech Machine Translation

by Ondřej Bojar - Prague Bulletin of Mathematical Linguistics , 2011
"... This paper examines two techniques of manual evaluation that can be used to identify error types of individual machine translation systems. The first technique of “blind post-editing ” is being used in WMT evaluation campaigns since 2009 and manually constructed data of this type are available for v ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
This paper examines two techniques of manual evaluation that can be used to identify error types of individual machine translation systems. The first technique of “blind post-editing ” is being used in WMT evaluation campaigns since 2009 and manually constructed data of this type are available

Algorithms for Non-negative Matrix Factorization

by Daniel D. Lee, H. Sebastian Seung - In NIPS , 2001
"... Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minim ..."
Abstract - Cited by 1246 (5 self) - Add to MetaCart
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown

Raptor codes

by Amin Shokrollahi - IEEE Transactions on Information Theory , 2006
"... LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract - Cited by 577 (7 self) - Add to MetaCart
, and the original symbols are recovered from the collected ones with O(k log(1/ε)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions

Dynamic programming algorithm optimization for spoken word recognition

by Hiroaki Sakoe, Seibi Chiba - IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING , 1978
"... This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization is given using timewarping function. Then, two time-normalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract - Cited by 788 (3 self) - Add to MetaCart
words in different The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimentat comparison with various DP-algorithms, previously applied

The irreducibility of the space of curves of given genus

by P. Deligne, D. Mumford - Publ. Math. IHES , 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~- ..."
Abstract - Cited by 506 (2 self) - Add to MetaCart
~- (1, and then the result is classical. A simple proof appears in Enriques-Chisini [E, vol. 3, chap. 3], based on analyzing the totality of coverings of p1 of degree n, with a fixed number d of ordinary branch points. This method has been extended to char. p by William Fulton [F], using specializations

The SLAM project: debugging system software via static analysis

by Thomas Ball, Sriram K. Rajamani - SIGPLAN Not
"... Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two un ..."
Abstract - Cited by 472 (17 self) - Add to MetaCart
Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two

Model Checking for Programming Languages using VeriSoft

by Patrice Godefroid - IN PROCEEDINGS OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES , 1997
"... Verification by state-space exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing model-checking techniques are restricted to the verification of ..."
Abstract - Cited by 446 (15 self) - Add to MetaCart
Verification by state-space exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing model-checking techniques are restricted to the verification

Selective sampling using the Query by Committee algorithm

by Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby - Machine Learning , 1997
"... We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the numbe ..."
Abstract - Cited by 433 (7 self) - Add to MetaCart
We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially
Results 1 - 10 of 16,233