Sciweavers

339 search results - page 53 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
69
Voted
EDCC
2008
Springer
14 years 11 months ago
Practical Setup Time Violation Attacks on AES
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...
Nidhal Selmane, Sylvain Guilley, Jean-Luc Danger
COLT
2010
Springer
14 years 7 months ago
Robust Hierarchical Clustering
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
Maria-Florina Balcan, Pramod Gupta
TNN
2010
143views Management» more  TNN 2010»
14 years 4 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ASPLOS
2012
ACM
13 years 5 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...
BMCBI
2007
163views more  BMCBI 2007»
14 years 9 months ago
Strainer: software for analysis of population variation in community genomic datasets
Background: Metagenomic analyses of microbial communities that are comprehensive enough to provide multiple samples of most loci in the genomes of the dominant organism types will...
John M. Eppley, Gene W. Tyson, Wayne M. Getz, Jill...