22 search results - page 4 / 5 » The Rademacher Complexity of Linear Transformation Classes |
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper a novel non-linear subspace method for face verification is proposed. The problem of face verification is considered as a two-class problem (genuine versus imposto...
TC
2010
13 years 2 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
NIPS
2001
13 years 9 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...