8413 search results - page 1185 / 1683 » Ordering Problem Subgoals |
308
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
298
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
289
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
271
click to vote
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
194
click to vote
VIS
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a method for extracting boundary surfaces from segmented cross-section image data. We use a constrained Potts model to interpolate an arbitrary number of region boundar...