Sciweavers

526 search results - page 48 / 106
» Representations of structural closure operators
Sort
View
132
Voted
KDID
2003
119views Database» more  KDID 2003»
15 years 5 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer
124
Voted
ECSCW
2003
15 years 5 months ago
Customizable Collaborative Editor Relying on treeOPT Algorithm
Research in collaborative editing tends to have been undertaken in isolation rather than as part of a general information or application infrastructure. Our goal is to develop a un...
Claudia-Lavinia Ignat, Moira C. Norrie
141
Voted
OOPSLA
1999
Springer
15 years 8 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
137
Voted
GECCO
2000
Springer
153views Optimization» more  GECCO 2000»
15 years 7 months ago
Applying Genetic Algorithms to Multi-Objective Land Use Planning
This paper explores the application of multiobjective Genetic Algorithms (mGAs) to rural land use planning, a spatial allocation problem. Two mGAs are proposed. Both share an unde...
Keith B. Matthews, Susan Craw, Stewart Elder, Alan...
118
Voted
TALG
2008
127views more  TALG 2008»
15 years 3 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra