4894 search results - page 472 / 979 » The Guarding Problem - Complexity and Approximation |
163
click to vote
LATIN
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
163
click to vote
ECML
2007
Springer
16 years 9 days ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
144
Voted
ICANNGA
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
144
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
146
click to vote
DGCI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...