euclidean-distance标记 第1页

     首页  | 前一页   当前 1 页   下一页   共 页,  跳转到    

序号 问题名称 标记tag
1 结合多个*搜索的最佳方法是什么?  ( What's the best way to combine multiple A* searches? ) euclidean-distance
2 算法以适应3D空间中的点  ( Algorithm to mimimally pair up points in 3D space ) euclidean-distance
3 修改4个点的错误成对距离以获得共面  ( Modifying the Erroneous Pairwise Distances of 4 Points to Get Coplanarity ) euclidean-distance
4 马哈拉诺比斯点到平面算法的距离  ( Mahalanobis distance of point to plane algorithm ) euclidean-distance
5 高效算法来实现一组坐标约束  ( Efficient algorithm to fulfil a set of coordinate constraints ) euclidean-distance
6 欧几里德飞机的部分TSP  ( Partial TSP in Euclidian plane ) euclidean-distance
7 最接近的对有多快?  ( How fast is closest pair? ) euclidean-distance
8 从带有点距离加权的边缘恢复从图形嵌入的点  ( Recovering a point embedding from a graph with edges weighted by point distance ) euclidean-distance
9 可以仅使用XOR的eUCLIDEAN距离功能来计算  ( Can the Euclidean distance function be computed using only XOR's ) euclidean-distance
10 找到欧几里德飞机上的点列表到给定的参考点  ( Finding nearest of a list of points on Euclidian plane to a given reference point ) euclidean-distance
11 聚类非重叠时间序列  ( Clustering non-overlapping time series ) euclidean-distance
12 预期的成对方形欧几里德点之间的距离  ( expected pairwise square euclidean distance between points ) euclidean-distance
13 从高维凸壳到目标点T的距离  ( Distance from high dimensional convex hull to target point T ) euclidean-distance
14 给定遍历路径的最佳项目位置  ( Optimal Item Locations given Traversal Paths ) euclidean-distance
15 网格上的点之间的总距离,时间复杂性低于$ O(n ^ 2)$  ( Total distance between points on a grid with time complexity lower than $O(n^2)$ ) euclidean-distance
16 是否应该平面欧几里德图是平面的直线图?  ( Should planar Euclidean graphs be planar straight-line graphs? ) euclidean-distance
17 均匀地分割一组飞机上并将其分类  ( Splitting a set of points in the plane evenly and sorting it ) euclidean-distance
18 二元定点垂钓 - 距离计算浮点欧几里德距离计算的计算复杂性比较  ( Computational complexity comparison of floating-point Euclidean distance calculation with binary fixed-point Hamming-distance calculation ) euclidean-distance
19 如何根据段的长度检测相交的段  ( How to detect intersecting segments based on length of the segments ) euclidean-distance
20 将一组点缩小到较小的区域  ( Scaling down a set of points into a smaller area ) euclidean-distance
21 近似算法访问无向加权,完整图中的所有节点,具有最短的边缘权重和  ( Approximation algorithm to visit all nodes in an undirected, weighted, complete graph, with shortest sum of edge weights ) euclidean-distance
22 如何防止欧几里德距离和马哈拉诺比斯距离中的溢出和下溢  ( How to prevent overflow and underflow in the Euclidean distance and Mahalanobis distance ) euclidean-distance
23 “孤独的点”算法  ( “Loneliest point” algorithm ) euclidean-distance
24 如何将Pearson距离嵌入欧几里德空间  ( How to embed Pearson distance into Euclidean space ) euclidean-distance
25 算法的方法,以在许多类似对象的列表中查找最近的3-D对象到给定的测试用例  ( Approach for algorithm to find closest 3-D object in a list of many similar objects to a given test case ) euclidean-distance
26 计算点的每个疼痛之间的最小距离  ( Computing the minimum distance between each pain of points ) euclidean-distance
27 在多目标优化中,如何计算参考点的距离?  ( In multiobjective optimization, how to calculate the distance to reference point? ) euclidean-distance
28 低顶点计数多边形的高效参数化  ( Efficient parameterization of low vertex count polygons ) euclidean-distance
29 改变2D欧几里德空间中的所有最近邻居  ( All nearest neighbor in a changing 2d euclidean space ) euclidean-distance
30 为什么很难表明Euclidean Steiner Tree问题是NP?  ( Why is it hard to show that the euclidean Steiner tree problem is in NP? ) euclidean-distance

     首页  | 前一页   当前 1 页   下一页   共 页,  跳转到    




© 2021 it.wenda123.org All Rights Reserved. 问答之家 版权所有