Exact Match in Masked Sorting Block-level Duplication ?

Abstract

To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Charikar (2002) proposed a fast approximate method for finding neighbor pairs of strings by sorting and scanning with a small window. This method, which we shall call “single sorting”, is applied to locality… (More)

10 Figures and Tables

Topics

  • Presentations referencing similar topics