Sciweavers

2168 search results - page 230 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
116
Voted
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
15 years 9 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
SIAMAM
2011
14 years 10 months ago
Imaging Schemes for Perfectly Conducting Cracks
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
Habib Ammari, Josselin Garnier, Hyeonbae Kang, Won...
TSP
2011
151views more  TSP 2011»
14 years 10 months ago
Stochastic Models for Sparse and Piecewise-Smooth Signals
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
Michael Unser, Pouya Dehghani Tafti
150
Voted
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 9 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
130
Voted
PIMRC
2010
IEEE
15 years 1 months ago
Asymptotic analysis of distributed multi-cell beamforming
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
Subhash Lakshminaryana, Jakob Hoydis, Mérou...