47 search results - page 2 / 10 » On Digital Search Trees - A Simple Method for Constructing B... |
SPIESR
2000
13 years 7 months ago
2000
A method for lossless compression of large binary images is proposed for applications where spatial access to the image is needed. The method utilizes the advantages of (1) variabl...
ALGORITHMICA
2002
13 years 5 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
RSCTC
2000
Springer
13 years 9 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
DEXA
2010
Springer
13 years 3 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...