Sciweavers

6202 search results - page 171 / 1241
» Without Loss of Generality
Sort
View
COLT
1999
Springer
15 years 3 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 11 days ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
15 years 2 days ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
BMCBI
2008
113views more  BMCBI 2008»
14 years 11 months ago
SynBlast: Assisting the analysis of conserved synteny information
Motivation: In the last years more than 20 vertebrate genomes have been sequenced, and the rate at which genomic DNA information becomes available is rapidly accelerating. Gene du...
Jörg Lehmann, Peter F. Stadler, Sonja J. Proh...
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
13 years 1 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu