Sciweavers

4039 search results - page 62 / 808
» A Method for Dynamic Clustering of Data
Sort
View
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 3 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
KDD
2002
ACM
138views Data Mining» more  KDD 2002»
16 years 7 days ago
Learning to match and cluster large high-dimensional data sets for data integration
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...
William W. Cohen, Jacob Richman
APPT
2007
Springer
15 years 1 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 7 days ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
CCGRID
2005
IEEE
15 years 5 months ago
Dynamic load balancing experiments in a grid
Connected world-widely distributed computers and data systems establish a global source of processing power and data, called a grid. Key properties of a grid are the fact that com...
Menno Dobber, Ger Koole, Robert D. van der Mei