900 search results - page 2 / 180 » On Polynomial Time Computation over Unordered Structures |
ALT
2003
Springer
13 years 9 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
BIRTHDAY
2009
Springer
14 years 1 days ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
PAKDD
2005
ACM
13 years 10 months ago
2005
ACM
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...