Asymptotic theory of greedy approximations to minimal $K$-point random graphs

Alfred O. Hero III and Olivier J. J. Michel
Tech. report TR 315, Univ. of Michigan, Communications & Signal Processing Lab., Sep 1998
IEEE Trans. Information Theory IT-45:1921–1939, Sep 1999
ftp://ftp.eecs.umich.edu/people/hero/Preprints/it98_final_draft.ps.Z
http://www.eecs.umich.edu/techreports/systems/cspl/cspl-315.ps.gz

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!