941 search results - page 120 / 189 » Efficient Testing of Large Graphs |
109
click to vote
KDD
2012
ACM
13 years 6 days ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
ACT Maps are vital tools for most government agencies and consumers. However, their manual generation and updating is tedious and time consuming. As a step toward automatic map gen...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
TGIS
2010
14 years 4 months ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
GBRPR
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...