Search results
Jump to navigation
Jump to search
Page title matches
- ...e algorithmic framework is based on a single operation ''join''.<ref name="join-based">{{citation | contribution = Just Join for Parallel Ordered Sets ...19 KB (2,971 words) - 09:24, 18 April 2024
Page text matches
- ...e algorithmic framework is based on a single operation ''join''.<ref name="join-based">{{citation | contribution = Just Join for Parallel Ordered Sets ...19 KB (2,971 words) - 09:24, 18 April 2024
- ...ref>{{Cite journal |last=Yannakakis |first=Mihalis |date=1981-09-09 |title=Algorithms for acyclic database schemes |url=https://dl.acm.org/doi/10.5555/1286831.12 ...eed to exist and can be computed in linear time for any acyclic query. The join tree is a tree structure that contains the query atoms as nodes and has the ...5 KB (773 words) - 12:12, 12 August 2024
- == Algorithms == ...<math>D_1 (a,b)=17</math> is the smallest value of <math>D_1</math>, so we join elements <math>a</math> and <math>b</math>. ...14 KB (2,172 words) - 01:40, 22 June 2024
- ...<math>D_1 (a,b)=17</math> is the smallest value of <math>D_1</math>, so we join elements <math>a</math> and <math>b</math>. ...>D_2 ((a,b),e)=22</math> is the smallest value of <math>D_2</math>, so we join cluster <math>(a,b)</math> and element <math>e</math>. ...11 KB (1,717 words) - 08:17, 9 July 2024
- ...les in ''R'' are represented as ''t<sub>1</sub>, ..., t<sub>k</sub>'', the join of the projections of each ''t<sub>i</sub>'' should agree with ''t'' on <ma ...u with a row that is the same as ''t'' implies that any tuple ''t'' in the join of the projections is actually a tuple of ''R''. ...8 KB (1,309 words) - 18:34, 26 September 2021
- ...{cite conference |author=Doug Lea |author-link=Doug Lea |title=A Java fork/join framework |year=2000 |url=http://gee.cs.oswego.edu/dl/papers/fj.pdf |confer ...tion.<ref>{{cite tech report |first=Pablo |last=Halpern |title=Strict Fork–Join Parallelism |number=N3409=12-0099 |institution=[[ISO/IEC JTC 1/SC 22]]/WG 2 ...17 KB (2,466 words) - 05:41, 2 December 2024
- ...{{dead link|date=July 2022|bot=medic}}{{cbignore|bot=medic}}.", Journal of Algorithms, 1989, pp 287-302</ref> ...ee contraction], Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures (ACM), 1994</ref> ...14 KB (2,265 words) - 21:24, 26 October 2023
- | title = Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Netwo | journal = ACM Trans. Algorithms ...8 KB (1,281 words) - 17:40, 21 January 2025
- ...a the Tutte and [[Nash-Williams theorem]]. There is a family of efficient algorithms, known as [[pebble game]]s, for determining if a multigraph meets the given ...igraph.''' <ref name=":0">{{Cite journal|date=2008-04-28|title=Pebble game algorithms and sparse graphs|url=https://www.sciencedirect.com/science/article/pii/S00 ...23 KB (3,683 words) - 12:58, 30 August 2024
- .../math>) + extra(<math>\mathcal{C}</math>). For <math>\mathcal{C}</math> := join(<math>\mathcal{A},</math> <math>\mathcal{B}</math>), we set max_wt(<math>\m ...he maximum weight except that, if <math>\mathcal{C}</math> is created by a join(Merge), length(<math>\mathcal{C}</math>) is the sum of lengths stored with ...21 KB (3,454 words) - 13:29, 8 June 2024
- ...'' is a [[radar]] and [[sonar]] performance enhancement strategy. Tracking algorithms provide the ability to predict future position of multiple moving objects b There are two common algorithms for plot-to-track:<ref>{{cite web|url=http://www.aticourses.com/fundamental ...18 KB (2,833 words) - 00:28, 29 December 2024
- ...ocks of data between a disk and main memory when performing a [[Join (SQL)|join]], in order to avoid repeated transfers of the same block while fitting the | contribution = Quantum speedups for exponential-time dynamic programming algorithms ...20 KB (2,839 words) - 19:52, 25 February 2024
- ...two operations <math>P\vee Q</math> and <math>P\wedge Q</math> form the [[join and meet]] operations of a finite [[distributive lattice]]. ...s have a unique least element greater than or equal to both of them (their join) and every two elements have a unique greatest element less than or equal t ...26 KB (4,147 words) - 08:50, 19 January 2024
- ...aculty at Yale University in Computer Science in 1980, and left in 1986 to join the Department of Computer Science at UC Davis as an associate professor. ...-authored with Robert Irving, ''The Stable Marriage Problem: Structure and Algorithms''.<ref name=stable>{{cite book ...15 KB (2,010 words) - 07:41, 31 December 2024
- ...lel algorithm|parallelising]] known [[Minimum_spanning_tree#Algorithms|MST algorithms]].<ref>{{cite book |last1=Sanders |last2=Dietzfelbinger |last3=Martin |last ...tree is difficult to parallelise, as two union operations might attempt to join the same subtrees at the same time. Really the only opportunity for paralle ...19 KB (3,006 words) - 01:04, 31 July 2023
- {{Short description|Class of algorithms operating on data streams}} ...ed in only a few passes, typically [[one-pass algorithm|just one]]. These algorithms are designed to operate with limited memory, generally [[L (complexity)|log ...25 KB (3,746 words) - 07:05, 4 February 2025
- ...rough a [[Graph (graph theory)|graph]].<ref name="skiena"/> Many different algorithms have been designed for multiplying matrices on different types of hardware, ...definition of matrix multiplication gives an algorithm that [[Analysis of algorithms|takes time]] on the order of {{math|''n''<sup>3</sup>}} [[Field (mathematic ...39 KB (5,444 words) - 03:27, 28 February 2025
- ...ly along the z-direction, a form of z-discretisation is required. Advanced algorithms have been developed for the modelling of optical tapers. ...7 KB (994 words) - 04:58, 9 September 2024
- ...ations to technology include methods for manufacturing novel materials and algorithms to solve complex problems in computation. ...em's components form a set of nodes and there are connections (edges) that join them. For example, a family tree is a network in which the nodes are people ...16 KB (2,460 words) - 15:56, 2 August 2024
- ...n structure <math>\pi</math> is individually stable if no player wishes to join another coalition whose members all welcome the player. Formally, <math>\pi ...layer who belongs to a coalition willing to let him leave and who wants to join a coalition willing to have him. In other words, <math>\pi</math> is contra ...28 KB (4,068 words) - 01:56, 3 September 2023