نتایج جستجو برای: cramer d w
تعداد نتایج: 739961 فیلتر نتایج به سال:
J. Adams, C. Adler, M. M. Aggarwal, Z. Ahammed, J. Amonett, B. D. Anderson, M. Anderson, D. Arkhipkin, G. S. Averichev, S. K. Badyal, J. Balewski, O. Barannikova, L. S. Barnby, J. Baudot, S. Bekele, V.V. Belaga, R. Bellwied, J. Berger, B. I. Bezverkhny, S. Bhardwaj, P. Bhaskar, A. K. Bhati, H. Bichsel, A. Billmeier, L. C. Bland, C. O. Blyth, B. E. Bonner, M. Botje, A. Boucham, A. Brandin, A. Br...
We describe infinitely scalable pipeline machines with perfect parallelism, in the sense that every instruction of an inline program is executed, on successive data, on every clock tick. Programs with shared data effectively execute in less than a clock tick. We show that pipeline machines are faster than single or multi-core, von Neumann machines for sufficiently many program runs of a suffici...
N o tre D am e Security w as co n tin u in g its search yesterday for five m en w ho allegedly ro b b ed a b lin d N o tre D am e s tu d e n t early W ednesday m orn ing , said D irec to r o f Security Rex R akow . T h e s tu d e n t, w ho is legally b lin d , w as ro bbed as he w as w alk in g a ro u n d St. Jo sep h 's Lake at approx im ate ly I a .m ., R akow said . H e w as accom pan ied...
In this paper, the problem of two-dimensional (2-D) frequency estimation of a complex sinusoid embedded in a white Gaussian additive noise is addressed. A new frequency estimator based on a least square plane fitting of the estimated autocorrelation phase of the signal is derived. This algorithm requires a 2-D phase unwrapping step which can be easily done. This algorithm is shown to be unbiase...
تکنیک کشت بافت گیاهی و باززایی در محیط درون شیشه, امکانی برای تولید مداوم مواد موثره ویژه به منظور استفاده در صنایع دارویی, آرایشی و غذایی و همچنین, مجالی برای انتخاب, تکثیر و حفظ ژنوتیپ های مهم و نادر گیاهان دارویی فراهم نموده و توانسته است گیاهان دارویی مهم را به نحو موثرتری در مقایسه با روش های سنتی ازدیاد رویشی تکثیر و حفظ نماید. در مطالعه ای که با هدف تکثیر درون شیشه ای انجدان رومی (levist...
A weighted orientation of a graph G is pair (D,w) where D an and w arc-weighting D, that application A(D)→N∖{0}. The in-weight vertex v in (D,w), denoted by S(D,w)(v), the sum weights arcs with head D. semi-proper such two adjacent vertices have different in-weights. number G, χs⃗(G), min(D,w)∈Γmaxv∈V(G)S(D,w)(v), Γ set all orientations G. optimal if maxv∈V(G)S(D,w)(v)=χs⃗(G). In this work, we sh...
An (r, w; d) cover-free family (CFF ) is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in the union of any other w members. The minimum number of elements for which there exists an (r, w; d) − CFF with t blocks is denoted by N((r, w; d), t). In this paper, we show that the value of N((r, w; d), t) is equal...
The niche graph of a digraph $D$ has $V(D)$ as the vertex set and an edge $uv$ if only $(u,w) \in A(D)$ $(v,w) A(D)$, or $(w,u) $(w,v) for some $w V(D)$. notion was introduced by Cable et al. (1989) variant competition graph. If is $D$, it said to be niche-realizable through $D$. $G$ $k$-partite tournament integer $k \ge 2$, then we say that pair $(G, k)$ niche-realizable. Bowser (1999) studied...
V 3 + W 0 3 # 0 6X W Y 6060(* Z / -,[ / # W 0 56 / -,[ / ' ) 0 \ / ". 0 [6 ( Q@ Z @ [". @6 ], A<>D ^_ @4 @ ` a>D W ` b6c =6 ], 3 de 0 3 ,\Q0 8^_ 0 f / #" (?6 8 2". @6 ], g # W J @ 0 #"9 N 6 6 0 2 W L 6 (* h 86% : %(* @ i W + % / D6 8 #Tkj)>? b6f^_ Wlnm@( @6 L D6C ^_ 9 : C a>D o6 + #"J W"` 5606 (* ' ) 8 D6 : o . 0 ."J @ Z / 3L @ W 0 # 0 ' @ / W (* / 86@MZI0pF /> Z(* @ Z / 7c : o W + C6 Nqr @6 )"...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید