Results 1  10
of
16
On The Core Of Ordered Submodular Cost Games
, 1997
"... A general ordertheoretic linear programming model for the study of matroidtype greedy algorithms is introduced. The primal restrictions are given by socalled weakly increasing submodular functions on antichains. The LPdual is solved by a Mongetype greedy algorithm. The model offers a direct comb ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
A general ordertheoretic linear programming model for the study of matroidtype greedy algorithms is introduced. The primal restrictions are given by socalled weakly increasing submodular functions on antichains. The LPdual is solved by a Mongetype greedy algorithm. The model offers a direct
A fast cost scaling algorithm for submodular flow
 INFORM. PROCESS. LETT
, 1999
"... This paper presents the current fastest known weakly polynomial algorithm for the submodular flow problem when the costs are not too big. It combines Röck’s or Bland and Jensen’s cost scaling algorithms, Cunningham and Frank’s primaldual algorithm for submodular flow, and Fujishige and Zhang’s push ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
This paper presents the current fastest known weakly polynomial algorithm for the submodular flow problem when the costs are not too big. It combines Röck’s or Bland and Jensen’s cost scaling algorithms, Cunningham and Frank’s primaldual algorithm for submodular flow, and Fujishige and Zhang’s
A faster capacity scaling algorithm for minimum cost submodular flow
, 2001
"... We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scal ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
is a variant of Dijkstra’s algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use maximum mean cuts to make
Fast cycle canceling algorithms for minimum cost submodular flow
 COMBINATORICA
, 2000
"... This paper presents two fast cycle canceling algorithms for the submodular flow problem. The first uses an assignment problem whose optimal solution identifies most negative nodedisjoint cycles in an auxiliary network. Canceling these cycles lexicographically makes it possible to obtain an optimal ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
submodular flow in O(n 4 h log(nC)) time, which almost matches the current fastest weakly polynomial time for submodular flow (where n is the number of nodes, h is the time for computing an exchange capacity, and C is the maximum absolute value of arc costs). The second algorithm generalizes Goldberg’s cycle
ON FINITELY SUBADDITIVE OUTER MEASURES AND MODULARITY PROPERTIES
, 2003
"... Let ν be a finite, finitely subadditive outer measure on P(X).Defineρ(E) = ν(X)− ν(E ′ ) for E ⊂ X. The measurable sets Sν and Sρ and the set S ={E ⊂ X/ν(E) = ρ(E)} are investigated in general, and in the presence of regularity or modularity assumptions on ν. This is also done for ν 0 (E) = inf{ν( ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
{ν(M)/E ⊂ M ∈ Sν}. General properties of ν are derived when ν is weakly submodular. Applications and numerous examples are given.
Weaklysupervised Discovery of Visual Pattern Configurations
"... The increasing prominence of weakly labeled data nurtures a growing demand for object detection methods that can cope with minimal supervision. We propose an approach that automatically identifies discriminative configurations of visual patterns that are characteristic of a given object class. We f ..."
Abstract
 Add to MetaCart
formulate the problem as a constrained submodular optimization problem and demonstrate the benefits of the discovered configurations in remedying mislocalizations and finding informative positive and negative training examples. Together, these lead to stateoftheart weaklysupervised detection results
The Sorting Effect of Price Competition
, 2007
"... –Preliminary draft – We investigate under which conditions price competition leads to sorting of buyers and sellers. In a decentralized Walrasian market where sellers post prices and buyers choose whom to buy from positive assortative matching obtains only if there is a high enough degree of complem ..."
Abstract
 Add to MetaCart
assortative matching obtains whenever the match value function is weakly submodular.
The Sorting Effect of Price Competition
, 2007
"... We investigate under which conditions price competition in a market with matching frictions leads to sorting of buyers and sellers. When buyer’s search strategies are directed by the market prices offered by sellers, positive assortative matching obtains only if there is a high enough degree of co ..."
Abstract
 Add to MetaCart
on the details of the underlying matching function that describes the search process. The condition is weaker than logsupermodularity, a condition required for positive assortative matching in markets with random search. Negative assortative matching obtains whenever the match value function is weakly
On the optimality of treereweighted maxproduct message passing
 In UAI
, 2005
"... Treereweighted maxproduct (TRW) message passing [9] is a modified form of the ordinary maxproduct algorithm for attempting to find minimal energy configurations in Markov random field with cycles. For a TRW fixed point satisfying the strong tree agreement condition, the algorithm outputs a config ..."
Abstract

Cited by 66 (5 self)
 Add to MetaCart
configuration that is provably optimal. In this paper, we focus on the case of binary variables with pairwise couplings, and establish stronger properties of TRW fixed points that satisfy only the milder condition of weak tree agreement (WTA). First, we demonstrate how it is possible to identify part
Results 1  10
of
16