Sciweavers

3008 search results - page 304 / 602
» Independence in connected graphs
Sort
View
COMBINATORICA
2011
14 years 6 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
MOBIHOC
2004
ACM
16 years 6 months ago
Locating cache proxies in manets
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...
Roy Friedman, Maria Gradinariu, Gwendal Simon
ANLP
1992
81views more  ANLP 1992»
15 years 8 months ago
Portable Natural Language Generation using SPOKESMAN
1 This paper reports on the SPOKESMAN natural language generation system, which is a domain independent text generator designed to incrementally produce text for an underlying appl...
Marie Meteer
NN
2010
Springer
163views Neural Networks» more  NN 2010»
15 years 1 months ago
Approximating the stability region of a neural network with a general distribution of delays
We investigate the linear stability of a neural network with distributed delay, where the neurons are identical. We examine the stability of a symmetrical equilibrium point via th...
R. Jessop, S. A. Campbell
PC
2000
96views Management» more  PC 2000»
15 years 6 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu