Sciweavers

1722 search results - page 53 / 345
» Variables in Concept Graphs
Sort
View
CPC
2007
101views more  CPC 2007»
14 years 9 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
ICML
1990
IEEE
15 years 1 months ago
An Incremental Method for Finding Multivariate Splits for Decision Trees
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
Paul E. Utgoff, Carla E. Brodley
FASE
2005
Springer
15 years 3 months ago
Ensuring Structural Constraints in Graph-Based Models with Type Inheritance
Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entitie...
Gabriele Taentzer, Arend Rensink
CORR
2008
Springer
136views Education» more  CORR 2008»
14 years 9 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
ILP
1997
Springer
15 years 1 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki