Search results

...''x''; ''h'') with a parameter ''h''. It was introduced by F. Esscher in 1932 {{harv|Esscher|1932}}. |year= 1994 ...

...ence]], '''tree accumulation''' is the process of accumulating data placed in [[Tree (data structure)|tree]] ...rithms for tree accumulations|journal=Science of Computer Programming|year=1994|series=Elsiver}}</ref> formally define binary tree accumulation as iterativ ...

{{Short description|Science book series written by scientists and published by Princeton University Pre ...ton Science Library |url=https://press.princeton.edu/collections/princeton-science-library |website=press.princeton.edu |language=en}}</ref> ...

...orn 27 November 1960, [[Wrocław]]) is a Polish mathematician, specializing in [[model theory]], [[set theory]], [[foundations of mathematics]], and [[uni ...ity of Wrocław, where he now works. He obtained the rank of full professor in 1998.<ref name=homepage/> From 2007 to 2016 Newelski was the director of th ...

...4. Strebe designed the projection to keep all areas proportionally correct in size; to push as much of the inevitable distortion as feasible away from th ...the [[North American Cartographic Information Society]] (NACIS) in August 1994.<ref>{{cite conference ...

...n of the College of Science and Mathematics at [[Wright State University]] in June 2020,{{r|dean}} and is a co-author of two textbooks on [[calculus]] an ...s of <math>\mathbb{R}^2</math> Actions and <math>\alpha</math>-Equivalence in Two Dimensions'', was supervised by [[Daniel Rudolph]].{{r|mgp}} ...

...(born 12 June 1962 in [[Geneva]]) is a German mathematician, specializing in [[geometry]] and [[representation theory]]. Soergel received his [[Promotion (Germany)|''Promotion'']] (PhD) in 1988 from the [[University of Hamburg]]. His PhD dissertation ''Universelle ...

{{short description|Intermittent increases and decreases in activity}} ...statistics]], '''burstiness''' is the intermittent increases and decreases in activity or [[frequency]] of an event.<ref name="Lambiotte">Lambiotte, R. ( ...

...was the fastest algorithm known for this problem, from its publication in 1994 until 2020.<ref>{{citation ...tle = 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic ...

...tor2-first=D.}}</ref> about representing a given [[context-free language]] in terms of two simpler languages. These two simpler languages, namely a [[reg ...{{harvtxt|Autebert|Berstel|Boasson|1997}} or {{harvtxt|Davis|Sigal|Weyuker|1994}}. ...

...e and a decreasing sequence. They were first studied by {{harvtxt|Stankova|1994}} and given their name by {{harvtxt|Atkinson|1998}}. ...increasing and a decreasing sequence are 3412 and 2143. {{harvtxt|Stankova|1994}} was the first to establish that a skew-merged permutation can also be equ ...

...al homology to the GNAT family of N-acetyltransferases | journal = Protein Science | volume = 12 | issue = 9 | pages = 1954–9 | date = September 2003 | pmid = This enzyme catalyses the last step in the [[biosynthesis]] of mycothiol ...

...'''range expansion index''' ('''REI''') is a [[technical indicator]] used in the [[technical analysis]] of [[financial market]]s. It is intended to char ...''The New Science of Technical Analysis''.<ref>Thomas R. DeMark, ''The New Science of Technical Analysis'', {{ISBN|0-471-03548-3}}</ref> ...

...nd environment initially in the state <math>\rho_{SE} (0) \,</math> (which in general may be [[quantum entanglement|entangled]]) and undergoing unitary e ...an be represented by a [[quantum operation]]. This mean we can express it in the operator-sum form ...

{{Short description|Concept in theoretical computer science}} ...ved. The non-decreasing condition here means that the letters are received in the correct order. ...

...cification of the flow field|between Eulerian and Lagrangian coordinates]] in [[continuum mechanics]]. It is named after [[Gabrio Piola]]. ...th> with <math> F( \hat{x}) = B \hat{x} +b, ~ B \in \mathbb{R}^{d,d}, ~ b \in \mathbb{R}^{d} </math> an affine transformation. Let <math> K=F(\hat{K}) ...

...is the weight and '''x''' is the value of the ''jth'' asset to be included in the portfolio. ...ance and W. W. Cooper (1959), "Chance-Constrained Programming," Management Science, 6, No. 1, 73-79. [https://www.jstor.org/stable/2627476?Search=yes&resultIt ...

{{Short description|Set of related problems in graph theory}} ...tion planning]] (in which the pebbles are robots) and [[network routing]] (in which the pebbles are [[Data packet|packets]] of data). The best-known exam ...

{{Short description|Soviet mathematician (1918–1994)}} | death_date = {{death date and age|1994|4|20|1918|11|26}} ...

In the mathematical discipline of [[category theory]], the '''Freyd cover''' o ...t it is like a [[Cone (topology)|cone]], but with the [[Sierpiński space]] in place of the [[unit interval]].<ref name=nlab/> ...