Sciweavers

1778 search results - page 188 / 356
» On the Power of the Randomized Iterate
Sort
View
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
15 years 12 months ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
JC
2007
94views more  JC 2007»
15 years 6 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
CVPR
2010
IEEE
15 years 9 months ago
Discriminative K-SVD for Dictionary Learning in Face Recognition
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
Qiang Zhang, Baoxin Li
TCS
1998
15 years 6 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
SEMWEB
2007
Springer
16 years 16 days ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...