4670 search results - page 263 / 934 » Testing that distributions are close |
210
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We show in this note that by deterministic packet sampling, the tail of the distribution of the original flow size can be obtained by rescaling that of the sampled flow size. To re...
198
click to vote
MOBIQUITOUS
2008
IEEE
16 years 1 months ago
2008
IEEE
The big challenge related to the contemporary research on ubiquitous and pervasive computing is that of seamless integration. For the next generation of ubiquitous and distributed...
202
click to vote
HPDC
2006
IEEE
16 years 22 days ago
2006
IEEE
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
144
click to vote
TREC
2008
15 years 8 months ago
2008
This paper describes our participation in the TREC Legal competition in 2008. Our first set of experiments involved the use of Latent Semantic Indexing (LSI) with a small number of...