Discovery - Top 10
Type
Date issued
(10)
(55)
(81)
(34)
(29)
(14)
(9)
(13)
(7)
Journal/Proceeding/Conference
(3)
(2)
(1)
(1)
Language
(252)
HKU Organizations
Search
Add filters:
Use filters to refine the search results.
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
On-line scheduling of parallel jobs on two machines Journal:Journal of Discrete Algorithms | 2008 | 101 | ||
Optimal Termination Protocols for Network Partitioning Journal:SIAM Journal on Computing | 1986 | 116 | ||
Watershed segmentation with boundary curvature ratio based merging criterion Proceeding/Conference:Proceedings of the 9th IASTED International Conference on Signal and Image Processing | 2007 | 159 | ||
Off-line algorithms for minimizing total flow time in broadcast scheduling Proceeding/Conference:Lecture Notes in Computer Science | 2005 | 107 | ||
| 1994 | 114 | |||
Escaping a grid by edge-disjoint paths Proceeding/Conference:Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2000 | 115 | ||
Dilation-5 embedding of 3-dimensional grids into hypercubes Journal:Journal of Parallel and Distributed Computing | 1996 | 162 | ||
Online bin packing of fragile objects with application in cellular networks Journal:Journal of Combinatorial Optimization | 2007 | 98 | ||
Algorithms for Placing Monitors in a Flow Network Journal:Algorithmica | 2012 | 35 | ||
Optimal Parallel Weighted Multiselection Proceeding/Conference:The 5th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2002) | 2002 | 70 | ||
On-line Scheduling with Partial Job Values and Bounded Importance Ratio Proceeding/Conference:The 2002 International Computer Symposium (ICS 2002) | 2002 | 91 | ||
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees Journal:Computational Geometry: Theory and Applications | 2005 | 170 | ||
MetaCluster 5.0: a two-round binning approach for metagenomic data for low-abundance species in a noisy sample Proceeding/Conference:Bioinformatics | 2012 | 47 | ||
Finding motifs with insufficient number of strong binding sites Journal:Journal of Computational Biology | 2005 | 113 | ||
Improved online algorithms for 1-space bounded 2-dimensional bin packing Proceeding/Conference:Lecture Notes in Computer Science | 2010 | 106 | ||
Finding Linear Motif Pair from Protein Interaction Networks: A Probabilistic Approach Proceeding/Conference:The 6th Annual International Conference on Computational Systems Bioinformatics Conference (CSB 2007) | 2007 | 77 | ||
Minimum Manhattan Network is NP-Complete Journal:Discrete and Computational Geometry | 2011 | 139 | ||
Object-based surveillance video retrieval system with real-time indexing methodology Proceeding/Conference:Lecture Notes in Computer Science | 2007 | 127 | ||
Adaptive phenotype testing for AND/OR items Proceeding/Conference:Lecture Notes In Computer Science | 2011 | 110 | ||
Frequency allocation problems for linear cellular networks Proceeding/Conference:Lecture Notes in Computer Science | 2006 | 131 | ||
A new upper bound 2.5545 on 2D online bin packing Journal:ACM Transactions on Algorithms | 2011 | 194 | ||
Online frequency assignment in wireless communication networks Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | 97 | ||
Constraints in the wavelet transform domain for stereo vision correspondence matching Proceeding/Conference:Proceedings of SPIE - The International Society for Optical Engineering | 1996 | 95 | ||
Constrained pairwise and center-star sequences alignment problems Journal:Journal of Combinatorial Optimization | 2016 | 86 | ||
OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM. Proceeding/Conference:Proceedings of the International Conference on Parallel Processing | 1981 | 70 |