4009 search results - page 256 / 802 » Clustering on Complex Graphs |
133
Voted
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
153
click to vote
AI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
157
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
174
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
148
click to vote
ISCC
2002
IEEE
15 years 10 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...