We describe a lower bound for the rank of any real matrix in which all diagonal entries are
significantly larger in absolute value than all other entries, and discuss several applications …

An explicit study of min-wise independent permutation families, together with their variants---
k-restricted, approximate, etc.---was initiated by Broder, et al [4]. In this paper, we give a …

The seminal work of Broder et al. introduces the minHash algorithm that computes a low-
dimensional sketch of high-dimensional binary data that closely approximates pairwise …

Let Ω be a finite set of cardinality n with a linear order on it and let k be a positive integer. Let
F be a set of permutations on Ω and let Pr F be an arbitrary distribution of probability on F …

A family of permutations of F n= 1, 2,…, n is (ε, k)‐min‐wise independent if for every
nonempty subset X of at most k elements of n, and for any x∈ X, the probability that in a …

On Some Properties of Min-Wise Independent Families and Groups Page 1 On Some
Properties of Min-Wise Independent Families and Groups Victor Bargachev St.Petersburg …

We consider efficient combinatorial constructions, that allow us to partly derandomize
datastructures using the locality sensitive framework of Indyk and Motwani (FOCS'98). In …

In this thesis, we aim to study and evaluate the privacy and scalability properties of
recommender systems using sketching techniques and propose scalable privacy preserving …

(X≥| X|− k),| X|≥ 2k, M (F) has full rank. This complements a well-known theorem of Gottlieb
which found denote the family of subsets of X having at most k many applications in …

In this paper we prove that two local conditions involving the degrees and co-degrees in a
graph can be used to determine whether a given vertex partition is Frieze–Kannan-regular …