Sciweavers

484 search results - page 89 / 97
» The number of convex permutominoes
Sort
View
AAAI
2010
13 years 9 months ago
Smooth Optimization for Effective Multiple Kernel Learning
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
CCCG
2010
13 years 9 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
EUSFLAT
2007
132views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Shortfall-dependant Risk Measures (and Previsions)
Because of their simplicity, risk measures are often employed in financial risk evaluations and related decisions. In fact, the risk measure ρ(X) of a random variable X is a rea...
Pietro Baroni, Renato Pelessoni, Paolo Vicig
NIPS
2007
13 years 9 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...
NIPS
2004
13 years 9 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski