2004 search results - page 28 / 401 » Sampling from large graphs |
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
CN
2000
14 years 11 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
126
click to vote
ECCC
2007
14 years 11 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...