Báo cáo toán học: "Algebraic models for positive operator valued measures " pot

... 115–119, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Topic Models for Dynamic Translation Model Adaptation Vladimir Eidelman Computer Science and UMIACS University ... baseline on both BLEU and TER. The best model, LTM-10, achieves a gain of about 0.5 and 0.6 BLEU and 2 TER. Although the performance on BLEU for both the 20 topic m...

Ngày tải lên: 19/02/2014, 19:20

... May 27 – June 1. Association for Computational Linguistics. Philipp Koehn. 2004. Pharaoh: a Beam Search De- coder for Phrase-Based Statistical Machine Trans- lation Models. In Proceedings of the ... the ACL, pages 529–536, Sydney, July 2006. c 2006 Association for Computational Linguistics Distortion Models For Statistical Machine Translation Yaser Al-Onaizan and Kishore P...

Ngày tải lên: 08/03/2014, 02:21

... to determine the sentiment flow of authors in reviews. Here we show that fine-to-coarse models of senti- ment can often be reduced to the sequential case. Cascaded models for fine-to-coarse sentiment analysis ... 432–439, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Structured Models for Fine-to-Coarse Sentiment Analysis Ryan McDonald ∗...

Ngày tải lên: 08/03/2014, 02:21

... Proceedings of EACL '99 New Models for Improving Supertag Disambiguation John Chen* Department of Computer and Information Sciences University of Delaware Newark, DE 19716 jchen@cis.udel.edu ... trigram models for part-of-speech tagging and supertag- ging, in this paper our goal is to improve the per- formance of supertagging using local techniques which avoid ful...

Ngày tải lên: 08/03/2014, 21:20

... in NLU there is a fun- damental asymmetry between the natural language and the unambiguous formal language. Most no- tably, one formal language word may frequently cor- respond to whole English ... then generated from a sin- gle formal language word using a translation model. The notion of what constitutes a natural clumping depends on the formal language. For example, su...

Ngày tải lên: 08/03/2014, 21:20

... AFNLP Minimized Models for Unsupervised Part-of-Speech Tagging Sujith Ravi and Kevin Knight University of Southern California Information Sciences Institute Marina del Rey, California 90292 {sravi,knight}@isi.edu Abstract We ... new possibilities for future research. For direct comparison to previous works, we also pre- sented results for the case when the dictionaries are incom...

Ngày tải lên: 17/03/2014, 01:20

... Statistical Models for Unsupervised Prepositional Phrase Attachment Adwait Ratnaparkhi Dept. of Computer and Information Science University of Pennsylvania ... Abstract We present several unsupervised statistical models for the prepositional phrase attachment task that approach the accuracy of the best su- pervised methods for this task. Our unsuper- ... base for...

Ngày tải lên: 17/03/2014, 07:20

... 2010. c 2010 Association for Computational Linguistics Topic Models for Word Sense Disambiguation and Token-based Idiom Detection Linlin Li, Benjamin Roth, and Caroline Sporleder Saarland University, ... neighbour for the chosen word and then assigns a sense based on the word, its neighbour and the topic. Boyd-Graber and Blei (2007) test their method on WSD...

Ngày tải lên: 23/03/2014, 16:20

... — Describe a high-throughput method for the analysis of uncertain models, e.g. in biological research. Methods — Generalized modeling for conceptual analysis of large classes of models. Results ... ,2 1 Generalized Models for high-throughput analysis of uncer- tain nonlinear systems Thilo Gross , Stefan Siegmund ∗ 2 1 Max-Planck Institute for the Phys...

Ngày tải lên: 20/06/2014, 21:20

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 15:20

... be reformulated in terms of the aforementioned statistics on binary words or lattice paths, our approach, based on statistics on domino arrangements, yields the most transparent constructions ... The foregoing observations establish (2.9) for 0  n  2since R ∗ n = R n for such n. Thus, it remains only to construct a ν-parity changing involution of R n −R ∗ n for n  3. Such...

Ngày tải lên: 07/08/2014, 08:22

... realization of the K-restricted jagged partitions for K odd has been found recently, in the context of superconformal minimal models [14]. 2 Jagged partitions Let us start by formalizing and exemplifying ... λ j = λ j+1 = λ j+K−2 + K − 1=λ j+K−1 + K − 1 . (63) To transform a generating function for K-restricted jagged partitions to one for partitions subject to (62) and (63)...

Ngày tải lên: 07/08/2014, 08:22

... to two optimization problems related to covering codes in which one leads to an exact solution (for binary codes) . For instance, we show that for 0 <k<n,(n − k − d) ≤ α m n where d = t(n ... straightforward. x 1 calls out the value Y 2 =(  n i=2 y i )modm.Foreachi>1, x i ◦ can see the values y i+1 , ,y n ◦ has heard the values Y 2 and y 2 , ,y i−1 and therefore uses the exp...

Ngày tải lên: 07/08/2014, 13:21

... ⊆  [n] r  k-wise intersecting if for any F 1 , . . . , F k ∈ F,  k i=1 F i = ∅. Frankl [5] proved the following theorem for k-wise intersecting families. Theorem 1.1 (Frankl). Let F ⊆  [n] r  be k-wise ... ǫ)  n−1 r−1  . We note that for k ≥ 2, F is k-wise intersecting implies that it is intersecting. Hence if r < n/2, the results obtained in the papers mention...

Ngày tải lên: 08/08/2014, 14:23