53 search results - page 10 / 11 » Maximal Lattice-Free Convex Sets in Linear Subspaces |
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
JMLR
2008
13 years 6 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
JMLR
2002
13 years 6 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
CVPR
2005
IEEE
13 years 8 months ago
2005
IEEE
Understanding and modifying the effects of arbitrary illumination on human faces in a realistic manner is a challenging problem both for face synthesis and recognition. Recent res...