In this paper, we give three different (including revamped versions of Horowitz's and Musser's) algorithms for computing SQFR decomposition of polynomials in R[x].Expand

The major advantage of the binary coded decimal (BCD) system is in providing rapid binary-decimal conversion. The shortcoming of the BCD system is that BCD arithmetic operations are often slow and… Expand

This paper presents a preliminary report on a new algorithm for computing the Greatest Common Divisor (GCD) of two multivariate polynomials over the integers.Expand

We examine progressive lossy to lossless compression of medical volumetric data using three-dimensional (3D) integer wavelet packet transforms and set partitioning in hierarchical trees (SPIHT).Expand

Publisher Summary
Before the advent of Berlekamp's algorithm for factoring polynomials over finite fields, the activity of factoring a polynomial over the integers was usually restricted to cases… Expand

Recent advances in computer vision, information ret rieval, and molecular biology amply demonstrate the value a nd importance of graph matching. However, graph match ing algorithms developed to date… Expand

This paper describes the database system requirements, identifies technological building blocks for meeting the requirements, and presents a system architecture for our target image database system, MISSION-DBS, which has been designed to fulfill the goals of Project MISSION (medical imaging support via satellite integrated optical network).Expand