6434 search results - page 152 / 1287 » The Dynamic Data Cube |
282
click to vote
ICDE
1999
IEEE
16 years 5 months ago
1999
IEEE
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parall...
124
click to vote
ISCI
1998
15 years 3 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
147
click to vote
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
140
click to vote
UM
2005
Springer
15 years 9 months ago
2005
Springer
We present further developments in our work on using data from real users to build a probabilistic model of user affect based on Dynamic Bayesian Networks (DBNs) and designed to de...
115
click to vote
HIPEAC
2007
Springer
15 years 10 months ago
2007
Springer
Voltage scaling reduces leakage power for cache lines unlikely to be referenced soon. Partitioning reduces dynamic power via smaller, specialized structures. We combine approaches,...