Results 1  10
of
49
Fast Zeta Transforms for Lattices with Few Irreducibles
, 2012
"... We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for Möbius algebras of finite lattices. We show that every lattice with v elements, n of which are nonzero and joinirreducible (or, by a dual result, nonzero and meetirreducible), has arit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
arithmetic circuits of size O(vn) for computing the zeta transform and its inverse, thus enabling fast multiplication in the Möbius algebra. Furthermore, the circuit construction in fact gives optimal (up to constants) circuits for a number of lattices of combinatorial and algebraic relevance
Fast Fourier transforms for finite inverse semigroups
 J. Algebra
"... Abstract. We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourie ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing
A Fast Lapped Transform for Image Coding
 IEEE Trans. Image Processing
, 2000
"... This paper introduces a class of linear phase lapped biorthogonal transforms with basis functions of variable length. A lattice is used to enforce both linear phase and perfect reconstruction properties as well as to provide a fast and e#cient transform implementation for image coding applications. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper introduces a class of linear phase lapped biorthogonal transforms with basis functions of variable length. A lattice is used to enforce both linear phase and perfect reconstruction properties as well as to provide a fast and e#cient transform implementation for image coding applications
On Constrained Implementation of Latticebased Cryptographic Primitives and Schemes on Smart Cards?
, 2014
"... Abstract. Most latticebased cryptographic schemes with a security proof suffer from large key sizes and heavy computations. This is also true for the simpler case of authentication protocols which are used on smart cards, as a veryconstrained computing environment. Recent progress on ideal lattice ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
devices, however, cuttingedge ones are suitablyefficient to be used practically on smart cards. Moreover, we have implemented fast Fourier transform (FFT) and discrete Gaussian sampling with different typical parameters sets, as well as versatile latticebased publickey encryptions. These results have
APractical Latticebased Digital Signature Schemes
"... Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case o ..."
Abstract
 Add to MetaCart
of classical cryptanalytic advances or progress on the development of quantum computers the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattices problems which are assumed
Fast Symplectic Mapping and Longterm Stability Near Broad Resonances
, 1997
"... Fast symplectic mapping, based on a canonical generator of the fullturn map in polar coordinates (I;), is a powerful tool to study longterm stability in large hadron storage rings. Accurate maps for realistic lattices can be constructed in a few hours on a workstation computer, and can be iterated ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Fast symplectic mapping, based on a canonical generator of the fullturn map in polar coordinates (I;), is a powerful tool to study longterm stability in large hadron storage rings. Accurate maps for realistic lattices can be constructed in a few hours on a workstation computer, and can
Lattice evidence for the family of decoupling solutions of Landau gauge YangMills theory
"... We show that the lowmomentum behavior of the lattice Landaugauge gluon and ghost propagators is sensitive to the lowest nontrivial eigenvalue (λ1) of the FaddeevPopov operator. If the gauge fixing favors Gribov copies with small λ1 the ghost dressing function rises more rapidly towards zero mome ..."
Abstract
 Add to MetaCart
We show that the lowmomentum behavior of the lattice Landaugauge gluon and ghost propagators is sensitive to the lowest nontrivial eigenvalue (λ1) of the FaddeevPopov operator. If the gauge fixing favors Gribov copies with small λ1 the ghost dressing function rises more rapidly towards zero
Incremental Computation of Dominator Trees
 ACM Trans. Progrm. Languages and Systems
, 1995
"... Data flow analysis based on an incremental approach may require that the dominator tree be correctly maintained at all times [CR88]. Previous solutions to the problem of incrementally maintaining dominator trees were restricted to reducible flowgraphs [RR94, CR88]. In this paper we present a new alg ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
). For the deletion case, our algorithm is likely to run fast on the average cases. 1 Introduction In the past few years, Static Single Assignment (SSA) form [CFR + 89, CFR + 91], Sparse Evaluation Graphs (SEG) [CCF91], and other related intermediate representations have been successfully used for efficient data
An approach to threedimensional structures of biomolecules by using singlemolecule diffraction images
 Proc. Natl Acad. Sci. USA
, 2001
"... We describe an approach to the highresolution threedimensional structural determination of macromolecules that utilizes ultrashort, intense xray pulses to record diffraction data in combination with direct phase retrieval by the oversampling technique. It is shown that a simulated molecular diff ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
methods. The phase problem is solved by using an iterative algorithm with a random phase set as an initial input. The convergence speed of the algorithm is reasonably fast, typically around a few hundred iterations. This approach and phasing method do not require any ab initio information about
Results 1  10
of
49