نتایج جستجو برای: best known hypothesis

تعداد نتایج: 1242829  

2004
Ingrid Stairs

Radio pulsar observations can be used to test aspects of general relativity from equivalence principle violations to binary orbital effects in the strong-field regime. This article summarizes the status of such tests at the start of the meeting, and describes two new tests made possible by recent observations of well-known binary pulsar systems.

Journal: :تحقیقات کتابداری و اطلاع رسانی دانشگاهی 0
رضا دیبا دکتر حجت الله حسن لاریجانی

this research is to determine considering the standards which are applied for the persian abstract of imam sadeq university's dissertations from 1368 and the accord ability of it with the iso of preparing the abstracts. the population for this research is the persian abstracts from 1368 to 1382. the main results show that in the faculties of imam sadeq university, the political faculty of ...

Journal: :Int. J. of Asian Lang. Proc. 2010
Jinhua Du Andy Way

System combination has been applied successfully to various machine translation tasks in recent years. As is known, the hypothesis alignment method is a critical factor for the translation quality of system combination. To date, many effective hypothesis alignment metrics have been proposed and applied to the system combination, such as TER, HMM, ITER, IHMM, and SSCI. In addition, Minimum Bayes...

2003
Gábor Gosztolya András Kocsor

During automatic speech recognition selecting the best hypothesis over a combinatorially huge hypothesis space is a very hard task, so selecting fast and efficient heuristics is a reasonable strategy. In this paper a general purpose heuristic, the multi-stack decoding method, was refined in several ways. For comparison, these improved methods were tested along with the well-known Viterbi beam s...

Journal: :Computational Geometry: Theory and Applications 2022

A graph G with n vertices is called an outerstring if it has intersection representation a set of curves inside disk such that one endpoint every curve attached to the boundary disk. Given s segments, Maximum Independent Set ( MIS ) can be computed in O 3 time (Keil et al. (2017) [22] ). We examine fine-grained complexity problem on some well-known representations (e.g., line L -shapes, etc.), ...

2008
VENKATESAN T. CHAKARAVARTHY SAMBUDDHA ROY

We show that Sp2 ⊆ P , where Sp2 is the symmetric alternation class and prAM refers to the promise version of the Arthur-Merlin class AM. This is derived as a consequence of our main result that presents an FP algorithm for finding a small set of “collectively irrefutable certificates” of a given S2-type matrix. The main result also yields some new consequences of the hypothesis that NP has pol...

2008
Venkatesan T. Chakaravarthy Sambuddha Roy

We show that Sp2 ⊆ P , where Sp2 is the symmetric alternation class and prAM refers to the promise version of the Arthur-Merlin class AM. This is derived as a consequence of our main result that presents an FP algorithm for finding a small set of “collectively irrefutable certificates” of a given S2-type matrix. The main result also yields some new consequences of the hypothesis that NP has pol...

1998
Esther Klabbers Raymond N. J. Veldhuis

One well-known problem with diphone concatenation is the occurrence of audible discontinuities at diphone boundaries, which are most prominent in vowels and semi-vowels. Significant formant jumps at certain boundaries suggest that the problem is of a spectral nature. We have examined this hypothesis by correlating the results of a listening experiment with spectral distances measured across dip...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید