2636 search results - page 401 / 528 » Linear Programming |
104
Voted
CPM
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
142
click to vote
SIGSOFT
2009
ACM
15 years 7 months ago
2009
ACM
Runtime adaptation is recognized as a viable way for a serviceoriented system to meet QoS requirements in its volatile operating environment. In this paper we propose a methodolog...
130
click to vote
IPMI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
138
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
149
click to vote
IWVF
2001
Springer
15 years 6 months ago
2001
Springer
We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, suc...