Sciweavers

13214 search results - page 180 / 2643
» Pseudorandomness for network algorithms
Sort
View
IJON
2002
67views more  IJON 2002»
15 years 6 months ago
Test of spike-sorting algorithms on the basis of simulated network data
: Results of spike sorting algorithms are usually compared against recorded signals which themselves underly interpretations, distortions and errors. Our approach is to provide and...
Kerstin M. L. Menne, Andre Folkers, Thomas Malina,...
TWC
2010
15 years 1 months ago
Distributed Routing Algorithms for Underwater Acoustic Sensor Networks
Underwater Acoustic Sensor Networks (UW-ASNs) consist of devices with sensing, processing, and communication capabilities that are deployed underwater to perform collaborative moni...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz
UAI
2003
15 years 8 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
DIS
2009
Springer
16 years 1 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han
ICC
2007
IEEE
146views Communications» more  ICC 2007»
16 years 26 days ago
Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
Saad B. Qaisar, Shirish S. Karande, Kiran Misra, H...