Sciweavers

1224 search results - page 97 / 245
» On the Optimality of the Dimensionality Reduction Method
Sort
View
SSPR
2004
Springer
15 years 11 months ago
Feature Subset Selection Using an Optimized Hill Climbing Algorithm for Handwritten Character Recognition
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
Carlos M. Nunes, Alceu de Souza Britto Jr., Celso ...
GECCO
2004
Springer
15 years 11 months ago
Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms
We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilisti...
Mario Giacobini, Enrique Alba, Andrea Tettamanzi, ...
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
16 years 3 months ago
I/O Clustering in Design Cost and Performance Optimization for Flip-Chip Design
I/O placement has always been a concern in modern IC design. Due to flip-chip technology, I/O can be placed throughout the whole chip without long wires from the periphery of the...
Hung-Ming Chen, I-Min Liu, Martin D. F. Wong, Muzh...
SBCCI
2005
ACM
111views VLSI» more  SBCCI 2005»
15 years 12 months ago
Total leakage power optimization with improved mixed gates
Gate oxide tunneling current Igate and sub-threshold current Isub dominate the leakage of designs. The latter depends on threshold voltage Vth while Igate vary with the thickness ...
Frank Sill, Frank Grassert, Dirk Timmermann
ICPR
2010
IEEE
15 years 4 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng