146 search results - page 15 / 30 » An Algorithm for Enumerating All Spanning Trees of a Directe... |
APPINF
2003
13 years 8 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
JDCTA
2010
13 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
DIS
2007
Springer
13 years 11 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
CISS
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...