213 search results - page 8 / 43 » An Approximation Algorithm for Binary Searching in Trees |
83
Voted
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
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...
102
Voted
ALGORITHMICA
2000
14 years 9 months ago
2000
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...
100
Voted
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
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...
89
Voted
IJCNN
2000
IEEE
15 years 1 months ago
2000
IEEE
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...
94
Voted
DAGSTUHL
1996
14 years 11 months ago
1996
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...