96 search results - page 6 / 20 » Restructuring ordered binary trees |
ENTCS
2002
14 years 9 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
72
Voted
ECLIPSE
2006
ACM
15 years 3 months ago
2006
ACM
In this paper, we present the APFEL plug-in that collects finegrained changes from version archives in a database. APFEL is built upon the Eclipse infrastructure for CVS and Java....
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
DLOG
2007
14 years 12 months ago
2007
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...