Wing Ning Li

According to our database1, Wing Ning Li authored at least 33 papers between 1989 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Searching for Monochromatic-Square-Free Ramsey Grid Colorings via SAT Solvers.
Proceedings of the International Conference on Information Science and Applications, 2013

Identification of Consensus Glycosaminoglycan Binding Strings in Proteins.
Proceedings of the International Conference on Information Science and Applications, 2013

Data File Layout Inference Using Content-Based Oracles.
Proceedings of the 16th IEEE International Conference on Computational Science and Engineering, 2013

Automatic Composition of ETL Workflows from Business Intents.
Proceedings of the 16th IEEE International Conference on Computational Science and Engineering, 2013

2012
Parallel search for Ramsey grid colorings.
Proceedings of the 50th Annual Southeast Regional Conference, 2012

2008
Automating File Schema Recognition Via Content-Based Oracles.
Proceedings of the 2008 International Conference on Information & Knowledge Engineering, 2008

Towards a Domain-Specific Modeling Language for Customer Data Integration Workflow.
Proceedings of the Workshops at the Grid and Pervasive Computing Conference, 2008

2007
Workflow Planning on a Grid.
IEEE Internet Comput., 2007

Distributed Data Structures and Algorithms for Disjoint Sets in Computing Connected Components of Huge Network.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2006
Efficient Algorithms for Grouping Data to Improve Data Quality.
Proceedings of the 2006 International Conference on Information & Knowledge Engineering, 2006

Data Processing Workflow Automation in Grid Architecture.
Proceedings of the Grid and Cooperative Computing Workshops, 2006

2005
On unit task linear-nonlinear two-cluster scheduling problem.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2004
An Exact Scheduling Algorithm for Two, Linear-Nonlinear Clusters, With A Common Communication Delay.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Parallel Thinning on Rmesh.
Proceedings of the 19th International Conference on Computers and Their Applications, 2004

2003
PISMOL: A Software Tool for Protein Interactive Site Prediction Model Development.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2003

A Novel Computational Model for Predicting Interactive Sites of Proteins.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2003

Convergent transfer subgraph characterization and computation.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2000
On the Thread Scheduling Problem.
J. Univers. Comput. Sci., 2000

1998
Feedforward backpropagation artificial neural networks on reconfigurable meshes.
Future Gener. Comput. Syst., 1998

Towards a hierarchical design and integration of programming projects.
Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

Artificial Neural Networks on Reconfigurable Meshes.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997
Two-segmented Channel Routing Is Strong NP-complete.
Discret. Appl. Math., 1997

1996
An object-oriented design and implementation of reusable graph objects with C++: a case study.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995
The complexity of segmented channel routing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

Computing the configuration space for a convex robot on hypercube multiprocessors.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization.
Proceedings of the 1995 ACM symposium on applied computing, 1995

Optimal hypercube algorithms for robot configuration space computation.
Proceedings of the 1995 ACM symposium on applied computing, 1995

1994
On the equivalence of pull-up transistor assignment in PLA folding and distribution graph.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

1993
On the circuit implementation problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993

Strongly NP-Hard Discrete Gate Sizing Problems.
Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

1990
Pull up transistor folding.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Long and short covering edges in combination logic circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

1989
On path selection in combinational logic circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989


  Loading...