16 search results - page 1 / 4 » Distances In Random Induced Subgraphs Of Generalized N-Cubes |
CPC
2002
13 years 5 months ago
2002
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
RECOMB
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...