The low weight polynomial multiple problem arises in the context of stream ciphers cryptanalysis and of efficient finite field arithmetic, and is believed to be difficult. It can be formulated as follows: given a polynomial f ∈ F2[X] of degree d, and a bound n, the task is to find a low weight multiple of f of degree at most n. The best algorithm known so far to solve this problem is based on a...

Let P be a d-dimensional lattice polytope. We show that there exists a natural number cd , only depending on d, such that the multiples cP have a unimodular cover for every c ∈ N, c ≥ cd . Actually, an explicit upper bound for cd is provided, together with an analogous result for unimodular covers of rational cones. 1. STATEMENT OF RESULTS All polytopes and cones considered in this paper are as...

Multiples translations can be computed by one machine translation (MT) system or by different MT systems. We may assume that different MT systems make different errors due to using different models, generation strategies, or tweaks. An investigated technique, inherited from automatic speech recognition (ASR), is the so-called system combination that is based on combining the outputs of multiple...

Ware, Chap 10: Interacting with Visualizations. first half, p 317-324 Tufte, Chap 4: Small Multiples State of the Art: Coordinated & Multiple Views in Exploratory Visualization. Jonathan C. Roberts. Proc. Conference on Coordinated & Multiple Views in Exploratory Visualization (CMV) 2007. Building Highly-Coordinated Visualizations In Improvise. Chris Weaver. Proc. InfoVis 2004 Exploring High-D S...

A strategy for multiple removal consists of estimating a model of the multiples and then adaptively subtracting this model from the data by estimating shaping filters. A possible and efficient way of computing these filters is by minimizing the difference or misfit between the input data and the filtered multiples in a least-squares sense. Therefore, the signal is assumed to have minimum energy...

A number of experiments have looked at various factors when visualizing dynamic graphs. Animation, small multiples, drawing stability (also known as the mental map) have been investigated. In this paper, we examine these results from the perspective of presentation method— mainly animation and small multiples. We also present findings of recent empirical studies on drawing stability and how the...

A very popular and effective way of removing multiples is by creating a multiple model (Verschuur et al., 1992) and using it in order to perform the attenuation of the multiples. From this multiple model, two different strategies are possible. A first strategy might consist in subtracting this model from the data. A second strategy might consist in using this model as an estimate of the noise m...

To explore and to compare different revisions of complex software systems is a challenging task as it requires to constantly switch between different revisions and the corresponding information visualization. This paper proposes to combine the concept of small multiples and focus+context techniques for software maps to facilitate the comparison of multiple software map themes and revisions simu...