2354 search results - page 147 / 471 » Assignment Problems |
116
click to vote
ACIVS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
133
click to vote
ICA
2004
Springer
15 years 7 months ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
112
click to vote
COMPUTING
2010
14 years 12 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
136
click to vote
JSAC
2006
15 years 2 months ago
2006
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
ICEC
1994
15 years 3 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...