This paper presents an efficient algorithm called CosMinert for interesting pattern discovery. The widely used cosine similarity, found to possess the null-invariance property and the anti-cross-support-pattern property, is adopted as the interestingness measure in CosMinert . CosMinert is generally an FP-growth-like depth-first traversal algorithm that rests on an important property of the cos...

It is shown that a recently proposed method by Chubanov for solving linear homogeneous systems with nonnegative variables can be improved, both theoretically and computationally.

In Pollard's rho method, an iterating function f is used to de-ne a sequence (yi) by yi+1 = f(yi) for i = 0; 1; 2; : : :, with some starting value y0. In this paper, we deene and discuss new iterating functions for computing discrete logarithms with the rho method. We compare their performances in experiments with elliptic curve groups. Our experiments show that one of our newly deened function...

We approximate the solution u of the Cauchy problem ∂ ∂t u(t, x) r f r. Under natural conditions on solvability in the Sobolev spaces W m p , we show that for any k > 1 one can approximate the solution u with an error of order δ k , by an appropriate combination of the solutions v r along a sequence of time discretization, where δ is proportional to the step size of the grid. This result is obt...

In this paper we propose look-up table (LUT) based methods for inverse halftoning of images. The LUT for inverse halftoning is obtained from the histogram gathered from a few sample halftone images and corresponding original images. The method is extremely fast (no filtering is required) and the PSNR and visual image quality achieved is comparable to the best methods known for inverse halftonin...

— This paper presents a new method of digital adaptive predistortion for linearization of Power Amplifiers (PA) exhibiting memory effects. The predistorter (PD) device consists of a Look-Up-Table (LUT) gain followed by a codebook of filters addressed by the index of the LUT. The adaptation is derived from direct learning for the LUT gains and indirect learning for the filter coefficients. We co...

Abstract. In this paper, we deal with the convergence of an iterative scheme for the 2-D stochastic Navier-Stokes Equations on the torus suggested by the LieTrotter product formulas for stochastic differential equations of parabolic type. The stochastic system is split into two problems which are simpler for numerical computations. An estimate of the approximation error is given either with per...

We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho algorithm and is known to require less iterations than Pollard’s original iterating function in reaching a collision. Our main idea is to follow through the r-adding walk with only partial information about the nodes reached. The ...

This paper describes a new subgridding approach with a view to improving the efficiency of full-wave simulation of electronic circuits. The proposed subgridding method has been incorporated into a full-wave variable-mesh finite-difference transmission line matrix (FD-TLM) simulator. By incorporating the proposed subgridding method, a speed-up of about 2 has been attained. The computational acce...

A frame interpolation algorithm for frame rate up-conversion of progressive image sequences is proposed. The algorithm is based on simple motion compensation and linear interpolation. A motion vector is searched for each pixel in the interpolated image and the resulting motion eld is median ltered to remove inconsistent vectors. Averaging along the motion trajectory is used to produce the inter...