Search results

...Transactions on Magnetics|volume=7|issue=4|pages=814–819|doi=10.1109/TMAG.1971.1067237|last1=Mattson|first1=R.|bibcode=1971ITM.....7..814M }}</ref> The po ...3=T. R.|last4=Emma|first4=P. G.|title=Proceedings of the 3rd conference on Computing frontiers |chapter=Cache miss behavior |date=2006-01-01|chapter-url=http:// ...

{{Short description|Distance measure in statistics}} ...efined in 1971 by Gower<ref>{{cite journal |last1=Gower|first1=John C|date=1971|title=A general coefficient of similarity and some of its properties|url=ht ...

In the mathematical field of [[numerical analysis]], '''discrete spline interp ...Discrete splines via mathematical programming|journal=SIAM J. Control|date=1971|volume=9|issue=2|pages=174–183|doi=10.1137/0309015}}</ref> ...

...raic K-theory]] and [[group theory]]. His career was spent as a professor in the Department of Mathematics at [[Cornell University]]. Dennis was the ex ...keith-dennis Roger Keith Dennis] Member: School of Mathematics 9/1970 – 8/1971, IAS</ref> ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ...ny. The ''load'' of a bin is defined as the sum of sizes of existing items in the bin before placing the new item. ...

...tic|floating-point]] algorithm for computing the exact [[round-off error]] in a floating-point addition operation. 2Sum and its variant Fast2Sum were first published by Ole Møller in 1965.<ref name="moeller">{{cite journal ...

...right=1.3|The order-4 shuffle-exchange network, with its vertices arranged in numerical order]] In [[graph theory]], the '''shuffle-exchange network''' is an [[undirected gra ...

{{Short description|Concept in graph theory mathematics}} ...Shortest Loopless Paths in a Network|journal= Management Science|date=Jul 1971|volume=17|issue=11|pages=712–716|jstor=2629312|doi=10.1287/mnsc.17.11.712}} ...

...= Balogh at [[Mathematisches Forschungsinstitut Oberwolfach|Oberwolfach]] in 2023 |birth_date = {{Birth year and age|1971|12}} ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ...mal number of bins possible for the list L. The analysis of FF(L) was done in several steps. ...

...m]] and are, in particular, useful for constructing polynomial-size proofs in these systems. The characterization of standard complexity classes and corr ...asibility in Arithmetic, Jour. Symbolic Logic 36 (1971) 494–508.</ref> in 1971, and later developed by [[Samuel Buss|Samuel R. Buss]]. <ref name="buss">{{ ...

...ible off. It can be used to demonstrate the concept of [[covering radius]] in [[coding theory]]. ...nding on its previous state. When flipping more than one switch, the order in which the switches are flipped does not make a difference to the outcome: t ...

...partite graph]]s and finding [[Arborescence (graph theory)|arborescence]]s in [[directed graph]]s. ...s theorem, the matroid intersection problem for two matroids can be solved in polynomial time using [[matroid partitioning]] algorithms. ...

...humb|360px|A 2-vertex-connected graph, its square, and a Hamiltonian cycle in the square]] ...ltonian. It is named after [[Herbert Fleischner]], who published its proof in 1974. ...

[[File:Polytrees in a tournament.svg|thumb|upright=1.3|A 6-vertex tournament, and copies of eve ...ure in [[extremal graph theory]] on oriented [[tree (graph theory)|trees]] in [[tournament (graph theory)|tournaments]]. It states that every [[Orientati ...

In the area of [[mathematics]] called [[combinatorial group theory]], the '''S ...52517}}</ref> An equivalent definition [[Todd–Coxeter algorithm|was made]] in an early paper of Todd and Coxeter.<ref>{{cite journal|first1=J.A |last1=To ...

...structures and partitions as a Ph.D. student at [[Harvard University]] in 1971 under the guidance of [[Gian-Carlo Rota]]. ...tially ordered set|poset]] with <math>p</math> elements denoted <math>x,y \in P</math>, and let <math>[n]=\{1<2<\ldots<n\}</math> be a [[total order|chai ...

...to their internal requirement for stock control. The system was first used in the early 1970s by J.Sainsbury to identify all of its products on supermark The barcode can be read in either direction (left to right or right to left). ...

...ded by probability of B. Bayesian econometricians assume that coefficients in the model have [[prior distribution]]s. ...one wishes to avoid losing a bet regardless of the outcome.<ref>Chapter 3 in de Finetti, B. (1990). ''Theory of Probability''. Chichester: John Wiley & ...

{{Short description|Technique for computing light scattering by nonspherical particles}} ...nd geometry in electromagnetic scattering |journal=Physical Review D |date=1971 |volume=3 |issue=4 |pages=825–839 |doi=10.1103/PhysRevD.3.825|bibcode=1971P ...