Sciweavers

229 search results - page 32 / 46
» Semi-Lossless Text Compression
Sort
View
DCC
2008
IEEE
14 years 8 months ago
An Approach to Graph and Netlist Compression
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Jeehong Yang, Serap A. Savari, Oskar Mencer
DCC
2010
IEEE
14 years 3 months ago
Lossless Compression Based on the Sequence Memoizer
In this work we describe a sequence compression method based on combining a Bayesian nonparametric sequence model with entropy encoding. The model, a hierarchy of Pitman-Yor proce...
Jan Gasthaus, Frank Wood, Yee Whye Teh
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 2 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
IJCAI
2003
13 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
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 8 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...