• Publications
  • Influence
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants
TLDR
We present two new algorithms, ADT and MDT, for solving order-n Toeplitz systems of linear equations Tz = b in time O(n log2 n). Expand
  • 424
  • 17
  • PDF
On square-free decomposition algorithms
  • D. Yun
  • Computer Science
  • SYMSAC '76
  • 10 August 1976
TLDR
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
  • 108
  • 11
RBCD: redundant binary coded decimal adder
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 andExpand
  • 71
  • 9
The EZ GCD algorithm
  • J. Moses, D. Yun
  • Mathematics, Computer Science
  • ACM Annual Conference
  • 27 August 1973
TLDR
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
  • 83
  • 7
Progressive coding of medical volumetric data using three-dimensional integer wavelet packet transform
TLDR
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
  • 40
  • 3
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
TLDR
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. Expand
  • 29
  • 3
The Hensel Lemma in Algebraic Manipulation
  • D. Yun
  • Mathematics, Computer Science
  • Outstanding Dissertations in the Computer…
  • 1973
TLDR
New and improved algorithms for computation in several fundamental polynomial operations are presented. Expand
  • 53
  • 2
HENSEL MEETS NEWTON — ALGEBRAIC CONSTRUCTIONS IN AN ANALYTIC SETTING
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 casesExpand
  • 12
  • 2
Unifying Graph Matching Problems with a Practical Solution
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 dateExpand
  • 17
  • 2
Intelligent distributed medical image management
TLDR
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
  • 12
  • 1
...
1
2
3
4
5
...