Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
A model of a packet radio network in which transmitters with range R are distributed according to a twodimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR 2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if πR2D > N0, for some critical value N0. We show that 2.195 < N0 < 10.526. © 1989 IEEE
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Liqun Chen, Matthias Enzmann, et al.
FC 2005
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007