Sciweavers

432 search results - page 43 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
CHES
2009
Springer
157views Cryptology» more  CHES 2009»
16 years 4 months ago
Differential Cluster Analysis
Abstract. We propose a new technique called Differential Cluster Analysis for side-channel key recovery attacks. This technique uses cluster analysis to detect internal collisions ...
Lejla Batina, Benedikt Gierlichs, Kerstin Lemke-Ru...
TIP
2010
90views more  TIP 2010»
14 years 10 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
ESTIMEDIA
2009
Springer
15 years 10 months ago
QoS management of dynamic video tasks by task splitting and skipping
—We have integrated processing with deterministic and non-deterministic resource usage in an overall application and evaluated its performance on a multi-core processor platform....
Rob Albers, Eric Suijs, Peter H. N. de With
PODC
2004
ACM
15 years 9 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
CCGRID
2003
IEEE
15 years 9 months ago
Creating Services with Hard Guarantees from Cycle-Harvesting Systems
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
Chris Kenyon, Giorgos Cheliotis