129 search results - page 13 / 26 » Maintaining Spatial Data Sets in Distributed-Memory Machines |
113
Voted
ICML
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
118
Voted
DAWAK
2001
Springer
15 years 4 months ago
2001
Springer
We present a framework for visualizing remote distributed data sources using a multi-user immersive virtual reality environment. DIVE-ON is a system prototype that consolidates dis...
107
Voted
PAMI
2010
14 years 10 months ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
117
click to vote
ASPLOS
1996
ACM
15 years 3 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...