Sciweavers

17688 search results - page 14 / 3538
» Data Set Balancing
Sort
View
136
Voted
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 6 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
122
Voted
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
15 years 6 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta
ICS
2005
Tsinghua U.
15 years 7 months ago
The implications of working set analysis on supercomputing memory hierarchy design
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
Richard C. Murphy, Arun Rodrigues, Peter M. Kogge,...
AUSAI
2006
Springer
15 years 5 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert
EOR
2007
96views more  EOR 2007»
15 years 1 months ago
A balancing method and genetic algorithm for disassembly line balancing
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassemb...
Seamus M. McGovern, Surendra M. Gupta