867 search results - page 98 / 174 » The Generalized Maximum Coverage Problem |
140
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
113
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
102
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
CVPR
1997
IEEE
16 years 3 months ago
1997
IEEE
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
89
Voted
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
In this paper we propose a novel inhomogeneous Gibbs model by the minimax entropy principle, and apply it to face modeling. The maximum entropy principle generalizes the statistic...