3020 search results - page 391 / 604 » Optimal partition trees |
215
click to vote
RTSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
176
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
184
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
204
click to vote
JBI
2004
15 years 8 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
278
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...