Related papers: Independence of Tabulation-Based Hash Classes
With the rapid growth of image and video data on the web, hashing has been extensively studied for image or video search in recent years. Benefit from recent advances in deep learning, deep hashing methods have achieved promising results…
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a parallel algorithm. We show that these…
We present the design of a structured search engine which returns a multi-column table in response to a query consisting of keywords describing each of its columns. We answer such queries by exploiting the millions of tables on the Web…
Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how "random" a hash function or a random number generator is, is its…
There is a natural bijection between standard immaculate tableaux of composition shape $\alpha \vDash n$ and length $\ell(\alpha) = k$ and the $ \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} $ set-partitions of $\{ 1, 2,…
Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as…
Catalano and Fiore propose a scheme to transform a linearly-homomorphic encryption into a homomorphic encryption scheme capable of evaluating quadratic computations on ciphertexts. Their scheme is based on the linearly-homomorphic…
In the present paper we study the derived Hall algebra for the bounded derived category of the nilpotent representations of a tame quiver over a finite field. We show that for any three given objects in the bounded derived category, the…
In this paper we introduce a novel hash learning framework that has two main distinguishing features, when compared to past approaches. First, it utilizes codewords in the Hamming space as ancillary means to accomplish its hash learning…
We show for bicommutative graded connected Hopf algebras that a certain distributive (Laplace) subgroup of the convolution monoid of 2-cochains parameterizes certain well behaved Hopf algebra deformations. Using the Laplace group, or its…
We introduce and study modular truncations of the Ackermann function viewed as self-maps on finite rings. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural…
We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ…
This paper presents a simple yet effective supervised deep hash approach that constructs binary hash codes from labeled data for large-scale image search. We assume that the semantic labels are governed by several latent attributes with…
The R programming language is widely used in large-scale data analyses. It contains especially rich built-in support for dealing with vectors, arrays, and matrices. These operations feature prominently in the applications that form R's…
The article continues the work on the description of integrable nonlinear chains with three independent variables of the following form $u^j_{n+1,x}=u^j_{n,x}+f(u^{j+1}_{n}, u^{j}_n,u^j_{n+1 },u^{j-1}_{n+1})$ by the presence of a hierarchy…
We propose a novel architecture for graph-based dependency parsing that explicitly constructs vectors, from which both arcs and labels are scored. Our method addresses key limitations of the standard two-pipeline approach by unifying arc…
Deep supervised hashing has emerged as an influential solution to large-scale semantic image retrieval problems in computer vision. In the light of recent progress, convolutional neural network based hashing methods typically seek pair-wise…
Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for…
Recent works have shown the power of linear indexed type systems for enforcing complex program properties. These systems combine linear types with a language of type-level indices, allowing more fine-grained analyses. Such systems have been…
We present an unsupervised method for aggregating anomalies in tabular datasets by identifying the top-k tabular data quality insights. Each insight consists of a set of anomalous attributes and the corresponding subsets of records that…