Search: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, n, Research paper, 2009, 50 - 99

1 result

Results

An efficient and scalable algorithm for segmented alignment of ontologies of arbitrary size

... of pairs of nodes from given two ontologies, where N denotes the average number of nodes in each ontology. Our proposed algorithm ...

Publication - george - 04/17/2013 - 04:38 - 0 comments - 0 attachments