206 search results - page 38 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
ICIP
1999
IEEE
15 years 1 months ago
1999
IEEE
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
114
click to vote
KDD
2012
ACM
13 years 9 hour ago
2012
ACM
Accurate prediction of user behaviors is important for many social media applications, including social marketing, personalization and recommendation, etc. A major challenge lies ...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
ASPLOS
2010
ACM
15 years 4 months ago
2010
ACM
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...