Sciweavers

927 search results - page 178 / 186
» Measuring Consistency Costs for Distributed Shared Data
Sort
View
CAMP
2005
IEEE
14 years 2 months ago
Speeding-up NCC-Based Template Matching Using Parallel Multimedia Instructions
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...
Luigi di Stefano, Stefano Mattoccia, Federico Tomb...
ICDCS
2009
IEEE
13 years 6 months ago
A Case Study of Traffic Locality in Internet P2P Live Streaming Systems
With the ever-increasing P2P Internet traffic, recently much attention has been paid to the topology mismatch between the P2P overlay and the underlying network due to the large a...
Yao Liu, Lei Guo, Fei Li, Songqing Chen
SPAA
2004
ACM
14 years 2 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
GRID
2007
Springer
14 years 15 days ago
Optimizing multiple queries on scientific datasets with partial replicas
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
Li Weng, Ümit V. Çatalyürek, Tahs...
VLDB
2001
ACM
129views Database» more  VLDB 2001»
14 years 1 months ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...