779 search results - page 33 / 156 » Algorithms for the Sample Mean of Graphs |
104
click to vote
PR
2008
14 years 11 months ago
2008
In this paper, we make a study on three Linear Discriminant Analysis (LDA) based methods: Regularized Discriminant Analysis (RDA), Discriminant Common Vectors (DCV) and Maximal Ma...
PAKDD
2010
ACM
15 years 4 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
109
click to vote
APVIS
2001
15 years 1 months ago
2001
Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been develo...
SEFM
2008
IEEE
15 years 6 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
101
click to vote
RSFDGRC
2005
Springer
15 years 5 months ago
2005
Springer
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...