Sciweavers

2228 search results - page 46 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 7 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
ICTAI
2005
IEEE
15 years 10 months ago
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
TIME
1997
IEEE
15 years 8 months ago
On Effective Data Clustering in Bitemporal Databases
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...
Jong Soo Kim, Myoung-Ho Kim
JPDC
2006
100views more  JPDC 2006»
15 years 4 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
EWSN
2004
Springer
16 years 3 months ago
Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering
Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wid...
Andreas Köpke, Christian Frank, Holger Karl, ...