Chung Keung Poon

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Two improved range-efficient algorithms for F0 estimation.

[BibT_eX]

[DOI]

He Sun

Theor. Comput. Sci., 2009

Two-Dimensional Packet Classification and Filter Conflict Resolution in the Internet.

[BibT_eX]

[DOI]

Andy Kwok

Theory Comput. Syst., 2009

Using phrases as features in email classification.

[BibT_eX]

[DOI]

J. Syst. Softw., 2009

OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data.

[BibT_eX]

[DOI]

Jing Cai

Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009

On Job Scheduling with Preemption Penalties.

[BibT_eX]

[DOI]

Yinfeng Xu

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Improved on-line broadcast scheduling with deadlines.

[BibT_eX]

[DOI]

J. Sched., 2008

Approximate colored range and point enclosure queries.

[BibT_eX]

[DOI]

Ying Kit Lai

Benyun Shi

J. Discrete Algorithms, 2008

Online interval scheduling: randomized and multiprocessor cases.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Efficient phrase querying with common phrase index.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2008

Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

On-Demand Bounded Broadcast Scheduling with Tight Deadlines.

[BibT_eX]

[DOI]

Yinfeng Xu

Int. J. Found. Comput. Sci., 2007

Two Improved Range-Efficient Algorithms for F 0 Estimation.

[BibT_eX]

[DOI]

He Sun

Proceedings of the Theory and Applications of Models of Computation, 2007

Design and Implementation of an Automated System for Assessment of Computer Programming Assignments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web Based Learning, 2007

2006

Opportunistic data structures for range queries.

[BibT_eX]

[DOI]

Wai Keung Yiu

J. Comb. Optim., 2006

A tight lower bound for job scheduling with cancellation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Experiences with PASS: Developing and Using a Programming Assignment aSsessment System.

[BibT_eX]

[DOI]

Yuen-Tak Yu

Marian Choy

Proceedings of the Sixth International Conference on Quality Software (QSIC 2006), 2006

Faster Twig Pattern Matching Using Extended Dewey ID.

[BibT_eX]

[DOI]

Leo Yuen

Proceedings of the Database and Expert Systems Applications, 17th International Conference, 2006

2005

On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity.

[BibT_eX]

[DOI]

Wenci Yu

J. Comb. Optim., 2005

Approximating the minimum triangulation of convex 3-polytopes with bounded degrees.

[BibT_eX]

[DOI]

Comput. Geom., 2005

A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity.

[BibT_eX]

[DOI]

Wenci Yu

Ann. Oper. Res., 2005

Relational Index Support for XPath Axes.

[BibT_eX]

[DOI]

Leo Yuen

Proceedings of the Database and XML Technologies, 2005

Catching the Picospams.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005

Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximate Colored Range Queries.

[BibT_eX]

[DOI]

Ying Kit Lai

Benyun Shi

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Experiences in Using an Automated System for Improving Students' Learning of Computer Programming.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Based Learning - ICWL 2005, 4th International Conference, Hong Kong, China, July 31, 2005

Laxity Helps in Broadcast Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

On Minimizing Total Completion Time In Batch Machine Scheduling.

[BibT_eX]

[DOI]

Wenci Yu

Int. J. Found. Comput. Sci., 2004

Optimal Range Max Datacube For Fixed Dimensions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Minimizing Makespan in Batch Machine Scheduling.

[BibT_eX]

[DOI]

Pixing Zhang

Algorithmica, 2004

Space Optimal Packet Classification for 2-d Conflict-free Filters.

[BibT_eX]

[DOI]

Andy Kwok

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Excalibur: A Personalized Meta Search Engine.

[BibT_eX]

[DOI]

Proceedings of the 28th International Computer Software and Applications Conference (COMPSAC 2004), 2004

2003

Dynamic orthogonal range queries in OLAP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Approximation Algorithms in Batch Processing.

[BibT_eX]

[DOI]

Xiaotie Deng

Yuzhong Zhang

J. Comb. Optim., 2003

Verifying minimum stable circuit values.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

An Email Classifier Based on Resemblance.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 14th International Symposium, 2003

2001

Efficient Approximation Algorithms for Two-Label Point Labeling.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

Orthogonal Range Queries in OLAP.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2001

2000

A space lower bound for st-connectivity on node-named JAGs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

Tight Lower Bounds for st-Connectivity on the NNJAG Model.

[BibT_eX]

[DOI]

Jeff Edmonds

Dimitris Achlioptas

SIAM J. Comput., 1999

Efficient Approximation Algorithms for Multi-label Map Labeling.

[BibT_eX]

[DOI]

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

1998

A Polynomial Time Solution for Labeling a Rectlinear Map.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

1997

An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.

[BibT_eX]

[DOI]

Vijaya Ramachandran

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

A Polynomial Time Solution for Labeling a Rectilinear Map.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

On the complexity of the st-connectivity problem.

[BibT_eX]

[DOI]

PhD thesis, 1996

1995

Optimal Simulation of Full Binary Trees on Faulty Hypercubes.

[BibT_eX]

[DOI]

Bethany Man-Yee Chan

IEEE Trans. Parallel Distributed Syst., 1995

A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model.

[BibT_eX]

[DOI]

Jeff Edmonds

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

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

[BibT_eX]

[DOI]

Algorithmica, 1994

1993

Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

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

[BibT_eX]

[DOI]

Mee Yee Chan