Sciweavers

199 search results - page 6 / 40
» Model Kit for Lightweight Data Compression Algorithms
Sort
View
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
LREC
2008
108views Education» more  LREC 2008»
14 years 11 months ago
A Lightweight and Efficient Tool for Cleaning Web Pages
Originally conceived as a "naive" baseline experiment using traditional n-gram language models as classifiers, the NCLEANER system has turned out to be a fast and lightw...
Stefan Evert
ICIP
2000
IEEE
15 years 11 months ago
On Data-Filling Algorithms for MRC Layers
A recently adopted standard, the Mixed Raster Content (MRC) imaging model, represents compound images as a superposition of layers. Since layers are superimposed, large regions ma...
Ricardo L. de Queiroz
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 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