Sciweavers

467 search results - page 25 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ICML
2007
IEEE
16 years 17 days ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara
MLDM
2009
Springer
15 years 4 months ago
Selection of Subsets of Ordered Features in Machine Learning
The new approach of relevant feature selection in machine learning is proposed for the case of ordered features. Feature selection and regularization of decision rule are combined ...
Oleg Seredin, Andrey Kopylov, Vadim Mottl
CG
2002
Springer
14 years 11 months ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 3 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
MOR
2008
169views more  MOR 2008»
14 years 11 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang