Before revision:  In this paper, we propose FRESH, a novel approximate solution to find similar curves under the continuous Fr\'echet distance. FRESH leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning step based on a cascade of curve simplifications.
After revision:  In this paper, we propose FRESH, an approximate and randomized approach for r-range search, that leverages on a locality sensitive hashing scheme for detecting candidate near neighbors of the query curve, and on a subsequent pruning step based on a cascade of curve simplifications.