196 search results - page 37 / 40 » SMP PCs: A Case Study on Cluster Computing |
108
click to vote
DKE
2008
14 years 11 months ago
2008
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
124
Voted
VISSYM
2003
15 years 1 months ago
2003
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
RECOMB
2008
Springer
15 years 12 months ago
2008
Springer
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
104
Voted
ESA
2005
Springer
15 years 5 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
118
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...