Sciweavers

867 search results - page 98 / 174
» The Generalized Maximum Coverage Problem
Sort
View
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 8 months ago
Budget Optimization in Search-Based Advertising Auctions
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...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 8 months ago
The approximability of MAX CSP with fixed-value constraints
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 ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
CVPR
1997
IEEE
14 years 10 months ago
Disparity Component Matching for Visual Correspondence
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...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICCV
2001
IEEE
14 years 10 months ago
Learning Inhomogeneous Gibbs Model of Faces by Minimax Entropy
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...
Ce Liu, Song Chun Zhu, Heung-Yeung Shum