Sciweavers

568 search results - page 45 / 114
» New bounds for the Cebysev functional
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
FOCS
2009
IEEE
14 years 2 months ago
Smoothed Analysis of Multiobjective Optimization
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
Heiko Röglin, Shang-Hua Teng
GLVLSI
1999
IEEE
92views VLSI» more  GLVLSI 1999»
14 years 7 hour ago
Fault Coverage Estimation for Early Stage of VLSI Design
This paper proposes a new fault coverage estimation model which can be used in the early stage of VLSI design. The fault coverage model is an exponentially decaying function with ...
Von-Kyoung Kim, Tom Chen, Mick Tegethoff
TIT
2010
137views Education» more  TIT 2010»
13 years 2 months ago
Channel coding rate in the finite blocklength regime
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...
Yury Polyanskiy, H. Vincent Poor, Sergio Verd&uacu...
ICASSP
2011
IEEE
12 years 11 months ago
PAC-Bayesian approach for minimization of phoneme error rate
We describe a new approach for phoneme recognition which aims at minimizing the phoneme error rate. Building on structured prediction techniques, we formulate the phoneme recogniz...
Joseph Keshet, David A. McAllester, Tamir Hazan