Wireless networks are a common place nowadays and almost all of the modern devices support wireless communication in some form. These networks differ from more traditional computi...
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...