316 search results - page 60 / 64 » Reducing the Cost of Generating APH-Distributed Random Numbe... |
RCIS
2010
14 years 7 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
103
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
105
click to vote
ICDT
2001
ACM
15 years 1 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
CGO
2004
IEEE
15 years 1 months ago
2004
IEEE
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...