Sciweavers

874 search results - page 52 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 7 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
DSRT
2009
IEEE
14 years 1 months ago
An Approach for Parallel Interest Matching in Distributed Virtual Environments
—Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing inter...
Elvis S. Liu, Georgios K. Theodoropoulos
FGCS
2000
81views more  FGCS 2000»
13 years 10 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ESA
2004
Springer
143views Algorithms» more  ESA 2004»
14 years 3 months ago
Data Migration on Parallel Disks
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetla...
CCGRID
2001
IEEE
14 years 1 months ago
Cluster Computing in the Classroom: Topics, Guidelines, and Experiences
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
Amy W. Apon, Rajkumar Buyya, Hai Jin, Jens Mache