Sciweavers

405 search results - page 31 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
IPPS
2003
IEEE
15 years 8 months ago
Design and Evaluation of a Parallel HOP Clustering Algorithm for Cosmological Simulation
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
HPCA
2000
IEEE
15 years 7 months ago
Design of a Parallel Vector Access Unit for SDRAM Memory Systems
We are attacking the memory bottleneck by building a “smart” memory controller that improves effective memory bandwidth, bus utilization, and cache efficiency by letting appl...
Binu K. Mathew, Sally A. McKee, John B. Carter, Al...
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 5 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
CLUSTER
2008
IEEE
15 years 9 months ago
An OSD-based approach to managing directory operations in parallel file systems
—Distributed file systems that use multiple servers to store data in parallel are becoming commonplace. Much work has already gone into such systems to maximize data throughput....
Nawab Ali, Ananth Devulapalli, Dennis Dalessandro,...
135
Voted
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 3 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar