502 search results - page 36 / 101 » Verifying Balanced Trees |
102
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
82
Voted
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
127
Voted
AGTIVE
2003
Springer
15 years 5 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
96
Voted
ICDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
203
Voted
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...