Learn More
Given an N-point sequence, finding its k largest components in the frequency domain is a problem of great interest. This problem, which is usually referred to as a sparse Fourier Transform, was recently brought back on stage by a newly proposed algorithm called the sFFT. In this paper, we present a parallel implementation of sFFT on both multi-core CPUs and(More)
We present a randomized algorithm for reconstructing directed rooted trees of n nodes and node degree at most d, by asking at most O(dn log 2 n) path queries. Each path query takes as input an origin node and a target node, and answers whether there is a directed path from the origin to the target. Our algorithm is only a factor of O(d log n) from the(More)
Mitigating human errors is a priority in the design of complex systems, especially through the use of body area networks. This paper describes early developments of a dynamic data driven platform to predict operator error and trigger appropriate intervention before the error happens. Using a two-stage process, data was collected using several sensors (e.g.,(More)
  • 1