352 search results - page 7 / 71 » On implementation choices for iterative improvement partitio... |
COMPGEOM
1993
ACM
15 years 1 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...
76
Voted
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CG
2002
Springer
14 years 9 months ago
2002
Springer
Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts ...
86
Voted
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
136
Voted
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...