Results 231 to 240 of about 271,967 (273)
Some of the next articles are maybe not open access.
Computational Statistics, 2007
Iterative denoising is a data mining technology for analysis of large heterogeneous datasets, e.g., sets of text documents. The result of it is a hierarchical divisive cluster tree with visual representation of each node. The specific feature of this technology is that the features for the clustering are extracted from data at each node of the ...
Giles, Kendall E. +3 more
openaire +1 more source
Iterative denoising is a data mining technology for analysis of large heterogeneous datasets, e.g., sets of text documents. The result of it is a hierarchical divisive cluster tree with visual representation of each node. The specific feature of this technology is that the features for the clustering are extracted from data at each node of the ...
Giles, Kendall E. +3 more
openaire +1 more source
Computational Methods and Function Theory, 2004
Let \((f_n)\) be a sequence of rational functions and let \(F_n:=f_n \circ f_{n-1}\circ \dots\circ f_1\). The study of the limiting behavior of the sequence \((F_n)\) is a generalization of iteration. This article is a survey of results in this area that have been obtained by the authors and others.
Brück, Rainer, Büger, Matthias
openaire +1 more source
Let \((f_n)\) be a sequence of rational functions and let \(F_n:=f_n \circ f_{n-1}\circ \dots\circ f_1\). The study of the limiting behavior of the sequence \((F_n)\) is a generalization of iteration. This article is a survey of results in this area that have been obtained by the authors and others.
Brück, Rainer, Büger, Matthias
openaire +1 more source
Applied Mathematics and Computation, 2003
The author investigates the convergence and behavior of the vector iteration \(x_{n+1}= Ax_n+b\) which is projected into a box.
openaire +2 more sources
The author investigates the convergence and behavior of the vector iteration \(x_{n+1}= Ax_n+b\) which is projected into a box.
openaire +2 more sources
Perceptual and Motor Skills, 1965
A method of combining free word association with the engineering principles of servomechanisms is presented. It provides a focusing and amplifying of the word association test by incorporating S into a closed delayed feedback system in which he provides both the stimulus and the response words.
B J, BALDRIDGE, F H, HUSTMYER
openaire +2 more sources
A method of combining free word association with the engineering principles of servomechanisms is presented. It provides a focusing and amplifying of the word association test by incorporating S into a closed delayed feedback system in which he provides both the stimulus and the response words.
B J, BALDRIDGE, F H, HUSTMYER
openaire +2 more sources
Iteration of Iterated Belief Revision
Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, 2023The behavior of Iterated Belief Revision operators with respect to iteration has been characterized by a set of four postulates proposed by Darwiche and Pearl. These postulates give constraints on a single iteration step, and this is not enough to forbid some pathological operators.
Nicolas Schwind +2 more
openaire +1 more source
Vector Iteration in Pointed Iterative Theories
SIAM Journal on Computing, 1980This paper is a sequel to a previous paper S. L. Bloom, C. C. Elgot and J. B. Wright, Solutions of the iteration equation and extensions of the scalar iteration operations, SIAM J. Comput., 9 (1980), pp. 25–45. In that paper it was proved that for each morphism ⊥: 1 → 0 in an iterative theory J there is exactly one extension of the scalar iteration ...
Bloom, Stephen L. +2 more
openaire +2 more sources
2010
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
2018
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +1 more source
This chapter examines the question of how to iterate through a collection of objects. The chapter examines external iteration, in which you write a loop to examine the elements, and internal iteration, in which you call a method to perform the loop for you.
openaire +1 more source
Canadian Journal of Mathematics, 1952
In his work on Laplace and Stieltjes transforms Widder [6, ch.
openaire +1 more source
In his work on Laplace and Stieltjes transforms Widder [6, ch.
openaire +1 more source
Fundamenta Informaticae, 2015
We discuss simple functional transductions defined by invertible Mealy automata under iteration and in particular the question when the orbit relation defined by iteration is rational. We identify a class of these automata that has relatively complicated orbits, yet some of them are still orbit rational and discuss a number of decision problems ...
openaire +1 more source
We discuss simple functional transductions defined by invertible Mealy automata under iteration and in particular the question when the orbit relation defined by iteration is rational. We identify a class of these automata that has relatively complicated orbits, yet some of them are still orbit rational and discuss a number of decision problems ...
openaire +1 more source