in this paper, we consider rna structures with arc-length 4 . first, we represent thesestructures as matrix models and zero-one linearprogramming problems. then, we obtain anoptimal solution for this problemusing an implicit enumeration method. the optimal solutioncorresponds toan rna structure with the maximum number of hydrogen bonds.

We propose an iterative algorithm for high-dimensional sparse grid regression with penalty. The algorithm is of additive Schwarz type and is thus parallel. We show that the convergence of the algorithm is better than additive Schwarz and examples demonstrate that convergence is between that of additive Schwarz and multiplicative Schwarz procedures. Similarly, the method shows improved performan...

• A spectral norm bound for reconstruction error for the basic low-rank approximation random sampling algorithm. • A discussion of how similar bounds can be obtained with a variety of random projection algorithms. • A discussion of possible ways to improve the basic additive error bounds. • An iterative algorithm that leads to additive error with much smaller additive scale. This will involve u...

We give an adversary strategy that forces the Perceptron algorithm to make a( kN) mistakes in learning monotone disjunctions over N variables with at most k literals. In contrast, Littlestone’s algorithm Winnow makes at most 0( k log N) mistakes for the same problem. Both algorithms use thresholded linear functions as their hypotheses. However, Winnow does multiplicative updates to its weight v...