Center-based clustering techniques are fundamental in some areas of mach...
We present a simple O(n^4)-time algorithm for computing optimal search
t...
Search trees are commonly used to implement access operations to a set o...
AIFV-2 codes are a new method for constructing lossless codes for
memory...
Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in ...
In dynamic flow networks, every vertex starts with items (flow) that nee...
Huang and Wong [5] proposed a polynomial-time dynamic-programming algori...
The Maximal points in a set S are those that aren't dominated by
any o...
An optimal binary search tree for an access sequence on elements is a st...