Matches in SemOpenAlex for { <https://semopenalex.org/work/W2050761777> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W2050761777 abstract "We show a worst-case lower bound and a smoothed upper bound on the number of iterations performed by the Iterative Closest Point (ICP) algorithm. First proposed by Besl and McKay, the algorithm is widely used in computational geometry where it is known for its simplicity and its observed speed. The theoretical study of ICP was initiated by Ezra, Sharir and Efrat, who bounded its worst-case running time between Omega(n log n) and O(n^{2}d)^{d}. We substantially tighten this gap by improving the lower bound to Omega(n/d)^{d+1}. To help reconcile this bound with the algorithm?s observed speed, we also show the smoothed complexity of ICP is polynomial, independent of the dimensionality of the data. Using similar methods, we improve the best known smoothed upper bound for the popular k-means method to n^{O(k)}, once again independent of the dimension." @default.
- W2050761777 created "2016-06-24" @default.
- W2050761777 creator A5051574024 @default.
- W2050761777 creator A5070795618 @default.
- W2050761777 date "2006-10-01" @default.
- W2050761777 modified "2023-09-24" @default.
- W2050761777 title "Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method" @default.
- W2050761777 cites W1998739300 @default.
- W2050761777 cites W2019110169 @default.
- W2050761777 cites W2034053794 @default.
- W2050761777 cites W2049981393 @default.
- W2050761777 cites W2066472867 @default.
- W2050761777 cites W2091283109 @default.
- W2050761777 cites W2103544971 @default.
- W2050761777 cites W2119851068 @default.
- W2050761777 cites W2129497745 @default.
- W2050761777 cites W2143856509 @default.
- W2050761777 cites W2144594079 @default.
- W2050761777 cites W2150593711 @default.
- W2050761777 cites W3138330851 @default.
- W2050761777 cites W4236385439 @default.
- W2050761777 doi "https://doi.org/10.1109/focs.2006.79" @default.
- W2050761777 hasPublicationYear "2006" @default.
- W2050761777 type Work @default.
- W2050761777 sameAs 2050761777 @default.
- W2050761777 citedByCount "51" @default.
- W2050761777 countsByYear W20507617772012 @default.
- W2050761777 countsByYear W20507617772013 @default.
- W2050761777 countsByYear W20507617772014 @default.
- W2050761777 countsByYear W20507617772015 @default.
- W2050761777 countsByYear W20507617772017 @default.
- W2050761777 countsByYear W20507617772018 @default.
- W2050761777 countsByYear W20507617772019 @default.
- W2050761777 countsByYear W20507617772020 @default.
- W2050761777 countsByYear W20507617772021 @default.
- W2050761777 countsByYear W20507617772022 @default.
- W2050761777 crossrefType "proceedings-article" @default.
- W2050761777 hasAuthorship W2050761777A5051574024 @default.
- W2050761777 hasAuthorship W2050761777A5070795618 @default.
- W2050761777 hasBestOaLocation W20507617772 @default.
- W2050761777 hasConcept C11413529 @default.
- W2050761777 hasConcept C41008148 @default.
- W2050761777 hasConceptScore W2050761777C11413529 @default.
- W2050761777 hasConceptScore W2050761777C41008148 @default.
- W2050761777 hasLocation W20507617771 @default.
- W2050761777 hasLocation W20507617772 @default.
- W2050761777 hasOpenAccess W2050761777 @default.
- W2050761777 hasPrimaryLocation W20507617771 @default.
- W2050761777 hasRelatedWork W2003465964 @default.
- W2050761777 hasRelatedWork W2333698505 @default.
- W2050761777 hasRelatedWork W2351491280 @default.
- W2050761777 hasRelatedWork W2358668433 @default.
- W2050761777 hasRelatedWork W2371447506 @default.
- W2050761777 hasRelatedWork W2386767533 @default.
- W2050761777 hasRelatedWork W2390279801 @default.
- W2050761777 hasRelatedWork W2748952813 @default.
- W2050761777 hasRelatedWork W2899084033 @default.
- W2050761777 hasRelatedWork W303980170 @default.
- W2050761777 isParatext "false" @default.
- W2050761777 isRetracted "false" @default.
- W2050761777 magId "2050761777" @default.
- W2050761777 workType "article" @default.