6897 search results - page 1023 / 1380 » Parallelization of Modular Algorithms |
207
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
162
click to vote
PDPTA
2003
15 years 8 months ago
2003
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
163
click to vote
CCCG
1993
15 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
208
click to vote
FTCS
1993
15 years 8 months ago
1993
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
182
click to vote
CGF
2008
15 years 6 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...