2773 search results - page 441 / 555 » Decomposing Social Networks |
168
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
165
click to vote
ISQED
2008
IEEE
16 years 24 days ago
2008
IEEE
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
174
click to vote
ESAW
2000
Springer
15 years 10 months ago
2000
Springer
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
161
click to vote
ICISC
2008
15 years 7 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
175
click to vote
RSA
2008
15 years 5 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...