2150 search results - page 164 / 430 » On a restricted cross-intersection problem |
112
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
116
click to vote
HICSS
2008
IEEE
15 years 11 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
122
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
144
Voted
DAGM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
141
click to vote
DCOSS
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...