Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

DOI10.1145/321978.321982zbMath0333.68020OpenAlexW2048285065MaRDI QIDQ4099196

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321978.321982

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Efficient algorithms for robustness in resource allocation and scheduling problems, Parametric optimization of sequence alignment, Maximizing residual flow under an arc destruction, Using sparsification for parametric minimum spanning tree problems, Space-sweep algorithms for parametric optimization, On total variation minimization and surface evolution using parametric maximum flows, A faster algorithm for computing the principal sequence of partitions of a graph, Improving the efficiency of decentralized supply chains with fixed ordering costs, Constructing the minimization diagram of a two-parameter problem, Parametric methods in integer linear programming, Total Variation on a Tree, An approximation algorithm for a general class of parametric optimization problems, Maximal closure on a graph with resource constraints, Balancing profits and costs on trees, Parametric multiple sequence alignment and phylogeny construction, A parametric maximum flow algorithm for bipartite graphs with applications, On weighting two criteria with a parameter in combinatorial optimization problems, A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem, Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, Parametric matroid interdiction, Parametric stable marriage and minimum cuts, Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, A fast algorithm for the generalized parametric minimum cut problem and applications, Approximation schemes for the parametric knapsack problem, Algorithms for flows with parametric capacities, Modelling and solving an FMS part selection problem, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, Facility location models to locate data in information networks: a literature review, Parametric multiroute flow and its application to multilink-attack network, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, Generalization of a theorem on the parametric maximum flow problem, On the p‐coverage problem on the real line, Structural and algorithmic properties for parametric minimum cuts, EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION, Approximating the Minimum Chain Completion problem, A fast parametric assignment algorithm with applications in max-algebra, Total Variation in Imaging, Capacitated procurement planning with price-sensitive demand and general concave-revenue functions, How Good is the Chord Algorithm?, An improved branch-and-bound clustering approach for data partitioning, An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries, An approximation algorithm for a general class of multi-parametric optimization problems, Ordered optimal solutions and parametric minimum cut problems, A polynomial time algorithm for a deterministic joint pricing and inventory model, Una struttura bidimensionale per la memorizzazione dei file trasposti, Calculation of stability radii for combinatorial optimization problems, An efficient algorithm for the parametric resource allocation problem, Inventory control of service parts in the final phase: A central depot and repair kits, A note on Stability of the constant cost dynamic lot size model by K. Richter, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering