نتایج جستجو برای: perfect mixing model

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

Journal: :Discrete Mathematics 1997
Stefan Hougardy

We will extend Reed's Semi-Strong Perfect Graph Theorem by proving that unbreakable C 5-free graphs diierent from a C 6 and its complement have unique P 4-structure.

Journal: :Bulletin of JSME 1982

We have considered a perfect sample method for model selection of finite mixture models with either known (fixed) or unknown number of components which can be applied in the most general setting with assumptions on the relation between the rival models and the true distribution. It is, both, one or neither to be well-specified or mis-specified, they may be nested or non-nested. We consider mixt...

2017
Rodrigo Ramos Jiliberto Pablo Moisset de Espan'es

In a recent paper published in Ecosphere, their authors suggest that extending the logistic growth model in its usual r−K parameterization to a multi-patch environment results in undesirable properties, that were referred to as the “perfect mixing paradox”. ∗[email protected] (corresponding author) †[email protected] 1 ar X iv :1 70 3. 02 96 2v 1 [ qbi o. PE ] 8 M ar 2 01 7 This le...

Journal: :Journal of Graph Theory 2018
Maria Chudnovsky

The Wonderful Lemma, that was first proved by Roussel and Rubio, is one of the most important tools in the proof of the Strong Perfect Graph Theorem. Here we give a short proof of this lemma.

2009
Abby D. Levenberg Miles Osborne

Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whilst maintaining a constant error rate. We present a novel randomised language model which uses an online perfect hash function to efficiently deal with unbounded text streams. Translation experiments over a text stream...

Journal: :J. Comb. Theory, Ser. A 2007
Simon R. Blackburn Tuvi Etzion Douglas R. Stinson Gregory M. Zaverucha

The paper provides an upper bound on the size of a (generalized) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, secure frameproof codes and separating hash families of small type. © 2008 Elsevier Inc. All rights re...

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

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