5473 search results - page 652 / 1095 » On the graph isomorphism problem |
191
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of tag prediction in collaborative tagging systems where users share and annotate resources on the Web. We put forward HAMLET, a novel approach to automatic...
190
click to vote
FQAS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
204
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
177
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
167
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...