406 search results - page 25 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
MST
2007
14 years 11 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
113
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
NIPS
1996
15 years 1 months ago
1996
Abstract. In this paper we investigate the feed-forward learning problem. The well-known ill-conditioning which is present in most feed-forward learning problems is shown to be the...