321 search results - page 17 / 65 » Partitioning by iterative deletion |
115
Voted
FOCM
2007
15 years 16 days ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
96
Voted
ISHPC
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
70
Voted
SIAMDM
2010
14 years 11 months ago
2010
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
105
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
96
Voted
COMPGEOM
2009
ACM
15 years 5 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....