204 search results - page 12 / 41 » Parameterized Complexity of Cardinality Constrained Optimiza... |
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Principal ComponentAnalysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion. In particular, PCA has been widely used to model the var...
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
EOR
2008
13 years 9 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
LION
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...