MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Closest pair of points problemLocal optimumNearest-neighbor interpolationNearest neighbor graphNearest-neighbor chain algorithmNearest centroid classifierMinimum bounding box algorithmsNeighbourhood components analysisClosest stringCombinatorial optimizationIterative closest pointLine searchGabriel graphRange searchingOptimization problem3-optShortest path problemMinimax approximation algorithmSmallest-circle problemNearest neighbour algorithmGeometric medianBidirectional searchBeam searchEuclidean shortest pathParticle swarm optimizationRange minimum query2-optNeighbourhood systemProjections onto convex setsApproximate string matchingClique problemMatching pursuitInterpolation searchSearch problemTrajectory optimizationOptics algorithmDistance from a point to a planeBinary search algorithmTernary searchPoint in polygonCloseness centralityMetric k-centerCoordinate descentLongest common subsequence problemMatrix chain multiplicationApproximation algorithmBest-first searchPolynomial interpolationDesign optimizationConstraint satisfactionPolygon triangulationSum-of-squares optimizationGlobal optimizationTopology optimizationCluster analysisMaximum weight matchingLinear programmingLinearizationLine detectionGolden-section searchActive-set methodMm algorithmMetricQuadratic programmingTriangulationMinhashLogic optimizationConvex hull of a simple polygonTotal derivativeGradient descentTabu searchConic optimizationMaximum subarray problemMinimum-cost flow problemMinimum bounding boxBreadth-first searchConstrained optimizationFeasible regionDistance from a point to a lineConvex optimizationGraph bandwidthMarginJump point searchApproximation theoryJohnson's algorithmNeighbourhoodPerturbation theoryMirror descentLongest path problemGraph edit distanceSimilarity measurePoint-set registrationBacktracking line searchNon-negative least squaresOptimizationBasis pursuit denoisingK shortest path routingProximal operatorAdjoint state methodGraph traversal