Sciweavers

2312 search results - page 55 / 463
» The complexity of estimating min-entropy
Sort
View
ORL
2006
118views more  ORL 2006»
13 years 9 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro
ICC
2007
IEEE
14 years 4 months ago
Non-Data Aided Symbol Timing Estimation in MIMO Systems
—We present two Maximum Likelihood (ML) based estimators for Non-Data-Aided (NDA) symbol timing recovery in MIMO systems. These estimators are based on the classical Unconditiona...
Ketan Rajawat, Ajit K. Chaturvedi
ISPD
1998
ACM
79views Hardware» more  ISPD 1998»
14 years 2 months ago
On wirelength estimations for row-based placement
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop e cient wirelength estimation techniqu...
Andrew E. Caldwell, Andrew B. Kahng, Stefanus Mant...
TCAD
2010
168views more  TCAD 2010»
13 years 4 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
ICASSP
2011
IEEE
13 years 1 months ago
Acceleration of adaptive proximal forward-backward splitting method and its application to sparse system identification
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
Masao Yamagishi, Masahiro Yukawa, Isao Yamada