5316 search results - page 197 / 1064 » Which Search Problems Are Random |
147
Voted
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
128
click to vote
PCM
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
129
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
126
click to vote
ICPP
1998
IEEE
15 years 8 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
146
click to vote
EUROCRYPT
2010
Springer
15 years 7 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...