990 search results - page 77 / 198 » Sub-Graphs of Complete Graph |
IJCM
2002
13 years 8 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
NETWORKS
2007
13 years 8 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
SIGIR
2011
ACM
12 years 12 months ago
2011
ACM
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
CVPR
1997
IEEE
14 years 11 months ago
1997
IEEE
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
ICAPR
2005
Springer
14 years 2 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...