On the public citation graph

Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/cviu.2002.0987openalex-snapshot
Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm
inferredcites →https://doi.org/10.1007/3-540-28349-8_2openalex-snapshot
A Survey of Clustering Data Mining Techniques
inferredcites →https://doi.org/10.1007/s00453-004-1127-9openalex-snapshot
How Fast Is the k-Means Method?
inferredcites →https://doi.org/10.1016/j.comgeo.2004.03.003openalex-snapshot
A local search approximation algorithm for k-means clustering
inferredcites →https://doi.org/10.1109/34.121791openalex-snapshot
A method for registration of 3-D shapes
inferredcites →https://doi.org/10.1109/34.982886openalex-snapshot
ICP registration using invariant features
inferredcites →https://doi.org/10.1109/im.1999.805329openalex-snapshot
The Digital Michelangelo Project
inferredcites →https://doi.org/10.1109/im.2001.924423openalex-snapshot
Efficient variants of the ICP algorithm
inferredcites →https://doi.org/10.1109/im.2003.1240258openalex-snapshot
Geometrically stable sampling for the ICP algorithm
inferredcites →https://doi.org/10.1109/sfcs.2003.1238219openalex-snapshot
Average case and smoothed competitive analysis of the multi-level feedback algorithm
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1145/1055558.1055581openalex-snapshot
k -means projective clustering
inferredcites →https://doi.org/10.1145/1137856.1137873openalex-snapshot
On the ICP algorithm
inferredcites →https://doi.org/10.1145/1137856.1137880openalex-snapshot
How slow is the k -means method?
inferredcites →https://doi.org/10.1145/177424.178042openalex-snapshot
Applications of weighted Voronoi diagrams and randomization to variance-based k -clustering
inferredcites →https://doi.org/10.1145/513400.513402openalex-snapshot
A local search approximation algorithm for k-means clustering
inferredcites →https://doi.org/10.1145/780542.780578openalex-snapshot
Random knapsack in expected polynomial time
inferredcites →https://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferredcites →https://doi.org/10.5555/1070432.1070555openalex-snapshot
How fast is the k-means method?

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20341openalex-snapshot
Smoothed analysis of balancing networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-1168-0_15openalex-snapshot
Numerical Thinking in Algorithm Design and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-58008-7_15openalex-snapshot
Initial Centroid Selection Method for an Enhanced K-means Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_4openalex-snapshot
The Simultaneous Semi-random Model for TSP
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_2openalex-snapshot
A Tight Lower Bound Instance for k-means++ in Constant Dimension
inferred← citeshttps://doi.org/10.1007/978-3-319-52503-7_11openalex-snapshot
Graph-Based Clustering for Apictorial Jigsaw Puzzles of Hand Shredded Content-less Pages
inferred← citeshttps://doi.org/10.1007/978-3-319-68124-5_7openalex-snapshot
Simultaneous Reconstruction of Multiple Hand Shredded Content-Less Pages Using Graph-Based Global Reassembly
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_24openalex-snapshot
The Planar k-Means Problem is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_39openalex-snapshot
Smoothed Analysis of Balancing Networks
inferred← citeshttps://doi.org/10.1007/s00454-011-9340-1openalex-snapshot
k-means Requires Exponentially Many Iterations Even in the Plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.10.005openalex-snapshot
Smoothed analysis of probabilistic roadmaps
inferred← citeshttps://doi.org/10.1016/j.compmedimag.2021.101884openalex-snapshot
A system for 3D reconstruction of comminuted tibial plafond bone fractures
inferred← citeshttps://doi.org/10.1016/j.ins.2015.06.039openalex-snapshot
Recovering the number of clusters in data sets with noise features using feature rescaling factors
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.034openalex-snapshot
The planar k -means problem is NP-hard
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.012openalex-snapshot
Tight lower bound instances for k-means++ in two dimensions
inferred← citeshttps://doi.org/10.1017/9781108637435.018openalex-snapshot
Smoothed Analysis of Local Search
inferred← citeshttps://doi.org/10.1101/2022.04.28.489908openalex-snapshot
Attractor dynamics of a whole-cortex network model predicts emergence and structure of fMRI co-activation patterns in the mouse brain
inferred← citeshttps://doi.org/10.1109/aris.2015.7158374openalex-snapshot
Semi-automatically simultaneous localization and mapping for home service robots
inferred← citeshttps://doi.org/10.1109/focs.2009.21openalex-snapshot
Smoothed Analysis of Multiobjective Optimization
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00099openalex-snapshot
Smoothing the gap between NP and ER
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831292openalex-snapshot
Sampling-based Smoothed Analysis for network algorithm evaluation
inferred← citeshttps://doi.org/10.1109/icabcd49160.2020.9183892openalex-snapshot
Effect of Data Parameters and Seeding on k-Means and k-Medoids
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218478openalex-snapshot
A truthful (1-ε)-optimal mechanism for on-demand cloud resource provisioning
inferred← citeshttps://doi.org/10.1109/ipdps.2012.99openalex-snapshot
Efficient Quality Threshold Clustering for Parallel Architectures
inferred← citeshttps://doi.org/10.1109/mesa.2010.5552024openalex-snapshot
Characterization of partial discharge signals
inferred← citeshttps://doi.org/10.1109/sces.2012.6199061openalex-snapshot
Notice of Violation of IEEE Publication Principles - K-means versus k-means ++ clustering technique
inferred← citeshttps://doi.org/10.1109/tcc.2018.2822718openalex-snapshot
A Truthful $(1-\epsilon)$-Optimal Mechanism for On-demand Cloud Resource Provisioning
inferred← citeshttps://doi.org/10.1109/tcsvt.2021.3108772openalex-snapshot
A Robust Coverless Steganography Scheme Using Camouflage Image
inferred← citeshttps://doi.org/10.1109/tgrs.2023.3323735openalex-snapshot
A Click-Based Interactive Segmentation Network for Point Clouds
inferred← citeshttps://doi.org/10.1109/time.2008.27openalex-snapshot
The Complexity of CaRet + Chop
inferred← citeshttps://doi.org/10.1109/tip.2009.2035840openalex-snapshot
Automatic Color Based Reassembly of Fragmented Images and Paintings
inferred← citeshttps://doi.org/10.1137/1.9781611972979.12openalex-snapshot
Smoothed Analysis of Probabilistic Roadmaps
inferred← citeshttps://doi.org/10.1137/1.9781611973068.51openalex-snapshot
Improved Smoothed Analysis of the k-Means Method
inferred← citeshttps://doi.org/10.1137/20m1385287openalex-snapshot
Smoothing the Gap Between NP and ER
inferred← citeshttps://doi.org/10.1145/1137856.1137880openalex-snapshot
How slow is the k -means method?
inferred← citeshttps://doi.org/10.1145/1542362.1542419openalex-snapshot
k-means requires exponentially many iterations even in the plane
inferred← citeshttps://doi.org/10.1145/1562764.1562785openalex-snapshot
Smoothed analysis
inferred← citeshttps://doi.org/10.1145/3447579openalex-snapshot
Competitive Caching with Machine Learned Advice
inferred← citeshttps://doi.org/10.15388/informatica.2010.277openalex-snapshot
Multistage K-Means Clustering for Scenario Tree Construction
inferred← citeshttps://doi.org/10.3390/info16020155openalex-snapshot
Schema Understandability: A Comprehensive Empirical Study of Requirements Metrics
inferred← citeshttps://doi.org/10.3844/jcssp.2014.1197.1206openalex-snapshot
COMPARATIVE STUDY OF K-MEANS AND K-MEANS++ CLUSTERING ALGORITHMS ON CRIME DOMAIN
inferred← citeshttps://doi.org/10.4018/ijehmc.20210901.oa4openalex-snapshot
Data Mining-Based Privacy Preservation Technique for Medical Dataset Over Horizontal Partitioned
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.40openalex-snapshot
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4207openalex-snapshot
A bad 2-dimensional instance for k-means++
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2912openalex-snapshot
A tight lower bound instance for k-means++ in constant dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01177openalex-snapshot
Smoothed Analysis of the Art Gallery Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04645openalex-snapshot
Smoothed Analysis of Order Types
inferred← citeshttps://doi.org/10.5555/1283383.1283494openalex-snapshot
k-means++: the advantages of careful seeding
inferred← citeshttps://doi.org/10.5555/1496770.1496886openalex-snapshot
Approximate clustering without the approximation
inferred← citeshttps://doi.org/10.70675/45ab3162z1f59z4314zac77z515f812fa17eopenalex-snapshot
Détection et analyse des évènements rares par vision, dans un contexte urbain ou péri-urbain
inferred← citeshttps://doi.org/10.9790/3021-021041214openalex-snapshot
Visual quality of stego-image using Haar Wavelet
inferred← citeshttps://doi.org/10.9790/3021-021041519openalex-snapshot
Reconstruction of the image objects by SAIF
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.