Sciweavers

1115 search results - page 193 / 223
» Separating Shape Graphs
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Spectral feature selection for supervised and unsupervised learning
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
Zheng Zhao, Huan Liu
PLDI
2009
ACM
14 years 9 months ago
Sharing classes between families
Class sharing is a new language mechanism for building extensible software systems. Recent work has separately explored two different kinds of extensibility: first, family inherit...
Xin Qi, Andrew C. Myers
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
POPL
2002
ACM
14 years 8 months ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
14 years 5 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...