394 search results - page 69 / 79 » Testing subgraphs in large graphs |
ICPR
2004
IEEE
14 years 8 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
13 years 11 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...
CAP
2010
13 years 2 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
TGIS
2010
13 years 2 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...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...