๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding Points of Contact for Collaborative Work

โœ Scribed by Deborah J. Hirsch; Cathy Burack

Publisher
John Wiley and Sons
Year
2001
Weight
50 KB
Volume
2001
Category
Article
ISSN
0271-0560

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Academic and student affairs officers in New England meet regularly to identify and develop opportunities for collaboration.

๐Ÿ“œ SIMILAR VOLUMES

On finding p-th nearest neighbours of sc
On finding p-th nearest neighbours of scattered points in two dimensions for small p
โœ George Goodsell ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

Given a large set of scattered points in the plane, we describe a new and efficient algorithm to find, for each point, the subset of p closest points, using the Dirichlet tessellation of the set of points, for small values of p. This problem has applications to interpolation and contouring, for exam

An iterative algorithm for finding a nea
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
โœ B. Llanas; M. Fernandez de Sevilla; V. Feliu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a