Sciweavers

1334 search results - page 138 / 267
» Composite kernel learning
Sort
View
ALT
2004
Springer
16 years 16 days ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
149
Voted
COLT
1999
Springer
15 years 7 months ago
Covering Numbers for Support Vector Machines
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
Ying Guo, Peter L. Bartlett, John Shawe-Taylor, Ro...
173
Voted
MM
2010
ACM
137views Multimedia» more  MM 2010»
15 years 3 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
152
Voted
SKG
2006
IEEE
15 years 9 months ago
Infrastructure for Language Service Composition
Although English has become the standard language in various areas, most people do not use it in local activities. To increase the mutual understanding of different cultures with ...
Yohei Murakami, Toru Ishida, Takao Nakaguchi
145
Voted
ICCV
2011
IEEE
14 years 3 months ago
Image Segmentation by Figure-Ground Composition into Maximal Cliques
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
Adrian Ion, Joao Carreira, Cristian Sminchisescu