The most popular algorithms for object detection require the use of exhaustive spatial and scale search procedures. In such approaches, an object is defined by means of local features. fu this paper we show that including contextual information in object detection procedures provides an efficient way of cutting down the need for exhaustive search. We present results with real images showing tha...

The authors of Rijndael [3] describe the \Square attack" as the best known attack against the block cipher Rijndael. If the key size is 128 bit, the attack is faster than exhaustive search for up to six rounds. We extend the Square attack on Rijndael variants with larger keys of 192 bit and 256 bit. Our attacks exploit minor weaknesses of the Rijndael key schedule and are faster than exhaustive...

An n-bit coil is a sequence of length n binary strings which corresponds to an induced cycle in the n-dimension hypercube. Coils have a variety of applications and usually the longer the coil the more useful it is in the application. The longest possible coils for n ≤ 7 were found by exhaustive search. Several heuristic based computational techniques including stochastic hill-climbing technique...

The paper presents the research aimed to find the way for efficient monitoring and control of subcontractor performance in large construction projects. As a result the procedure for recording and processing the nonconformities is proposed. Procedure consists of the following stages: the identification of nonconformity (defect, work performed is at variance with project, the requirements of work...

Exhaustive key search is the simplest attack against a cryptosystem, but it is sometimes the most realistic. This is specially true for carefully designed block ciphers for which advanced cryptanalysis (e.g. linear, differential) is not applicable. In this paper, we first update the cost of an exhaustive key search of the Data Encryption Standard (DES) using Field Programmable Gate Arrays (FPGA...

Screening is an important task to convert a continuous-tone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorithm for cluster-dot screening using a local exhaustive search. Our new algorithm generates 2-cluster, 3-cluster, and 4cluster binary images, in which all dots have at least 2, 3, and 4 pixels, respectively. The key ide...

Many existing approaches used iterative-reenement techniques for 3D registration of partially-overlapping range images. The major drawback of these approaches is that they require a good initial estimate to guarantee that the correct solution can always be found. In this paper, we propose a new method, the RANSAC-based DARCES (data-aligned rigidity-constrained exhaustive search) method, which c...

Similarity searching in protein sequence databases is a standard technique for biologists dealing with a newly sequenced protein. Exhaustive search in such databases is prohibitive because of the large sizes of these database and because pairwise comparisons are slow. Heuristic techniques, such as FASTA and BLAST, are useful because they are fast and accurate, though it has been shown that exha...

How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NPhard. Our proposal obtains the optimal solution by running a...

Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus are two representatives. In general, only exhaustive search can bring about the optimal subset. However, under certain conditions, exhaustive search can be avoided without sacri cing the subset's optimality. One such condit...