Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...urces provide more or less flexible mathematical formalizations of the way events can be triggered and which combinations are forbidden. The most general of these formalizations is given by Glynn Winskel. Winskel formalizes an event ...
    4 KB (550 words) - 23:56, 6 July 2024
  • [[File:Probability tree diagram.svg|thumb|Tree diagram for events <math>A</math> and <math>B</math>.]] ...Each set of sibling nodes represents an exclusive and exhaustive partition of the parent event. ...
    2 KB (271 words) - 00:45, 3 May 2024
  • ...s. The lower bound is expressed in terms of the probabilities for pairs of events. Formally, let <math>A_1,\ldots,A_n</math> be events. Assume that <math>\Pr[A_i]>0</math> for some <math>i</math>. Then ...
    1 KB (229 words) - 04:35, 12 May 2024
  • ...s a relative difference measure used to compare the [[incidence rate]]s of events occurring at any given point in time. where incidence rate is the occurrence of an event over person-time (for example [[person-year]]s): ...
    1 KB (192 words) - 08:22, 3 June 2024
  • ...maintains the [[Smallest circle problem|smallest enclosing disk]] of a set of moving points. ...ter. Thus, by maintaining the [[Kinetic diameter (data)|kinetic diameter]] of the point set, the farthest-point delaunay triangulation, and whether or no ...
    3 KB (475 words) - 00:29, 19 October 2015
  • ...ription|Procedure that can be infinitely repeated, with a well-defined set of outcomes}} ...s only one. A random experiment that has exactly two ([[Mutually exclusive events|mutually exclusive]]) possible outcomes is known as a [[Bernoulli trial]].< ...
    5 KB (752 words) - 18:44, 23 March 2024
  • ...mulation]]s require a future event list (FEL) structure that sorts pending events according to their time. Such simulators require a good and efficient [[Dat ...queue (abstract data type)|queue]]) and dequeue (deleting from a queue) of events in FEL is based on event time. ...
    5 KB (673 words) - 23:48, 1 March 2025
  • ..., Major]] (1946) The Statistical Study of Infectious Diseases. ''[[Journal of the Royal Statistical Society]]'', 109(2): 85–110. {{JSTOR|2981176}}</ref> In general, for a given sequence of events in time or space the statistic is given by:.<ref name=MG1/> ...
    3 KB (446 words) - 00:14, 7 February 2023
  • ...ure]] that maintains a [[triangulation (geometry)|triangulation]] of a set of moving points. Maintaining a kinetic triangulation is important for applica ...ng to use a triangulation scheme that generates a small number of external events. ...
    5 KB (681 words) - 08:08, 24 August 2023
  • ...tial randomness''' ('''CSR''') describes a [[point process]] whereby point events occur within a given study area in a completely random fashion. It is synon ..., whereas in most other statistical contexts it is referred to the concept of a spatial Poisson process.<ref name="Omaimon2010DataM"/> ...
    5 KB (834 words) - 11:48, 17 April 2024
  • ...s a [[kinetic data structure]] for maintaining a [[List_(computing)|list]] of points under motion in sorted order. It is used as a kinetic predecessor da ..., and the two certificates involving the swapped elements and the elements of the sorted list which directly precede and follow the swapped pair. ...
    3 KB (546 words) - 12:36, 18 August 2023
  • {{Short description|Possible result of an experiment or trial}} ...periment). All of the possible outcomes of an experiment form the elements of a [[sample space]].<ref>{{cite web |url=http://www-math.bgsu.edu/~albert/m1 ...
    7 KB (1,008 words) - 15:18, 25 February 2025
  • ...''insert'', ''delete'' and ''find-max''. They are often used as components of other kinetic data structures, such as [[kinetic closest pair]]. ...elements in its [[child nodes]]. Thus, the [[Tree (data structure)|root]] of the tree contains the maximum (or minimum) element at a given time. ...
    4 KB (616 words) - 19:00, 3 January 2023
  • ...n event in relativity.png|thumb|right|An event in spacetime and a 2D slice of its causal cone.]] ...e that can be characterized by a point in space and a corresponding moment of time.}}</ref> ...
    4 KB (565 words) - 05:28, 10 February 2025
  • ...at maintains the [[Euclidean minimum spanning tree]] (EMST) of a set ''P'' of ''n'' points that are moving continuously. ...' in 2-dimensional space, there are two kinetic algorithms for maintenance of the EMST. ...
    2 KB (260 words) - 01:37, 23 July 2023
  • ...ayesian network]]s, which describe a [[probability distribution]] in terms of conditional probabilities. ==Chain rule for events== ...
    9 KB (1,558 words) - 03:27, 24 November 2024
  • ...r simplicity: A fundamental cognitive principle?"] ''The Quarterly Journal of Experimental Psychology'', 52 (A), 273–302.</ref> computer scientist [[Paul of the situation is shorter than anticipated. For instance, the description of a consecutive lottery draw, such as 22-23-24-25-26-27, is ...
    6 KB (738 words) - 08:00, 17 November 2022
  • ...e recommendations for restaurants, museums, or other points of interest or events near the user's location. ...ing the location information of their users to show and recommend upcoming events, posts, and local trends. ...
    10 KB (1,567 words) - 02:42, 8 August 2023
  • ...itor-last2=Dekker |editor-first2=Paul |encyclopedia=The Cambridge Handbook of Formal Semantics |title=Modification|year=2016 |pages=442–464 |publisher=Ca ...odifier|intersective]] and non-intersectivity is sometimes treated as part of its definition.<ref name="m" /> ...
    7 KB (1,018 words) - 12:50, 12 August 2023
  • ...oover, M. P. (2007). ''Work Systems: The Methods, Measurement & Management of Work'', Prentice Hall, {{ISBN|978-0-13-140650-6}}</ref> By providing a smal ...hone call]]s are interruptions not related to work. However, the two types of interruption are both essential for the worker because it is almost impossi ...
    3 KB (420 words) - 13:49, 19 October 2020
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)