507 search results - page 69 / 102 » Sizes of Ordered Decision Trees |
89
Voted
EPIA
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
73
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
93
Voted
HPDC
1994
IEEE
15 years 4 months ago
1994
IEEE
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
CHARME
2001
Springer
15 years 4 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
113
Voted
IEEECIT
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract--The size, heterogeneity and dynamism of the execution platforms of scientific applications, like computational grids, make using those platforms complex. Furthermore, tod...