We present a new locality sensitive hashing (LSH) algorithm for c-approximate nearest neighbor search in `p with 1 < p < 2. For a database of n points in `p, we achieve O(dn) query time and O(dn +… (More)

Abstract. Say that a graph G is representable in R if there is a map f from its vertex set into the Euclidean space R such that ‖f(x) − f(x′)‖ = ‖f(y)−f(y′)‖ iff {x, x′} and {y, y′} are both edges or… (More)

Drought occurs throughout the world, affecting people more than any other major natural hazards. An important requirement for mitigating the impact of drought is an effective method of forecasting… (More)