We present a method to decrease the storage and communication complexity of the context-tree weighting method. This method is based on combining the estimated probability of a node in the context tree and weighted probabilities of its children in one single variable. This variable is represented by its logarithm.

Currently, in web page classification, Absolute Weighting Method is a common method to weight HTML main structure features. The disadvantage of the method is that weighting coefficient is a fixed value, which has different effects on the long and short text. So the influence of structure features on local text will be weakened with the length of local text increasing. To solve the problem, we p...

Applicability of the weighting function method to gravity problems is discussed as compared with the exact method. The merits of the weighting function method are its simplicity and rapidity of computation, particularly in three-dimensional problems. For local geological problems, the weighting function method can be used for the gravity calculation with sufficient accuracy when the structure i...

We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and ...

We describe a sequential universal data compression procedure for binary tree sources that performs the \double mixture". Using a context tree, this method weights in an eecient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and stor...