Sciweavers

157 search results - page 26 / 32
» Passing Messages to Lonely Numbers
Sort
View
JASIS
2007
122views more  JASIS 2007»
14 years 10 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 9 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
CLEIEJ
1998
57views more  CLEIEJ 1998»
14 years 9 months ago
User-Level Parallel File I/O
Parallel disk I/O subsystems are becoming more important in today’s large-scale parallel machines. Parallel disk systems provide a significant boost in I/O performance reducing ...
Ernst L. Leiss, Yili Wang
SCP
1998
107views more  SCP 1998»
14 years 9 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
TON
2002
175views more  TON 2002»
14 years 9 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher