Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Context tree weighting

Known as: CTW, Context Tree Weighting method 
The context tree weighting method (CTW) is a lossless compression and prediction algorithm by . The CTW algorithm is among the very few such… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We describe an adaptive context tree weighting (ACTW) algorithm, as an extension to the standard context tree weighting (CTW… Expand
  • table 1
  • table 2
  • table 3
  • table 7
  • table 6
Highly Cited
2009
Highly Cited
2009
Alignment of time series is an important problem to solve in many scientific disciplines. In particular, temporal alignment of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
– The current UN Decade of Education for Sustainable Development echoes many scholars' calls to re‐envision education for… Expand
  • figure 1
  • table I
  • figure 2
  • table II
  • table II
2006
2006
First we modify the basic (binary) context-tree weighting method such that the past symbols x1-D, x2-D, …, x 0 are not needed by… Expand
Review
2002
Review
2002
Backlash is one of the most important non-linearities that limit the performance of speed and position control in industrial… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
Abstract The convergent validity of five multiattribute weighting methods is studied in an Internet experiment. This is the first… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Highly Cited
1998
Highly Cited
1998
  • F. Willems
  • IEEE Trans. Inf. Theory
  • 1998
  • Corpus ID: 2237779
First we modify the basic (binary) context-tree weighting method such that the past symbols x/sub 1-D/, x/sub 2-D/, ..., x/sub 0… Expand
  • figure 1
  • figure 2
  • figure 4
1997
1997
The results of an experimental study of different modifications of the context tree weighting algorithm are described. In… Expand
  • table 1
  • table 3
  • table 4
  • table 5
Highly Cited
1995
Highly Cited
1995
Describes a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a… Expand
  • figure 2
Highly Cited
1994
Highly Cited
1994
Much of decision aiding uses a divide-and-conquer strategy to help people with risky decisions. Assessing the utility of outcomes… Expand