1538 search results - page 123 / 308 » Relative Randomness and Cardinality |
119
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
158
click to vote
ANSS
2004
IEEE
15 years 7 months ago
2004
IEEE
We quantatively analyze the differences between a realistic mobility model, TRANSIMS, and several synthetic mobility models. New synthetic models were created by modifying the sta...
112
click to vote
AAAI
2004
15 years 4 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
111
Voted
COGSCI
2010
15 years 3 months ago
2010
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
107
click to vote
IJSN
2007
15 years 3 months ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...