161 search results - page 18 / 33 » Methods for convex and general quadratic programming |
122
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
125
click to vote
AUTOMATICA
2007
15 years 4 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
125
click to vote
HAPTICS
2002
IEEE
15 years 9 months ago
2002
IEEE
We have developed a tactile display that uses electric current from the skin surface as a stimulus. Our main objective was to independently stimulate a variety of mechanoreceptors...
164
click to vote
JMLR
2008
15 years 4 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
164
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...