Results 11 to 20 of about 8,312,092 (294)
New and Efficient Implementation of CC3. [PDF]
We present a new and efficient implementation of the closed shell coupled cluster singles and doubles with perturbative triples method (CC3) in the electronic structure program $e^T$. Asymptotically, a ground state calculation has an iterative cost of $4n_{\text{V}}^{4}n_{\text{O}}^{3}$ floating point operations (FLOP), where $n_{\text{V}}$ and $n_ ...
Paul AC, Myhre RH, Koch H.
europepmc +6 more sources
Efficient implementation of progressive meshes [PDF]
Abstract In earlier work, we introduced the progressive mesh (PM) representation, a new format for storing and transmitting arbitrary triangle meshes. For a given mesh, the PM representation defines a continuous sequence of level-of-detail approximations, allows smooth visual transitions (geomorphs) between these approximations, supports progressive ...
openaire +2 more sources
Efficient Implementation of Rendezvous [PDF]
In this paper we present a simple and efficient implementation of the rendezvous developed for a small multiprocessor system (6–10 processors). At first, we present the communication primitives with their traditional implementation. Secondly, we discuss in details our implementation and the communication architecture needed.
Schiper, André +3 more
openaire +3 more sources
Fast Implementation of Oversampled Modulated Filter Banks [PDF]
This paper presents an efficient implementation of oversampled filter banks derived from a prototype filter by modulation. Via a polyphase analysis, redundancies in the filter operations are removed.
Weiss, Stephan +5 more
core +4 more sources
A Robust and Efficient Implementation of LOBPCG [PDF]
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely used to compute eigenvalues of large sparse symmetric matrices. The algorithm can suffer from numerical instability if it is not implemented with care. This is especially problematic when the number of eigenpairs to be computed is relatively large.
Jed A. Duersch +3 more
openaire +5 more sources
The theory of implementation abounds with mechanisms with intricate systems of rewards and punishments off-the-equilibrium path. Generally, it is not in the designer’s best interest to go through with the reward/punishment in the “subgame” arising from ...
Luis C. Corchón +5 more
core +1 more source
Tuple Spaces Implementations and Their Efficiency [PDF]
Among the paradigms for parallel and distributed computing, the one popularized with Linda, and based on tuple spaces, is one of the least used, despite the fact of being intuitive, easy to understand and to use. A tuple space is a repository, where processes can add, withdraw or read tuples by means of atomic operations.
Vitaly Buravlev +2 more
openaire +5 more sources
Efficient Hardware Implementation of the LEDAcrypt Decoder
This work describes an efficient implementation of the iterative decoder that is the main part of the decryption stage in the LEDAcrypt cryptosystem, recently proposed for post-quantum cryptography based on low-density parity-check (LDPC) codes.
Kristjane Koleci +5 more
doaj +1 more source
Efficient implementation of a BDD package [PDF]
Efficient manipulation of Boolean functions is an important component of many computer-aided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementation of the if-then-else (ITE) operator.
Karl S. Brace +2 more
openaire +2 more sources
With the advent of the Internet of Things, lightweight devices necessitate secure and cost-efficient key storage. Since traditional secure key storage is expensive, novel solutions have been developed based on the idea of deriving the key from noisy ...
Christopher Huth +4 more
doaj +1 more source

