Francis Y. L. Chin

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites.

[BibT_eX]

[DOI]

Henry C. M. Leung

Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

Voting algorithms for discovering long motifs.

[BibT_eX]

[DOI]

Henry C. M. Leung

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004

Improved competitive algorithms for online scheduling with partial job values.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Approximate and dynamic rank aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A simple algorithm for the constrained sequence problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

Finding motifs for insufficient number of sequences with strong binding to transcription facto.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Progress on Maximum Weight Triangulation.

[BibT_eX]

[DOI]

Jianbo Qian

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Erratum to: "Efficient algorithm for transversal of disjoint convex polygons".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Transversal of disjoint convex polygons.

[BibT_eX]

[DOI]

Hong Shen

Inf. Process. Lett., 2003

Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?

[BibT_eX]

[DOI]

Algorithmica, 2003

Escaping a Grid by Edge-Disjoint Paths.

[BibT_eX]

[DOI]

Hing-Fung Ting

Algorithmica, 2003

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002

Efficient algorithm for transversal of disjoint convex polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Algorithms and Complexity for Tetrahedralization Detections.

[BibT_eX]

[DOI]

Boting Yang

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Experiences in Running a Flexible, Web-Based, and Self-Paced Course.

[BibT_eX]

[DOI]

C. K. M. Wong

V. Mak

Proceedings of the Advances in Web-Based Learning, First International Conference, 2002

2001

Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Approximation for minimum triangulation of convex polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Mining Confident Rules Without Support Requirement.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Triangulations without minimum-weight drawing.

[BibT_eX]

[DOI]

Boting Yang

Inf. Process. Lett., 2000

Selection and Multiselection on Multi-Dimensional Meshes.

[BibT_eX]

Hong Shen

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks.

[BibT_eX]

[DOI]

Hong Shen

Yi Pan

IEEE Trans. Parallel Distributed Syst., 1999

Maximum Weight Triangulation and Graph Drawing.

[BibT_eX]

[DOI]

Bo-Ting Yang

Inf. Process. Lett., 1999

Finding the Medial Axis of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

Jack Snoeyink

Discret. Comput. Geom., 1999

A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.

[BibT_eX]

[DOI]

Der-Tsai Lee

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

A Faster Algorithm for Finding Disjoint Paths in Grids.

[BibT_eX]

[DOI]

Hing-Fung Ting

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Maximum Stabbing Line in 2D Plane.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

A Polynomial Time Solution for Labeling a Rectlinear Map.

[BibT_eX]

[DOI]

Binhai Zhu

Inf. Process. Lett., 1998

Maximum Weight Triangulation and Its Application on Graph Drawing.

[BibT_eX]

[DOI]

Bo-Ting Yang

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Interpolating Polyhedral Models Using Intrinsic Shape Parameters.

[BibT_eX]

[DOI]

Yue Man Sun

Wenping Wang

Comput. Animat. Virtual Worlds, 1997

A New Subgraph of Minimum Weight Triangulations.

[BibT_eX]

[DOI]

Yin-Feng Xu

J. Comb. Optim., 1997

Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Algorithms for Finding Optimal Disjoint Paths Around a Rectangle.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

A Polynomial Time Solution for Labeling a Rectilinear Map.

[BibT_eX]

[DOI]

Binhai Zhu

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Optimal Multiresolution Polygonal Approximation.

[BibT_eX]

[DOI]

K. W. Chan

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Hierarchical motion estimation based on visual patterns for video coding.

[BibT_eX]

[DOI]

Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

1995

Optimal Simulation of Full Binary Trees on Faulty Hypercubes.

[BibT_eX]

[DOI]

Bethany Man-Yee Chan

IEEE Trans. Parallel Distributed Syst., 1995

Improved and Optimal Adaptive Hierarchical Vector Quantization for Image Coding and Indexing.

[BibT_eX]

Sheng Zhong

Proceedings of the International Workshop on Multi-Media Database Management Systems, 1995

A microprocessor-based optical character recognition check reader.

[BibT_eX]

[DOI]

Francis Wu

Proceedings of the Third International Conference on Document Analysis and Recognition, 1995

Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences.

[BibT_eX]

[DOI]

Algorithmica, 1994

On Greedy Tetrahedralization of Points in 3D.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Optimal Resilient Distributed Algorithms for Ring Election.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Schedulers for Larger Classes of Pinwheel Instances.

