Pages that link to "Item:Q1920226"

The following pages link to Distance measures for point sets and their computation (Q1920226):

Displaying 37 items.

• An \(O(n^2)\) algorithm for the limited-capacity many-to-many point matching in one dimension (Q329283) (← links)
• Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
• Curvature based shape detection (Q482336) (← links)
• Minimum many-to-many matchings for computing the distance between two sequences (Q497361) (← links)
• Polychotomous kernel Fisher discriminant via top-down induction of binary tree (Q611331) (← links)
• Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
• Content-based image collection summarization and comparison using self-organizing maps (Q854262) (← links)
• An algorithm for computing the restriction s|caffold assignment problem in computational biology (Q1041813) (← links)
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets (Q1272958) (← links)
• Distance measures with heavy aggregation operators (Q1630784) (← links)
• Exploration of digital-filter and forward-stepwise synthetic turbulence generators and an improvement for their skewness-kurtosis (Q1653800) (← links)
• A graded approach to database repair by context-aware distance semantics (Q1677932) (← links)
• A distance function for computing on finite subsets of Euclidean spaces (Q1709440) (← links)
• Metrics based on average distance between sets (Q1943080) (← links)
• Fréchet distance between two point sets (Q2064018) (← links)
• Novel semi-metrics for multivariate change point analysis and anomaly detection (Q2127415) (← links)
• Scaling and compressing melodies using geometric similarity measures (Q2141192) (← links)
• Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
• Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
• Distance measures for well-distributed sets (Q2385142) (← links)
• Computing the Monge-Kantorovich distance (Q2403116) (← links)
• Distances between sets based on set commonality (Q2440129) (← links)
• Distance semantics for database repair (Q2457795) (← links)
• Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
• Distance Measures between Digital Fuzzy Objects and Their Applicability in Image Processing (Q3003553) (← links)
• (Q3690255) (← links)
• (Q4035079) (← links)
• A new measure between sets of probability distributions with applications to erratic financial behavior (Q5020029) (← links)
• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
• Quantitative classification of vortical flows based on topological features using graph matching (Q5160736) (← links)
• Context-Aware Distance Semantics for Inconsistent Database Systems (Q5230062) (← links)
• Stochastic Distance Transform (Q5237047) (← links)
• Distance Between Vector-Valued Fuzzy Sets Based on Intersection Decomposition with Applications in Object Detection (Q5270572) (← links)
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
• (Q6084355) (← links)
• Equivalence relations and \(L^p\) distances between time series with application to the black summer Australian bushfires (Q6102441) (← links)
• Statistical Modeling and Monitoring of Geometrical Deviations in Complex Shapes With Application to Additive Manufacturing (Q6631085) (← links)