✦ LIBER ✦

Initial point search on weighted trees

✍ Scribed by Kensaku Kikuta; William H. Ruckle

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 523 KB
Volume: 41
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199410)41:6<821::aid-nav3220410610>3.0.co;2-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Binary Trees for Concurrent Sea

Weighted Binary Trees for Concurrent Searching

✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

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

Notes on the weighting biases in value t

Notes on the weighting biases in value trees

✍ Mari Pöyhönen; Raimo P. Hämäläinen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 3 views

The variation in the structure of value trees can have undesirable eects on the attribute weights. Earlier experiments suggest that an attribute receives a higher weight if it is presented at an upper level in a value tree or if it is split into subattributes. Here we show that it is ¯awed to make c

Optimal Parametric Search on Graphs of B

Optimal Parametric Search on Graphs of Bounded Tree-Width

✍ David Fernández-Baca; Giora Slutzki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 339 KB

We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.

On the complexity of branch-and-bound se

On the complexity of branch-and-bound search for random trees

✍ Luc Devroye; Carlos Zamora-Cura 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB 👁 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co

On the distribution of binary search tre

On the distribution of binary search trees under the random permutation model

✍ James Allen Fill 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar