Sciweavers

491 search results - page 89 / 99
» Random Paintbrush Transformation
Sort
View
CASES
2006
ACM
15 years 4 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
108
Voted
SAC
2006
ACM
15 years 4 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
EUROCRYPT
2003
Springer
15 years 3 months ago
Extracting Group Signatures from Traitor Tracing Schemes
Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-He...
Aggelos Kiayias, Moti Yung
WSC
2000
14 years 11 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
101
Voted
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 11 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