Sciweavers

13214 search results - page 144 / 2643
» Pseudorandomness for network algorithms
Sort
View
IPPS
2007
IEEE
16 years 23 days ago
Deadline-based QoS Algorithms for High-performance Networks
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-...
Alejandro Martínez, Francisco José A...
DSOM
2007
Springer
16 years 19 days ago
NADA - Network Anomaly Detection Algorithm
This paper deals with a new iterative Network Anomaly Detection Algorithm – NADA, which accomplishes the detection, classification and identification of traffic anomalies. NADA f...
Silvia Farraposo, Philippe Owezarski, Edmundo Mont...
ISCIS
2004
Springer
15 years 12 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ESANN
2003
15 years 7 months ago
Autonomous learning algorithm for fully connected recurrent networks
In this paper fully connected RTRL neural networks are studied. In order to learn dynamical behaviours of linear-processes or to predict time series, an autonomous learning algori...
Edouard Leclercq, Fabrice Druaux, Dimitri Lefebvre
ENTCS
2007
110views more  ENTCS 2007»
15 years 6 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano