688 search results - page 100 / 138 » Comparison of Conceptual Graphs |
67
Voted
MINENET
2006
ACM
15 years 3 months ago
2006
ACM
We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: ...
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
81
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a novel constructive learning algorithm for a competitive neural network. The proposed algorithm is developed by taking ideas from the immune system and demons...
MICCAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...