Sciweavers

169 search results - page 22 / 34
» Reductions among high dimensional proximity problems
Sort
View
DAC
2008
ACM
14 years 8 months ago
ELIAD: efficient lithography aware detailed router with compact post-OPC printability prediction
In this paper, we present ELIAD, an efficient lithography aware detailed router to optimize silicon image after optical proximity correction (OPC) in a correct-by-construction man...
Minsik Cho, Kun Yuan, Yongchan Ban, David Z. Pan
AAAI
2006
13 years 9 months ago
Tensor Embedding Methods
Over the past few years, some embedding methods have been proposed for feature extraction and dimensionality reduction in various machine learning and pattern classification tasks...
Guang Dai, Dit-Yan Yeung
TSMC
2010
13 years 2 months ago
Fractional Particle Swarm Optimization in Multidimensional Search Space
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
Serkan Kiranyaz, Turker Ince, E. Alper Yildirim, M...
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ICASSP
2010
IEEE
13 years 7 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel