260 search results - page 42 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
IACR
2011
13 years 9 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
TOG
2002
14 years 9 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
WAW
2009
Springer
15 years 4 months ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
AAAI
2011
13 years 9 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...