25 search results - page 1 / 5 » cp 2011 |
ATAL
2011
Springer
12 years 4 months ago
2011
Springer
CP
2011
Springer
12 years 4 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
CP
2011
Springer
12 years 4 months ago
2011
Springer
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In our previous work we have proposed a dynamic version of the consensus propagation (CP) algorithm introduced by Moallemi and Van Roy. Here, we pursue a system theoretic approach...
CONSTRAINTS
2011
12 years 8 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...