Results 1  10
of
9,150
ON CERTAIN SEQUENCE SPACES
, 2005
"... We study the multiplicativity factor and quadraticity factor for near quasinorm on certain sequence spaces of Maddox, namely, l(p) and l∞(p), where p = (pk) is a bounded sequence of positive real numbers. 1. ..."
Abstract
 Add to MetaCart
We study the multiplicativity factor and quadraticity factor for near quasinorm on certain sequence spaces of Maddox, namely, l(p) and l∞(p), where p = (pk) is a bounded sequence of positive real numbers. 1.
ON CERTAIN SEQUENCE SPACES
, 2005
"... We study the multiplicativity factor and quadraticity factor for near quasinorm on certain sequence spaces of Maddox, namely, l(p) and l∞(p), where p = (pk) is a bounded sequence of positive real numbers. 1. ..."
Abstract
 Add to MetaCart
We study the multiplicativity factor and quadraticity factor for near quasinorm on certain sequence spaces of Maddox, namely, l(p) and l∞(p), where p = (pk) is a bounded sequence of positive real numbers. 1.
A greedy algorithm for aligning DNA sequences
 J. COMPUT. BIOL
, 2000
"... For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy a ..."
Abstract

Cited by 585 (16 self)
 Add to MetaCart
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy
ON THE L pDISCREPANCY OF CERTAIN SEQUENCES
, 1986
"... Let (xn) s n = 1, 2,... be a sequence of r e a l numbers contained in [0, 1). Let A([09 x); N) be the number of x„s 1 < n < N9 t h a t l i e in the subinterval [0, x) of the u n i t i n t e r v a l. The number D(P) ..."
Abstract
 Add to MetaCart
Let (xn) s n = 1, 2,... be a sequence of r e a l numbers contained in [0, 1). Let A([09 x); N) be the number of x„s 1 < n < N9 t h a t l i e in the subinterval [0, x) of the u n i t i n t e r v a l. The number D(P)
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 1010 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
is passed almost certainly, whereas the same test is failed almost certainly when the compared codes originate from the same eye. The visible texture of a person’s iris in a realtime video image is encoded into a compact sequence of multiscale quadrature 2D Gabor wavelet coefficients, whose most
Relations Involving Lattice Paths and Certain Sequences of Integers
 The Fibonacci Quarterly
, 1967
"... Relations involving certain special planar lattice paths and certain sequences of integers have been studied previously [ 1] , [ 2]. We will state c e rtain basic definitions which pertain to these studies, develop additional r e s u l t s involving other planar lattice paths, and finally, indicat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Relations involving certain special planar lattice paths and certain sequences of integers have been studied previously [ 1] , [ 2]. We will state c e rtain basic definitions which pertain to these studies, develop additional r e s u l t s involving other planar lattice paths, and finally
Unimodality of certain sequences connected with binomial coefficients
 J. Integer Seq. 10 (2007), Article
"... This paper is devoted to the study of certain unimodal sequences related to binomial coefficients. Although the paramount purpose is to prove unimodality, in a few cases we even determine the maxima of the sequences. Our new results generalize some earlier theorems on unimodality. The proof techniqu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper is devoted to the study of certain unimodal sequences related to binomial coefficients. Although the paramount purpose is to prove unimodality, in a few cases we even determine the maxima of the sequences. Our new results generalize some earlier theorems on unimodality. The proof
Determinants of Circulant Matrices with Some Certain Sequences
"... Let be a sequence of real numbers defined by an th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix , , ⋯ , , providing a generalization of determinantal results in papers of Bozkurt [2], Bozkurt and Tam [3], and Shen, et al. ..."
Abstract
 Add to MetaCart
Let be a sequence of real numbers defined by an th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix , , ⋯ , , providing a generalization of determinantal results in papers of Bozkurt [2], Bozkurt and Tam [3], and Shen, et al
Results 1  10
of
9,150