Sciweavers

5606 search results - page 960 / 1122
» Randomization Techniques for Graphs.
Sort
View
IACR
2011
132views more  IACR 2011»
14 years 6 months ago
Homomorphic encryption from codes
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
Andrej Bogdanov, Chin Ho Lee
IACR
2011
136views more  IACR 2011»
14 years 6 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ICDAR
2011
IEEE
14 years 6 months ago
A New Feature Optimization Method Based on Two-Directional 2DLDA for Handwritten Chinese Character Recognition
—LDA transformation is one of the popular feature dimension reduction techniques for the feature extraction in most handwritten Chinese characters recognition systems. The integr...
Xue Gao, Wenhuan Wen, Lianwen Jin
JMLR
2012
13 years 8 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...
TEC
2012
234views Formal Methods» more  TEC 2012»
13 years 8 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao