Colored Range Closest-Pair Problem Under General Distance Functions

doi 10.1137/1.9781611975482.24
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

An Optimal Algorithm for the On-Line Closest-Pair Problem

1992English

Distance Functions and the Metrization Problem

Bulletin of the American Mathematical Society
1937English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

Diameter, Width, Closest Line Pair, and Parametric Searching

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1993English

Face Alignment by Minimizing the Closest Classification Distance

2009English

The Closest Substring Problem With Small Distances

English

JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences

2018English

Estimation Bias Under Model Selection for Distance Sampling Detection Functions

Environmental and Ecological Statistics
UncertaintyStatisticsProbabilityEnvironmental Science
2017English

Mean Distance of Closest Approach of Ions: Lithium Salts in Aqueous Solutions

Journal of Molecular Liquids
Condensed Matter PhysicsOpticsMaterials ChemistryMolecular Physics,SpectroscopyTheoretical ChemistryOpticalAtomicMagnetic MaterialsElectronicPhysical
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy