We consider the k-payment problem: given a total budget of N units, represent this budget as a set of coins, so that any k exact payment requests of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k The actual payments are made on-line, namely without knowing all payment requests in advance. Our motivation ...

This paper shows simple dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. For a basic version of the problem (i.e., maximizing the number of base pairs), this paper presents an O(n) time exact algorithm and an O(n4− ) time approximation algorithm. The latter one outputs, for most RNA sequences, a secondary structure in which the number of base pairs is at l...

Let Fn q be a vector space of dimension n over the finite field Fq . A q-analog of a Steiner system (also known as a q-Steiner system), denoted Sq(t,k,n), is a set S of k-dimensional subspaces of Fn q such that each t-dimensional subspace of Fn q is contained in exactly one element of S . Presently, q-Steiner systems are known only for t = 1, and in the trivial cases t = k and k= n. In this pap...

Chain event graphs are a model family particularly suited for asymmetric causal discrete domains. This paper describes a dynamic programming algorithm for exact learning of chain event graphs from multivariate data. While the exact algorithm is slow, it allows reasonably fast approximations and provides clues for implementing more scalable heuristic algorithms.

We report a new optimal resolution for the statistical stratification problem under proportional sampling allocation among strata. Consider a finite population of N units, a random sample of n units selected from this population and a number L of strata. Thus, we have to define which units belong to each stratum so as to minimize the variance of a total estimator for one desired variable of int...

We give a comprehensive theoretical treatment for calculating the viewshed of a given point, present an analytical solution to the viewshed problem and a new algorithm for finding the viewshed on a triangulated terrain. We implement our algorithm on a real terrain. Some algorithms make use of the horizon information of the terrain to calculate viewshed. The vertices of the horizon of the terrai...

We show an alternative way of represent­ ing a Bayesian belief network by sensitivities and probability distributions. This represen­ tation is equivalent to the traditional rep­ resentation by conditional probabilities, but makes dependencies between nodes apparent and intuitively easy to understand. We also propose a QR matrix representation for the sensitivities and/ or conditional probabili...

The generalized list T -coloring is a common generalization of many graph coloring models, including classical coloring, L(p, q)-labeling, channel assignment and T -coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for such a labeling of vertices of the input graph with natural numbers, in which every vert...