Sciweavers

44 search results - page 5 / 9
» Fractional Kernels in Digraphs
Sort
View
TNN
2010
176views Management» more  TNN 2010»
13 years 2 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
NIPS
2003
13 years 8 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
CORR
2008
Springer
375views Education» more  CORR 2008»
13 years 7 months ago
The Margitron: A Generalised Perceptron with Margin
We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (des...
Constantinos Panagiotakopoulos, Petroula Tsampouka
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...
PAMI
2006
132views more  PAMI 2006»
13 years 7 months ago
Capitalize on Dimensionality Increasing Techniques for Improving Face Recognition Grand Challenge Performance
This paper presents a novel pattern recognition framework by capitalizing on dimensionality increasing techniques. In particular, the framework integrates Gabor image representatio...
Chengjun Liu