Search
Search Funnelback University
- Refined by:
- Date: 2009
1 -
6 of
6
search results for KaKaoTalk:po03 op |u:www.statslab.cam.ac.uk
where 0
match all words and 6
match some words.
Results that match 1 of 2 words
-
J Theor Probab (2009) 22: 38–56DOI 10.1007/s10959-008-0177-3 On…
www.statslab.cam.ac.uk/~nickl/Site/__files/jotp09.pdf30 Apr 2009: n(pYn pY. ) (pZn pZ). p,λ= oP(1) (8). for p = (or p = 2). ... OP(n2t/(2t1). ) = oP(n1/2. ). since t > 1/2, and we have, for example, the following:. -
93 1 TELE1RAFFIC AND DATA1RAFFIC in a Period of ...
www.statslab.cam.ac.uk/~frank/PAPERS/cin.pdf8 May 2009: 93. 1. TELE1RAFFIC AND DATA1RAFFIC in a Period of Change, ITC-l3 A. Jensen and V.B. Iversen (Editors) Elsevier Science Publishers B.V. (North-Holland) e IAC, 1991. COALITIONS IN THE INTERNATIONAL NETWORK. R J Gibbens" F P Kelly. Statistical -
RANDOM GRAPHS WITH FORBIDDEN VERTEX DEGREES GEOFFREY GRIMMETT AND ...
www.statslab.cam.ac.uk/~grg/papers/sj208.pdf2 Jul 2009: op(n) edges and n0/np 1, which is to say that n(1 op(1)) vertices are. -
paper.dvi
www.statslab.cam.ac.uk/~frank/CP/cp.pdf26 Apr 2009: The Cliord Paterson Lecture Modelling communication networks. present and future. By F P Kelly. Statistical Laboratory University of Cambridge Mill Lane Cambridge CB SB UK. Modern communication networks are able to respond to randomly -
Uniform limit theorems for wavelet density estimators
www.statslab.cam.ac.uk/~nickl/Site/__files/AOP447.pdf22 Jul 2009: Donsker classes F. Our proofs will in fact show ‖P Wn Pn‖F = oP (1/. -
Noname manuscript No.(will be inserted by the editor) Resource ...
www.statslab.cam.ac.uk/~frank/PAPERS/ERLANG/kmwV3.pdf21 Oct 2009: We now prove Theorem 2. The theorem helps explain how the collapse ofour original queueing model is related to the multi-path proportionally fair op-timisation problem.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.