926 search results - page 29 / 186 » Parallel Databases |
EUROPAR
1999
Springer
14 years 1 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 ...
DEXAW
2002
IEEE
14 years 1 months ago
2002
IEEE
For mobile agents to be effective in practice, they have to be securely and efficiently deployed. In this paper, we propose and discuss several route structures and methods for mo...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract. Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databas...
IDEAS
2006
IEEE
14 years 2 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
SSD
1993
Springer
14 years 26 days ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...