Results 271 to 280 of about 1,134,922 (335)
General-purpose mechanical computing enabled by origami circuit reconfiguration with robotic addressing and activation. [PDF]
Nat CommunChen Y, Tan T, Yan Z.
europepmc +1 more source
Voltage regulation in PV-rich distribution networks: an edge pipelined intelligent computing approach. [PDF]
Commun EngLi C, Liu J, Liu Q, Li Y, Cao Y, Li Y.
europepmc +1 more source
A chaotic parallel hash engine with dynamic stochastic diffusion for blockchain and cloud security. [PDF]
Sci RepWang Q +5 more
europepmc +1 more source
An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix
, 1989 Paul N. Swarztrauber
openalex +1 more source
Spatially programmable origami networks enable high-density mechanical computing for autonomous robotics. [PDF]
Nat CommunHu X, Tan T, Chen Y, Yan Z.
europepmc +1 more source
FastSCODE: an accelerated SCODE algorithm for inferring gene regulatory networks on manycore processors. [PDF]
BioinformaticsSung R, Woo S, Shin D, Kim J, Lee D.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Horizons of parallel computation
Journal of Parallel and Distributed Computing, 1995This paper considers the ultimate impact of fundamental physical limitations—notably, speed of light and device size—on parallel computing machines. Although we fully expect an innovative and very gradual evolution to the limiting situation, we take here the provocative view of exploring the consequences of the accomplished attainment of the physical ...
Bilardi, Gianfranco +1 more
openaire +1 more source
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
Nature, 1983
The functional abilities and parallel architecture of the human visual system are a rich source of ideas about visual processing. Any visual task that we can perform quickly and effortlessly is likely to have a computational solution using a parallel algorithm. Recently, several such parallel algorithms have been found that exploit information implicit
D H, Ballard +2 more
openaire +2 more sources
The functional abilities and parallel architecture of the human visual system are a rich source of ideas about visual processing. Any visual task that we can perform quickly and effortlessly is likely to have a computational solution using a parallel algorithm. Recently, several such parallel algorithms have been found that exploit information implicit
D H, Ballard +2 more
openaire +2 more sources
Parallelism in Seismic Computing
Surveys in Geophysics, 1989This paper describes a vectorized and parallelized implementation of a two-dimensional pseudo-spectral seismic elastic model and of a (frequency-domain) seismic migration algorithm on the (tightly-coupled) vector multiprocessor IBM 3090 VF. Performance data of alternative parallel implementations on an LCAP (loosely coupled system of array processors ...
M. Kindelan, P. Sguazzero, A. Kamel
openaire +1 more source