Sciweavers

553 search results - page 53 / 111
» Cover Contact Graphs
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 28 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
IMC
2007
ACM
15 years 1 days ago
Measurement and analysis of online social networks
Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a power...
Alan Mislove, Massimiliano Marcon, P. Krishna Gumm...
ECIR
2011
Springer
14 years 2 months ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
TAGT
1998
Springer
156views Graph Theory» more  TAGT 1998»
15 years 2 months ago
Graph-Based Models for Managing Development Processes, Resources, and Products
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
Carl-Arndt Krapp, Sven Krüppel, Ansgar Schlei...