1542 search results - page 120 / 309 » Kernelization of packing problems |
108
click to vote
ESANN
2006
15 years 3 months ago
2006
This work presents two kernels which can be applied to sets of spike times. This allows the use of state-of-the-art classification techniques to spike trains. The presented kernels...
107
click to vote
NIPS
2001
15 years 3 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
115
click to vote
ICIP
2002
IEEE
16 years 3 months ago
2002
IEEE
Techniques that can introduce low-dimensional feature representation with enhanced discriminatory power is of paramount importance in face recognition applications. It is well kno...
126
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
105
Voted
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...