#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1998

2009

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Chih-Fang Wang, Sartaj Sahni
- IEEE Trans. Parallel Distrib. Syst.
- 1998

C4D#E FHG I JKD#LMI NHOQPRNSJKE/TBIUD#GVFHL/W XYL,O<NSG J F IUZ[NSL \B]#Z[D#L/]#D^FHL/W _>L/`SZ a L/D#D#GUZ[L/`/bdc1L,Z e DfG gUZ IYh NHO ikj[NSGUZ[W/F,b&lmFHZ[L/D#g eBZ[j[j[D bnikoqpSrSs,tStSuv_2aYJ FHZ[jxw yfz FHL/`/b gUFH{/L/Z5|H}4]#Z[gUDSu T,~u DfW,Tdu H {/Z[g z NSG z FHggUT/E/ENSG IUD#Wb2Z[LnE FHG Ifbk
Mh;I {/D 4G Jh;D#gUDfFHGU]"{@1K]#D… (More)

- Sartaj Sahni, Chih-Fang Wang
- Informatica
- 1998

We show that the diameter of an N 2 processor OTIS-Hypercube computer (N = 2 d) is 2d + 1. OTIS-Hypercube algorithms for some commonly performed permutations { transpose, bit reversal, vector reversal, perfect shuue, unshuue, shuued row-major, and bit shuue { are developed. We also propose an algorithm for general BPC permutations.

- Chih-Fang Wang, Sartaj Sahni
- IEEE Trans. Computers
- 2001

- Chih-Fang Wang, Sartaj Sahni
- IEEE Trans. Parallel Distrib. Syst.
- 2000

- Chih-Fang Wang, Sartaj Sahni
- ICPP
- 2002

We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are… (More)

- Anand Yendluri, Wen-Chi Hou, Chih-Fang Wang
- DASFAA
- 2004

- Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Chih-Fang Wang
- 22nd International Conference on Data Engineering…
- 2006

XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structural join size accurately and quickly is thus crucial to the success of XML query plan selection and the query optimization. XML structural joins are essentially complex unequal… (More)

In many applications, data takes the form of a continuous stream rather than a persistent data set. Data stream processing is generally an on-line, one-pass process and is required to be time and space efficient too. In this paper, we develop a framework for estimating join size over the data streams based on the discrete cosine transform (DCT). The DCT… (More)

- Meng Su, Chih-Fang Wang, Wen-Chi Hou
- Mobile Data Management
- 2005

Caching can reduce expensive data transfers and improve the performance of mobile computing. In order to reuse caches after short disconnections, invalidation reports are broadcast to clients to identify outdated items. Detailed reports may not be desirable because they can consume too much bandwidth. On the other hand, false invalidations may set in if the… (More)

- Hongsik Rho, Wen-Chi Hou, Dunren Che, Chih-Fang Wang
- DEXA
- 2003