684 search results - page 75 / 137 » A characterization of b-perfect graphs |
121
click to vote
DAM
2011
14 years 6 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
101
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
BIRD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
IM
2008
14 years 12 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
TIT
2010
14 years 6 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...