79 search results - page 8 / 16 » An Online Algorithm for Maximizing Submodular Functions |
127
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
100
Voted
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
90
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
192
click to vote
EMMCVPR
2011
Springer
13 years 11 months ago
2011
Springer
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...
103
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...