Sciweavers

105 search results - page 9 / 21
» Tree Structure Compression with RePair
Sort
View
IJCAI
2003
14 years 10 months ago
Web Page Cleaning for Web Mining through Feature Weighting
Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, ...
Lan Yi, Bing Liu
ICASSP
2008
IEEE
15 years 3 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
ICIAR
2005
Springer
15 years 2 months ago
Compressing 2-D Shapes Using Concavity Trees
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...
Ossama El Badawy, Mohamed S. Kamel
ICIP
1998
IEEE
15 years 11 months ago
A Compressed Video Database Structured for Active Browsing and Search
We describe a unique system called ViBE (video browsing environment) for browsing and searching large databases of video sequences. The system first computes the DC sequence for a...
Cüneyt M. Taskiran, Charles A. Bouman, Edward...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer