We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in t...We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in the context of high- radiation environments. Our experimental evaluation demon- strates that the resulting approach leads to a significantly higher resiliency rate compared to previous results. This is es- pecially the case for large-scale multi-spectral satellite data, which renders the proposed approach well-suited to operate aboard today＇s satellites.展开更多
文摘We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in the context of high- radiation environments. Our experimental evaluation demon- strates that the resulting approach leads to a significantly higher resiliency rate compared to previous results. This is es- pecially the case for large-scale multi-spectral satellite data, which renders the proposed approach well-suited to operate aboard today＇s satellites.
