206 search results - page 29 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
140
click to vote
CVPR
2012
IEEE
13 years 23 hour ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
102
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
95
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...