Sciweavers

2492 search results - page 214 / 499
» On the General Signature Trees
Sort
View
GD
2005
Springer
16 years 1 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
16 years 1 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
DIAGRAMS
2004
Springer
16 years 29 days ago
Decision Diagrams in Machine Learning: An Empirical Study on Real-Life Credit-Risk Data
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result...
Christophe Mues, Bart Baesens, Craig M. Files, Jan...
212
Voted
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
16 years 25 days ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
177
Voted
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 11 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen