Sciweavers

1756 search results - page 143 / 352
» Directed scale-free graphs
Sort
View
RSFDGRC
2005
Springer
117views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Dependency Bagging
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
Yuan Jiang, Jinjiang Ling, Gang Li, Honghua Dai, Z...
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 13 days 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
IPPS
1998
IEEE
14 years 12 days ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
IPPS
1998
IEEE
14 years 12 days ago
Scheduling with Communication Delays and Data Routing in Message Passing Architectures
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
Aziz Moukrim, Alain Quilliot
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
14 years 11 days 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