2677 search results - page 349 / 536 » Locally Served Network Computers |
156
click to vote
DCOSS
2005
Springer
16 years 2 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
154
click to vote
GSN
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm that makes an appropriate use of a Kalman filter combined with a geometric computation with respect to the localisation of a pollutant-emitting point sourc...
166
click to vote
UAI
1996
15 years 7 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
184
click to vote
TNN
2008
15 years 6 months ago
2008
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
236
click to vote
CISS
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper presents the system level performance evaluation for energy-detection based cooperative spectrum sensing in cognitive radio networks. Three performance criteria are q...