ARTÍCULO
TITULO

Text Compression for Dynamic Document Databases

Moffat    
A    
Zobel    
J    
Sharman    
N    

Resumen

No disponible

 Artículos similares

       
 
Marcin Lawnik, Artur Pelka and Adrian Kapczynski    
In the era of ubiquitous digitization, the Internet of Things (IoT), information plays a vital role. All types of data are collected, and some of this data are stored as text files. An important aspect?regardless of the type of data?is related to file st... ver más
Revista: Algorithms

 
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida    
This study presents an analysis of RePair, which is a grammar compression algorithm known for its simple scheme, while also being practically effective. First, we show that the main process of RePair, that is, the step by step substitution of the most fr... ver más
Revista: Algorithms

 
Chang-Min Kim, Ellen J. Hong, Kyungyong Chung and Roy C. Park    
Recently, demand for handwriting recognition, such as automation of mail sorting, license plate recognition, and electronic memo pads, has exponentially increased in various industrial fields. In addition, in the image recognition field, methods using ar... ver más
Revista: Applied Sciences

 
Jérémy Barbay    
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within ??(??(1+lg??))???(??lg??) O ( n ( 1 + lg a ) ) ? O ( n lg n ) , where the alternation ???[1..??-1] a ? [ 1 . . n - 1 ] approximates the minimal... ver más
Revista: Algorithms

 
Liat Rozenberg, Sagi Lotan and Dan Feldman    
Whether the source is autonomous car, robotic vacuum cleaner, or a quadcopter, signals from sensors tend to have some hidden patterns that repeat themselves. For example, typical GPS traces from a smartphone contain periodic trajectories such as ?home, w... ver más
Revista: Algorithms