Sciweavers

4962 search results - page 98 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
NETWORKING
2004
15 years 6 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
CONNECTION
2004
92views more  CONNECTION 2004»
15 years 4 months ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
160
Voted
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 10 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 5 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
MOBIHOC
2009
ACM
15 years 11 months ago
Low-connectivity and full-coverage three dimensional wireless sensor networks
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
Xiaole Bai, Chuanlin Zhang, Dong Xuan, Jin Teng, W...