1547 search results - page 36 / 310 » Solving Knapsack Problems in a Sticker Based Model |
102
Voted
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
101
click to vote
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patchbased ...
131
Voted
SPEECH
2010
14 years 9 months ago
2010
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
221
click to vote
SBIA
2010
Springer
15 years 23 days ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
132
click to vote
WINE
2007
Springer
15 years 8 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...