We introduce a provably correct learning algorithm for latent-variable PCFGs. The algorithm relies on two steps: first, the use of a matrix-decomposition algorithm applied to a co-occurrence matrix estimated from the parse trees in a training sample; second, the use of EM applied to a convex objective derived from the training samples in combination with the output from the matrix decomposition...

gates. We present an algorithm that is optimal up to a multiplicative constant, as well as Θ(log n) times faster than previous methods. While our results are primarily asymptotic, simulation results show that even for relatively small n our algorithm is faster and yields more efficient circuits than the standard method. Generically our algorithm can be interpreted as a matrix decomposition algo...

The Baugh-Wooley algorithm is a well-known iterative algorithm for performing multiplication in digital signal processing applications. Decomposition logic is used with Baugh-Wooley algorithm to enhance the speed and to reduce the critical path delay. In this paper a high speed multiplier is designed and implemented using decomposition logic and Baugh-Wooley algorithm. The result is compared wi...

We present a zero decomposition theorem and an algorithm based on Wu’s method, which computes a zero decomposition with multiplicity for a given zerodimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.

This paper focuses on the iterative identification problems for a class of Hammerstein nonlinear systems. By decomposing the system into two fictitious subsystems, a decomposition based least squares iterative algorithm is presented for estimating the parameter vectors in each subsystem. Moreover, a data filtering based decomposition least squares iterative algorithm is proposed. The simulation...

In image compression, the wavelet transformation is a state-of-the-art component. Recently, wavelet packet decomposition has received quite an interest. A popular approach for wavelet packet decomposition is the near-best-basis algorithm using nonadditive cost functions. In contrast to additive cost functions, the wavelet packet decomposition of the near-best-basis algorithm is only suboptimal....

The computational complexity of one-dimensional time fractional reaction-diffusion equation is O(N²M) compared with O(NM) for classical integer reaction-diffusion equation. Parallel computing is used to overcome this challenge. Domain decomposition method (DDM) embodies large potential for parallelization of the numerical solution for fractional equations and serves as a basis for distributed, ...

In this paper, indefinite linear systems with linear constraints are considered. We present a special decomposition that makes use of the LQ decomposition, and retains the constraints in the factors. The resulting decomposition is of a structure similar to that obtained using the Bunch-Kaufman-Parlett algorithm. The decomposition can be used in a direct solution algorithm for indefinite systems...

The modified adaptive Chirplet decomposition (MACD) is presented in this paper. It is based on the extension of the traditional Chirplet atoms to the form of the quadratic frequency-modulated signals. The accuracy of the signal decomposition is improved compared with the traditional Chirplet decomposition. A practical algorithm for the parameters estimation of monocomponent MACD atom and the de...