Sciweavers

675 search results - page 97 / 135
» On Compression of Parse Trees
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 7 hour ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
ER
2009
Springer
111views Database» more  ER 2009»
14 years 3 months ago
A New Point Access Method Based on Wavelet Trees
Abstract. The development of index structures that allow ecient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been d...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Error Resilient Multiple Description Coding Based on Wavelet Tree Coding and EREC for Wireless Networks
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
Daewon Song, Lei Cao, Chang Wen Chen
DMKD
2004
ACM
167views Data Mining» more  DMKD 2004»
14 years 2 months ago
FP-tax: tree structure based generalized association rule mining
Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining wit...
Iko Pramudiono, Masaru Kitsuregawa
NIPS
2004
13 years 10 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer