Sciweavers

5606 search results - page 780 / 1122
» Randomization Techniques for Graphs.
Sort
View
SCN
2008
Springer
116views Communications» more  SCN 2008»
15 years 6 months ago
General Certificateless Encryption and Timed-Release Encryption
While recent timed-release encryption (TRE) schemes are implicitly supported by a certificateless encryption (CLE) mechanism, the security models of CLE and TRE differ and there is...
Sherman S. M. Chow, Volker Roth, Eleanor G. Rieffe...
191
Voted
PRL
2006
144views more  PRL 2006»
15 years 6 months ago
Astronomical image restoration using an improved anisotropic diffusion
Images secured from an astronomical telescope usually suffer from blur and from interference that scientists refer to as ``noise''. Therefore, good image restoration tec...
Shin-Min Chao, Du-Ming Tsai
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TCAD
2008
73views more  TCAD 2008»
15 years 6 months ago
Reduction of Parametric Failures in Sub-100-nm SRAM Array Using Body Bias
Abstract--In this paper, we present a postsilicon-tuning technique to improve parametric yield of SRAM array using body bias (BB). First, we show that, although parametric failures...
Saibal Mukhopadhyay, Hamid Mahmoodi, Kaushik Roy
TIT
2008
83views more  TIT 2008»
15 years 6 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng