language:
Find link is a tool written by Edward Betts.Longer titles found: Parallel algorithms for minimum spanning trees (view), Analysis of parallel algorithms (view)
searching for Parallel algorithm 51 found (104 total)
alternate case: parallel algorithm
Kruskal's algorithm
(1,851 words)
[view diff]
no match in snippet
view article
find links to article
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree.Merkle–Damgård construction (1,961 words) [view diff] exact match in snippet view article find links to article
feed-forward. The MD algorithm is inherently sequential. There is a parallel algorithm which constructs a collision resistant hash function from a collisionRobert Hyatt (572 words) [view diff] case mismatch in snippet view article find links to article
Alabama at Birmingham in 1988. His thesis was titled A High-Performance Parallel Algorithm to Search Depth-First Game Trees. Bruce Wilsey Suter was Hyatt's doctoralAlgorithms for calculating variance (5,769 words) [view diff] exact match in snippet view article find links to article
estimate of the mean, and then use this algorithm on the residuals. The parallel algorithm below illustrates how to merge multiple sets of statistics calculatedIsolation lemma (1,903 words) [view diff] exact match in snippet view article find links to article
that has minimum weight. This can be used to obtain a randomized parallel algorithm for the maximum matching problem. Stronger isolation lemmas have beenConvex polygon (881 words) [view diff] exact match in snippet view article find links to article
interactive animation. Chandran, Sharat; Mount, David M. (1992). "A parallel algorithm for enclosed and enclosing triangles". International Journal of ComputationalCornell University Center for Advanced Computing (730 words) [view diff] exact match in snippet view article find links to article
resources for its user community and applying their expertise in parallel algorithm development and optimization to a wide range of scientific and engineeringProBiS (836 words) [view diff] case mismatch in snippet view article find links to article
similar binding sites in proteins (February 2012) Parallel-ProBiS: Fast Parallel Algorithm for Local Structural Comparison of Protein Structures and BindingHigher-order singular value decomposition (4,129 words) [view diff] exact match in snippet view article find links to article
advocated by Vasilescu and Terzopoulos that developed M-mode SVD a parallel algorithm that employs the matrix SVD. The term higher order singular valuePrivatization (computer programming) (2,407 words) [view diff] exact match in snippet view article
can read and write it independently and thus, simultaneously. Each parallel algorithm specifies whether a variable is shared or private. Many errors inZemor's decoding algorithm (3,225 words) [view diff] exact match in snippet view article find links to article
of asymptotically good linear-error codes together with a simple parallel algorithm that will always remove a constant fraction of errors. The articleIntel Advisor (977 words) [view diff] exact match in snippet view article find links to article
used by Schlumberger, Sandia national lab, and others for design and parallel algorithm research and Vectorization Advisor capabilities known to be used byBarnes–Hut simulation (799 words) [view diff] exact match in snippet view article find links to article
ISBN 978-0-521-49564-6. T. Hamada; et al. (2009). "A novel multiple-walk parallel algorithm for the Barnes-Hut treecode on GPUs – towards cost effective, highMinimum spanning tree-based segmentation (884 words) [view diff] exact match in snippet view article find links to article
Jan; Middelmann, Wolfgang; Sanders, Peter (2009), "An efficient parallel algorithm for graph-based image segmentation", in Jiang, Xiaoyi; Petkov, NicolaiNurse scheduling problem (1,067 words) [view diff] case mismatch in snippet view article find links to article
Zdeněk (2016). "A Novel Approach for Nurse Rerostering based on a Parallel Algorithm". European Journal of Operational Research. 251 (2). Elsevier: 624–639Richard J. Cole (206 words) [view diff] exact match in snippet view article find links to article
routing problems. His notable research contributions include an optimal parallel algorithm for sorting in the PRAM model, and an optimal analysis of the Boyer–MoorePoint in polygon (1,518 words) [view diff] case mismatch in snippet view article find links to article
from the original on 26 January 2013. Pineda, Juan (August 1988). A Parallel Algorithm for Polygon Rasterization (PDF). SIGGRAPH'88. Computer Graphics. VolExplicit multi-threading (1,572 words) [view diff] exact match in snippet view article find links to article
conceptualizing and describing parallel algorithms. In the WT framework, a parallel algorithm is first described in terms of parallel rounds. For each round, theBranch and bound (2,426 words) [view diff] case mismatch in snippet view article find links to article
Bader, David A.; Hart, William E.; Phillips, Cynthia A. (2004). "Parallel Algorithm Design for Branch and Bound" (PDF). In Greenberg, H. J. (ed.). TutorialsSerial computer (919 words) [view diff] exact match in snippet view article find links to article
entire system. […] The Parallel Multiplier Unit […] by means of a parallel algorithm […] (26 pages) Shirriff, Ken (May 2015). "The Texas Instruments TMXAdder (electronics) (2,803 words) [view diff] case mismatch in snippet view article
24, 2017. Kogge, Peter Michael; Stone, Harold S. (August 1973). "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations"Topological skeleton (1,384 words) [view diff] exact match in snippet view article find links to article
Section 9.9, p. 389. Zhang, T. Y.; Suen, C. Y. (1984-03-01). "A fast parallel algorithm for thinning digital patterns". Communications of the ACM. 27 (3):Spanning tree (3,265 words) [view diff] exact match in snippet view article find links to article
original on Dec 8, 2023; Gazit, Hillel (1991), "An optimal randomized parallel algorithm for finding connected components in a graph", SIAM Journal on ComputingCubesort (219 words) [view diff] exact match in snippet view article find links to article
is avoided. Cypher, Robert; Sanz, Jorge L.C (1992). "Cubesort: A parallel algorithm for sorting N data items with S-sorters". Journal of Algorithms. 13Planar graph (4,471 words) [view diff] case mismatch in snippet view article find links to article
Graph Drawing. Bader, D.A.; Sreshta, S. (October 1, 2003). A New Parallel Algorithm for Planarity Testing (Technical report). UNM-ECE Technical ReportDEGIMA (277 words) [view diff] exact match in snippet view article find links to article
Japan Beowulf cluster Hamada T. et al. (2009) A novel multiple-walk parallel algorithm for the Barnes–Hut treecode on GPUs – towards cost effective, highIndependent set (graph theory) (3,553 words) [view diff] exact match in snippet view article
on Discrete Algorithms): 570–581. Luby, Michael (1986), "A simple parallel algorithm for the maximal independent set problem", SIAM Journal on ComputingHidden-line removal (1,403 words) [view diff] exact match in snippet view article find links to article
unsolved at the time of writing. In 1988 Devai proposed an O(log n)-time parallel algorithm using n2 processors for the hidden-line problem under the concurrentCarry-skip adder (1,643 words) [view diff] case mismatch in snippet view article find links to article
24, 2017. Kogge, Peter Michael; Stone, Harold S. (August 1973). "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations"Triangle (8,656 words) [view diff] exact match in snippet view article find links to article
13 (2013) 113–115". Chandran, Sharat; Mount, David M. (1992). "A parallel algorithm for enclosed and enclosing triangles". International Journal of ComputationalComputed tomography imaging spectrometer (1,303 words) [view diff] exact match in snippet view article find links to article
computed tomographic imaging spectrometer reconstruction using a parallel algorithm exploiting spatial shift-invariance", Opt. Eng. 59(5), 055110 (2020)Michael L. Best (845 words) [view diff] exact match in snippet view article find links to article
senior thesis he developed, on a Connection Machine, a massively parallel algorithm for the graph coloring problem. After graduating with a BS in 1989Kogge–Stone adder (4,394 words) [view diff] case mismatch in snippet view article find links to article
Harold S. Stone, who published it in a seminal 1973 paper titled A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsZvi Galil (2,104 words) [view diff] exact match in snippet view article find links to article
Galil worked with Dany Breslauer to design a linear-work, O(loglogn) parallel algorithm for string matching, and they later proved it to have the best possibleCo-simulation (741 words) [view diff] exact match in snippet view article find links to article
reason is that the Jacobi method is easy to convert into an equivalent parallel algorithm while there are difficulties to do so for the Gauss-Seidel methodLoad balancing (computing) (6,265 words) [view diff] exact match in snippet view article
large-scale computing clusters, it is not tolerable to execute a parallel algorithm that cannot withstand the failure of one single component. ThereforeInteger sorting (4,038 words) [view diff] exact match in snippet view article find links to article
Computer Science, pp. 193–203. Reif, John H. (1985), "An optimal parallel algorithm for integer sorting", Proceedings of the 26th Annual Symposium onPer Brinch Hansen (4,443 words) [view diff] exact match in snippet view article find links to article
fit an "all-pairs paradigm," he then focused on exploring reusable parallel algorithm structures he termed "programming paradigms" or "generic programs"Jacobi eigenvalue algorithm (3,928 words) [view diff] exact match in snippet view article find links to article
JSTOR 2005221. MR 0297131. Shroff, Gautam M. (1991). "A parallel algorithm for the eigenvalues and eigenvectors of a general complex matrix"SequenceL (2,392 words) [view diff] case mismatch in snippet view article find links to article
2004 Cooke, Daniel; Rushton, Nelson (January 1993), "Iterative and Parallel Algorithm Design from High Level Language Traces", ICCS'05 Proceedings of theAlgorithmic Lovász local lemma (2,501 words) [view diff] exact match in snippet view article find links to article
\Gamma (A)}(1-x(B))} for some ε > 0 Moser and Tardos proved that the parallel algorithm achieves a better runtime complexity. In this case, the parallel versionWeng Cho Chew (3,080 words) [view diff] case mismatch in snippet view article find links to article
Luis; Obelleiro, Fernando; Rodriguez, Jose Luis (2010). "Mlfma-FFT Parallel Algorithm for the Solution of Large-Scale Problems in Electromagnetics". ProgressSmall-bias sample space (2,439 words) [view diff] exact match in snippet view article find links to article
Noga; Babai, László; Itai, Alon (1986), "A fast and simple randomized parallel algorithm for the maximal independent set problem" (PDF), Journal of AlgorithmsUniloc USA, Inc. v. Microsoft Corp. (1,749 words) [view diff] exact match in snippet view article find links to article
algorithm to generate a licensee unique ID was not identical to the parallel algorithm in Uniloc's user's local station. Uniloc appealed the decision ofLyle Norman Long (2,560 words) [view diff] exact match in snippet view article find links to article
Chyczewski, T. S.; Myczkowski, J. (January 1, 1992). "A deterministic parallel algorithm to solve a model Boltzmann equation (BGK)". Computing Systems in EngineeringMultidimensional empirical mode decomposition (7,055 words) [view diff] exact match in snippet view article find links to article
of using a thread-level parallel algorithm are threefold. It can exploit more parallelism than a block-level parallel algorithm. It does not incur anyMamba (deep learning architecture) (1,254 words) [view diff] exact match in snippet view article
Hardware-Aware Parallelism: Mamba utilizes a recurrent mode with a parallel algorithm specifically designed for hardware efficiency, potentially furtherLuc Steels (6,074 words) [view diff] exact match in snippet view article find links to article
Publishers. doi:10.1016/0167-739X(84)90035-9. Marcke KV (July 1986). "A parallel algorithm for consistency maintenance in knowledge representation.". ProceedingsPopulation model (evolutionary algorithm) (2,874 words) [view diff] case mismatch in snippet view article
(1990): Genetic Algorithms and Population Structures - A Massively Parallel Algorithm. PhD thesis, Universität Dortmund, Fakultät für Informatik, GermanyKrishnendu Chaudhury (1,631 words) [view diff] case mismatch in snippet view article find links to article
on Communication Systems, ICCS-89, Singapore, Oct. 12-16, 1989 A Parallel Algorithm for 3D Point Pattern Matching, Krishnendu Chaudhury, R. Mehrotra,University of Illinois Center for Supercomputing Research and Development (6,992 words) [view diff] exact match in snippet view article find links to article
transformations for the Alliant compiler. Having nearly two decades of parallel algorithm experience (starting from Illiac 4), the applications group chose