Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ealwan Lee
dblp:70/6954 · also Eel-Wan Lee
· DBLP profile ↗
6ranked-venue papers
3as first author
1since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 2 first-author
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.
| Artificial intelligence
1 paper |
Kernel, tree and ensemble methods · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods › nearest neighbor methods
nearest neighbor classifier |
0.0 | 1 | 1998 | Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality · IEEE Trans. Pattern Anal. Mach. Intell. 1998 |
Computational complexity › reduction
computational complexity reduction |
0.0 | 1 | 1998 | Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality · IEEE Trans. Pattern Anal. Mach. Intell. 1998 |
Methods — techniques the papers use, named apart from their topics
triangular inequalities · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Analytical Origin and Mitigation of Third-Order Tones in 4-Phase BLE Backscatter
Jeong-Gyu Cho, Min-Jun Suh, Ju-Won Oh, Ealwan Lee, Kang-Yoon Lee |
ISCAS | 5 |
| 1998 | Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular InequalityabstractWe propose a method of designing a reduced complexity nearest-neighbor classifier with near-minimal computational complexity from a given nearest-neighbor classifier that has high input dimensionality and a large number of class vectors. We applied our method to the classification problem of handwritten numerals in the NIST database. If the complexity of the RCNN classifier is normalized to that of the given classifier, the complexity of the derived classifier is 62 percent, 2 percent higher than that of the optimal classifier. This was found using the exhaustive search. Ealwan Lee, Soo-Ik Chae |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1995 | New Perceptron Model Using Random BitstreamsabstractA very high precision is needed to implement the adder using stochastic computation (or pulse arithmetic) in modern VLSI technology. In this paper we propose a new model of perceptron using random bitstreams that alleviates this problem. Ealwan Lee, Soo-Ik Chae |
Neural Comput. | 1 |
| 1994 | Character Recognition by Neural Networks with Single-Layer Training and Rejection MechanismabstractFor many real applications of pattern classification problems, it is more important to reduce the misclassification rate than to increase the rate of successful classification. In this paper, we propose a single-layer neural network with two rejection mechanisms for character recognition problems, which guarantees a very low misclassification rate. The proposed architecture is a cascaded connection of an SLP network and a simple combinational circuit. Comparing to the MLP network, it yields fast learning and requires a simple hardware architecture. We also introduce a new linearly separable coding scheme for training the SLP network to reduce the misclassification rate. We prepared two databases: one with 135,000 digit patterns and the other with 117,000 letter patterns. Then we applied the proposed method to the classification problem for the databases and results show that the misclassification rate is significantly low with maintaining a high recognition rate.> Joonho Lim, Ealwan Lee, Soo-Ik Chae |
ISCAS | 2 |
| 1994 | A Study on the Stochastic Computation Using the Ratio of One Pulses and Zero PulsesabstractStochastic computation uses pulse streams to represent numbers. In this paper, we have studied the novel method to implement the number system which uses the ratio of the number of one (high) pulses and the number of zero (low) pulses in a pulse stream. With this number system, if we let P be the probability that the pulse is one in a pulse stream, then the number Y we want to deal with is defined as Y=P/(1-P). We have studied the method to implement the basic operations such as an addition, a multiplication and a division using this number system and considered the error characteristics of such operations in stochastic computation. Also we introduce an averaging circuit to reduce the error which is inherent in stochastic computation. According to the study, by using this number system we can implement artificial neural networks and represent the simulation results for the digit recognition problem.> Seung-Jai Min, Ealwan Lee, Soo-Ik Chae |
ISCAS | 2 |
| 1993 | Modified Probabilistic RAM Archticture for VLSI Implementation of a Backpropagation Learning Algorithm
Ealwan Lee, Jae-Hee Won, Soo-Ik Chae |
ISCAS | 1 |