356 search results - page 59 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
131
click to vote
CCR
2011
14 years 4 months ago
2011
Scalability is said to be one of the major advantages brought by the cloud paradigm and, more specifically, the one that makes it different to an “advanced outsourcing” solu...
173
Voted
CGF
2011
14 years 3 months ago
2011
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...
134
click to vote
WSDM
2012
ACM
13 years 8 months ago
2012
ACM
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
128
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
STOC
2003
ACM
16 years 19 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...