Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2021
MaNIACS: Approximate Mining of Frequent Subgraph Patterns through Sampling
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data MiningPages 1348–1358https://doi.org/10.1145/3447548.3467344We present MaNIACS, a sampling-based randomized algorithm for computing high-quality approximations of the collection of the subgraph patterns that are frequent in a single, large, vertex-labeled graph, according to the Minimum Node Image-based (MNI) ...
- research-articleFebruary 2014
Fast approximation of betweenness centrality through sampling
WSDM '14: Proceedings of the 7th ACM international conference on Web search and data miningPages 413–422https://doi.org/10.1145/2556195.2556224Betweenness centrality is a fundamental measure in social network analysis, expressing the importance or influence of individual vertices in a network in terms of the fraction of shortest paths that pass through them. Exact computation in large networks ...
- research-articleJune 2008
On s-intersecting curves and related problems
SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometryPages 79–84https://doi.org/10.1145/1377676.1377690Let P be a set of n points in the plane and let C be a family of simple closed curves in the plane each of which avoids the points of P. For every curve C ∈ C we denote by disc(C) the region in the plane bounded by C. Fix an integer s > 0 and assume ...