Sciweavers

8125 search results - page 1435 / 1625
» Parallelism and evolutionary algorithms
Sort
View
ASPLOS
2009
ACM
16 years 5 months ago
Optimization of tele-immersion codes
As computational power increases, tele-immersive applications are an emerging trend. These applications make extensive demands on computational resources through their heavy use o...
Albert Sidelnik, I-Jui Sung, Wanmin Wu, Marí...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 5 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
CHES
2009
Springer
157views Cryptology» more  CHES 2009»
16 years 5 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 4 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 4 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...
« Prev « First page 1435 / 1625 Last » Next »