4865 search results - page 579 / 973 » The Complexity of Graph Connectivity |
178
click to vote
FMCO
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
156
click to vote
PATMOS
2004
Springer
16 years 5 days ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
176
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
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...
149
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
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...
187
Voted
KDD
1994
ACM
15 years 11 months ago
1994
ACM
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...