Sciweavers

630 search results - page 62 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
15 years 10 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
EUROPAR
2004
Springer
15 years 3 months ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 2 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PODS
2005
ACM
124views Database» more  PODS 2005»
15 years 10 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 10 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...