4009 search results - page 170 / 802 » Clustering on Complex Graphs |
145
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
152
click to vote
APSEC
2005
IEEE
15 years 9 months ago
2005
IEEE
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...
147
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
156
click to vote
BPM
2006
Springer
15 years 7 months ago
2006
Springer
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
157
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...