This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 Data Compression Conference
Efficient Algorithms for Constructing Optimal Bi-directional Context Sets
Snowbird, Utah
March 24-March 26
ISBN: 978-0-7695-3994-2
Bi-directional context sets extend the classical context-tree modeling framework to situations in which the observations consist of two tracks or directions. In this paper, we study the problem of efficiently finding an optimal bi-directional context set for a given data sequence and loss function. This problem has applications in data compression, prediction, and denoising. The main tool in our construction is a new data structure, the compact bi-directional context graph, which generalizes compact suffix trees to two directions.
Index Terms:
context modeling, bi-directional models, suffix trees, compact bi-directional context graphs
Citation:
Fernando Fernández, Alfredo Viola, Marcelo J. Weinberger, "Efficient Algorithms for Constructing Optimal Bi-directional Context Sets," dcc, pp.179-188, 2010 Data Compression Conference, 2010
Usage of this product signifies your acceptance of the Terms of Use.