Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ki-Ja Lee

dblp:66/6037 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 50% High-performance computing · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
computer arithmetic
0.011997
A Residue Arithmetic Extension for Reliable Scientific Computation · IEEE Trans. Computers 1997
High-performance computing
scientific computing systems
0.011997
A Residue Arithmetic Extension for Reliable Scientific Computation · IEEE Trans. Computers 1997

Methods — techniques the papers use, named apart from their topics

interval arithmetic · 0.0
YearPublicationVenuePosition
1997 A Residue Arithmetic Extension for Reliable Scientific Computation
abstract
A reliable scientific computation approach, substantially different from the known ones, based on Residue Number System (RNS) floating-point arithmetic is described. In the approach, the real number is represented by an expression which consists of two parts, the approximate part and the interval error part. The approximate part, represented by an RNS floating-point number, shows an approximate value for the real number. The interval error value, represented by two RNS floating-point numbers, shows the left and the right limit of an interval containing the error. In parallel to the result of operation, the rounding error induced by that operation is determined and then summed up in each operation. When a series of operations is completed, the range of existence for the result can be determined from the result of the computation and the sum of interval errors. For the illustration of the proposed method, some examples are also given, which are said to be difficult to find exact solution in the usual floating-point calculation.
Eisuke Kinoshita, Ki-Ja Lee
IEEE Trans. Computers2