Sciweavers

137 search results - page 10 / 28
» A Method for Classification of Convex Polygons
Sort
View
IJON
2008
109views more  IJON 2008»
13 years 7 months ago
Unsupervised learning neural network with convex constraint: Structure and algorithm
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...
Hengqing Tong, Tianzhen Liu, Qiaoling Tong
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 7 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
COMPGEOM
1999
ACM
13 years 12 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
ICML
2007
IEEE
14 years 8 months ago
Sparse eigen methods by D.C. programming
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
Bharath K. Sriperumbudur, David A. Torres, Gert R....
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...