Sciweavers

4201 search results - page 289 / 841
» Interaction graphs: Additives
Sort
View
WWW
2011
ACM
15 years 1 months ago
Estimating sizes of social networks via biased sampling
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...
Liran Katzir, Edo Liberty, Oren Somekh
SAC
2002
ACM
15 years 6 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 11 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
VLDB
1994
ACM
118views Database» more  VLDB 1994»
15 years 10 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
IPPS
2010
IEEE
15 years 4 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke