Sciweavers

1387 search results - page 178 / 278
» Convexity in Discrete Space
Sort
View
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 9 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 10 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
MM
2010
ACM
169views Multimedia» more  MM 2010»
13 years 9 months ago
CO3 for ultra-fast and accurate interactive segmentation
This paper presents an interactive image segmentation framework which is ultra-fast and accurate. Our framework, termed "CO3", consists of three components: COupled repr...
Yibiao Zhao, Song Chun Zhu, Siwei Luo
PAMI
2002
122views more  PAMI 2002»
13 years 8 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni