Search results

...kinetic data structure]] to maintain the [[minimum bounding box]] of a set of points whose positions change continuously with time. For points moving in ...ular kinetic width problems, and the data-structure needs to maintain sets of four points{{snd}} two [[antipodal pairs]] which have perpendicular support ...

...hull]] can be used to construct a kinetic data structure for the diameter of a moving point set that is [[Kinetic data structure#Performance|responsive] ...be found by computing the convex hull of the point set, finding all pairs of antipodal points, and then finding the maximum distance between these pairs ...

...vex hull]] can be used to construct a kinetic data structure for the width of a point set that is [[Kinetic data structure#Performance|responsive]], [[Ki ...ab</math> of the convex hull, and the other line must go through a point c of the convex hull such that (a,c) and (b,c) are [[antipodal pairs]]. ab and c ...

In the [[history of mathematics]], '''Egyptian algebra''', as that term is used in this article ...ence: A Source Book Volume 3: Ancient Egyptian Mathematics |series=Memoirs of the American Philosophical Society |volume=232 |location=Philadelphia |publ ...

{{Short description|Model of algorithmic learning}} ...t (PAC) learning]], where the learner is evaluated on its predictive power of a test set. ...

{{Short description|Variant of the stable marriage problem}} ...ginal problem, the goal is to match all men to all women such that no pair of man and woman who are unmarried to each other, would simultaneously like to ...

[[File:Stirling permutation Euler tour.svg|thumb|240px|Euler tour of a tree, with edges labeled to show the order in which they are traversed by ...ing tree functions in logarithmic parallel time | conference = Proceedings of FOCS | pages = 12–20 | doi = 10.1109/SFCS.1984q5896 | doi-broken-date = 1 N ...

...e chessboard and each [[edge (graph theory)|edge]] represents a legal move of the bishop; that is, there is an edge between two vertices (squares) if the ...rs, but by one or more moves a bishop can get from any square to any other of the same color.<ref>{{cite journal ...

'''External memory graph traversal''' is a type of [[graph traversal]] optimized for accessing externally stored memory. ...es slower than accessing internal memory, the need for efficient traversal of [[external memory algorithm|external memory]] exists. ...

...set of points <math>S \subset \mathbb{R}^d</math>, is a sequence of pairs of sets <math>(A_i, B_i)</math>, such that each pair is '''well-separated''', ...] [[Euclidean graph]], and is useful in approximating solutions to several problems pertaining to this.<ref name="smid">{{cite web | url=http://people.scs.carl ...

...f direct access devices in problems requiring the reordering of long lists of data, report RJ-555, IBM Research Laboratory, San Jose, California, 1969. to order lists of two electron repulsion integrals. It is implemented in the IBM Alchemy prog ...

...s to come up with a strategy of reordering the list so that the total cost of accesses is minimized. The reordering can be done at any time but incurs a * A free transposition of the item being accessed anywhere ahead of its current position; ...

...It was originally developed by Serafim Opricovic in 1979 to solve decision problems with conflicting and noncommensurable (different units) criteria. It assume ...ne J.L. and M.Zeleny (Eds.), Multiple Criteria Decision Making, University of South Carolina Press, Columbia.</ref> ...

...<math>n</math> form a [[Coprime integers#Coprimality in sets|coprime set]] of <math>k+1</math> integers. Jordan's totient function is a generalization of Euler's [[totient function]], which is the same as <math>J_1(n)</math>. The ...

{{short description|List of concrete topologies and topological spaces}} {{Main|List of topology topics}} ...

{{Short description|First Book of Chronicles, chapter 12}} ...t-align: center; line-height: 1em">The complete Hebrew text of the [[Books of Chronicles]] (1 and 2 Chronicles) in the [[Leningrad Codex]] (1008 CE).</di ...

...onnected brown regions and interior boundaries, including degenerate cases of single vertices and edges, (a,b,f).]] | title = An Introduction To The Geometry Of <math>N</math> Dimensions ...

...in real-world computing systems but also underscores the growing relevance of RATMs in addressing the challenges posed by big data applications. ...ect where the execution time of an instruction is contingent upon the size of the numbers involved, effectively bridging the gap between abstract computa ...

...av | pages=1003–1050 | volume=170 | year=2009 | issue=3 | journal = Annals of Mathematics | doi=10.4007/annals.2009.170.1003| arxiv=math/0403263 | s2cid= ...otiles || all || 1 || Shapes such that congruent copies can form a tiling of space ...

| caption=Static visualization of bubble sort<ref>{{cite web |last=Cortesi |first=Aldo |title=Visualising Sor ...on sort]], is named for the way the larger elements "bubble" up to the top of the list. ...