96 search results - page 4 / 20 » Restructuring ordered binary trees |
IGARSS
2010
14 years 6 months ago
2010
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
120
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
136
click to vote
ICTAI
2003
IEEE
15 years 2 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
122
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...