Search results

...iddo (1983) Linear-time algorithms for linear programming in R³ and related problems. SIAM J. Comput., 12:759–776 {{doi|10.1109/SFCS.1982 ...n'')}} be the [[time complexity]] of the whole prune-and-search algorithm, and {{math|''S''(''n'')}} be the time complexity of the pruning step. Then {{ma ...

...> (a parody of ''[[asymptotically optimal algorithm|optimal algorithms]]'' and ''[[computational complexity theory|complexity analysis]]''). ...nd the maximum of the whole array by comparing the results of 1.1 and 1.2, and place it at the end of the list. (1.3) ...

...math>O(n^{4/3})</math>, where <math>n</math> is the total number of points and lines.{{r|chan-zheng}} This time bound matches the bound of <math>O(n^{4/3} ==Algorithms== ...

==Properties and algorithms== ...)/2 edges, a rectilinear minimum spanning tree can be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorith ...

...ort of <math>N</math> items on a machine with cache of size <math>Z</math> and cache lines of length <math>L</math> is <math> O(\frac{N}{L} \log_Z N)</mat ...<math>\sqrt{N}</math> contiguous subarrays of size <math>\sqrt{N}</math>, and recursively sort each subarray. ...

...ional cost&mdash;it can be implemented so as to have nearly the same cost (and exactly the same number of arithmetic operations) as naive summation. ...qrt{\log n})</math> for pairwise summation.<ref name=Tasche>Manfred Tasche and Hansmartin Zeuner ''Handbook of Analytic-Computational Methods in Applied M ...

...ath>O(n \log r)</math>, where <math>n</math> is the number of input points and <math>r</math> is the number of processed points (up to <math>n</math>).<re ...Instead, Barber et al. describe it as a deterministic variant of Clarkson and Shor's 1989 algorithm.<ref name=Quickhull/> ...

...rst=Brian |last2=Ngo |first2=Viet |date=1997 |conference=Computer Software and Applications Conference |doi=10.1109/CMPSAC.1997.625082 |publisher=IEEE}}</ It employs a [[divide and conquer algorithm]] that ...

...inary search tree]]s. This framework aims at designing highly-parallelized algorithms for various balanced binary search trees. The algorithmic framework is base ...Algorithms and Architectures, Proc. of 28th ACM Symp. Parallel Algorithms and Architectures (SPAA 2016) ...

...uted Algorithm for Minimum Weight Spanning Tree, Counting, Leader Election and Other Problems|url=http://www.disco.ethz.ch/alumni/pascal/refs/mst_1987_awe ...es villages to bind together to form cities according to each other's rank and edges. Cities are then formed by alliances or by conquering/absorption. ...

{{Copy edit|for=grammar and style|date=September 2024}} ...ation]] formula to disperse data [[Divide-and-conquer algorithm|divide and conquer]]. Interpolation sort is also a variant of [[bucket sort]] [[algorithm]].<r ...

...d list]] to store the edge weights, and a standard [[minimum spanning tree#Algorithms|MST algorithm]] to compute the MST given the sorted edge weights. This data ...lity (projective geometry)|dual]] view of the graph, and then [[divide and conquer paradigm|divides]] based on Frederickson's restricted partitions <ref name= ...

{{short description|American computer scientist and educator}} ...eceived his PhD from the [[Massachusetts Institute of Technology]] in 1989 and joined the faculty at the University of California, Berkeley in 1999.<ref>{ ...

...re#Performance|efficient]], [[Kinetic data structure#Performance|compact]] and [[Kinetic data structure#Performance|local]].<ref name="BGH99" /> ...to maintaining the convex hull of a set of moving points. Computing upper and lower envelopes are equivalent problems, so computing the upper envelope of ...

...construct a good clustering of the stream, using a small amount of memory and time. <!-- in contrary to the traditional clustering where data are static. ...= J. | last1 = Munro | first2 = M. | last2 = Paterson | title = Selection and Sorting with Limited Storage | journal = Theoretical Computer Science | vol ...

...| doi = 10.1109/sfcs.1998.743449 | chapter = Geometric separator theorems and applications | title = Proceedings 39th Annual Symposium on Foundations of * The general MIS problem is hard to approximate and doesn't even have a constant-factor approximation. In some geometric inters ...

...Heap's algorithm permuting the four letters A (amber), B (blue), C (cyan) and D (dark red)]] ...2}} elements are not disturbed. In a 1977 review of permutation-generating algorithms, [[Robert Sedgewick (computer scientist)|Robert Sedgewick]] concluded that ...

...building blocks for interaction patterns, that are often used in [[SPMD]] algorithms in the [[parallel programming]] context. Hence, there is an interest in eff .... The Message Passing Interface (MPI) standard, chapter 7.3.1. Mathematics and Computer Science Division, [[Argonne National Laboratory]].</ref> (MPI). ...

...empty. The very middle rectangle has an arrow pointing to its black circle and an 'x' at the end of the arrow. ...g random pivots for its average <math>O(n)</math> complexity for selection and average <math>O(n\log n)</math> complexity for sorting, without any overhea ...

...real symmetric arrowhead matrices and applications |journal=Linear Algebra and Its Applications|volume=464|year=2015|pages=62–89| arxiv=1302.7203 |s2cid=1 ...|last2=Eisenstat|first2=Stanley C.|journal=SIAM Journal on Matrix Analysis and Applications|volume=16|pages=172–191|url=https://zenodo.org/record/1236142} ...