3154 search results - page 164 / 631 » Computing Closed Skycubes |
163
click to vote
BPM
2009
Springer
16 years 19 days ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
160
Voted
WG
2009
Springer
16 years 19 days ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
138
click to vote
CIKM
2009
Springer
16 years 19 days ago
2009
Springer
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...
167
click to vote
IWPEC
2009
Springer
16 years 18 days ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
134
click to vote
MFCS
2009
Springer
16 years 18 days ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...