Results 231 to 240 of about 30,818 (266)
Some of the next articles are maybe not open access.
Efficient subpixel image registration algorithms
Optics Letters, 2008Three new algorithms for 2D translation image registration to within a small fraction of a pixel that use nonlinear optimization and matrix-multiply discrete Fourier transforms are compared. These algorithms can achieve registration with an accuracy equivalent to that of the conventional fast Fourier transform upsampling approach in a small fraction of
Manuel, Guizar-Sicairos +2 more
openaire +2 more sources
2021
New non-volatile memory (NVM) technologies are projected to become the dominant type of main memory in the near future. They promise by the addressability, good read latencies, and significantly lower energy and higherdensity compared to DRAM. However, a key property of NVMs is the asymmetric read and write cost: write operations are much more ...
openaire +1 more source
New non-volatile memory (NVM) technologies are projected to become the dominant type of main memory in the near future. They promise by the addressability, good read latencies, and significantly lower energy and higherdensity compared to DRAM. However, a key property of NVMs is the asymmetric read and write cost: write operations are much more ...
openaire +1 more source
Constructing efficient election algorithms from efficient traversal algorithms
1988Traversal and Election are two foundamental tasks in distributed systems. A traversal algorithm enables a processor to send a message from node to node around the system. An election algorithm ends with some processor in a distinguished state (the leader).
openaire +1 more source
Statistical efficiency of adaptive algorithms
Neural Networks, 2003The statistical efficiency of a learning algorithm applied to the adaptation of a given set of variable weights is defined as the ratio of the quality of the converged solution to the amount of data used in training the weights. Statistical efficiency is computed by averaging over an ensemble of learning experiences.
Bernard, Widrow, Max, Kamenetsky
openaire +2 more sources
Efficient Algorithms for Similarity Search
Journal of Combinatorial Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajasekaran, S. +6 more
openaire +1 more source
Algorithms, Their Complexity and Efficiency.
Mathematics of Computation, 1982Evaluation of Polynomials Iterative Processes Direct Methods for Solving Sets of Linear Equations The Fast Fourier Transform Fast Multiplications of Numbers Internal Sorting External Sorting Searching.
Christoph M. Hoffmann, Lydia Kronsjo
openaire +1 more source
More efficient parallel flow algorithms
1995We develop an arsenal of tools for improving the efficiency of parallel algorithms for network-flow problems and apply it to a maximum-flow algorithm of Goldberg, a blocking-flow algorithm of Shiloach and Vishkin, and a maximum-flow algorithm of Ahuja and Orlin.
Dedorath, Jürgen +2 more
openaire +2 more sources
Efficient Reconstruction Algorithms
2014Reconstruction in MPI in most cases requires a time consuming calibration scan, from which the system function can be derived (see section 2.6). The system function is a matrix containing the signal caused by a delta probe, which is moved through the whole FOV.
openaire +1 more source
An Efficient Equipment-Layout Algorithm
Operations Research, 1974This paper treats the problem of locating a given number of interrelated physical facilities in a single- or multi-story building as an optimization model such that the weighted sum of the distances along orthogonal directions is minimized, and describes a constructive heuristic algorithm for the one-dimensional model.
openaire +2 more sources

