Sciweavers

469 search results - page 54 / 94
» Edges as Nodes - a New Approach to Timetable Information
Sort
View
ESANN
2008
13 years 9 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
CP
2007
Springer
14 years 1 months ago
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
Stéphane Zampelli, Yves Deville, Christine ...
CSMR
2010
IEEE
13 years 2 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
CVPR
2009
IEEE
15 years 2 months ago
Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In general, shapecorrespondenc...
Andrew Temlyakov, Brent C. Munsell, Song Wang