3020 search results - page 132 / 604 » Optimal partition trees |
150
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
153
click to vote
WEA
2009
Springer
15 years 11 months ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
151
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
169
click to vote
ORDER
2007
15 years 6 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
176
click to vote
PKDD
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...