𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for computing two nearest-neighbor problems on a rap

✍ Scribed by Tzong-Wann Kao; Shi-Jinn Horng

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
782 KB
Volume
27
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient design of a nearest neighbo
An efficient design of a nearest neighbor classifier for various-scale problems
✍ Heesung Lee; Sungjun Hong; Imran Fareed Nizami; Euntai Kim πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 615 KB

By appropriate editing of the reference set and judicious selection of features, we can obtain an optimal nearest neighbor (NN) classifier that maximizes the accuracy of classification and saves computational time and memory resources. In this paper, we propose a new method for simultaneous referenc

A New Efficient Algorithm for Computatio
A New Efficient Algorithm for Computational Aeroacoustics on Parallel Processors
✍ Yusuf Γ–zyΓΆrΓΌk; Lyle N. Long πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 922 KB

conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.

Algorithms for solving a spatial optimis
Algorithms for solving a spatial optimisation problem on a parallel computer
✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

A Parallel Ring Ordering Algorithm for E
A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations
✍ B.B. Zhou; R.P. Brent πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 141 KB

In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. An efficient parallel ring Jacobi ordering for computing singular value decomposition is described. This ordering can generate n(n -1)/2 different index pairs