Search

9 Aug 2009: in practice; his ‘coalescent’ [23, 24] is a beautiful piece of probability,. ... Annals of Prob-ability, 24, 411–421. [32] Peled, R. 2008. Personal communication.[33] Peled, R.

8 May 2009: Daily traffic profiles were calculated using the CCITT method [24]. An immediately striking feature of the traffic matrix given in Table 1 is that the larger busy hour traffics between time ... overloads of 53% for Japan, 24% for USA or 15% for UK (in a

2 Sep 2009: A linear network. Metering policy. Optimal policy? Proportionally fair metering. Slide Number 24.

8 May 2009: 2 Xk h2k!1=2 C ; (24)the second inequality is familiar as the Hoeffding bound.

15 Apr 2009: ACM Comp. Commun. Rev. 24, 10{23.(See http://www.aciri.org/ oyd/ecn.html.). Floyd, S. & Jacobson, V.

21 Oct 2009: We state the result here, but refer the reader to (24, Section C) for anaccessible justification of the result and to (30, Section 7) for a proof. ... φ RJ+. 24. Thus ( N(h)sh. : s S) has a characteristic function that converges in the following way.

30 Apr 2009: F Kn (ĥn) Fn ‖ D. n log n. by construction of the estimator, which proves (24). ... holding. Ann. Stat. 24, 508–539 (1996)8. Dümbgen, L., Rufibach, K.: Maximum likelihood estimation of a log-concave density and its distribu-.

25 Mar 2009: See [23, 24] and [5, 27]. Thespin-clusters of the Ising model on T are ‘critical’ (in a certain sense described below)for all p (pc(T), 12 ], and this suggests ... 24] , Towards conformal invariance of 2D lattice models, Proceedings of the

2 Jul 2009: RANDOM GRAPHS WITH. FORBIDDEN VERTEX DEGREES. GEOFFREY GRIMMETT AND SVANTE JANSON. Abstract. We study the random graph Gn,λ/n conditioned on theevent that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a

1 Jul 2009: 15th International Teletraffic Congress,. Washington D.C., 24 June 1997. The reliable operation of a public multiservice broadband network raises design issues both within the subnetworks run by individual network operators,