Find link

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 45 found (106 total)

Kruskal's algorithm (1,829 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.

Robert Hyatt (576 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 doctoral

Algorithms for calculating variance (5,774 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 calculated

Convex polygon (878 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 Computational

ProBiS (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 Binding

Cornell University Center for Advanced Computing (729 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 engineering

Privatization (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 in

Zemor's decoding algorithm (3,237 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 article

Intel Advisor (1,039 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 by

Richard J. Cole (215 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–Moore

Barnes–Hut simulation (814 words) [view diff] exact match in snippet view article find links to article

Yuichiro; Oguri, Kiyoshi; Taiji, Makoto (2009). "A novel multiple-walk parallel algorithm for the Barnes–Hut treecode on GPUs – towards cost effective, high

Minimum 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, Nicolai

Nurse scheduling problem (1,130 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–639

Explicit 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, the

Point in polygon (1,530 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. Vol

Serial computer (920 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 TMX

Spanning tree (3,280 words) [view diff] exact match in snippet view article find links to article

1145/357195.357200; Gazit, Hillel (1991), "An optimal randomized parallel algorithm for finding connected components in a graph", SIAM Journal on Computing

Topological skeleton (1,412 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):

DEGIMA (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, high

Branch and bound (2,414 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.). Tutorials

Cubesort (221 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. 13

Adder (electronics) (2,895 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"

Planar graph (4,589 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 Report

Independent set (graph theory) (3,564 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 Computing

Triangle (6,518 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-486-45846-5. Chandran, Sharat; Mount, David M. (1992). "A parallel algorithm for enclosed and enclosing triangles". International Journal of Computational

Zvi 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 possible

Hidden-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 concurrent

Selection (evolutionary algorithm) (1,736 words) [view diff] case mismatch in snippet view article

(1990). Genetic Algorithms and Population Structures - A Massively Parallel Algorithm (PhD). Dortmund, FRG: University of Dortmund, Faculty of Computer

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 1989

Per 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"

Computed tomography imaging spectrometer (1,317 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)

Kogge–Stone adder (4,539 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 Equations

Co-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 method

Integer sorting (4,057 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 on

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 the

Weng Cho Chew (3,183 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". Progress

Jacobi eigenvalue algorithm (4,683 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"

Small-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 Algorithms

Uniloc USA, Inc. v. Microsoft Corp. (1,757 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 of

Lyle Norman Long (2,497 words) [view diff] exact match in snippet view article find links to article

Chyczewski, T.S.; Myczkowski, J. (January 1992). "A deterministic parallel algorithm to solve a model Boltzmann equation (BGK)". Computing Systems in Engineering

Luc Steels (6,098 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.". Proceedings

Multidimensional empirical mode decomposition (7,060 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 any

Mamba (deep learning architecture) (1,159 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 further

Population model (evolutionary algorithm) (3,152 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, Germany

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