188 search results - page 33 / 38 » Back to the Complexity of Universal Programs |
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
IFIP
2001
Springer
13 years 11 months ago
2001
Springer
Effective security management depends upon good risk management, which is itself based upon a reliable risk assessment, involving data collection of all the facets influencing sys...
HPDC
1996
IEEE
13 years 11 months ago
1996
IEEE
' The coming of giga-bit networks makes possible the realization ofa single nationwide virtual computer comprised of a variety of geographically distributed highpe6ormance mac...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...