675 search results - page 129 / 135 » On Compression of Parse Trees |
SSD
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
DCC
2000
IEEE
14 years 1 months ago
2000
IEEE
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...
ISCAS
1999
IEEE
14 years 27 days ago
1999
IEEE
A vector enhancement of Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image co...
ICALP
2007
Springer
14 years 14 days ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...