Sciweavers

3658 search results - page 353 / 732
» An Approach To Data Distributions in Chapel
Sort
View
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 11 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
16 years 8 months ago
Workload-aware anonymization
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
212
Voted
ESANN
2004
15 years 9 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
IWCC
1999
IEEE
15 years 12 months ago
Single I/O Space for Scalable Cluster Computing
In this paper, we propose a novel Single I/O Space architecture for achieving a Single System Image (SSI) at the I/O subsystem level. This is very much desired in a scalable clust...
Roy S. C. Ho, Hai Jin, Kai Hwang
ICS
2003
Tsinghua U.
16 years 23 days ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas