Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Shanglin Zhou
JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences
Related publications
An Optimal Algorithm for the On-Line Closest-Pair Problem
An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
Journal of Computer Science and Technology
Hardware
Computer Science Applications
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
A Stochastic Iterative Closest Point Algorithm (stochastICP)
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Diameter, Width, Closest Line Pair, and Parametric Searching
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
A Heuristic Algorithm to Find Rupture Degree in Graphs
Turkish Journal of Electrical Engineering and Computer Sciences
Electronic Engineering
Electrical
Computer Science
Colored Range Closest-Pair Problem Under General Distance Functions
Depolarization Due to the Resonance Tail During a Fast Resonance Jump
A Proposal to Find the Ultimate Pit Using Ford Fulkerson Algorithm
Revista Escola de Minas
Materials Science
Waste Management
Petrology
Disposal
Geology
Geochemistry
Economic Geology
Three-Dimensional Point-Cloud Registration Using a Genetic Algorithm and the Iterative Closest Point Algorithm
