Sciweavers

315 search results - page 15 / 63
» Performance optimization under rise and fall parameters
Sort
View
FOCS
1999
IEEE
15 years 4 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
JCST
2008
124views more  JCST 2008»
14 years 11 months ago
Clustering by Pattern Similarity
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
Haixun Wang, Jian Pei
ICASSP
2011
IEEE
14 years 3 months ago
A robust artificial noise aided transmit design for MISO secrecy
This paper considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna ea...
Qiang Li, Wing-Kin Ma
84
Voted
ICARIS
2005
Springer
15 years 5 months ago
A Markov Chain Model of the B-Cell Algorithm
An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent abso...
Edward Clark, Andrew Hone, Jon Timmis
DAC
2010
ACM
14 years 12 months ago
QuickYield: an efficient global-search based parametric yield estimation with performance constraints
With technology scaling down to 90nm and below, many yield-driven design and optimization methodologies have been proposed to cope with the prominent process variation and to incr...
Fang Gong, Hao Yu, Yiyu Shi, Daesoo Kim, Junyan Re...