Resilient k-d trees: k-means in space revisited

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still using only linear space. While the data structure is of independent interest, we demonstrate its use in the context of high-radiation environments. Our experimental evaluation demonstrates that the resulting approach leads to a significantly higher resiliency rate compared to previous results. This is especially the case for large-scale multi-spectral satellite data, which renders the proposed approach well-suited to operate aboard today's satellites.

OriginalsprogEngelsk
TidsskriftFrontiers of Computer Science
Vol/bind6
Udgave nummer2
Sider (fra-til)166-178
Antal sider13
ISSN2095-2228
DOI
StatusUdgivet - 2012
Eksternt udgivetJa

ID: 167918056