348 search results - page 41 / 70 » Distributed Approximation Algorithm for Resource Clustering |
125
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
130
click to vote
HPDC
2008
IEEE
15 years 2 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
159
Voted
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
135
Voted
IPMI
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
118
click to vote
DKE
2006
15 years 2 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...