Sciweavers

2228 search results - page 125 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
MSS
1999
IEEE
99views Hardware» more  MSS 1999»
15 years 11 months ago
Clustered Multi-media NOD: Popularity-based Article Prefetching and Placement
According to the current profound development of multimedia and networking technologies, the way people communicate with, naturally, has evolved from a textoriented into a multime...
Y.-J. Kim, Tae-uk Choi, K. O. Jung, Y. K. Kang, Se...
CLUSTER
2006
IEEE
16 years 23 days ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 7 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
UAI
2008
15 years 8 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
176
Voted
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
16 years 7 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen