𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distances defined by neighborhood sequences

✍ Scribed by Masafumi Yamashita; Toshihide Ibaraki

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Subgraph distances in graphs defined by
Subgraph distances in graphs defined by edge transfers
✍ Gary Chartrand; HΓ©ctor Hevia; Elzbieta B. Jarrett; Michelle Schultz πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 800 KB

For two edge-induced subgraphs F and H of the same size in a graph G, the subgraph H can be obtained from F by an edge jump if there exist four distinct vertices u, v, w, and x in G such that uv ~ E(F), wx ~ E(G) -E(F), and H = F -uv + wx. The subgraph F is j-transformed into H ifH can be obtained f

Fast Euclidean Distance Transformation b
Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
✍ O Cuisenaire; B Macq πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 444 KB

We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approximation. Computations are kept short by restric

Conditional Empirical Processes Defined
Conditional Empirical Processes Defined by Nonstationary Absolutely Regular Sequences
✍ Michel Harel; Madan L. Puri πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 228 KB

proved the weak invariance of the conditional nearest neighbor regression function estimator called the conditional empirical process based on .-mixing observations. In this paper, we extend the result for nonstationary and absolutely regular random variables which have applications for Markov proce