In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided recombination systems, which model this gene rearrangement, can be used as problem solvers. Specifically, we prove that these systems can uniformly solve SAT in time O(n ·m) for a boolean formula of m clauses over n vari...

Measuring surface fluxes using the surface renewal (SR) method requires a set of programmatic algorithms for tabulation, algebraic calculation, and quality control. Field experiments were conducted over a variety of surface conditions to determine the shortest valid time averaging period for the SR method. Because the SR method utilizes high frequency (20 Hz+) measurements, some steps in the fl...

The main purpose of this study is to evaluate the computational efficiency of optimized shortest path algorithms. Our study establishes the relative order of the shortest path algorithms with respect to their known computational efficiencies is not significantly modified when the algorithms are adequately coded. An important contribution of this study is the inclusion of the re-distributive hea...

Computing posterior modes (e.g., maximum likelihood estimates) for models involving latent variables or missing data often involves complicated optimization procedures. By splitting this task into two simpler parts, however, EMtype algorithms often offer a simple solution. Although this approach has proven useful, in some settings even these simpler tasks are challenging. In particular, computa...

After David’s pioneering contribution, many authors have claimed that the prevalence of the QWERTY keyboard layout is an instance of lock-in on an inferior technology, because the Dvorak Simplified Keyboard is more efficient. But other authors, notably Liebowitz and Margolis, have disputed this claim. Here we proceed to examine the relative efficiency of the two layouts by computational means. ...

Based on rapid upsurge in the demand and usage of electronic media devices such as tablets, smart phones, laptops, personal computers, etc. and its different display specifications including the size and shapes, image retargeting became one of the key components of communication technology and internet. The existing techniques in image resizing cannot save the most valuable information of image...

In this section, we present the proof of Theorem 1. We assume that active search policies have access to the correct marginal probabilities f(x;D) = Pr(y = 1 | x,D), for any given point x and labeled data D, which may include “ficticious” observations. Further, the computational cost will be analyzed as the number of calls to f , i.e., f(x;D) has unit cost. Note that the optimal policy operates...

We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with a preference relation such that the observed choices are Pareto efficient. We differentiate between t...

In this paper we propose a fast reconstruction method for a progressive subband-decomposed signal coding system. It is shown that unlike the normal approach which contains a xed computational complexity, the computational complexity of the proposed approach is proportional to the number of reened coeecients. Therefore, using the proposed approach in image coding applications, we can update the ...

Feature Selection is important to improve learning performance, reduce computational complexity and decrease required storage. There are multiple methods for feature selection, with varying impact and computational cost. Therefore, choosing the right method for a given data set is important. In this paper, we analyze the advantages of metalearning for feature selection employment. This issue is...