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

Implicit data structures for fast search and update

โœ Scribed by J.Ian Munro; Hendra Suwanda

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
883 KB
Volume
21
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Modified winner-update search algorithm
Modified winner-update search algorithm for fast block matching
โœ Jingli Zhou; Jun Li; Shengsheng Yu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 567 KB

Based on the study of winner-update search (WUS) algorithm, a modified WUS (MWUS) algorithm for fast blockmatching motion estimation is proposed in this paper. The computational reduction without any degradation in predicted image comes from fast elimination of impossible motion vectors. We obtain f

Data structure and algorithms for fast a
Data structure and algorithms for fast automatic differentiation
โœ I. Tsukanov; M. Hall ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 425 KB

## Abstract In this paper we discuss the data structure and algorithms for the direct application of generalized Leibnitz rules to the numerical computation of partial derivatives in forward mode. The proposed data structure provides constant time access to the partial derivatives, which accelerate

Investigating automated assistance and i
Investigating automated assistance and implicit feedback for searching systems
โœ Bernard J. Jansen; Michael D. McNeese ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 810 KB

## Abstract Information retrieval systems offering personalized automated assistance have the potential to improve the searching process. There has been much work in this area for several years on a variety of systems. However, there has been little empirical evaluation of automated assistance to d