4009 search results - page 73 / 802 » Clustering on Complex Graphs |
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
105
click to vote
JMLR
2006
14 years 11 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
113
click to vote
CIE
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
ISSRE
2007
IEEE
15 years 1 months ago
2007
IEEE
In any software project, developers need to be aware of existing dependencies and how they affect their system. We investigated the architecture and dependencies of Windows Server...