688 search results - page 108 / 138 » General Partitioning on Random Graphs |
108
Voted
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
143
click to vote
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
WWW
2005
ACM
16 years 1 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
91
Voted
IUI
2009
ACM
15 years 9 months ago
2009
ACM
Concept maps are an important tool to knowledge organization, representation, and sharing. Most current concept map tools do not provide full support for hand-drawn concept map cr...