Showing 13 of 613 papers

Finding All the Elementary Circuits of a Directed Graph

D. Barton Johnson
1975
1 reference

An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by $O((n + e)(c + 1))$ and space bounded by $O(n + e)$, where there are n vertices, e edges and c elementary circuits in the graph. The algorithm re...

Multidimensional Binary Search Trees Used for Associative Searching.

Jon Bentley
1975
1 reference

This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined and example...

Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen

Arnold Neumaier
1974
1 reference

Abstract Der bei einer Summation auftretende Rundungsfehler kann als Maß für die Güte des verwendeten Verfahrens gelten. Im folgenden werden für mehrere Summierungsverfahren, unter anderem für das übliche und das Kahan‐Babuška‐Verfahren, a‐priori‐Sch...

A New Vector Partition of the Probability Score

A. H. Murphy
1973
1 reference

A new vector partition of the probability, or Brier, score (PS) is formulated and the nature and properties of this partition are described. The relationships between the terms in this partition and the terms in the original vector partition of the P...

Efficiency of a Good But Not Linear Set Union Algorithm

Robert E. Tarjan
1972
1 reference

We questioned whether the respiratory muscles of humans contribute to systemic oxidative stress following inspiratory flow-resistive breathing, whether the amount of oxidative stress is influenced by the level of resistive load, and whether the amoun...

A Study of Replacement Algorithms for Virtual-Storage Computer

L. A. Belady
1966
1 reference

One of the basic limitations of a digital computer is the size of its available memory. 1 In most cases, it is neither feasible nor economical for a user to insist that every problem program fit into memory. The number of words of information in a pr...

Nonmetric Multidimensional Scaling: A Numerical Method

Joseph B. Kruskal
1964
1 reference

We describe the numerical methods required in our approach to multi-dimensional scaling. The rationale of this approach has appeared previously.

Note on a Method for Calculating Corrected Sums of Squares and Products

B. P. Welford
1962
1 reference

"Note on a Method for Calculating Corrected Sums of Squares and Products." Technometrics, 4(3), pp. 419–420

Topological sorting of large networks

Arthur B. Kahn
1962
1 reference

Topological Sorting is a procedure required for many problems involving analysis of networks. An example of one such problem is PERT. The present paper presents a very general method for obtaining topological order. It permits treatment of larger net...

Control Chart Tests Based on Geometric Moving Averages

1959
1 reference

A geometrical moving average gives the most recent observation the greatest weight, and all previous observations weights decreasing in geometric progression from the most recent back to the first. A graphical procedure for generating geometric movin...