Results 221 to 230 of about 545,174 (258)
Some of the next articles are maybe not open access.
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
On the Derivation of Higher Order Root-Finding Methods
2007 American Control Conference, 2007High order root-finding algorithms are constructed based on some canonical conditions and a generalized Taylor series. The convergence order is automatically determined using these canonical conditions. The proposed approaches resulted in deriving methods of any desired order including the Newton, Halley, and Ostrowski iterations. It is also shown that,
openaire +1 more source
Local Orders, Root Numbers, and Modular Curves
American Journal of Mathematics, 1988Let F be a local field. Let \(\pi\) be an irreducible admissible representation of \(GL(2,F)\) and \(\pi_{\chi}\) the representation of \(GL(2,F)\) which corresponds (via the Weil representation) to a character \(\chi\) of a quadratic extension of F. Assume the restriction of \(\chi^{-1}\) to \(F^*\) is equal to the central character of \(\pi\). Then \(
openaire +2 more sources