Search results

...c sorted list''' is a [[kinetic data structure]] for maintaining a [[List_(computing)|list]] of points under motion in sorted order. It is used as a kinetic pre ...uses no extraneous [[Kinetic data structure#Certificates Approach|internal events]], every change in the ordering of the elements causes exactly one certific ...

[[Category:Events (computing)]] ...

...tial randomness''' ('''CSR''') describes a [[point process]] whereby point events occur within a given study area in a completely random fashion. It is synon ...re independently and uniformly distributed over space; in other words, the events are equally likely to occur anywhere and do not interact with each other. ...

...turally when arranging events in order of time, such as network [[Timeout (computing)|timeout]]s or [[discrete event simulation]]. An event can cause some acti ...interest are prioritized by the coordinate of the crossed point, and these events are extracted in monotonic ordering. ...

{{Short description|Optimization theory in computing}} ...approximate counting algorithm''' allows the counting of a large number of events using a small amount of memory. Invented in 1977 by [[Robert Morris (crypt ...

...g lines]]. In the static case, the diameter of a point set can be found by computing the convex hull of the point set, finding all pairs of antipodal points, an ...th> per event. The data structure is efficient because the total number of events is <math>O(n^{2+\epsilon})</math> for all <math>\epsilon>0</math> and the d ...

==Conditional probability and conditional events== ...opositions are thought of as sets of possible worlds.</ref> That is, given events <math>A</math> and <math>B</math>, one might suppose there is an event, <ma ...

...matical terms, the version vector generates a [[preorder]] that tracks the events that precede, and may therefore influence, later updates. ...hlia Malkhi]] and Doug Terry. Concise Version Vectors in WinFS.Distributed Computing, Vol. 20, 2007.</ref> allow significant space savings when handling multipl ...

...ey can also be used for investigating the cause and consequence of failure events. The generation of conditional samples is not trivial but can be performed ...t generation of samples of '''X''' conditional on the intermediate failure events, i.e., the conditional samples. This is generally non-trivial. ...

...premise of event partitioning is that systems exist to respond to external events: identify what happens in the business environment that requires planned re ...f the "'''actors'''" (external systems), which are the sources of external events. If you find a graphic to be helpful, create a [[system context diagram|co ...

...sorted edge weights. This data structure must process <math>O(n^2)</math> events, developing a more [[kinetic data structure#Performance|efficient]] data st ...llest spanning trees | author=Frederickson, G. N. |journal=SIAM Journal on Computing | year=1997 | volume=26 | issue=2 | pages=484–538 | doi=10.1137/s0097539792 ...

| title = Dependable Computing Systems and Communication Networks states a system may be in. Transitions between states happen as a result of events from underlying Poisson processes with different intensities. ...

===Computing weak chromatic polynomials=== .... Undirected edges, instead, indicate a non-causal correlation between two events. A connected component of the undirected subgraph of a chain graph is calle ...

...sing the remaining redundant nodes on the cluster to take over the [[Load (computing)|load]] of failed nodes for providing constant services.{{sfn|Robertson|200 ...nsible for keeping track of such occurrences for the purpose of triggering events to rebalancing and reconfiguring the master to distribute the load. ...

...[[Space complexity|sub-linear space]], at the expense of overcounting some events due to [[hash collision|collisions]]. The count–min sketch was invented in ...in probability.{{efn|The following discussion assumes that only "positive" events occur, i.e., the frequency of the various types cannot decrease over time. ...

...nequalities giving an exponential bound on the probability of many related events happening simultaneously by their pairwise dependence. Informally Janson's ...|journal=Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing |date=2019 | pages=442–453 |arxiv=1809.04092 |doi=10.1145/3313276.3316339 | ...

==Computing the cycle rank== Computing the cycle rank is computationally hard: {{harvtxt|Gruber|2012}} proves that ...

=== Computing the fractional solution === as long as none of the following "bad" events occur: ...

...<math>i</math> indexes the state variables, and <math>j</math> indexes the events), the method is as follows: This algorithm typically requires computing <math>2N</math> ''auxiliary values'' (where <math>N</math> is the number of ...

...of the underlying process is mirrored in the non-equal number of intrinsic events observed over equal periods of physical time. | title = High-Performance Computing in Finance}}</ref> ...