In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
With the growing popularity of pen-based computers comes the need to display clear handwritten characters at small sizes on low-resolution displays. This paper describes a method ...
Sara L. Su, Chenyu Wu, Ying-Qing Xu, Heung-Yeung S...
The shear-warp volume rendering algorithm is one of the fastest algorithms for volume rendering, but it achieves this rendering speed only by sacrificing interpolation between th...