Pages that link to "Item:Q3558022"

The following pages link to Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method (Q3558022):

Displaying 14 items.

• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
• Surface estimation for multiple misaligned point sets (Q777257) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
• Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
• Nonrigid registration using Gaussian processes and local likelihood estimation (Q2238115) (← links)
• On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
• Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
• Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
• Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• (Q5111230) (← links)
• The simultaneous semi-random model for TSP (Q6589752) (← links)