86 search results - page 11 / 18 » On the complexity of optimization over the standard simplex |
VLDB
1991
ACM
15 years 3 months ago
1991
ACM
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
NIPS
2007
15 years 1 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
AIPS
2009
15 years 23 days ago
2009
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
114
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
103
click to vote
ICML
2004
IEEE
16 years 13 days ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...