Sciweavers

147 search results - page 12 / 30
» The Uncapacitated Swapping Problem
Sort
View
CVPR
2007
IEEE
14 years 12 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
CVPR
2007
IEEE
14 years 12 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
INFOCOM
2007
IEEE
14 years 4 months ago
Distributed Placement of Service Facilities in Large-Scale Networks
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
Nikolaos Laoutaris, Georgios Smaragdakis, Konstant...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 4 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 11 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller