Sciweavers

551 search results - page 98 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 7 months ago
Critical control of a genetic algorithm
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
Raphaël Cerf
ICISC
2009
169views Cryptology» more  ICISC 2009»
13 years 5 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
CVPR
2011
IEEE
13 years 2 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
PPNA
2011
13 years 2 months ago
Security and privacy issues in P2P streaming systems: A survey
Streaming applications over Peer-To-Peer (P2P) systems have gained an enormous popularity. Success always implies increased concerns about security, protection, privacy and all the...
Gabriela Gheorghe, Renato Lo Cigno, Alberto Montre...
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang