Sciweavers

17967 search results - page 273 / 3594
» Functional timing optimization
Sort
View
EMMCVPR
2011
Springer
14 years 6 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
MOR
2002
94views more  MOR 2002»
15 years 6 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
NIPS
2008
15 years 8 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
WWW
2011
ACM
15 years 1 months ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
GECCO
2010
Springer
217views Optimization» more  GECCO 2010»
15 years 8 months ago
Benchmarking CMA-EGS on the BBOB 2010 noiseless function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noiseless function testbed. The CMA-EGS is a hybrid strategy which combines elements from grad...
Steffen Finck, Hans-Georg Beyer