Sciweavers

356 search results - page 17 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 9 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
LREC
2010
176views Education» more  LREC 2010»
13 years 9 months ago
There's no Data like More Data? Revisiting the Impact of Data Size on a Classification Task
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
Ines Rehbein, Josef Ruppenhofer
ICCAD
2000
IEEE
74views Hardware» more  ICCAD 2000»
13 years 12 months ago
Simultaneous Gate Sizing and Fanout Optimization
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram
SIAMJO
2008
72views more  SIAMJO 2008»
13 years 7 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
ICB
2009
Springer
159views Biometrics» more  ICB 2009»
14 years 2 months ago
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition
The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To...
Changyou Chen, Junping Zhang, Rudolf Fleischer