We analyze how fast we can solve general systems of multivariate equations of various low degrees over F2; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive search technique, our improved approach is more efficient both asymptotically and practically. We implemented several optimized vers...

The use of space filling curves to encode image input blocks in vector quantization (VQ) is proposed. It is based on computing a group of Peano scannings of selected feature vectors for each codeword in the codebook. An ordered list of the Peano scannings and their link to the codebook is stored. Coding is conducted by restricting the search to two windows of codewords with the closest Peano sc...

A recently proposed product quantization method is efficient for large scale approximate nearest neighbor search, however, its performance on unstructured vectors is limited. This paper introduces residual vector quantization based approaches that are appropriate for unstructured vectors. Database vectors are quantized by residual vector quantizer. The reproductions are represented by short cod...

We aim to understand how the customer relationship portfolio of a subcontractor changes as the subcontractor evolves its capabilities. While this line of research is under-investigated in the literature on business relationships, we believe that it is a crucial aspect to gaining new insights about how competitive advantages are developed in industrial markets. To address this research question ...

In this paper we consider a repeated interaction between a manufacturing rm and a subcontractor. The moral hazard problem present in this relationship is aggravated by the fact that both parties do not have perfect knowledge about the base cost level of the project carried out by the subcontractor but only have identical a priori beliefs. Short term and long term contracts are compared in a two...

We present a criterion to generate audible summaries of music recordings that optimally explain a given track with mutually disjoint segments of itself. We represent audio as sequences of beat-synchronous harmonic features and use an exhaustive search to identify the best summary. To demonstrate the merit of this approach, we evaluate the criterion and show consistency across a collection of mu...

In this paper, we propose a recursive method for finding Costas arrays that relies on a particular formation of Costas arrays from similar patterns of smaller size. By using such an idea, the proposed algorithm is able to dramatically reduce the computational burden (when compared to the exhaustive search), and at the same time, still can find all possible Costas arrays of given size. Similar t...