2304 search results - page 280 / 461 » On the Vulnerability of Large Graphs |
191
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
208
click to vote
TCC
2012
Springer
14 years 2 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
164
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
161
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—It is well known that Web users create links with different intentions. However, a key question, which is not well studied, is how to categorize the links and how to quantify th...
169
click to vote
HICSS
2006
IEEE
16 years 19 days ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...