337 search results - page 35 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
CVIU
2007
13 years 7 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
SIGMOD
1999
ACM
14 years 6 days ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
SIGAL
1990
13 years 12 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...