Incremental encoding

Known as: Back compression, Front compression 
Incremental encoding, also known as front compression, back compression, or front coding, is a type of delta encoding compression algorithm whereby… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Generating a reasonable ending for a given story context, i.e., story ending generation, is a strong indication of story… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2014
2014
Traditional SAT-based MaxSAT solvers encode cardinality constraints directly as part of the CNF and solve the entire optimization… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2010
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally when keys… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
One of the attractive ways to increase text compression is to replace words with references to a text dictionary given in advance… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2002
2002
Note: This paper grew out of an invitation to Pat Keating to summarize and critique the model of phonological encoding presented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Incremental updates to multiple inheritance hierarchies are becoming more prevalent with the increasing number of persistent… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
1997
1997
thod to generate a stream of nes a polygonal model from to the original high-fidelity level of detail algorithms r of discrete… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1997
1997
-A prefix trie index (originally called trie hashing) is applied to the problem of providing fast search times, fast load times… (More)
  • figure I
  • figure 2
  • table 1
  • table 2
Is this relevant?