Results 221 to 230 of about 294,257 (261)

An Efficient Clustering Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1976
A new algorithm is presented (called matching algorithm), in order to reorganize data data and identify clusters. Thus the algorithm requires only three integer additions in each step, instead of comparing the entire row to evaluate the matchings with the neighboring rows.
Bhat, M. V., Haupt, A.
openaire   +1 more source

Efficient routing algorithm

Computer-Aided Design, 1987
Abstract The line expansion algorithm provided by Heynes was a new kind of routing algorithm that took advantage of both Lee's algorithm and linear expansion algorithms, and hence was more efficient. However, it was less efficient in two layer routing situations.
Shi Kai-jian, Zhu Hong-e
openaire   +1 more source

Efficient sequence alignment algorithms

Journal of Theoretical Biology, 1984
Sequence alignments are becoming more important with the increase of nucleic acid data. Fitch and Smith have recently given an example where multiple insertion/deletions (rather than a series of adjacent single insertion/deletions) are necessary to achieve the correct alignment. Multiple insertion/deletions are known to increase computation time from O(
openaire   +2 more sources

Efficient MPC Algorithms

2012
Computing the control input for constrained model predictive control (MPC) is a complex and time-consuming process. The constrained problem formulation does not allow the control law to be expressed as a closed equation; instead, a numerical optimization problem has to be performed online at each sampling period.
Gergely Takács, Boris Rohal’-Ilkiv
openaire   +1 more source

Efficient multicanonical algorithms

IEEE Photonics Technology Letters, 2005
Motivated by our recent work on the application of multicanonical sampling to experimental measurements, we here examine the reduction of statistical error through weighted least squares fitting procedures. Our method, which generalizes previous modified multicanonical approaches, also incorporates a novel technique for characterizing statistical ...
null Tao Lu, D. Yevick
openaire   +1 more source

Efficient subpixel image registration algorithms

Optics Letters, 2008
Three 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, Samuel T, Thurman, James R, Fienup   +2 more
openaire   +2 more sources

Write-efficient Algorithms

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

Constructing efficient election algorithms from efficient traversal algorithms

1988
Traversal 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, 2003
The 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, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rajasekaran, S., Hu, Y., Luo, J., Nick, H., Pardalos, P. M., Sahni, S., Shaw, G.   +6 more
openaire   +1 more source