Chih-Fang Wang

Learn More
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 FHgƒgUT/E/E„NSG IUD#Wb2Z[LnE FHG Ifbk…Mh;I {/D †4G J‡h;ˆ‰D#gUDfFHGU]"{@Š1‹K]#D(More)
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)
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)
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)