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

Research output: Contribution to journalJournal articleResearchpeer-review

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.

Original languageEnglish
JournalFrontiers of Computer Science
Volume6
Issue number2
Pages (from-to)166-178
Number of pages13
ISSN2095-2228
DOIs
Publication statusPublished - 2012
Externally publishedYes

    Research areas

  • clustering, data mining, resilient algorithms and data structures

ID: 167918056