Results 1  10
of
697,081
A Note to Hermite and Smith Normal Form Computation
, 1995
"... Hermite normal form and Smith normal form are canonic forms of integral matrices with respect to congruence produced by multiplication with right unimodular matrix resp. by multiplication with left and right unimodular matrix simultaneously. This lowerdiagonal resp. diagonal form has many applicati ..."
Abstract
 Add to MetaCart
Hermite normal form and Smith normal form are canonic forms of integral matrices with respect to congruence produced by multiplication with right unimodular matrix resp. by multiplication with left and right unimodular matrix simultaneously. This lowerdiagonal resp. diagonal form has many
On efficient sparse integer matrix Smith normal form computations
, 2001
"... We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of wordsize primes. Consequently, the algorithm does not suffer from coefficient growth. W ..."
Abstract

Cited by 42 (20 self)
 Add to MetaCart
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of wordsize primes. Consequently, the algorithm does not suffer from coefficient growth
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract

Cited by 613 (94 self)
 Add to MetaCart
and phonological representations that capture better the relevant structure among the written and spoken forms of words. In a number of simulation experiments, networks using the new representations learn to read both regular and exception words, including lowfrequency exception words, and yet are still able
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
that the gradient can be written in a form suitable for estimation from experience aided by an approximate actionvalue or advantage function. Using this result, we prove for the first time that a version of policy iteration with arbitrary differentiable function approximation is convergent to a locally optimal
Pretense and representation: The origins of a theory of mind
 Psychol. Rev
, 1987
"... One of the major developments of the second year of human life is the emergence of the ability to pretend. A child's knowledge of a real situation is apparently contradicted and distorted by pretense. If, as generally assumed, the child is just beginning to construct a system for internally rep ..."
Abstract

Cited by 413 (14 self)
 Add to MetaCart
compute the complex function postulated to underlie pretend play. This model also reveals pretense as an early manifestation of the ability to understand mental states. Aspects of later preschool development, both normal and abnormal, are discussed in the light of the new model. This
Fast parallel computation of Hermite and Smith forms of polynomial matrices
 SIAM J. Alg. Discrete Meth
, 1987
"... Abstract. Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determin ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
Abstract. Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also
Parallel Algorithms for Computing the Smith Normal
 Form of Large Matrices, Lecture
"... Abstract. Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large
The complexity of computing a Nash equilibrium
, 2006
"... We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a game with 4 or more players is complete for the complexity class PPAD. Our proof uses ideas from the recentlyestablished equivalence between polynomialtime solvability of n ..."
Abstract

Cited by 329 (23 self)
 Add to MetaCart
of normalform games and graphical games, and shows that these kinds of games can implement arbitrary members of a PPADcomplete class of Brouwer functions. 1
The Octagon Abstract Domain
, 2007
"... ... domain for static analysis by abstract interpretation. It extends a former numerical abstract domain based on DifferenceBound Matrices and allows us to represent invariants of the form (±x ± y ≤ c), where x and y are program variables and c is a real constant. We focus on giving an efficient re ..."
Abstract

Cited by 321 (24 self)
 Add to MetaCart
representation based on DifferenceBound Matrices—O(n 2) memory cost, where n is the number of variables—and graphbased algorithms for all common abstract operators—O(n 3) time cost. This includes a normal form algorithm to test equivalence of representation and a widening operator to compute least fixpoint
Results 1  10
of
697,081