31 search results - page 3 / 7 » An Optimal Balanced Partitioning of a Set of 1D Intervals |
94
Voted
PRL
2006
14 years 10 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
64
Voted
ISPD
1999
ACM
15 years 2 months ago
1999
ACM
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
106
Voted
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
95
Voted
ICDE
2007
IEEE
15 years 4 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
91
Voted
COMPGEOM
1993
ACM
15 years 2 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...