836 search results - page 90 / 168 » On the Complexity of Train Assignment Problems |
137
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
157
click to vote
CVPR
2012
IEEE
13 years 6 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...
165
click to vote
ARGMAS
2007
Springer
15 years 8 months ago
2007
Springer
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
154
click to vote
NIPS
2007
15 years 5 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
141
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...