Sciweavers

619 search results - page 52 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
ACSW
2006
13 years 9 months ago
Description of bad-signatures for network intrusion detection
Today, a computer network is under constant assault from attacks. In Computer Science, NIDS are used in order to protect a computer network against these intrusions. These systems...
Michael Hilker, Christoph Schommer
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
CASES
2010
ACM
13 years 5 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
GIS
2008
ACM
13 years 7 months ago
An ACS cooperative learning approach for route finding in natural environment
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...
David Brosset, Christophe Claramunt, Eric Saux
SIGIR
2004
ACM
14 years 1 months ago
A logic-based approach for computing service executions plans in peer-to-peer networks
Abstract. Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Di...
Henrik Nottelmann, Norbert Fuhr