4843 search results - page 461 / 969 » The Shortcut Problem - Complexity and Approximation |
149
click to vote
ECML
2007
Springer
15 years 11 months 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...
127
click to vote
ICANNGA
2007
Springer
15 years 11 months 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...
133
click to vote
CPAIOR
2005
Springer
15 years 10 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 ...
132
click to vote
DGCI
2005
Springer
15 years 10 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...
123
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...