2489 search results - page 278 / 498 » On the Subgroup Distance Problem |
147
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
129
click to vote
EOR
2007
15 years 4 months ago
2007
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
174
click to vote
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
157
click to vote
JMLR
2012
13 years 6 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
215
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...