This article is a survey of some recent developments which concern two multilevel approximation schemes: (a) Nonlinear n-term approximation from piecewise polynomials generated by anisotropic dyadic partitions in R, and (b) Nonlinear n-term approximation from sequences of hierarchical spline bases generated by multilevel triangulations in R. A construction is given of sequences of bases consist...

In this paper a new fast partitioning algorithm able to find either a globally optimal partition or a locally optimal partition of the set A ⊂ R close to the global one is proposed. The performance of the algorithm in terms of CPU time shows significant improvement in comparison with other incremental algorithms. Since optimal partitions with 2, 3, . . . clusters are determined successively in ...

The rapidly increasing number of vehicles in roads leads to numerous problems in metropolitan areas. Several researchers show that carpooling can be an efficient solution to relieve the pressures caused by large numbers of cars. Previous research on carpools introduces several additional constraints to simplify the problem, but some of them are unreasonable in reality. In this paper, we focus o...

Many classes of functional RNA molcules are characterized by highly conserved secondary structures but little detectable sequence similarity. Reliable multiple alignments can therefore be constructed only when the shared structural features are taken into account. Sankoff’s algorithm can be used to construct such structure-based alignments of RNA sequences in polynomial time. Here we extend the...

Frequent pattern mining is always an interesting research area in data mining to mine several hidden and previously unknown pattern. The better algorithms are always introduced and become the topic of interest. Association rule mining is an implication of the form X implies Y, where X is a set of antecedent items and Y is the consequent items. There are several techniques have been introduced i...

Stochastic discrete resource allocation problems are difficult to solve. In this paper, we propose a new algorithm designed specifically to tackle them. The algorithm combines with the Nested Partitions method, the Ordinal Optimization techniques, and an efficient simulation control technique. The resulting hybrid algorithm retains the global perspective of the Nested Partitions method and the ...

This research presents an algorithm that allows transaction processing to proceed during site failures and network partitioning while ensuring the consistency of replicated data. Our algorithm can be used together with various voting schemes which provide varying degrees of data availability. Different voting schemes may be used simultaneously for different groups,'of data. Our algorithm contai...

A horizontal-vertical partition scheme modification for fractal and hybrid image compression and an algorithm of its optimization are proposed. The proposed partition scheme efficiency analysis for two test images is carried out. The advantages of the proposed partition scheme in comparison to conventional horizontal vertical partition scheme and to Quadtree partition scheme are shown.