Sciweavers

5659 search results - page 127 / 1132
» Comparing Clusterings in Space
Sort
View
WWW
2008
ACM
13 years 10 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ICS
2007
Tsinghua U.
14 years 4 months ago
Automatic nonblocking communication for partitioned global address space programs
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
Wei-Yu Chen, Dan Bonachea, Costin Iancu, Katherine...
ECAL
2001
Springer
14 years 2 months ago
The Use of Latent Semantic Indexing to Identify Evolutionary Trajectories in Behaviour Space
This paper describes the simulation of a foraging agent in an environment with a simple ecological structure, alternatively using one of three different control systems with varyi...
Ian R. Edmonds
WWW
2010
ACM
14 years 5 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
PAKDD
2007
ACM
143views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Clustering Ensembles Based on Normalized Edges
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Yan Li, Jian Yu, Pengwei Hao, Zhulin Li