نتایج جستجو برای: kneser graph
تعداد نتایج: 198300 فیلتر نتایج به سال:
S (in alphabetic order by speaker surname) Title: Geometric distance-regular graphs without 4-claws Speaker: Sejeong Bang, Seoul National University Abstract: A non-complete distance-regular graph Γ is called geometric if there exists a set C of Delsarte cliques such that each edge of Γ lies in a unique clique in C. In this talk, we determine the non-complete distance-regular graphs satisfying ...
In this work we address the challenge of augmenting n-gram language models according to prior linguistic intuitions. We argue that the family of hierarchical Pitman-Yor language models is an attractive vehicle through which to address the problem, and demonstrate the approach by proposing a model for German compounds. In our empirical evaluation the model outperforms a modified Kneser-Ney n-gra...
Given positive integers n⩾2k, the Kneser graph KGn,k is a whose vertex set collection of all k-element subsets {1,…,n}, with edges connecting pairs disjoint sets. One classical results in combinatorics, conjectured by and proved Lovász, states that chromatic number equal to n−2k+2. In this paper, we study random KGn,k(p), is, obtained from including each independently probability p. We prove th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید