535 search results - page 21 / 107 » Generalized Version Space Trees |
ICLP
1992
Springer
15 years 3 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
103
click to vote
COLOGNETWENTE
2009
15 years 25 days ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
KDID
2003
15 years 1 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
106
click to vote
TKDE
2008
14 years 11 months ago
2008
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
102
click to vote
WALCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...