867 search results - page 43 / 174 » The Generalized Maximum Coverage Problem |
167
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
153
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
136
Voted
SAT
2009
Springer
15 years 11 months ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
152
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
175
Voted
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...