Sciweavers

906 search results - page 75 / 182
» Map graphs
Sort
View
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 2 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
GPCE
2007
Springer
13 years 11 months ago
Library composition and adaptation using c++ concepts
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
Jaakko Järvi, Matthew A. Marcus, Jacob N. Smi...
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 9 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
LREC
2008
142views Education» more  LREC 2008»
13 years 9 months ago
Enriching Frame Semantic Resources with Dependency Graphs
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
Hagen Fürstenau
ICIAP
2003
ACM
14 years 1 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar