Sciweavers

1517 search results - page 292 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
ECCV
2008
Springer
15 years 7 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
KDD
2010
ACM
203views Data Mining» more  KDD 2010»
15 years 1 months ago
Collusion-resistant privacy-preserving data mining
Recent research in privacy-preserving data mining (PPDM) has become increasingly popular due to the wide application of data mining and the increased concern regarding the protect...
Bin Yang, Hiroshi Nakagawa, Issei Sato, Jun Sakuma
98
Voted
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
IPPS
2010
IEEE
14 years 7 months ago
Improving numerical reproducibility and stability in large-scale numerical simulations on GPUs
The advent of general purpose graphics processing units (GPGPU's) brings about a whole new platform for running numerically intensive applications at high speeds. Their multi-...
Michela Taufer, Omar Padron, Philip Saponaro, Sand...
JCB
2002
70views more  JCB 2002»
14 years 9 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...