Sciweavers

2612 search results - page 297 / 523
» Switching Graphs and Their Complexity
Sort
View
145
Voted
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
15 years 9 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
15 years 9 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 9 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
CIE
2009
Springer
15 years 9 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
DEXAW
2004
IEEE
152views Database» more  DEXAW 2004»
15 years 8 months ago
OntoEditor: A Web Tool for Manipulating Ontologies Stored in Database Servers
The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies which enable the ...
Cláudio de Souza Baptista, Karine F. Vascon...