Sciweavers

4377 search results - page 192 / 876
» Mass problems and randomness
Sort
View
INFOCOM
2007
IEEE
16 years 26 days ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
PCM
2007
Springer
169views Multimedia» more  PCM 2007»
16 years 21 days ago
Random Subspace Two-Dimensional PCA for Face Recognition
The two-dimensional Principal Component Analysis (2DPCA) is a robust method in face recognition. Much recent research shows that the 2DPCA is more reliable than the well-known PCA ...
Nam Nguyen, Wanquan Liu, Svetha Venkatesh
FPT
2005
IEEE
170views Hardware» more  FPT 2005»
16 years 5 days ago
High Quality Uniform Random Number Generation Through LUT Optimised Linear Recurrences
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
David B. Thomas, Wayne Luk
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
15 years 12 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
CHES
2004
Springer
99views Cryptology» more  CHES 2004»
15 years 12 months ago
Defeating Countermeasures Based on Randomized BSD Representations
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
Pierre-Alain Fouque, Frédéric Muller...