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

doi 10.1137/1.9781611975321.9
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

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

A Stochastic Iterative Closest Point Algorithm (stochastICP)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Diameter, Width, Closest Line Pair, and Parametric Searching

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1993English

A Heuristic Algorithm to Find Rupture Degree in Graphs

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2019English

Colored Range Closest-Pair Problem Under General Distance Functions

2019English

Depolarization Due to the Resonance Tail During a Fast Resonance Jump

1981English

A Proposal to Find the Ultimate Pit Using Ford Fulkerson Algorithm

Revista Escola de Minas
Materials ScienceWaste ManagementPetrologyDisposalGeologyGeochemistryEconomic Geology
2014English

Three-Dimensional Point-Cloud Registration Using a Genetic Algorithm and the Iterative Closest Point Algorithm

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy