Computational geometry: an introduction
Computational geometry: an introduction
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Synthesizing Robust Data Structures-An Introduction
IEEE Transactions on Computers
Introduction to algorithms
Vector quantization and signal compression
Vector quantization and signal compression
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Concurrent Error Detection Using Watchdog Processors-A Survey
IEEE Transactions on Computers
Certification Trails and Software Design for Testability
Proceedings of the IEEE International Test Conference on Designing, Testing, and Diagnostics - Join Them
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Redundancy in Data Structures: Improving Software Fault Tolerance
IEEE Transactions on Software Engineering
Redundancy in Data Structures: Some Theoretical Results
IEEE Transactions on Software Engineering
The N-Version Approach to Fault-Tolerant Software
IEEE Transactions on Software Engineering
Samurai: protecting critical data in unsafe languages
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Checking value-sensitive data structures in sublinear space
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Computer Science Review
| Hi-index | 0.00 |
Abstract: We present several examples of programs which efficiently monitor the answers from queries performed on data structures to determine if any errors are present. Our paper includes the first efficient on-line error monitor for a data structure designed to perform nearest neighbor queries. Applications of nearest neighbor queries are extensive and include learning, categorization, speech processing, and data compression. Our paper also discusses on-line error monitors for priority queues and splittable priority queues. On-line error monitors immediately detect if an error is present in the answer to a query. An error monitor which is not on-line may delay the time of detection until a later query is being processed which may allow the error to propagate or may cause irreversible state changes. On-line monitors can allow a more rapid and accurate response to an error.