EDP Sciences Journals List
Home Document
Subscriber Authentication Point
Free access article

Issue ESAIM: PS
Volume 9, 2005
Page(s) 241 - 253
DOI 10.1051/ps:2005012

References of  September 2005, Vol. 9, p. 241-253
  1. O. Barndorff-Nielsen, Information and Exponential Families. Wiley, New York (1978).
  2. T. Bu, N. Duffield, F. Lo Presti and D. Towsley, Network tomography on general topologies. Proc. ACM Sigmetrics 2002, Marina Del Ray, June 15-19 (2002).
  3. R. Cáceres, N.G. Duffield, J. Horowitz, D. Towsley and T. Bu, Multicast-based inference of network internal characteristics: accuracy of packet loss estimation. IEEE Trans. Inform. Theory 45 (2000) 2462-2480.
  4. M. Coates, A.O. Hero, R. Nowak and B. Yu, Internet tomography. IEEE Signal Processing Magazine 19 (2002) 47-65 [CrossRef].
  5. J.N. Darroch and D. Ratcliff, Generalized iterative scaling for log-linear models. Ann. Math. Stat. 43 (1972) 1470-1480 [MathSciNet].
  6. A.P. Dempster, N.M. Laird and D.B. Rubin, Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. B 39 (1997) 1-38.
  7. I.H. Dinwoodie and E. Mosteig, Statistical inference for network reliability with spatial dependence. SIAM J. Discrete Math. 16 (2003) 663-674 [CrossRef] [MathSciNet].
  8. N. Duffield, J. Horowitz, D. Towsley, W. Wei and T. Friedman, Multicast-based loss inference with missing data. IEEE J. Selected Areas Communications 20 (2002) 700-713.
  9. C. Ji and A. Elwalid, Measurement-based network monitoring and inference: scalability and missing information. IEEE J. Selected Areas Communications 20 (2002) 714-725.
  10. G. Liang and B. Yu, Maximum pseudo-likelihood estimation in network tomography. IEEE Trans. Signal Process. 51 (2003) 2043-2053 [CrossRef].
  11. M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston (1964).
  12. P. Parrilo and B. Sturmfels, Minimizing polynomial functions. http://xyz.lanl.gov/abs/math.OC/0103170 (2002).
  13. Y. Tsang, M. Coates and R. Nowak, Passive network tomography using EM algorithms. Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing, Salt Lake City, Utah 3 (May 2001) 1469-1472.
  14. C.F. Jeff Wu, On the convergence of the EM algorithm. Ann. Statist. 11 (1983) 95-103 [MathSciNet].
  15. B. Xi, G. Michailidis and V.N. Nair, Estimating network internal losses using a new class of probing experiments. University of Michigan Department of Statistics Technical Report 397 (2003).



What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.
  • If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
  • You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
  • You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.