905 search results - page 63 / 181 » On the Complexity of uSPR Distance |
103
click to vote
BPM
2006
Springer
15 years 1 months ago
2006
Springer
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
IJCINI
2007
14 years 9 months ago
2007
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
INFOVIS
2003
IEEE
15 years 3 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...