Sciweavers

3946 search results - page 476 / 790
» The computational complexity of choice sets
Sort
View
DAC
2003
ACM
16 years 7 months ago
Support vector machines for analog circuit performance representation
The use of Support Vector Machines (SVMs) to represent the performance space of analog circuits is explored. In abstract terms, an analog circuit maps a set of input design parame...
Fernando De Bernardinis, Michael I. Jordan, Albert...
MICCAI
2006
Springer
16 years 7 months ago
The Entire Regularization Path for the Support Vector Domain Description
Abstract. The support vector domain description is a one-class classification method that estimates the shape and extent of the distribution of a data set. This separates the data ...
Karl Sjöstrand, Rasmus Larsen
ICML
2009
IEEE
16 years 7 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 7 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
CHI
2005
ACM
16 years 7 months ago
Implications for designing the user experience of DVD menus
DVD menus often miss out on usability and are complex and difficult to navigate through. One of the main problems is the lack of design standards. By conducting an expert walkthro...
Thomas Költringer, Martin Tomitsch, Karin Kap...