Sciweavers

2979 search results - page 337 / 596
» Computation and the Periodic Table
Sort
View
CONEXT
2008
ACM
15 years 8 months ago
ISP-friendly peer matching without ISP collaboration
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...
Cheng-Hsin Hsu, Mohamed Hefeeda
EUROPAR
2008
Springer
15 years 8 months ago
Complex Queries for Moving Object Databases in DHT-Based Systems
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...
Cecilia Hernández, M. Andrea Rodrígu...
NSDI
2004
15 years 8 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
WSCG
2004
130views more  WSCG 2004»
15 years 8 months ago
A Hybrid Approach to Rendering Handwritten Characters
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...
VG
2003
15 years 8 months ago
Integrating Pre-Integration Into The Shear-Warp Algorithm
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...
Jürgen P. Schulze, Martin Kraus, Ulrich Lang,...