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

SingLing Lee

dblp:38/448 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1Computer networks · 1Human-computer interaction and ubiquitous computing · 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
Electronic design automation · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.011992
A 2.5 approximation algorithm for the multi-via assignment problem · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › physical design
routing
0.011992
A 2.5 approximation algorithm for the multi-via assignment problem · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › physical design › routing
via assignment
0.011992
A 2.5 approximation algorithm for the multi-via assignment problem · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992

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

approximation algorithm · 0.0
YearPublicationVenuePosition
2014 Detecting spamming activities in a campus network using incremental learning
JuiHsi Fu, PoChing Lin, SingLing Lee
J. Netw. Comput. Appl.3
2013 Certainty-based active learning for sampling imbalanced datasets
JuiHsi Fu, SingLing Lee
Neurocomputing2
2012 An Aggressive Margin-Based Algorithm for Incremental Learning
JuiHsi Fu, SingLing Lee
PAKDD (1)2
2012 A multi-class SVM classification system based on learning methods from indistinguishable chinese official documents
JuiHsi Fu, SingLing Lee
Expert Syst. Appl.2
2009 A Multi-Strategy Approach to KNN and LARM on Small and Incrementally Induced Prediction Knowledge
JuiHsi Fu, SingLing Lee
ADMA2
2006 Energy-Efficient Data Dissemination in Wireless Sensor Networks
Ji-Han Jiang, KuoHua Kao, SingLing Lee
UIC3
1992 A 2.5 approximation algorithm for the multi-via assignment problem
abstract
The via assignment problem, whose objective is to minimize the number of via columns used, is known to be NP-hard even when each net includes at most three vias. The authors develop efficient approximation algorithms for solving this problem. An algorithm for the case in which the size of each net is bounded by three is presented, and is then extended to the case in which the nets have arbitrary sizes.>
Thang Nguyen Bui, Willie Hsu, SingLing Lee
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3