Results 1  10
of
10,435
Transformations: the Symmetric Case
, 2011
"... of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to t ..."
Abstract
 Add to MetaCart
of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the
Dynamic programming algorithm optimization for spoken word recognition
 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract

Cited by 788 (3 self)
 Add to MetaCart
This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 574 (9 self)
 Add to MetaCart
. Our results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. [1] in the case of a binarysymmetric channel and a binary messagepassing algorithm, is a general phenomenon. For the particularly important
Algebraic Multigrid Theory: The Symmetric Case
 Appl. Math. Comput
, 1986
"... reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher, bepress. Contributions to Economic Analysis & Policy is one of The B.E. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher, bepress. Contributions to Economic Analysis & Policy is one of The B.E.
Decay Bounds for Solutions of Lyapunov Equations: The Symmetric Case
, 1999
"... We present two new bounds for the eigenvalues of the solutions to a class of continuoustime and discretetime Lyapunov equations. These bounds hold for Lyapunov equations with symmetric coefficient matrices and righthand side matrices of low rank. They reflect the fast decay of the nonincreasingly ..."
Abstract

Cited by 54 (2 self)
 Add to MetaCart
We present two new bounds for the eigenvalues of the solutions to a class of continuoustime and discretetime Lyapunov equations. These bounds hold for Lyapunov equations with symmetric coefficient matrices and righthand side matrices of low rank. They reflect the fast decay
Secret Key Agreement by Public Discussion From Common Information
 IEEE Transactions on Information Theory
, 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract

Cited by 434 (18 self)
 Add to MetaCart
) are derived for the case where X = [X 1 ; : : : ; XN ], Y = [Y 1 ; : : : ; YN ] and Z = [Z 1 ; : : : ; ZN ] result from N independent executions of a random experiment generating X i ; Y i and Z i , for i = 1; : : : ; N . In particular it is shown that such secret key agreement is possible for a scenario
Liouville’s theorem in the radially symmetric case
, 2003
"... We present a very short proof of Liouville’s theorem for solutions to a nonuniformly elliptic radially symmetric equation. The proof uses the Ricatti equation satisfied by the Dirichlet to Neumann map. ..."
Abstract
 Add to MetaCart
We present a very short proof of Liouville’s theorem for solutions to a nonuniformly elliptic radially symmetric equation. The proof uses the Ricatti equation satisfied by the Dirichlet to Neumann map.
On The Modifications Of Classical Orthogonal Polynomials: The Symmetric Case.
, 1997
"... We consider the modifications of the monic Hermite and Gegenbauer polynomials via the addition of one point mass at the origin. Some properties of the resulting polynomials are studied: threeterm recurrence relation, differential equation, ratio asymptotics, hypergeometric representation as well as ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We consider the modifications of the monic Hermite and Gegenbauer polynomials via the addition of one point mass at the origin. Some properties of the resulting polynomials are studied: threeterm recurrence relation, differential equation, ratio asymptotics, hypergeometric representation as well as, for large n, the behaviour of their zeros. 1 Introduction. In 1940, H. L. Krall [19] obtained three new classes of polynomials orthogonal with respect to measures which are not absolutely continuous with respect to the Lebesgue measure. In fact, his study is related to an extension of the very well known characterization of classical orthogonal polynomials by S. Bochner. This kind of measures was not considered in [28]. Moreover, in his paper H. L. Krall obtain that these three new families of orthogonal polynomials satisfy a fourth order differential equation. The corresponding measures are given in the following table. fP n (x)g weight function d supp() Laguerretype e \Gammax dx +M f...
The Role of Constraints in a Segregation Model: The Symmetric Case
"... In this paper we study the effects of constraints on the dynamics of an adaptive segregation model introduced by Bischi and Merlone (2011). The model is described by a two dimensional piecewise smooth dynamical system in discrete time. It models the dynamics of entry and exit of two populations into ..."
Abstract
 Add to MetaCart
In this paper we study the effects of constraints on the dynamics of an adaptive segregation model introduced by Bischi and Merlone (2011). The model is described by a two dimensional piecewise smooth dynamical system in discrete time. It models the dynamics of entry and exit of two populations into a system, whose members have a limited tolerance about the presence of individuals of the other group. The constraints are given by the upper limits for the number of individuals of a population that are allowed to enter the system. They represent possible exogenous controls imposed by an authority in order to regulate the system. Using analytical, geometric and numerical methods, we investigate the border collision bifurcations generated by these constraints assuming that the two groups have similar characteristics and have the same level of tolerance toward the members of the other group. We also discuss the policy implications of the constraints to avoid segregation.
From State to DeltaBased Bidirectional Model Transformations: the symmetric Case
 JOURNAL OF OBJECT TECHNOLOGY
, 2011
"... ..."
Results 1  10
of
10,435