Sciweavers

3247 search results - page 442 / 650
» Randomized smoothing networks
Sort
View
MOBICOM
2009
ACM
16 years 1 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
DSN
2008
IEEE
16 years 1 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
IPSN
2007
Springer
16 years 21 days ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
ISCAS
2006
IEEE
143views Hardware» more  ISCAS 2006»
16 years 17 days ago
Dynamic computation in a recurrent network of heterogeneous silicon neurons
Abstract—We describe a neuromorphic chip with a twolayer excitatory-inhibitory recurrent network of spiking neurons that exhibits localized clusters of neural activity. Unlike ot...
Paul Merolla, Kwabena Boahen
LCN
2006
IEEE
16 years 17 days ago
Clustered Mobility Model for Scale-Free Wireless Networks
— Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free power-law connectivity distribution and a few densely...
Sunho Lim, Chansu Yu, Chita R. Das