Sciweavers

122 search results - page 14 / 25
» Kernelization for Convex Recoloring
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
13 years 5 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
CVPR
2008
IEEE
14 years 9 months ago
Combining brain computer interfaces with vision for object categorization
Human-aided computing proposes using information measured directly from the human brain in order to perform useful tasks. In this paper, we extend this idea by fusing computer vis...
Ashish Kapoor, Pradeep Shenoy, Desney S. Tan
ICCV
2009
IEEE
15 years 10 days ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu