#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1997

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku
- J. Algorithms
- 2004

A real scaled occurrence of a pattern in a text is a position of the text at which the pattern occurs in some real scale 1. The real scaled indexing problem is to preprocess a text so that all real scaled occurrences of a pattern in the text can be found efficiently. Let T be a text of length n over a finite alphabet Σ . We show that with O(n3)-time… (More)

- Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung
- IEEE Trans. Parallel Distrib. Syst.
- 2003

- Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang
- Theor. Comput. Sci.
- 2009

- Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
- ISAAC
- 2001

The p-median problem on a tree T is to find a set S of p vertices on T that minimize the sum of distances from T’s vertices to S. For this problem, Tamir [14] had an O(pn)-time algorithm, while Gavish and Sridhar [6] had an O(nlog n)-time algorithm for the case of p=2. In this paper, we study two generalizations of the 2-median problem, which are obtained… (More)

- Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
- ICPP
- 1999

- Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
- J. Algorithms
- 2006

Let T = (V ,E) be a free tree in which each vertex has a weight and each edge has a length. Let n = |V |. Given T and parameters k and l, a (k, l)-tree core is a subtree X of T with diameter l, having k leaves, which minimizes the sum of the weighted distances from all vertices in T to X. In this paper, two efficient algorithms are presented for finding a… (More)

- Shan-Chyun Ku, Wei-Kuan Shih, Biing-Feng Wang
- ICPP
- 1997

- Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
- COCOON
- 2002

In this paper, we study the problem of locating a median path of limited length on a tree under the condition that some existing facilities are already located. The existing facilities may be located at any subset of vertices. Upper and lower bounds are proposed for both the discrete and continuous models. In the discrete model, a median path is not allowed… (More)

- Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi
- IEEE Trans. Parallel Distrib. Syst.
- 2001

- Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku
- Inf. Comput.
- 2008