Sciweavers

239 search results - page 41 / 48
» Random walks in a supply network
Sort
View
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...
DSN
2008
IEEE
14 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
ISCAS
2006
IEEE
143views Hardware» more  ISCAS 2006»
14 years 1 months 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
SASN
2004
ACM
14 years 24 days ago
Source-location privacy in energy-constrained sensor network routing
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related iss...
Celal Ozturk, Yanyong Zhang, Wade Trappe
IDEAS
2003
IEEE
131views Database» more  IDEAS 2003»
14 years 20 days ago
Neighborhood Signatures for Searching P2P Networks
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam