900 search results - page 65 / 180 » On Polynomial Time Computation over Unordered Structures |
CP
2008
Springer
13 years 10 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...