Sciweavers

6542 search results - page 1115 / 1309
» The tao of parallelism in algorithms
Sort
View
CHES
2009
Springer
157views Cryptology» more  CHES 2009»
16 years 7 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...
KDD
2008
ACM
209views Data Mining» more  KDD 2008»
16 years 7 months ago
Combinational collaborative filtering for personalized community recommendation
Rapid growth in the amount of data available on social networking sites has made information retrieval increasingly challenging for users. In this paper, we propose a collaborativ...
WenYen Chen, Dong Zhang, Edward Y. Chang
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 6 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
3DIM
2007
IEEE
16 years 6 months ago
Automatic Pose Estimation for Range Images on the GPU
Object pose (location and orientation) estimation is a common task in many computer vision applications. Although many methods exist, most algorithms need manual initialization ...
Marcel Germann, Michael D. Breitenstein, In Kyu Pa...
ICS
2010
Tsinghua U.
16 years 4 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim
« Prev « First page 1115 / 1309 Last » Next »