13987 search results - page 422 / 2798 » The Two Guards Problem |
168
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
197
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
162
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
198
click to vote
ESA
2007
Springer
16 years 1 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
208
click to vote
WINE
2007
Springer
16 years 1 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...