This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...