486 search results - page 33 / 98 » Boosting and Hard-Core Sets |
89
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
102
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
SCIA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper deals, for the first time, with an analysis of localization capabilities of weakly supervised categorization systems. Most existing categorization approaches ...
169
click to vote
ECCV
2008
Springer
15 years 2 months ago
2008
Springer
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
AAAI
2004
15 years 1 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...