Sciweavers

583 search results - page 21 / 117
» Computing Linking Numbers of a Filtration
Sort
View
IJISEC
2006
119views more  IJISEC 2006»
13 years 9 months ago
A monitoring system for detecting repeated packets with applications to computer worms
Abstract We present a monitoring system which detects repeated packets in network traffic, and has applications including detecting computer worms. It uses Bloom filters with count...
Paul C. van Oorschot, Jean-Marc Robert, Miguel Var...
IPSN
2005
Springer
14 years 3 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
WEBI
2005
Springer
14 years 3 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
AMC
2007
129views more  AMC 2007»
13 years 10 months ago
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
SPAA
2012
ACM
12 years 7 days ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...