This paper addresses the nearest neighbor search problem under inner product similarity and introduces a compact code-based approach. The idea is to approximate a vector using the composition of several elements selected from a source dictionary and to represent this vector by a short code composed of the indices of the selected elements. The inner product between a query vector and a database ...

Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. The concept of deniability has later demonstrated useful and powerful in many other contexts, such as leakage resilience, adaptive security of protocols,...

Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits aredescribed via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that preserve them. Suchstates are obtained by stabilizer circuits (consisting of CNOT, Hadamard and Phase only) and can be represented compactly onconventio...

We discuss the notions of strong convergence and weak convergence in n-inner product spaces and study the relation between them. In particular, we show that the strong convergence implies the weak convergence and disprove the converse through a counter-example, by invoking an analogue of Parseval’s identity in n-inner product spaces.

We propose a quantization based approach for fast approximate Maximum Inner Product Search (MIPS). Each database vector is quantized in multiple subspaces via a set of codebooks, learned directly by minimizing the inner product quantization error. Then, the inner product of a query to a database vector is approximated as the sum of inner products with the subspace quantizers. Different from rec...

We present a hardware architecture for parallel innerproduct array computation in very high dimensional feature spaces, towards a general-purpose kernel-based classiJer and function approximator: The architecture is internally analog with fully digital interface. On-chip analog jinegrain parallel processing yields real-time throughput levels for high-dimensional (over 1,000per chip) classificat...

and Applied Analysis 3 for all x1, . . . , x2n ∈ V if and only if the odd mapping f : V → W is Cauchy additive, that is, f ( x y ) f x f ( y ) , 2.2 for all x, y ∈ V . Proof. Assume that f : V → W satisfies 2.1 . Letting x1 · · · xn x, xn 1 · · · x2n y in 2.1 , we get nf ( x − x y 2 ) nf ( y − x y 2 ) nf x nf ( y ) − 2nf ( x y 2 ) , 2.3 for all x, y ∈ V . Since f : V → W is odd, 0 nf x nf ( y )...