Sciweavers

148 search results - page 23 / 30
» Exploiting Parallelism for Hard Problems in Abstract Argumen...
Sort
View
FC
2004
Springer
129views Cryptology» more  FC 2004»
14 years 26 days ago
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
Matthias Enzmann, Marc Fischlin, Markus Schneider ...
ICDCSW
2002
IEEE
14 years 13 days ago
Class-Based Delta-Encoding: A Scalable Scheme for Caching Dynamic Web Content
Abstract—Caching static HTTP traffic in proxy-caches has reduced bandwidth consumption and download latency. However, web-caching performance is hard to increase further due to ...
Konstantinos Psounis
ICVS
2009
Springer
14 years 2 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter
TC
2008
13 years 7 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
DCOSS
2005
Springer
14 years 1 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie