Results 261 to 270 of about 10,849,141 (303)
Some of the next articles are maybe not open access.
Root high-order cumulant MUSIC
Digital Signal Processing, 2022Abstract The ( p , q )th order circularity and non-circularity of non-Gaussian signals are developed for the first time in this paper. The polynomial rooting implementation of the high-order cumulant based multiple signal classification (MUSIC) methods are then investigated, concentrating on the direction-of-arrival estimation of the ( p ...
Yaxing Yue, Yougen Xu, Zhiwen Liu
openaire +1 more source
Clustering Rooted Ordered Trees
2007 IEEE Symposium on Computational Intelligence and Data Mining, 2007Tree structures have gained popularity for storing data from different domains such as XML documents, bio informatics and so on. Clustering these data can facilitate different operations. In this paper, we propose TreeCluster, a novel and heuristic algorithm for clustering tree structured data.
Mostafa Haghir Chehreghani +3 more
openaire +1 more source
Circuits Systems and Signal Processing, 2000
In direction finding MUSIC (multiple signal classification) is used in different versions. In certain situations second-order algorithms perform well, whereas in other cases higher-order methods should be preferred. That's why the authors propose the combination of these methods to obtain optimal performance in the case of unknown signal properties. In
Gershman, Alex B., Messer, Hagit
openaire +1 more source
In direction finding MUSIC (multiple signal classification) is used in different versions. In certain situations second-order algorithms perform well, whereas in other cases higher-order methods should be preferred. That's why the authors propose the combination of these methods to obtain optimal performance in the case of unknown signal properties. In
Gershman, Alex B., Messer, Hagit
openaire +1 more source
On the convergence and roots of order-statistics filters
IEEE Transactions on Signal Processing, 1995We propose a comprehensive theory of the convergence and characterization of roots of order-statistics filters. Conditions for the convergence of iterations of order-statistics filters are proposed. Criteria for the morphological characterization of roots of order-statistics filters are also proposed. >
Mohammed Charif-Chefchaouni +1 more
openaire +1 more source
Root signals of rank order processors
IEEE Transactions on Signal Processing, 1992Summary: A rank order processor (ROP) is a signal processor that operates purely by making rank determinations on input values, and includes as special cases ``median filters'' and ``rank order filters''. It is shown how the methods of automata theory can be used to show the existence of root signal (i.e., fixed point) sets of input sequences, and to ...
openaire +2 more sources
A heuristic algorithm for clustering rooted ordered trees
Intelligent Data Analysis, 2007Recently, tree structures have become a popular way for storing huge amount of data. Clustering these data can facilitate different operations such as storage, retrieval, rule extraction and processing. In this paper, we propose a novel and heuristic algorithm for clustering tree structured data, called TreeCluster.
Mostafa Haghir Chehreghani +3 more
openaire +2 more sources
TESTING FOR FORBIDDEN POSETS IN ORDERED ROOTED FORESTS
International Journal of Foundations of Computer Science, 2012We initiate the study of testing for general forbidden posets in a colored ordered rooted forest whose structure is fixed. First, we consider the case where the forbidden set consists of (ancestral) chains, and second, we consider the case in which it consists of one general ordered rooted forest. For both cases, we provide 1-sided error, non-adaptive
openaire +2 more sources
Calculating the square root with arbitrary order of convergence
International Journal of Computer Mathematics, 2000In this paper an iterative algorithm has been presented for calculating the square root of a real number with arbitrary order of convergence using formulae derived by applying binomial theorem. The primary objective is to reduce the number of division operations required.
Rezaul Alam Chowdhury, M. Kaykobad
openaire +1 more source
High-order polynomial root tracking algorithm
[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992A new, efficient algorithm for tracking the roots of time-varying polynomials with complex coefficients is presented. The algorithm updates a vector of polynomial roots in response to a perturbation in polynomial coefficients. The update requires only the solution of a single set of linear equations.
David Starer, Arye Nehorai
openaire +1 more source
Root closure in algebraic orders
Archiv der Mathematik, 2002We obtain a characterization of root closed algebraic orders by means of their conductor. It provides the root closure of an algebraic order. Actually, non-integrally closed root closed orders are exceptional. In the same way, we study \(n\)-root closedness of algebraic orders, for a given integer \(n\).
openaire +1 more source