Results 1  10
of
2,476
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
in the biorthogonal, i.e, nonunitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a waveletlike transform that maps integers to integers.
Mapping Integer Order Neumann Functions To Real Orders M.Mekhfi
, 2000
"... In a recent paper we unified Bessel functions of different orders.Here we extend the unification to other linairely independant solutions to Bessel equation,Neumann’s and Hankel’s functions mekhfi@hotmail.com Neumann’s functions Np(z) and Bessel functions Jp(z) with p integer,are the two linairely i ..."
Abstract
 Add to MetaCart
In a recent paper we unified Bessel functions of different orders.Here we extend the unification to other linairely independant solutions to Bessel equation,Neumann’s and Hankel’s functions mekhfi@hotmail.com Neumann’s functions Np(z) and Bessel functions Jp(z) with p integer,are the two linairely
Entrez Gene: genecentered information at NCBI
 Nucleic Acids Res
, 2007
"... Entrez Gene (www.ncbi.nlm.nih.gov/entrez/query. fcgi?db=gene) is NCBI’s database for genespecific information. Entrez Gene includes records from genomes that have been completely sequenced, that have an active research community to contribute genespecific information or that are scheduled for in ..."
Abstract

Cited by 340 (12 self)
 Add to MetaCart
, stable and tracked integers as identifiers. The content (nomenclature, map location, gene products and their attributes, markers, phenotypes and links to citations, sequences, variation details, maps, expression, homologs, protein domains and external databases) is provided via interactive browsing
Matrix Factorizations for Reversible Integer Mapping
, 2001
"... Reversible integer mapping is essential for lossless source coding by transformation. A general matrix factorization theory for reversible integer mapping of invertible linear transforms is developed in this paper. Concepts of the integer factor and the elementary reversible matrix (ERM) for integer ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
Reversible integer mapping is essential for lossless source coding by transformation. A general matrix factorization theory for reversible integer mapping of invertible linear transforms is developed in this paper. Concepts of the integer factor and the elementary reversible matrix (ERM
Fast Mergeable Integer Maps
 In Workshop on ML
, 1998
"... Finite maps are ubiquitous in many applications, but perhaps nowhere more so than in compilers and other language processors. In these applications, three operations on finite maps dominate all others: looking up the value associated with a key, inserting a new binding, and merging two finite maps. ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
. Most implementations of finite maps in functional languages are based on balanced binary search trees, which perform well on the first two, but poorly on the third. We describe an implementation of finite maps with integer keys that performs well in practice on all three operations. This data structure
Practical Multilinear Maps over the Integers
"... Abstract. Extending bilinear elliptic curve pairings to multilinear maps is a longstanding open problem. The first plausible construction of such multilinear maps has recently been described by Garg, Gentry and Halevi, based on ideal lattices. In this paper we describe a different construction that ..."
Abstract

Cited by 56 (2 self)
 Add to MetaCart
Abstract. Extending bilinear elliptic curve pairings to multilinear maps is a longstanding open problem. The first plausible construction of such multilinear maps has recently been described by Garg, Gentry and Halevi, based on ideal lattices. In this paper we describe a different construction
Cartesian Genetic Programming
, 2000
"... This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node funct ..."
Abstract

Cited by 230 (59 self)
 Add to MetaCart
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node
Multiwavelets and Integer Transforms
"... In many applications of image processing, the given data are integervalued. It is therefore desirable to construct transformations that map data of this type to an integer (or rational) ring. Calderbank, Daubechies, Sweldens, and Yeo [1] devised two methods for modifying orthogonal and biorthonal w ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In many applications of image processing, the given data are integervalued. It is therefore desirable to construct transformations that map data of this type to an integer (or rational) ring. Calderbank, Daubechies, Sweldens, and Yeo [1] devised two methods for modifying orthogonal and biorthonal
Cryptanalysis of the multilinear map over the integers
 In Advances in Cryptology  EUROCRYPT 2015  34th Annual International Conference on the Theory and Applications of Cryptographic Techniques
"... Abstract. We describe a polynomialtime cryptanalysis of the (approximate) multilinear map of Coron, Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the socalled zeroizing attack against the Garg, Gentry and Halevi (GGH) candidate multilinear map. Zeroizing is much more devastati ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
Abstract. We describe a polynomialtime cryptanalysis of the (approximate) multilinear map of Coron, Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the socalled zeroizing attack against the Garg, Gentry and Halevi (GGH) candidate multilinear map. Zeroizing is much more
Results 1  10
of
2,476