On the Average Number of Maxima in a Set of Vectors and Applications
From MaRDI portal
(Redirected from Publication:4170249)
Cited in
(66)- A note on the expected time required to construct the outer layer
- Geometric containment and vector dominance
- Fast algorithms for computing the diameter of a finite planar set
- A note on linear expected time algorithms for finding convex hulls
- A note on finding convex hulls via maximal vectors
- How to reduce the average complexity of convex hull finding algorithms
- Convex hulls of samples from spherically symmetric distributions
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- On the variance of the number of maxima in random vectors and its applications
- Random polytopes in a convex polytope, independence of shape, and concentration of vertices
- A sweepline algorithm to solve the two-center problem
- A provably fast linear-expected-time maxima-finding algorithm
- Efficient processing of intelligent probabilistic collision detection queries
- Convex-hull algorithms: implementation, testing, and experimentation
- Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
- An anomaly concerning ties in Lotto-like games
- Output-sensitive results on convex hulls, extreme points, and related problems
- On the average number of maximal in a set of vectors
- Random convex hulls in a product of balls
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
- Effective space usage estimation for sliding-window skybands
- Persistent homology in \(\ell_\infty\) metric
- Stochastic control of ecological networks
- K-dominance in multidimensional data: theory and applications
- Efficient processing of neighboring skyline queries with consideration of distance, quality, and cost
- Optimizing skyline queries over incomplete data
- How many maxima can there be?
- Records, the maximal layer, and uniform distributions in monotone sets
- Updating credal networks is approximable in polynomial time
- Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- On the Version Space Compression Set Size and Its Applications
- Data structures for range-aggregation over categories
- Threshold rules for online sample selection
- From proximity to utility: a Voronoi partition of Pareto optima
- Towards estimating expected sizes of probabilistic skylines
- Random linear programs with many variables and few constraints
- Direct dominance of points
- Faster output-sensitive skyline computation algorithm
- scientific article; zbMATH DE number 1286270 (Why is no real title available?)
- On random cartesian trees
- Computing the vector in the convex hull of a finite set of points having minimal length
- A Complete Implementation for Computing General Dimensional Convex Hulls
- A survey on multi-objective evolutionary algorithms for many-objective problems
- Exact asymptotics of divide-and-conquer recurrences
- Random inequality constraint systems with few variables
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- Recent Results and Open Problems in Evolutionary Multiobjective Optimization
- Sampling-based approximate skyline calculation on big data
- K-Dominance in Multidimensional Data: Theory and Applications
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
- A convex hull algorithm for solving a location problem
- scientific article; zbMATH DE number 7650102 (Why is no real title available?)
- Maximal empty boxes amidst random points
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- On the shortest path problem with negative cost cycles
- A volume first maxima-finding algorithm
- The two variable per inequality abstract domain
- An upper bound on the number of extreme shortest paths in arbitrary dimensions
- Maximizing weighted dominance in the plane
- Construction of three-dimensional Delaunay triangulations using local transformations
- Approximately dominating representatives
- On the angle restricted nearest neighbor problem
- A new clustering algorithm for coordinate-free data
This page was built for publication: On the Average Number of Maxima in a Set of Vectors and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170249)
