Sciweavers

339 search results - page 7 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
Random Sampling LDA for Face Recognition
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...
Xiaogang Wang, Xiaoou Tang
70
Voted
SPAA
1992
ACM
15 years 1 months ago
Separator Based Parallel Divide and Conquer in Computational Geometry
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
NDSS
2009
IEEE
15 years 4 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
CCE
2004
14 years 9 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
PVLDB
2008
110views more  PVLDB 2008»
14 years 9 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons