Efficient Algorithm for ECG Coding Research Papers (original) (raw)
- by Dana Pe'er and +1
- •
- Stochastic Process, Algorithms, Computational Biology, Cell Cycle
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image... more
Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image compression. The proposed algorithm introduces a new method, direct redundancy elimination, to efficiently exploit the two-dimensional redundancy of an image, as well as a novel
Abstract. The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is... more
Abstract. The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best ...
ABSTRACT This paper develops a mathematical model to derive the optimal periodical preventive maintenance (PM) policy for a leased facility with Weibull life-time. Within a lease period, any failures of the facility are rectified by... more
ABSTRACT This paper develops a mathematical model to derive the optimal periodical preventive maintenance (PM) policy for a leased facility with Weibull life-time. Within a lease period, any failures of the facility are rectified by minimal repairs and a penalty may occur to the lessor when the time required to perform a minimal repair exceeds a reasonable time limit. To reduce failures of the facility, additional PM actions are carried out periodically during the lease period. When the life-time distribution of a product is Weibull, the optimal number of PM actions and the corresponding maintenance degrees are derived such that the expected total maintenance cost is minimized. The structural properties of the optimal policy are investigated and an efficient algorithm is provided to search for the optimal policy. Finally, numerical examples are provided to illustrate the features of the proposed model.
The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “k-cores”, proposed in 1983 by Seidman.... more
The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “k-cores”, proposed in 1983 by Seidman. Together with connectivity components, cores are one among few concepts that provide efficient decompositions of large graphs and networks. In this
- by Ivan Rapaport and +1
- •
- Efficient Algorithm for ECG Coding
Complex models generated e.g. with a laser range scanner often consist of several thousand or million triangles. For efficient rendering this high number of primitives has to be reduced. An important property of mesh reduction - or... more
Complex models generated e.g. with a laser range scanner often consist of several thousand or million triangles. For efficient rendering this high number of primitives has to be reduced. An important property of mesh reduction - or simplification - algorithms used for rendering is the control over the introduced geometric error. In general, the better this control is, the slower the simplification algorithm becomes. This is especially a problem for out-of-core simplification, since the processing time quickly reaches several hours for high-quality simplification. In this paper we present a new efficient algorithm to measure the Hausdorff distance between two meshes by sampling the meshes only in regions of high distance. In addition to comparing two arbitrary meshes, this algorithm can also be applied to check the Hausdorff error between the simplified and original meshes during simplification. By using this information to accept or reject a simplification operation, this method all...
The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to... more
The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to image mining, rough sets, computational geometry, and robotics. Designing efficient algorithms for these cover problems was an open problem in the literature.
A coding theory approach to error control in redundant residue number systems (RRNSs) is presented. The concepts of Hamming weight, minimum distance, weight distribution, and error detection and correction capabilities in redundant... more
A coding theory approach to error control in redundant residue number systems (RRNSs) is presented. The concepts of Hamming weight, minimum distance, weight distribution, and error detection and correction capabilities in redundant residue number systems are introduced. The necessary and sufficient conditions for the desired error control capability are derived from the minimum distance point of view. Closed-form expressions are