no code implementations • 27 Oct 2014 • Nicholas Rhinehart, Jiaji Zhou, Martial Hebert, J. Andrew Bagnell
We present an efficient algorithm with provable performance for building a high-quality list of detections from any candidate set of region-based proposals.
no code implementations • 16 Aug 2013 • Jiaji Zhou, Stephane Ross, Yisong Yue, Debadeepta Dey, J. Andrew Bagnell
We study the problem of predicting a set or list of options under knapsack constraint.
no code implementations • 11 May 2013 • Stephane Ross, Jiaji Zhou, Yisong Yue, Debadeepta Dey, J. Andrew Bagnell
Many prediction domains, such as ad placement, recommendation, trajectory prediction, and document summarization, require predicting a set or list of options.