11 search results - page 2 / 3 » Hierarchical Penalization |
NIPS
2008
13 years 7 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
WOWMOM
2005
ACM
13 years 11 months ago
2005
ACM
The paper proposes an architecture for a scheduling algorithm, to be integrated in IEEE 802.11 Access Points (AP), able to take into account, besides the transport service class r...
NIPS
2003
13 years 7 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
JMLR
2008
13 years 5 months ago
2008
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
ICCV
2005
IEEE
14 years 7 months ago
2005
IEEE
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...