✦ LIBER ✦

Nearest neighbor analysis of point processes: Simulations and evaluations

✍ Scribed by Laurence T Maloney

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 491 KB
Volume: 27
Category: Article
ISSN: 0022-2496
DOI: 10.1016/0022-2496(83)90009-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nearest neighbor analysis of point proce

Nearest neighbor analysis of point processes: Applications to multidimensional scaling

✍ Amos Tversky; Yosef Rinott; Charles M Newman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 975 KB

Nearest-Neighbor Analysis of Spatial Poi

Nearest-Neighbor Analysis of Spatial Point Patterns: Application to Biomedical Image Interpretation

✍ Paolo Barbini; Gabriele Cevenini; Maria Rita Massai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Analysis of the spatial distributions of objects is fundamental to biomedical image interpretation. Nearest-neighbor (NN) methods are generally used to assess whether objects are arranged at random or in a deterministic manner. Simple standard NN techniques, however, may fail to identify complex spa

Analysis of k-nearest neighbor branch an

Analysis of k-nearest neighbor branch and bound rules

✍ Soren Larsen; Laveen N Kanal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Computer simulations of nearest-neighbor

Computer simulations of nearest-neighbor distribution functions and related quantities for hard-sphere systems

✍ S. Torquato; Sang Bub Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 875 KB

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

Efficient calculation of configurational

Efficient calculation of configurational entropy from molecular simulations by combining the mutual-information expansion and nearest-neighbor methods

✍ Vladimir Hnizdo; Jun Tan; Benjamin J. Killian; Michael K. Gilson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract Changes in the configurational entropies of molecules make important contributions to the free energies of reaction for processes such as protein‐folding, noncovalent association, and conformational change. However, obtaining entropy from molecular simulations represents a long‐standing