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

Probabilistic proximity searching algorithms based on compact partitions

โœ Scribed by Benjamin Bustos; Gonzalo Navarro

Book ID
108497742
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
364 KB
Volume
2
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new probabilistic relaxation method ba
A new probabilistic relaxation method based on probability space partition
โœ Alan M.N. Fu; Hong Yan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

Probabilistic relaxation is an iterative and parallel process, which can be regarded as a recurrent dynamical system. Since the stable states of the system depend on system parameters, one can design a system by estimating or selecting a set of parameters based on incomplete information of a given p

Fast nearest-neighbor search algorithms
Fast nearest-neighbor search algorithms based on approximation-elimination search
โœ V. Ramasubramanian; Kuldip K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of