Sciweavers

2076 search results - page 16 / 416
» Universal Routing in Distributed Networks
Sort
View
ICDCS
1996
IEEE
13 years 11 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
NECO
2008
146views more  NECO 2008»
13 years 7 months ago
Deep, Narrow Sigmoid Belief Networks Are Universal Approximators
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
Ilya Sutskever, Geoffrey E. Hinton
HPCC
2007
Springer
14 years 1 months ago
Stability Aware Routing: Exploiting Transient Route Availability in MANETs
The highly dynamic character of a mobile ad-hoc network (MANET) poses significant challenges on network communications and resource management. Previous work on routing in MANETs ...
Pramita Mitra, Christian Poellabauer, Shivajit Moh...
GLOBECOM
2006
IEEE
14 years 1 months ago
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
Yuh-Ren Tsai
ICASSP
2011
IEEE
12 years 11 months ago
Distributed routing in networks using affinity propagation
This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper d...
Manohar Shamaiah, Sang Hyun Lee, Sriram Vishwanath...