Search results

...ed by removing the longest [[edge (geometry)|edge]] from each [[triangle]] in the [[Delaunay triangulation]]. ...they are to each other). Since Delaunay triangulations can be constructed in time <math>O(n\log n)</math>, the same time bound holds for the Urquhart gr ...

...| issue=5| pages=563–591|author1=Benioff Paul|doi=10.1007/BF01011339| year=1980}}</ref><ref name="Feynman1986">{{cite journal| title=Quantum mechanical com ...eering model of quantum computation, first proposed by [[Paul Benioff]] in 1980. ...

In [[applied statistics]], a '''partial regression plot''' attempts to show th ...ns/125561/what-does-an-added-variable-plot-partial-regression-plot-explain-in-a-multiple|date=June 2024}} ...

...s''<ref name="thesis">{{cite thesis |last1=Saks |first1=Michael Ezra |date=1980 |title=Duality Properties of Finite Set Systems |degree=Ph.D. |publisher=[[ In 2016 he became a [[Fellow of the Association for Computing Machinery]].<ref>{{citation|title=ACM Recognizes New Fellows|journal=[[Comm ...

...rious sizes in a graph. It is one of several [[graph polynomial]]s studied in [[algebraic graph theory]]. ...''H''_''n''(''x'') is the "probabilist's Hermite polynomial" (1) in the definition of [[Hermite polynomial]]s. These facts were observed by {{ ...

...]] on the circle. It has one [[vertex (graph theory)|vertex]] for each arc in the set, and an [[edge (graph theory)|edge]] between every pair of vertices :<math> \{I_\alpha, I_\beta\} \in E \iff I_\alpha \cap I_\beta \neq \varnothing. </math> ...

In [[regression analysis]], '''partial leverage''' ('''PL''') is a measure of :''X''_{''j''·[''j'']} = [[errors and residuals in statistics|residuals]] from regressing ''X''_''j'' against the re ...

...= [[University of Chicago]]<br>[[Harvard Medical School]]<br>[[Scientific Computing and Imaging Institute]]<br>[[University of Chicago]] ...st|access-date=5 April 2017}}</ref> He is recognized for his contributions in developing tools for [[tensor]] data visualization. ...

'''Rolf Rannacher''' (born 10 June 1948 in [[Leipzig]]) is a German mathematician and a professor of [[numerical analy ...1988 a professor at [[Saarland University]]. Since 1988 he is a professor in Heidelberg. ...

{{short description|Graphical technique in statistics to show error in a model}} ...the [[response variable]] given that other independent variables are also in the [[Statistical model|model]]. ...

In mathematics, '''Owen's T function''' ''T''(''h'',&nbsp;''a''), named after ...on was first introduced by Owen in 1956.<ref>Owen, D B (1956). "Tables for computing bivariate normal probabilities". ''Annals of Mathematical Statistics'', ...

...ans to efficiently simulate [[Quantum mechanics|quantum]] systems, such as in solving the [[quantum many-body problem]]. ...m devices. Some of these proposals involve using [[Superconducting quantum computing|superconducting qubits]], [[Trapped ion quantum computer|trapped ions]], [[ ...

In [[graph theory]] and [[theoretical computer science]], the '''colour refine ...s a function from the vertices of this graph into some set (of "colours"). In each iteration, we define a sequence of vertex colourings <math> \lambda_i ...

...is a [[Hungarian American|Hungarian-American]] [[mathematician]], working in [[probability theory]] and [[discrete mathematics]]. He has been a professo ...es [[Almost everywhere convergence|converge pointwise almost everywhere]]. In probabilistic terminology, the theorem is as follows. Let ξ₁,ξ<s ...

[[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 [[robust statistics]], '''repeated median regression''', also known as the ...94.</ref> It can be calculated in <math>O(n^2)</math> time by brute force, in <math>O(n \log^2 n)</math> time using more sophisticated techniques,<ref>{{ ...

...er of eligible partitions for each tree is equal to the number of branches in that tree. ...ha^{-1}</math> expands an edge (decontraction), where the set can be split in any fashion. ...

| thesis_year = 1980 ...[[University of California, Davis]]. Gusfield is known for his research in combinatorial optimization and computational biology.<ref name=gs>{{Google ...

...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 ...spent the academic year 1970–1971 at the [[Institute for Advanced Study]] in Princeton as the first assistant of [[John Milnor]].<ref name=cornellobit/> ...

*[[RSA Award for Excellence in Mathematics]] (2024) .../ref> He is best known for his work in [[lattice-based cryptography]], and in particular for introducing the [[learning with errors]] problem. ...