Sciweavers

972 search results - page 40 / 195
» Performance of data networks with random links
Sort
View
ICONIP
2010
15 years 4 months ago
Improving Recurrent Neural Network Performance Using Transfer Entropy
Abstract. Reservoir computing approaches have been successfully applied to a variety of tasks. An inherent problem of these approaches, is, however, their variation in performance ...
Oliver Obst, Joschka Boedecker, Minoru Asada
COMPCON
1995
IEEE
15 years 9 months ago
IEEE 1394: A Ubiquitous Bus
A link is an unreliable FIFO channel. As we mentioned earlier, it is an abstraction of a point-topoint wire or of a simple broadcast LAN. It is unreliable because noise or other ph...
Gary Hoffman, Daniel Moore
MSWIM
2004
ACM
15 years 11 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
MOBIHOC
2002
ACM
16 years 5 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 1 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...