Sciweavers

331 search results - page 25 / 67
» Improved Antidictionary Based Compression
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 9 months ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li
WWW
2007
ACM
14 years 10 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
MVA
2007
186views Computer Vision» more  MVA 2007»
13 years 11 months ago
Improving Rotation Invariance of the Volume Local Binary Pattern Operator
Dynamic texture is an extension of texture to the temporal domain. Recently, a powerful method for dynamic texture recognition based on volume local binary patterns (VLBP) was pro...
Guoying Zhao, Matti Pietikäinen
ACSW
2006
13 years 11 months ago
Improving the flexibility of active grids through web services
Active Grids are a form of grid infrastructure where the grid network is active and programmable. These grids directly support applications with value added services such as data ...
Laurent Lefèvre, Paul Roe
IR
2008
13 years 9 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira