#### Filter Results:

- Full text PDF available (58)

#### Publication Year

1952

2017

- This year (3)
- Last 5 years (35)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Ruibang Luo, Thomas K. F. Wong, +14 authors T. P. L. Lam
- PloS one
- 2013

To tackle the exponentially increasing throughput of Next-Generation Sequencing (NGS), most of the existing short-read aligners can be configured to favor speed in trade of accuracy and sensitivity. SOAP3-dp, through leveraging the computational power of both CPU and GPU with optimized algorithms, delivers high speed and sensitivity simultaneously. Compared… (More)

- Francis Y. L. Chin, Hing-Fung Ting
- 26th Annual Symposium on Foundations of Computer…
- 1985

A distributed algorithm is presented that constructs the minimum-weight spanning tree of an undirected connected graph with distinct edge weights and distinct node identities. Initially each node knows only the weight of each of its adjacent edges. When the algorithm terminates, each node knows which of its adjacent edges are edges of the tree. For a graph… (More)

- Lap-Kei Lee, Hing-Fung Ting
- PODS
- 2006

In this paper, we give a simple scheme for identifying ε-approximate frequent items over a sliding window of size <i>n</i>. Our scheme is deterministic and does not make any assumption on the distribution of the item frequencies. It supports <i>O</i>(1/ε) update and query time, and uses <i>O</i>(1/ε) space. It is very simple; its main data… (More)

- Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
- J. Algorithms
- 2001

A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is only concerned with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and… (More)

- Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
- ESA
- 1999

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for… (More)

- Regant Y. S. Hung, Hing-Fung Ting
- FAW
- 2010

- Hing-Fung Ting
- CIAC
- 2006

- Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting
- Algorithmica
- 2010

In this paper we extend the study of algorithms for monitoring distributed data streams from whole data streams to a time-based sliding window. The concern is how to minimize the communication between individual streams and the root, while allowing the root, at any time, to report the global statistics of all streams within a given error bound. This paper… (More)

- Regant Y. S. Hung, Hing-Fung Ting
- LATIN
- 2008

- Francis Y. L. Chin, Hing-Fung Ting
- Algorithmica
- 1987

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(√logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which… (More)