5022 search results - page 174 / 1005 » Data structures and problem solving using Java |
100
click to vote
ECML
2003
Springer
15 years 7 months ago
2003
Springer
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
109
click to vote
CEC
2009
IEEE
15 years 5 months ago
2009
IEEE
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
117
click to vote
AAAI
2007
15 years 4 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
125
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
117
click to vote
ICIP
2006
IEEE
16 years 3 months ago
2006
IEEE
Structure from motion (SFM) is the problem of reconstructing the geometry of a scene from a stream of images. In this problem, the geometry of the scene must be inferred from imag...