[BibT_eX]

[DOI]

Algorithmica, 1993

Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1992

General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Optimal Generating Kernels for Image Pyramids by Piecewise Fitting.

[BibT_eX]

[DOI]

Andrew Choi

Yuhua Luo

IEEE Trans. Pattern Anal. Mach. Intell., 1992

1991

Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

1990

Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Packing Squares into a Square.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1990

1989

An Optimal EREW Parallel Algorithm for Parenthesis Matching.

[BibT_eX]

Wai Wan Tsang

Tak Wah Lam

Proceedings of the International Conference on Parallel Processing, 1989

1988

On Embedding Rectangular Grids in Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1988

Distributed Election in Complete Networks.

[BibT_eX]

[DOI]

Distributed Comput., 1988

1987

An Information-Based Model for Failure-Handling in Distributed Database Systems.

[BibT_eX]

[DOI]

K. V. S. Ramarao

IEEE Trans. Software Eng., 1987

An Improved Algorithm for Finding the Median Distributively.

[BibT_eX]

[DOI]

Algorithmica, 1987

Optimal Resilient Ring Election Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1987

1986

Optimal Termination Protocols for Network Partitioning.

[BibT_eX]

[DOI]

K. V. S. Ramarao

SIAM J. Comput., 1986

Security problems on inference control for SUM, MAX, and MIN queries.

[BibT_eX]

[DOI]

J. ACM, 1986

1985

A unifying approach for a class of problems in the computational geometry of polygons.

[BibT_eX]

[DOI]

Jeffrey Sampson

Vis. Comput., 1985

A Near-optimal Algorithm for Finding the Median Distributively.

[BibT_eX]

Proceedings of the 5th International Conference on Distributed Computing Systems, 1985

An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Efficient Inference Control for Range SUM Queries.

[BibT_eX]

[DOI]

Peter Kossowski

S. C. Loh

Theor. Comput. Sci., 1984

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems.

[BibT_eX]

[DOI]

Yung H. Tsin

SIAM J. Comput., 1984

Minimum Vertex Distance Between Separable Convex Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1983

A General Program Scheme for Finding Bridges.

[BibT_eX]

[DOI]

Yung H. Tsin

Inf. Process. Lett., 1983

Optimal Termination Prococols for Network Partitioning.

[BibT_eX]

[DOI]

K. V. S. Ramarao

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982

Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1982

Auditing and Inference Control in Statistical Databases.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1982

Scheduling the Open Shop to Minimize Mean Flow Time.

[BibT_eX]

[DOI]

James O. Achugbue

SIAM J. Comput., 1982

Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems.

[BibT_eX]

[DOI]

James O. Achugbue

Math. Oper. Res., 1982

Efficient Parallel Algorithms for Some Graph Problems.

[BibT_eX]

[DOI]

John Lam

I-Ngo Chen

Commun. ACM, 1982

1981

Statistical Database Design.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1981

On J-maximal and J-minimal Flow-Shop Schedules.

[BibT_eX]

[DOI]

Long-Lieh Tsai

J. ACM, 1981

Bounds on Schedules for Independent Tasks with Similar Execution Times.

[BibT_eX]

[DOI]

James O. Achugbue

J. ACM, 1981

Efficient Inference Control for Range SUM Queries on Statistical Data Bases.

[BibT_eX]

[DOI]

Peter Kossowski

Proceedings of the First LBL Workshop on Statistical Database Management, 1981

Auditing for secure statistical databases.

[BibT_eX]

[DOI]

Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980

Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops).

[BibT_eX]

[DOI]

K. Samson Fok

IEEE Trans. Computers, 1980

1978

Security in Statistical Databases for Queries with Small Counts.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1978

Algorithms for Updating Minimal Spanning Trees.

[BibT_eX]

[DOI]

David Houck

J. Comput. Syst. Sci., 1978

An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products.

[BibT_eX]

[DOI]

Commun. ACM, 1978

1977

The Partial Fraction Expansion Problem and Its Inverse.

[BibT_eX]

[DOI]

SIAM J. Comput., 1977

A Fast Error Evaluation Algorithm for Polynomial Approximation.

[BibT_eX]

[DOI]

Kenneth Steiglitz

Inf. Process. Lett., 1977

A Study on the Protection of Statistical Data Bases.

[BibT_eX]

[DOI]

Clement T. Yu

Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, 1977

1976

A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation.

[BibT_eX]

[DOI]