We present the results of the USHEF and USAAR-USHEF submissions for the WMT15 shared task on document-level quality estimation. The USHEF submissions explored several document and discourse-aware features. The USAARUSHEF submissions used an exhaustive search approach to select the best features from the official baseline. Results show slight improvements over the baseline with the use of discou...

.Various methods have been proposed and developed for video shot boundary detection. Commonly used method for shot detection is Block Matching Algorithm. It is the most commonly used motion estimation technique. Various block matching algorithms have been proposed for shot detection such as Exhaustive Search, Three Step Search, New Three Step Search, Simple and Efficient Search, Four Step Searc...

Submit Manuscript | http://medcraveonline.com Abbreviations: EPZS: Enhanced Predictive Zonal Search; ME: Motion Estimation; FS: Full Search; MC: Motion Compensation; BMA: Block Matching Algorithm; SA: Search Area; SAD: Sum of Absolute Difference; AVC: Advanced Video Coder; DS: Diamond Search; ES: Exhaustive Search; MVFAST: Motion Vector Field Adaptive Search Technique; PMVFAST: Predictive Motio...

MOTIVATION Prediction of protein-protein complexes from the coordinates of their unbound components usually starts by generating many potential predictions from a rigid-body 6D search followed by a second stage that aims to refine such predictions. Here, we present and evaluate a new method to effectively address the complexity and sampling requirements of the initial exhaustive search. In this...

Armed with super computational ability, the most efficient attack on symmetric-key systems is an exhaustive key search. A novel encryption method with infinite key space is presented by modifying traditional book cipher. Infinite key space means the unbounded entropy of the key space, which can frustrate any exhaustive key search. Moreover, this book cipher is immune from frequency analysis. Ex...

We present the results of the USHEF and USAAR-USHEF submissions for the WMT15 shared task on document-level quality estimation. The USHEF submissions explored several document and discourse-aware features. The USAARUSHEF submissions used an exhaustive search approach to select the best features from the official baseline. Results show slight improvements over the baseline with the use of discou...

We present two symmetries of the generic multidimensional periodic Costas arrays over elementary abelian groups. Through exhaustive search, we observe that these two symmetries generate the Costas arrays for the enumeration up to p = 5 (5x5x24). Following the results, we conjecture that these generators characterize the group of symmetries of the generic (m+1)-dimensional periodic Costas arrays...

It is of interest in various contexts to nd approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization , it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feasi...

This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implemented to guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly se...

In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To illustrate the algorithm, it was implemented on graphics cards using CUDA, a programming framework for NVIDIA graphics cards. We gain large speedups compared to previous serial CPU implementations. Our implementation ...