The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
— In this paper, we present an improved precoding technique which reduces a modulo loss in vector perturbation (VP) with low complexity for the downlink of a multiuser multiple-i...
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...